3Sum best solution

solution.js

/**
 * @param {number[]} nums
 * @return {number[][]}
 */
var threeSum = function(nums) {
    if (nums.length < 3) {
      return []
    }
    const result = []
    nums.sort((a, b) => a - b)
    for(let i=0; i < nums.length - 2; i++) {
        if(i === 0 || nums[i] !== nums[i-1]) {
          let lo = i+1
          let hi = nums.length - 1
          let sum = 0 - nums[i]
          while (lo < hi) {
            if (nums[lo] + nums[hi] === sum) {
              result.push([nums[i], nums[lo], nums[hi]])
              while(lo < hi && nums[lo] === nums[lo+1]) {
                lo++
              }
              while(lo < hi && nums[hi] === nums[hi-1]) {
                hi--
              }
              lo++
              hi--
            } else if (nums[lo] + nums[hi] < sum ) {
              lo++
            } else {
              hi--
            }
          }
        }
    }
    return result
};