Two Pointers with Binary Search
Some of the famous Two Pointer Problems are combined with Binary Search.
| Problem | Topic | Platform |
|---|---|---|
| Partition Array into Two Arrays to Minimize Sum Difference | Two Pointers w/ Binary Search | Leetcode |
| Closest Subsequence Sum | Two Pointers w/ Binary Search | Leetcode |
| Ways to Split Array into three subarrays | Two Pointers w/ Binary Search | Leetcode |
| 3sum-closest | Two Pointers w/ Binary Search | Leetcode |
While there are many other types of other two pointer problems, there are many other more in the link below (from chuka231): https://leetcode.com/discuss/study-guide/1688903/Solved-all-two-pointers-problems-in-100-days