Leetcode 18. 4Sum
Find all unique quadruplets of distinct elements in an integer array whose values sum to a given target. Results must avoid duplicates (order irrelevant); with n ≤ 200 an O(n^3) approach after sorting is typically used.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.