Count pairs with given sum | Array | Love Babbar DSA Sheet | Amazon🔥

[@fahadabdullah687]

beautiful explanation....gfg explanation ise bhi bht acha aur easier ..great one bhai!

[@satyamkumar6469]

Great explanation ,till now I was just wondering that why we are doing sum -arr[i] but now it is all clear thanks alot!

[@jk47nitk]

simple, best and less taking time explanation video

[@udaytewary3809]

Really thankyou bhaiya for such a easy explanation although i have not study map but your easy explanation made it easier for me to understand

[@nehagunapooti2731]

Forever grateful for you bhai, because of you I got my first job

[@CodeLibrary]

Congrats Neha!

[@kulyashdahiya2529]

Great one, For python use counter() which is a subclass of dict.

[@vikalpjain1098]

I tried by implementing this with input 1,1,1,-1,-1,-1 is giving 6 output, but actual output is 9.

[@aeroabrar_31]

Bhai constraints me saare elements positive de rakhe hai.. This approach wont work for negatives i guess.

[@toshanverma1084]

sort then try this it will work

[@Curiousss_Shivammm]

bhaiya agr iski jagah 2 pointer approach use krenge to kya tc jyada ho jayegi array ko sort krne ke chakkar mein

[@amankhanoria2053]

good work brother aapki wajah se data structure seekh paya mai

[@RonitSagar]

bhaiya aap pentab kaun saa use krte ho...can you please mention the link in reply

[@mohammedyasser4717]

intuitive approach and good explanation ! thanks

[@vivek4312]

great explaination brother!

[@explorewithshobhit9157]

Bhai boht badiya 👏🔥

[@vaneelakhatri]

Thanks for this solution 🙏🏻🙏🏻🙏🏻🙏🏻

[@andiamakaza24]

yup

[@justin.j4440]

Well explained mate!

[@maheshwarananbalagan9803]

Brute force algorithm not work sir

[@pranaymishra4407]

very clearly explained thanks bhai

[@abinayashrikbs6684]

you can talk in english throughout the video which will help who doesnt understand hindi.

[@mrinmoyhalder7293]

Interestingly, if it was to print all the pairs then using map also time complexity is O(n^2). because for every element in the given array we need to run a loop upto key_count stored in map. the worst case is [ 2,2,2,2] ans target is 4.

[@adityacr7407]

Searching in an unordered map is O(1)

[@shaikbabasaheb9801]

Hello sir I am preparing for amazon interview. Can i use python language to code during interview.

[@nomaanahmad5851]

Bhaiya please isko jaldi poora krke dp ko kariye please

[@deeptimayeemaharana2448]

map mein check karne se pehle ki element hai ya nahi, array ko toh map ke andar dala hi nahi...bhaiya samajh nahi aya

[@AmanSharma-xq7gv]

bhai ji ye mila na question ka ans gfg be text pdh ke to kuch samaj hi ni aa raha tha...Thanks

[@sohel4633]

Your DSA solution video is very helpful 🥰

[@pratikghule2995]

find number of pairs of 5 which can made with natural numbers

[@GodOfFaith]

Ye kya hai chutiye

[@rohandevaki4349]

what is unordered map ? at 3:11 ? is it on java also?

[@bhargav4g538]

Bro try dictionary in java

[@bhargav4g538]

Bro it’s just like dictionaries initially all are false ie zeros so frequencies are adding 2nd above return statement and they are counting inside if when they encounter use dict I use python same doubt came sorted with dict

[@altafmazhar7762]

tru hashmap in java

[@oqant0424]

nice explaination

[@AmitDas-hu3gr]

Bro love babbar DSA sheet ke baaki problems ke soultions ki video kab aayegi?

[@nehalpradhan2229]

6:00 why didn't you add 7 in map??

[@AbdulRahman-tj3wc]

because it was greater than k

[@akashanand6531]

awesome explanation

[@dhruv2014]

Nice explanation

[@paullater6230]

Amazing explanation 👏 👌 👍

[@sanushgowdabr7217]

Please Explain concepts in English

[@manthan7535]

plz plz upload for jAVA also

[@rickyarya7673]

// { Driver Code Starts //Initial Template for Java import java.io.*; import java.util.*; public class GFG { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int tc = Integer.parseInt(br.readLine().trim()); while (tc-- > 0) { String[] inputLine; inputLine = br.readLine().trim().split(" "); int n = Integer.parseInt(inputLine[0]); int k = Integer.parseInt(inputLine[1]); int[] arr = new int[n]; inputLine = br.readLine().trim().split(" "); for (int i = 0; i < n; i++) { arr[i] = Integer.parseInt(inputLine[i]); } int ans = new Solution().getPairsCount(arr, n, k); System.out.println(ans); } } } // } Driver Code Ends //User function Template for Java class Solution { int getPairsCount(int[] arr, int n, int k) { // code here int count =0; HashMap mapValue = new HashMap(); for(int i=0; i

[@yogeshgavali5238]

Greatly

[@M10-r8q7h]

man this was easy prblm😑😑

[@ankitparashar8730]

Only two pointers works when same type of intution ques on codeforces

[@rohandevaki4349]

please write the code in java also

[@rickyarya7673]

// { Driver Code Starts //Initial Template for Java import java.io.*; import java.util.*; public class GFG { public static void main(String[] args) throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int tc = Integer.parseInt(br.readLine().trim()); while (tc-- > 0) { String[] inputLine; inputLine = br.readLine().trim().split(" "); int n = Integer.parseInt(inputLine[0]); int k = Integer.parseInt(inputLine[1]); int[] arr = new int[n]; inputLine = br.readLine().trim().split(" "); for (int i = 0; i < n; i++) { arr[i] = Integer.parseInt(inputLine[i]); } int ans = new Solution().getPairsCount(arr, n, k); System.out.println(ans); } } } // } Driver Code Ends //User function Template for Java class Solution { int getPairsCount(int[] arr, int n, int k) { // code here int count =0; HashMap mapValue = new HashMap(); for(int i=0; i

[@iremtaze6262]

Why do you write the title in English even though you are speaking in Hindi? God, there are several videos like these I think I should learn Hindi

[@90krishika]

Can somebody help me with this c# code? I am not able to get the expected result. Urgent please public static int FindMaxNumForMaxSum(int[] nums, int k) { int result = 0; int N = nums.Length; var map = new Dictionary(); //[1, 5, 3, 3, 3],.. k = 6 for (var i = 0; i < N; i++) { var complement = k = nums[i]; if (map.ContainsKey(complement)) { //we'll increase the map value at this key and assign to result result = map[complement] += 1; } else { map.Add(k - nums[i], nums[i]); } } //end of for loop return result; }

[@rishavgupta4312]

bhai 5 months ho gaye aapne urgent kaha tha

[@hasnainraza3015]

@@rishavgupta4312 ab to 6 month ho gaye

[@ganeshpaih24]

@@hasnainraza3015 ab tho 11 months hogaye😥

[@67_ujjwalsolanki78]

@@ganeshpaih24 1 year☹

[@Nick-and-Boys]

samjh nhi ayya bhai btw iam begginer

[@Anonymous-qf6jn]

bekar explanation kuch smhj ni aaya

[@priyabratmail8936]

Bhaiya ,I have just completed array in dsa.I could do this problem using loops but I don't know what is map . should I learn maps now or I should move ahead?

[@CodeLibrary]

Yaa STL Sikh lo ekbar

[@sudhakarsingh7613]

luv ki stl series dekhlo

[@shivammathur665]

Bhai saans tho le kam se kam..... Aise kya rurt k aaya tha kya??? 😂

[@mereRevyoos]

#include #include using namespace std; int main() { vector a={1,2,3,4}; int size_a= a.size(); vector answer; for(int i=0; i

[@sudhakarsingh7613]

bcoz answer is empty

[@yourentertainer19]

r u kidding

[@prayagrajwade8699]

Hope you got your answer why you are not getting the output

[@mereRevyoos]

@@prayagrajwade8699 we have to use push_back or we have to specify the size of vector a(4)

[@prayagrajwade8699]

@@mereRevyoos no need to specify size for the vector...you just have to push the elements in vector

[@atulkumar-bb7vi]

Nice explaination

[@maqboolmirzaan2660]

Good explanation

[@fiza8266]

nice explanation