0 like 0 dislike
6,014 views

retagged | 6,014 views

## 1 Answer

0 like 0 dislike

Author of this sheet : https://www.linkedin.com/in/kumark1/

Complete DSA Roadmap :- https://www.desiqna.in/4963/roadmap-for-dsa-data-structures-algorithms-kumar-desi-2022

Desi QnA Two-Pointers Sheet (Make sure to go through set A and set B to have a good preparation level for an interview)

------------------------------------------------------------------------------------------------------------------

1)First things first , make sure you go through the Hashing Sheet(complete SET-A and SET-B) before you start this sheet.

2)Go through the concept from here : https://www.geeksforgeeks.org/two-pointers-technique/

3)Read this : https://leetcode.com/articles/two-pointer-technique/

4)Watch this video : https://www.youtube.com/watch?v=2wVjt3yhGwg

5)Now , it’s the time to start solving some problems. Make sure to solve Set-A and Set-B . Set-C is for the ones who want to reach expert level in the topic.

Set-A : (These problems may involve a mixture of Hashing and Two-Pointers , so make sure you go through the Hashing Sheet of Desi QnA mentioned above).

Set - B :

(Only focus on method1 of the solution.)

P2 : Find the number of pairs in the array whose sum is greater than equal to k. 'k' is the fixed value provided in the input.

(For Warmup-purpose)

(Important to understand the concept)

(Very Important)

(Enjoy this easy problem if you have come this far ;))

Set - C : Coming Soon!

Nice readings to go through :

.

ii)Coming Soon!

by Expert (91,670 points)
edited