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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 659. Split Array into Consecutive Subsequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact