LeetCode #18: 4Sum — Solved in Java
Brute-Filtered Two-Pointer Scan and Early Exit Optimized with Long Bounds
4Sum takes in an array of integers and asks you to find every set of four numbers that add up to a given target. You can use the same number more than once if it appears multiple times in the input, but each result has to be a unique combination. The order inside the array doesn’t matter, but repeated sets in the final list aren't allowed.
It…
