Algorithms & Data Structures
Beginner
Free
Two Pointers
Solve array and string problems in linear time by walking two indices instead of one
35 min read
1 view
Learn the two-pointer technique for scanning arrays and strings in O(n) time and O(1) extra space. Covers converging, fixed-gap, and in-place rewrite variants through classic interview problems like pair sums, triplets, palindromes, and container area.