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 · Given a 1-based indexing array arr [] of non-negative integers and an integer sum. You mainly need to return the left and right indexes (1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right.

2. Videos

   • 

     8:25

     youtube.com

     Lecture 19 - Sum vs XOR ( Hackerrank ) | Bit Manipulation Tutorial

     16 Jun 2020

     4.6K views

   • 

     9:18

     youtube.com

     198 - Sum vs XOR | Bit Manipulation | Hackerrank Solution | Python

     22 Oct 2021

     4.5K views

   • 

     6:00

     youtube.com

     Sum VS XOR || Bit-Manipulation (Easy - 04) || Explained Solution

     15 Mar 2022

     1.4K views

   View all

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

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

   • Cached

   4 days ago · 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

4. www.geeksforgeeks.org › to-find-sum-of-two-numbersTo find sum of two numbers without using any operator

   www.geeksforgeeks.org › to-find-sum-of-two-numbers

   • Cached

   5 days ago · We can use printf () to find sum of two numbers as printf () returns the number of characters printed. The width field in printf () can be used to find the sum of two numbers. We can use ‘*’ which indicates the minimum width of output.

5. www.hackerrank.com › challenges › sum-of-digits-of-aSum of Digits of a Five Digit Number Discussions - HackerRank

   www.hackerrank.com › challenges › sum-of-digits-of-a

   • Cached

   4 days ago · to calculate the sum of digits of a five digit number.

6. pkg.go.dev › math › bitsbits package - math/bits - Go Packages

   pkg.go.dev › math › bits

   • Cached

   5 days ago · Add returns the sum with carry of x, y and carry: sum = x + y + carry. The carry input must be 0 or 1; otherwise the behavior is undefined. The carryOut output is guaranteed to be 0 or 1.

7. www.hackerrank.com › test-c-171794093998Programming problems and Competitions :: HackerRank

   www.hackerrank.com › test-c-171794093998

   • Cached

   2 days ago · Scoring. Each challenge has a pre-determined score. A participant’s score depends on the number of test cases a participant’s code submission successfully passes. If a participant submits more than one solution per challenge, then the participant’s score will reflect the highest score achieved.

8. People also ask

   How to find sum of two numbers?

   • It’s a trick question. We can use printf () to find sum of two numbers as printf () returns the number of characters printed. The width field in printf () can be used to find the sum of two numbers. We can use ‘*’ which indicates the minimum width of output.

   To find sum of two numbers without using any operator

   www.geeksforgeeks.org/to-find-sum-of-two-numbers-without-using-any-operator/

   See all results for this question

   What if curr_Sum – Sum is not in the hash table?

   • If curr_sum – sum is not in the hash table, add an entry to the hash table with the key curr_sum and the value i. If you reach the end of the array and no subarray with the given sum is found, return an empty array. Below in the implementation of the above approach:

   Find Subarray with given sum | Set 1 (Non-negative Numbers)

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

   See all results for this question

   How to find a subarray with a given sum?

   • We can use dynamic programming to find the subarray with the given sum. The basic idea is to iterate through the array, keeping track of the current sum and storing the difference between the current sum and the given sum in a hash table.

   Find Subarray with given sum | Set 1 (Non-negative Numbers)

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

   See all results for this question

   What if a subarray has sum greater than a given sum?

   • Auxiliary Space: O (1). The idea is simple as we know that all the elements in subarray are positive so, If a subarray has sum greater than the given sum then there is no possibility that adding elements to the current subarray will be equal to the given sum. So the Idea is to use a similar approach to a sliding window.

   Find Subarray with given sum | Set 1 (Non-negative Numbers)

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

   See all results for this question

9. pkg.go.dev › hashhash package - hash - Go Packages

   pkg.go.dev › hash

   • Cached

   5 days ago · Writer // Sum appends the current hash to b and returns the resulting slice. // It does not change the underlying hash state. Sum(b [] byte ) [] byte // Reset resets the Hash to its initial state.