Triplet Sum in Array | Array | Love Babbar DSA Sheet | Hindi

Time Stamps :
Problem discussion : 0:00
Brute force approach: 01:48
Optimal approach : 03:00
Algorithm discussion : 05:34
Code explanation : 07:06
Time Complexity Discussion : 08:05
Time Complexity : O(n*n)
Space Complexity : O(1)
Problem Link : practice.geeksforgeeks.org/pr...
C++ Code Link : github.com/Ayu-99/Love-Babbar...
Python Code Link: github.com/Ayu-99/Love-Babbar...
Love Babbar DSA Sheet : drive.google.com/file/d/1FMdN...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#DataStructuresAndAlgorithms
#LoveBabbarDSASheet
#interviewpreparation
Triplet Sum in Array solution
Triplet Sum in Array Leetcode
Triplet Sum in Array C++
Triplet Sum in Array C++ Hindi
Triplet Sum in Array Hindi
Checkout the series: 🔥🔥🔥
👉 Array: • Arrays
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Dynamic Programming : • Dynamic Programming
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
👉 Leetcode July Challenge : • Leetcode July Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊

[@sumitk8842]

Your explanation>>>>

[@SonuKumar-uq2rb]

the way of teaching is mindblowing, keep it up sister, great job......, god bless u

[@jatinrastogi_vjm]

yes ...you deserved to be subscribed by every coders☺

[@AyushiSharmaDSA]

Thank you so much Jatin 🤗

[@bhanubhusan4009]

mam, can i say that for i loop should run till i < n-2 not i

[@pycharm_boy4344]

Thanks for giving the concept of three sum using 2 pointers approach really helpful

[@AyushiSharmaDSA]

Glad it helped. :) Please share with your friends and juniors

[@explorewithshobhit9157]

Ye video dekhte hi mene Turant Subscribe button Dabaya 👏. Well Explained 👌

[@AyushiSharmaDSA]

Thank you Shobhit 🥹🤘🏻

[@AyushiSharmaDSA]

Thank you Shobhit 🥹🤘🏻

[@AyushiSharmaDSA]

Thank you Shobhit 🥹🤘🏻

[@suruchibharti7473]

Dii, aap bhaut easily explain kar dete ho complex chizo ko. Thanku di and please make more video on coding questions ask in written and interview questions🙏.

[@AyushiSharmaDSA]

Thank you so much Suruchi, sure I'll make videos on these problems as well 🙂

[@pawankumarpandit1822]

i fall in love with your voice and explanation mam

[@AyushiSharmaDSA]

Thanks a lot Pawan🤩

[@suraj_patwa]

Awesome Video
Really Helpfull! Thank You Ayushi Didi

[@AyushiSharmaDSA]

Welcome Suraj, glad it was helpful 🙂

[@bitlegion1027]

kya awssum approach hai and i love the way you break down the problem and one more thing can you please make a video on time and space complexity i find it tough because i dont have maths background after 10th : }

[@ecs185_shaileshbharti3]

Thank You for the explanation ✌

[@AyushiSharmaDSA]

Welcome :). I'm glad it was helpful

[@vishalplayzz2580]

gfg testcases didnt have any duplicates in array right if there are any we have to skip right for no of triplets

[@keshavsharma5678]

Liked your approach it really helped me ...
💯

[@AyushiSharmaDSA]

Glad u liked it 🤗

[@sanjeetkumar173]

Are didi concept 🙌🙌🙌🙌🙌🙌🔥🔥🔥🔥

[@AyushiSharmaDSA]

🥺🥺🙌🏻🙌🏻✌🏻

[@projectsdb4034]

Helpful indeed

[@AyushiSharmaDSA]

Thanks🤗

[@sonumondal9376]

Lovely ❤❤❤❤❤ explanation

[@AyushiSharmaDSA]

Thanks Sonu😊

[@sparshpandey2878]

Thanks for this. 🙂

[@AyushiSharmaDSA]

Welcome. Glad it helped :)

[@gouravkumarshaw5467]

very good explanation thanks

[@AyushiSharmaDSA]

Welcome Gourav, glad it was helpful :)

[@SachinRao435]

But We Don't need to run a for lop till the end n and it need then why give me a reason

[@sagrika7096]

Thanku ❤️

[@AyushiSharmaDSA]

Welcome, glad it was helpful ❤

[@tarunchauhan1025]

well explained!!

[@AyushiSharmaDSA]

Thanks Tarun, glad it was helpful :)

[@ankittiwari2328]

thank u so much didi...this video tells me lot...now i know how to appoach ...any problem....how to do some mathematical calculation and then how to write psudo code or algo..for that one then after doing this....almost 90% work is done...only u write code and run...and also one more thing ...how to use constraints for managing time and space complexity..
once again didi ...thanks a lot

[@AyushiSharmaDSA]

Thank you so much Ankit🥺😊. Haan, I'll make a video on how to guess time complexity on basis of constraints

[@ankittiwari2328]

@@AyushiSharmaDSA yes as early as possible

[@AyushiSharmaDSA]

@@ankittiwari2328 yes ✌🏻

[@karanjitrandhawa1515]

Best explaination maam 💛

[@AyushiSharmaDSA]

Thank you Karanjit :)

[@karanjitrandhawa1515]

@@AyushiSharmaDSA keep going :)

[@viralchingaari2184]

really helpful videos

[@AyushiSharmaDSA]

Thank you. Glad they are helpful :)

[@user-kn4zc2gt3r]

Didi, I have subscribed your channel.

[@AyushiSharmaDSA]

Thanks a lot 😊

[@thebeatifulnature3142]

wah didi wah........................................

[@AyushiSharmaDSA]

Thank you :)

[@shivanshchaturvedi2601]

outer loop n-2 tk nahi chalna chaie ? n kyu

[@saunaknandi1814]

Ayushi can u provide solution to leetcode weekly contest problems ?

[@AyushiSharmaDSA]

Sure Saunak, I'll surely do if I am able to participate in it. :)

[@mrxxiii1807]

please do a video for duplicate elements

[@AyushiSharmaDSA]

Sure

[@ayush_kumariitbhu5430]

Di ,with due respect from which college you are?

[@AyushiSharmaDSA]

Hi Ayush, I have graduated from Guru Nanak Dev Engineering college

[@arihant_14]

Ek request can you please make video on pair sum question in which duplicates are also present. Please make video without using map. Please if possible make this video.

[@AyushiSharmaDSA]

Sure, can you please share the link of the problem

[@lehar5906]

Shouldn't the complexity be O(n^2logn)? because sorting is also used.

[@rawat_ji5183]

complexity will be O( n^2) + O(logn)
=> O(n^2)

[@ayushagrawal7760]

@@rawat_ji5183 can you explain this?

[@rawat_ji5183]

​@@ayushagrawal7760 Yes
let us assume a very large number n (let say (9999)
now n^2 will be very very large too
and the value o(log n) will be very very less as compared to n^2 so the time complexity will not have a very huge effect if we do not consider o(log n) that's why we are taking time complexity as o(n^2) not O(n^2) + o(log n)

[@ayushagrawal7760]

@@rawat_ji5183 thank you soo much now i understand why the complexity is n^2.

[@TheHariPutraOfficially]

Hareeeee Krishnaaaaaaa
Mujhe CP quit karne ka Mann kar raha hai Didi 😞

[@aryanyadav6283]

Hey, when low and high will equals to y then that will be infinite loop , right ?

[@venkateshn9884]

Pls try to make videos in English...as lot of ppl r from south

[@AyushiSharmaDSA]

yes, from now I will be making in English :).

[@Ehteshamkhan28]

With the first approach
It's not passing all the test case

[@sankhajitpal1050]

All test cases will have if you put in for loop till i

[@Ehteshamkhan28]

@@sankhajitpal1050 Thanks