Sort the stick lengths. For any three sticks to form a non-degenerate triangle, the sum of the two shorter ones must be strictly greater than the longest one.

Because the array is sorted, the most promising triple to try is consecutive elements: `nums[i] + nums[i+1] > nums[i+2]`. If any consecutive triple passes, the answer is YES. This works because consecutive sticks are closest in length, maximizing the chance of satisfying the inequality.

If no consecutive triple forms a triangle, no non-consecutive triple will either — you can immediately return NO. This greedy property holds because for `a ≤ b ≤ c ≤ d`, if `a + b ≤ c` then `a + b ≤ d` as well.