| Design an Array Statistics Tracker |
Hard
|
|
|
| Find Circular Gift Exchange Chains |
Hard
|
|
|
| Longest Common Prefix After at Most One Removal |
Medium
|
|
|
| Longest Team Pass Streak |
Hard
|
|
|
| Make a Positive Array |
Medium
|
|
|
| Maximize Profit from Task Assignment |
Medium
|
|
|
| Maximize Score After Pair Deletions |
Medium
|
|
|
| Maximum Coin Collection |
Medium
|
|
|
| Maximum Students on a Single Bench |
Easy
|
|
|
| Minimum Operations to Make Subarray Elements Equal |
Medium
|
|
|
| Minimum Runes to Add to Cast Spell |
Hard
|
|
|
| Minimum Threshold for Inversion Pairs Count |
Medium
|
|
|
| Minimum Time to Break Locks II |
Hard
|
|
|
| Minimum Time to Visit All Houses |
Medium
|
|
|
| Minimum Unlocked Indices to Sort Nums |
Medium
|
|
|
| Multiply Two Polynomials |
Hard
|
|
|
| Permutations III |
Medium
|
|
|
| Phone Number Prefix |
Easy
|
|
|
| Range XOR Queries with Subarray Reversals |
Hard
|
|
|
| Subsequences with a Unique Middle Mode II |
Hard
|
|
|
| Team Dominance by Pass Success |
Hard
|
|
|
| Unit Conversion II |
Medium
|
|
|
| Calculate Score After Performing Instructions |
Medium
|
|
|
| Find Time Required to Eliminate Bacterial Strains |
Hard
|
|
|
| Find Subsequence of Length K With the Largest Sum |
Easy
|
|
|
| Longest Subsequence Repeated k Times |
Hard
|
|
|
| Kth Smallest Product of Two Sorted Arrays |
Hard
|
|
|
| Sum of k-Mirror Numbers |
Hard
|
|
|
| Divide a String Into Groups of Size k |
Easy
|
|
|
| Minimum Deletions to Make String K-Special |
Medium
|
|
|
| Maximum Manhattan Distance After K Changes |
Medium
|
|
|
| Partition Array Such That Maximum Difference Is K |
Medium
|
|
|
| Divide Array Into Arrays With Max Difference |
Medium
|
|
|
| Count the Number of Arrays with K Matching Adjacent Elements |
Hard
|
|
|
| Maximum Difference Between Increasing Elements |
Easy
|
|
|
| Max Difference You Can Get From Changing an Integer |
Medium
|
|
|
| Maximum Difference by Remapping a Digit |
Easy
|
|
|
| Maximum Difference Between Adjacent Elements in a Circular Array |
Easy
|
|
|
| Maximum Difference Between Even and Odd Frequency II |
Hard
|
|
|
| Maximum Difference Between Even and Odd Frequency I |
Easy
|
|
|
| Using a Robot to Print the Lexicographically Smallest String |
Medium
|
|
|
| Analyze Organization Hierarchy |
Hard
|
|
|
| Analyze Subscription Conversion |
Medium
|
|
|
| Apply Substitutions |
Medium
|
|
|
| Assign Elements to Groups with Constraints |
Medium
|
|
|
| Find the Lexicographically Largest String From the Box I |
Medium
|
|
|
| Angle Between Hands of a Clock |
Medium
|
amazon
microsoft
|
|
| Ant on the Boundary |
Easy
|
|
|
| Amount of Time for Binary Tree to Be Infected |
Medium
|
|
|
| Ambiguous Coordinates |
Medium
|
google
|
|