Given an array A[] and a number x, check for pair in A[] with sum as x | GeeksforGeeks

Explanation for the article: www.geeksforgeeks.org/write-a-...
This video is contributed by Harshit Jain.

[@yazanshakhshir3049]

if i just knew this channel before going to my last interview i would have got the job :( the interviewer asked me this question and i wasn't able to solve it using the hashmap method i am very upset to find out how much easy the solution is :(

[@reyou7]

Yet another great video! Thanks G4G!

[@sounavapal762]

What about the extra space that we use for the hash array?

[@rahulkumar-uw4os]

sir what about sum=2 in the following example given at 0:26 using hashmap technique

[@akash7752]

what if sum value is -ve then how to solve using hashmap?

[@adityavarma1077]

use unordered set

[@NEXAWAY]

the bool map will not work if there is repetitions in the array?

[@hermesmercuriustrismegistu4841]

In Python you do not need to know the range of the hash map ie Python dictionary since they have dynamic sizes. I found Python to be a very useful language for coding interviews. Anyway thx a lot for the video!

[@Bhatonia_Jaat]

u may be right but c++is way faster than python and also u can make dynamic arrays/hashmaps in cpp

[@sunfline]

Python is shit

[@rapperstories5463]

Can someone explain third method i.e using remainders of the elements less than x....i couldnt find any video related to it

[@pradeepshetty3778]

how you find the indices?

[@Sahil-explorer]

Using brute force approach we can do it too using two for loops but worst time is O(n^2).

[@ravkrgmail]

How does it work if the array has billions elements?

[@user-ke9xj2mh4f]

Wow!! Math and hashmap are two wonderful creation of the coding universe ❤️❤️❤️❤️❤️ thanks a lot! This is amazing 🤩🤩🤩🤩🤩🤩🤩🤩🤩🤩 I get the algorithm now

[@divyansh59]

I like the way u r teaching sir it's geat;

[@ravindrasutar7490]

i want to display those numbers in array..

[@joydeepbhattacharjee5305]

The second method will never work if there is negative number in the given set of number (For C lang)

[@DigitalOutlawed]

thank you soooooooooo much my kind sir

[@nshukla6]

With Hashing technique what if numbers are duplicate

[@GeeksforGeeksVideos]

Hi Nitin, If the numbers are duplicate, then the algorithm will set the binary hash map twice. So, we will still get the same results.

[@ishumba]

@@GeeksforGeeksVideos Given an array [1, 5, 3, 3, 3] and sum 6, this algorithm gives a result of 3 instead of 4 being {1,5}, {3,3}, {3,3}, {3,3}.

[@axel9194]

In hash method the program not working

[@mohammadmujahid8850]

Why u r using hasmap for second method, hashset is better here.

[@namanshah2688]

very useful thanks !!

[@combofriend4461]

I don't think hashmap solution works right of there are dups

[@marthamontes1636]

Damn i need to know wtf the sum is im in third im thinking about it so hard what about you give the awnser to the ppl???

[@aakashmudigonda3375]

I didn't understand the second method

[@alexanderarea6157]

Sliding window will work here

[@wecan2729]

class Solution{ public: // Function to check if array has 2 elements // whose sum is equal to the given value bool hasArrayTwoCandidates(int arr[], int n, int x) { mapmp; for(int i=0;i

[@rajdave9862]

OMnS How can you think that please please omNs 🕉 please reply me How can you think like it

[@simplybish]

binMap[arr[i]] = 1 ---> This line in code will throw index out of bound if the array has negative numbers.

[@sounavapal762]

Bishwanath Singh in this case we'll have to keep an extra check

[@jeanettenguyen2265]

it's a dictionary/hashmap not an array

[@joydeepbhattacharjee5305]

@@jeanettenguyen2265 well C lang dont have dictionary or hashmap so this approach can be done with C Bishwanath Singh is most probably talking about C lang

[@akshaydwivedi935]

Basically a binary search

[@shiveshsingh2445]

fair

[@marthamontes1636]

Yet i guess you made not my day :/

[@theoneinyou2233]

Can it be simpler more like ... Map m= new HashMap(); for(i=0;i