Sorting Three Groups at UiPath
Medium42.9% acceptance
This problem has 100.0% frequency at UiPath.
Problem Description
You are given an integer array `nums`. Each element in `nums` is 1, 2 or 3. In each operation, you can remove an element from `nums`. Return the **minimum** number of operations to make `nums` **non-decreasing**.
Read full problem and hintsTopics
More UiPath Questions
Escape a Large MazeHardAs Far from Land as PossibleMediumNumber of IslandsMediumLongest Palindromic SubstringMediumMaking A Large IslandHard
View all UiPath questions