Yahoo India Web Search

Search results

1. www.geeksforgeeks.org › find-subarray-with-given-sumFind Subarray with given Sum from Array of non-negative ...

   www.geeksforgeeks.org › find-subarray-with-given-sum

   • Cached

   2 days ago · Learn how to find a subarray that adds to a given sum in an array of non-negative integers. See examples, code implementations, and time complexity analysis for different approaches.

   • Largest subarray having sum greater than k - GeeksforGeeks

     A simple solution is to one by one consider each subarray...

2. www.geeksforgeeks.org › largest-subarray-havingLargest subarray having sum greater than k - GeeksforGeeks

   www.geeksforgeeks.org › largest-subarray-having

   • Cached

   Jun 25, 2024 · A simple solution is to one by one consider each subarray and find its sum. If the sum is greater than k, then compare the length of this subarray with maximum length found so far. Time complexity of this solution is O (n2). An efficient solution is to use prefix sum and binary search.

3. medium.com › @mdkamranr25 › subarray-sum-equals-kSubarray Sum Equals K — The Best Explanation - Medium

   medium.com › @mdkamranr25 › subarray-sum-equals-k

   • Cached

   Jun 19, 2024 · The “Subarray Sum Equals K” problem involves finding the total number of continuous subarrays in an array that sum up to a specific target value, K. This problem is related to subarray sum...

4. www.geeksforgeeks.org › largest-sum-contiguous-subLargest Sum Contiguous Subarray (Kadane’s Algorithm)

   www.geeksforgeeks.org › largest-sum-contiguous-sub

   • Cached

   4 days ago · Given an array arr [] of size N. The task is to find the sum of the contiguous subarray within a arr [] with the largest sum. Example: Input: arr = {-2,-3,4,-1,-2,1,5,-3} Output: 7. Explanation: The subarray {4,-1, -2, 1, 5} has the largest sum 7. Input: arr = {2} Output: 2.

   • Video Duration: 17 min

5. www.techgeekbuzz.com › blog › subarray-with-sum-kSubarray with Sum k - Techgeekbuzz

   www.techgeekbuzz.com › blog › subarray-with-sum-k

   • Cached

   Jun 11, 2024 · def subArrayequalsK(arr, n, k): mp = {} sum = 0 for i in range(0,n): # add current element to sum sum = sum + arr[i] # if prefix sum is equal to target if sum == k: print("Found b/w 1 and", i+1) return # If sum - sum already exists in map if (sum - k) in mp: print("Found b/w", \ mp[sum - k] + 1, "and", i+1) return mp[sum] = i+1 l = [1, 2, 3, 4 ...

6. www.reddit.com › r › leetcodeQuestion about 560. Subarray Sum Equals K : r/leetcode - Reddit

   www.reddit.com › r › leetcode

   • Cached

   Hello, I was just wondering what's the difference between adding nums[i -1] and nums[i] What does this change when calculating a sum between indices…

7. People also ask

   How to find number of continuous subarrays whose sum is same as K?

   • Suppose we have an array of integers and an integer k, we need to find the total number of continuous subarrays whose sum same as k. So if nums array is [1, 1, 1] and k is 2, then the output will be 2.

   Subarray Sum Equals K in C++ - Tutorialspoint

   www.tutorialspoint.com/subarray-sum-equals-k-in-cplusplus

   See all results for this question

   How to find subarray sum equal to K in C++?

   • Subarray Sum Equals K in C++ C++ Server Side Programming Programming Suppose we have an array of integers and an integer k, we need to find the total number of continuous subarrays whose sum same as k. So if nums array is [1, 1, 1] and k is 2, then the output will be 2.

   Subarray Sum Equals K in C++ - Tutorialspoint

   www.tutorialspoint.com/subarray-sum-equals-k-in-cplusplus

   See all results for this question

   How to find length of largest subarray with a sum greater than k?

   • Given an array of integers and a value k, find the length of largest subarray having a sum greater than k. Examples: Output : 2 5 is {1, 6}. Input : arr= {2, -3, 3, 2, 0, -1}, k = 3 Output : 5 3 is {2, -3, 3, 2, 0}. Recommended : Please try your approach first on IDE and then look at the solution.

   Largest subarray having sum greater than k - GeeksforGeeks

   www.geeksforgeeks.org/largest-subarray-having-sum-greater-than-k/

   See all results for this question

   What is the sum of a subarray?

   • The subarray {1, 1, 0} also has sum 2 but a subarray of size 3 is already included. Approach: The given problem can be solved with the help of the sliding window algorithm. It can be observed that the sum of a subarray is equal to the count of 1’s in the subarray. Below are the steps to follow:

   Maximum count of distinct sized subarrays with given sum - GeeksforG…

   www.geeksforgeeks.org/maximum-count-of-distinct-sized-subarrays-with-given-sum/

   See all results for this question

8. dev.to › rk042 › finding-the-largest-sum-subarrayFinding the Largest Sum Subarray: Step-by-Step Guide Using ...

   dev.to › rk042 › finding-the-largest-sum-subarray

   • Cached

   Jun 16, 2024 · Finding the largest sum subarray is a intermediate problem in coding interviews. In this guide, we'll explore how to locate the maximum sum of a continuous subarray using Kadane's Algorithm. Don't worry if this sounds complex at first—we'll break it down step by step. Go ahead and check them out!