fa
Feedback

فریب کلاهبرداران را نخورید! تل‌متریو این کانال‌ها را شناسایی و برچسب‌گذاری می‌کند 👉 برای مشاهده برچسب، اشتراک تهیه کنید

Leetcode with dani

Leetcode with dani

رفتن به کانال در Telegram

Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts

نمایش بیشتر
1 240
مشترکین
-124 ساعت
-37 روز
-1730 روز
آرشیو پست ها
Which programming language do you primarily use for solving LeetCode problems?"
Anonymous voting
08 اوت 2024, 05:40

How many LeetCode questions have you solved so far?"
Anonymous voting
08 اوت 2024, 05:39

Which programming language do you primarily use for solving LeetCode problems?"
Anonymous voting
08 اوت 2024, 05:37
08 اوت 2024, ~05:40

Which additional learning resources would you like to see?"
Anonymous voting
08 اوت 2024, 05:35

What’s your preferred approach when tackling a new coding problem?"
Anonymous voting
08 اوت 2024, 05:34

Which difficulty level of LeetCode problems do you prefer?"
Anonymous voting
08 اوت 2024, 05:33

Repost from SkillUp
🌟 Learn to Code for Free with freeCodeCamp! 📚 freeCodeCamp offers a comprehensive curriculum to learn coding and earn certifications in areas such as web development, data visualization, and more. Ideal for beginners and experienced learners alike. 🎓 Key Features: - Completely free - Interactive lessons - Certifications upon completion 🌐 Start Learning Today: [freeCodeCamp](https://www.freecodecamp.org) #FreeCoding #WebDevelopment #DataVisualization #LearnToCode #freeCodeCamp #SkillDevelopment
08 اوت 2024, 04:43



def fillPrefixSum(arr, n, prefixSum):

  prefixSum[0] = arr[0]

  # Adding present element
  # with previous element
  for i in range(1, n):
    prefixSum[i] = prefixSum[i - 1] + arr[i]


# Driver code
if __name__ == '__main__':
arr = [10, 4, 16, 20]
n = len(arr)

# Function call
prefixSum = [0 for i in range(n + 1)]

fillPrefixSum(arr, n, prefixSum)

for i in range(n):
  print(prefixSum[i], " ", end="")

# This code is contributed
# by Anant Agarwal.
08 اوت 2024, 03:41

#Q18 #leet_codeQ18 Easy 1480 . Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6,10] Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4]. Example 2: Input: nums = [1,1,1,1,1] Output: [1,2,3,4,5] Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1]. Example 3: Input: nums = [3,1,2,10,1] Output: [3,4,6,16,17] Constraints: 1 <= nums.length <= 1000 -10^6 <= nums[i] <= 10^6
08 اوت 2024, 03:40

Try to Solve this problem
Try to Solve this problem
06 اوت 2024, 14:22

05 اوت 2024, 12:12
07 اوت 2024, ~04:14

05 اوت 2024, 06:53
07 اوت 2024, ~04:14

05 اوت 2024, 06:43
05 اوت 2024, ~06:43

Example 2: Input : Arr[] = {6, 7, 8, 10}, Q = 2 queries[] = {0, 3, 1, 2} Output : 7 7
05 اوت 2024, 06:16

Example 1: Input : Arr[] = {1, 2, 3, 4, 5}, Q = 3 queries[] = {0, 2, 1, 3, 0, 4} Output : 2 3 3 Explanation: Here we can see that the array of integers is [1, 2, 3, 4, 5]. Query 1: L = 0 and R = 2 Sum = 6 Integer Count = 3 So, Mean is 2 Query 2: L = 1 and R = 3 Sum = 9 Integer Count = 3 So, Mean is 3 Query 3: L = 0 and R = 4 Sum = 15 Integer Count = 5 So, the Mean is 3. So, In the end, the function will return the array [2, 3, 3] as an answer.
05 اوت 2024, 06:16

Mean of range in array #Q17 Geeks for Geeks Given an array of n integers and q queries. Write a program to find floor value of mean in range l to r for each query in a new line. Queries are given by an array queries[] of size 2*q. Here queries[2*i] denote l and queries[2*i+1] denote r for i-th query (0<= i <q).
05 اوت 2024, 06:16

#leet_codeQ16 #Q_209 #Easy #Prefix_sum 1991. Find the Middle Index in Array Hint Given a 0-indexed integer array nums, find the leftmost middleIndex (i.e., the smallest amongst all the possible ones). A middleIndex is an index where nums[0] + nums[1] + ... + nums[middleIndex-1] == nums[middleIndex+1] + nums[middleIndex+2] + ... + nums[nums.length-1]. If middleIndex == 0, the left side sum is considered to be 0. Similarly, if middleIndex == nums.length - 1, the right side sum is considered to be 0. Return the leftmost middleIndex that satisfies the condition, or -1 if there is no such index. Example 1: Input: nums = [2,3,-1,8,4] Output: 3 Explanation: The sum of the numbers before index 3 is: 2 + 3 + -1 = 4 The sum of the numbers after index 3 is: 4 = 4 Example 2: Input: nums = [1,-1,4] Output: 2 Explanation: The sum of the numbers before index 2 is: 1 + -1 = 0 The sum of the numbers after index 2 is: 0 Example 3: Input: nums = [2,5] Output: -1 Explanation: There is no valid middleIndex. Constraints: 1 <= nums.length <= 100 -1000 <= nums[i] <= 1000
05 اوت 2024, 03:06

1991. Find the Middle Index in Array Hint Given a 0-indexed integer array nums, find the leftmost middleIndex (i.e., the smallest amongst all the possible ones). A middleIndex is an index where nums[0] + nums[1] + ... + nums[middleIndex-1] == nums[middleIndex+1] + nums[middleIndex+2] + ... + nums[nums.length-1]. If middleIndex == 0, the left side sum is considered to be 0. Similarly, if middleIndex == nums.length - 1, the right side sum is considered to be 0. Return the leftmost middleIndex that satisfies the condition, or -1 if there is no such index. Example 1: Input: nums = [2,3,-1,8,4] Output: 3 Explanation: The sum of the numbers before index 3 is: 2 + 3 + -1 = 4 The sum of the numbers after index 3 is: 4 = 4 Example 2: Input: nums = [1,-1,4] Output: 2 Explanation: The sum of the numbers before index 2 is: 1 + -1 = 0 The sum of the numbers after index 2 is: 0 Example 3: Input: nums = [2,5] Output: -1 Explanation: There is no valid middleIndex. Constraints: 1 <= nums.length <= 100 -1000 <= nums[i] <= 1000
05 اوت 2024, 03:04
05 اوت 2024, ~03:04