Competitive Programming TacTics#1

Two Pointer Technique: In this Session, I have explained two pointer technique which is the optimal way to solve problems related to arrays, strings, and linked list in O(N) time. Clause to solve two-pointer problems is data structure should be sorted.

There are many problems which can be solved with two pointer tactic, It can reduce your time complexities, Below are the few problems on 2 pointers.

1. Opposite direction​ :
https://leetcode.com/problems/contain...
https://leetcode.com/problems/squares...
https://leetcode.com/problems/move-ze...
https://leetcode.com/problems/valid-p...
https://leetcode.com/problems/two-sum...

2. Same direction​ :
https://leetcode.com/problems/remove-...
https://leetcode.com/problems/merge-s...
https://leetcode.com/problems/longest...
https://leetcode.com/problems/linked-...
https://leetcode.com/problems/remove-...


🔥 DONT CLICK THIS: https://bit.ly/2BEDWYG

👍 Let's Connect on Facebook: https://bit.ly/31KPcgI

🔗 Share with your Network:    • Two Pointer Approach - CP TacTics | T...  

💡 Source Code:https://github.com/naval41/CS_Tricks/...

📲 Connect on Telegram : https://t.me/joinchat/Kc_ZkBsijqXJDWr...

Note : Problem rights owned by LeetCode.

#twopointertechnique #cptictacs #programming #dataStructures #algorithms #coding #competitiveprogramming #google #java #codinginterview #problemsolving #facebook #amazon #oracle #linkedin #twosum