- Result: monotonous increasing stack. Print it in correct order. Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest ...

if the number of different integers in that subarray is exactly K. (For example, [1,2,3,1,2] has 3 different integers: 1, 2, and 3.) Return the number of good ...