Two Sum | Leetcode #1

This video explains the most asked programming interview problem: finding the pair of elements whose sum is equal to target sum. This problem is popularly known as the two sum problem. In this video, we will discuss three different techniques to solve the problem.
CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

======================================PLEASE DONATE=============================
==============================================================================

=======================================================================
USEFUL LINKS:

RELATED LINKS:

[udaypratapsingh]

if the array is sorted we can use two pointer approach and in case when array is not sorted we use hash map to solve this 🙂

[zendr]

I have tried many channels but None is like yours. You are the only one who teaches the logic rather than just showing the code in some language.

[Jaffar]

longtime no see, please do all leetcode questions youre the best

[khorgshhh]

Thank you for your videos, if you could put time stamp on the videos, it would be great

[danielaviv]

Hi wanna to ask, how would you solve the following problem:
Given a *sorted array* & target, return *all pairs* of 2Sum s.t. Ai + Aj = target

[technicalknowledgeandfacts]

sir how to make a pair array basically?which contains index as well as array elements

[siddhantbanchhode]

Such detailed and nice explaination ❤❤❤❤

[harsh]

Paytm mai yahi question aya tha, mera beta ki lag gayi. Thank you sir