Two Pointer Problems
The two-pointer technique uses two indices moving through data to solve problems in linear time. Common patterns: converging pointers, fast-slow pointers, and sliding windows on sorted arrays.
3 problems
| Title | Difficulty | Platform |
|---|---|---|
| Longest Repeating Character Replacement | Medium | LeetCode |
| Maximum Number of Visible Points | Medium | LeetCode |
| Sort Colors | Medium | LeetCode |