Category
greedy
Minimum Deletions to Make Character Frequencies Unique
The task is to determine the minimum number of characters that need to be deleted from a given string to make it satisfies a condition. 
Stone Game (9)
Alice and Bob take turns removing stones from a row, aiming to avoid making the sum of the removed stones divisible by 3. If a player removes a stone that results in a sum divisible by 3, they lose. The task is to determine whether Alice wins or Bob wins. 
Maximum Strictly Increasing Cells in a Matrix
The problem revolves around navigating an integer matrix from a starting cell following a set of rules. The task is to determine the maximum number of cells that can be visited. 
Find K Pairs with Smallest Sums
The goal is to find the k pairs formed by choosing one element from each array. These pairs have the smallest sums among all possible combinations of elements from both arrays. -
Count Negative Numbers in a Sorted Matrix
Simple traversing problem that can be solve in many ways