Minimum Number of Moves to Make Palindrome |
Hard
|
|
|
Minimum Number of Operations to Make Array Continuous |
Hard
|
|
|
Minimum Number of Operations to Make Arrays Similar |
Hard
|
|
|
Minimum Number of Operations to Make String Sorted |
Hard
|
|
|
Minimum Number of Valid Strings to Form Target II |
Hard
|
|
|
Minimum Number of Visited Cells in a Grid |
Hard
|
|
|
Minimum Obstacle Removal to Reach Corner |
Hard
|
|
|
Minimum Operations to Make a Subsequence |
Hard
|
|
|
Minimum Operations to Make Array Equal to Target |
Hard
|
|
|
Minimum Skips to Arrive at Meeting On Time |
Hard
|
|
|
Minimum Space Wasted From Packaging |
Hard
|
|
|
Minimum Sum of Values by Dividing Array |
Hard
|
|
|
Minimum Time to Finish the Race |
Hard
|
|
|
Minimum Time to Make Array Sum At Most x |
Hard
|
|
|
Minimum Time to Remove All Cars Containing Illegal Goods |
Hard
|
|
|
Minimum Total Cost to Make Arrays Unequal |
Hard
|
|
|
Minimum Weighted Subgraph With the Required Paths |
Hard
|
|
|
Minimum White Tiles After Covering With Carpets |
Hard
|
|
|
Minimum XOR Sum of Two Arrays |
Hard
|
|
|
Next Greater Element IV |
Hard
|
|
|
Nth Magical Number |
Hard
|
|
|
Number of Beautiful Partitions |
Hard
|
|
|
Number of Distinct Roll Sequences |
Hard
|
|
|
Number of Pairs Satisfying Inequality |
Hard
|
|
|
Number of Squareful Arrays |
Hard
|
apple
|
|
Number of Subarrays With AND Value of K |
Hard
|
|
|
Number of Unique Good Subsequences |
Hard
|
|
|
Number of Valid Move Combinations On Chessboard |
Hard
|
|
|
Number of Valid Words for Each Puzzle |
Hard
|
dropbox
|
|
Number of Ways to Divide a Long Corridor |
Hard
|
|
|
Number of Ways to Separate Numbers |
Hard
|
|
|
Palindrome Partitioning IV |
Hard
|
|
|
Palindrome Rearrangement Queries |
Hard
|
|
|
Parallel Courses II |
Hard
|
google
|
|
Peaks in Array |
Hard
|
|
|
Power of Heroes |
Hard
|
|
|
Probability of a Two Boxes Having The Same Number of Distinct Balls |
Hard
|
|
|
Process Restricted Friend Requests |
Hard
|
|
|
Rearranging Fruits |
Hard
|
|
|
Replace Non-Coprime Numbers in Array |
Hard
|
|
|
Reverse Subarray To Maximize Array Value |
Hard
|
codenation
|
|
Robot Collisions |
Hard
|
|
|
Select Cells in Grid With Maximum Score |
Hard
|
|
|
Shortest Distance After Road Addition Queries II |
Hard
|
|
|
Shortest Impossible Sequence of Rolls |
Hard
|
|
|
Sort Items by Groups Respecting Dependencies |
Hard
|
google
|
|
Special Binary String |
Hard
|
citrix
coursera
quip
visa
|
|
Split the Array to Make Coprime Products |
Hard
|
|
|
Stamping The Sequence |
Hard
|
facebook
google
uber
|
|
Stream of Characters |
Hard
|
amazon
facebook
google
|
|