659. Split Array into Consecutive Subsequences

LeetCodeArrayHash TableGreedyHeap (Priority Queue)Open on judge ↗

You are given an integer array nums that is sorted in non-decreasing order. Determine if it is possible to split nums into one or more subsequences such that both of the following conditions are true: - Each subsequence is a consecutive increasing sequence (i.e. each integer is exactly one more than the previous integer). - All subsequences have a length of 3 or more. Return true if you can sp

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI