I tried to solve this problem for the past three hours using ruby, and I was impressed by how much I improved it: because it was too slow it pushed me too improve the code and I came with a good solution but too slow for exemple 315/318 (that array is massive)... anyway, I\'m open to any suggestions!\n```\n# @param {Integer[]} nums\n# @return {Integer[][]}\ndef three_sum(nums)\n  answers = []\n  return answers if nums.length < 3\n  if nums.length == 3\n    answers << nums if nums.inject(:+) == 0\n    return answers\n  end\n  nums.sort!\n  nums.each_with_index do |first_num, i|\n    break if first_num > 0\n    next if first_num == nums[i - 1] && i != 0\n    nums[i + 1...nums.length - 1].each.with_index do |second_num, j|\n      next if j != 0 && second_num == nums[i + 1...nums.length - 1][j - 1]\n      break if second_num > first_num / -2 && second_num != 0\n      third_num = nums[i + j + 2...nums.length].find{ |num| num + second_num + first_num == 0 }\n      next unless third_num\n      curr_answer = [first_num, second_num, third_num]\n      answers << curr_answer\n    end\n  end\n  answers\nend\n```

I tried to solve this problem for the past three hours using ruby, and I was impressed by how much I improved it: because it was too slow it pushed me too impro