Two Pointer
Two Pointer
Course Content
Basic
-
Pair with a Sum
-
Count pairs with given sum
-
Pair with a Difference
-
Unique pairs with given Difference
-
Union of Two Sorted Arrays
-
Intersection of Two Arrays
-
Remove Element
-
Remove Duplicates from Sorted Array
-
Remove Duplicates from Sorted Array I
-
Find Subarray
-
3Sum
-
4Sum
-
3Sum Closest
-
Container With Most Water
-
Boats to Save People
-
Longest Substring Without Repeating Characters
-
Minimum Window Substring
-
Max Consecutive Ones III
-
Count Number of Nice Subarrays
-
Equivalent Sub-Arrays
-
Subarrays with K Different Integers
-
Minimize (max(A[i], B[j], C[k]) – min(A[i], B[j], C[k])) of three different sorted arrays
-
Ugly Number II
-
Power of Two
Student Ratings & Reviews
No Review Yet