Leetcode 659. Split Array into Consecutive Subsequences

Given a sorted integer array, determine whether you can partition its elements into one or more disjoint subsequences that are strictly consecutive (difference 1) and each have length at least 3. This is a greedy/greedy-like feasibility problem of assigning counts to extend or start consecutive runs.