Decreasing Subsequences

Problem Overview

• Split an integer array into strictly decreasing subsequences.
• Return the minimum number of subsequences possible.
• Input: nums of length n; constraints unspecified.
• Context: sequence partitioning relevant to scheduling or resource grouping.
• From Google interviews; a common coding interview problem and interview question.