Tap here to switch tabs
Problem
Submissions

Problem: Minimum Number of Increasing Subsequence to Be Removed

Minimum Number of Increasing Subsequence to Be Removed asks you to clear an integer array through repeated operations, each removing a strictly increasing subsequence, and return the fewest operations.

Statement

Given an integer array nums, you can remove elements from the array by repeatedly selecting and removing a strictly increasing subsequence.

Return the minimum number of operations required to remove all elements from nums.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • 1≤1 \leq nums[i] ≤105\leq 10^5

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Minimum Number of Increasing Subsequence to Be Removed

Minimum Number of Increasing Subsequence to Be Removed asks you to clear an integer array through repeated operations, each removing a strictly increasing subsequence, and return the fewest operations.

Statement

Given an integer array nums, you can remove elements from the array by repeatedly selecting and removing a strictly increasing subsequence.

Return the minimum number of operations required to remove all elements from nums.

Constraints:

  • 1≤1 \leq nums.length ≤105\leq 10^5

  • 1≤1 \leq nums[i] ≤105\leq 10^5