Bytedance Tech Phone Screen: 3Sum Variant with O(N²) Time and O(1) Space

Bytedance technical phone screen question involves finding all unique triplets in an array that sum to a target value with O(N²) time and O(1) space complexity.