What's actually hard about solving leetcode style questions

Today I was working through the following problem: Given an array of unsorted numbers, find all unique triplets in it that add up to zero. Example 1: Output: [[-3, 1, 2], [-2, 0, 2], [-2, 1, 1], [-1, 0, 1]] Explanation: There are four unique triplets...