| Minimum Insertion OR Deletion Steps to Make a String Palindrome |
Medium
|
|
|
| Minimum Deletion Steps to Make a String Palindrome |
Medium
|
|
|
| Closest Equal Element Queries |
Medium
|
|
|
| Check If Digits Are Equal in String After Operations I |
Easy
|
|
|
| Check If Digits Are Equal in String After Operations II |
Hard
|
|
|
| Choose K Elements With Maximum Sum |
Medium
|
|
|
| Count Beautiful Splits in an Array |
Medium
|
|
|
| Count Connected Components in LCM Graph |
Hard
|
|
|
| Count Covered Buildings |
Medium
|
|
|
| Count Mentions Per User |
Medium
|
|
|
| Fill a Special Grid |
Medium
|
|
|
| Find Followers Count |
Easy
|
|
|
| Maximum Unique Subarray Sum After Deletion |
Easy
|
|
|
| Minimum Time to Break Locks I |
Medium
|
|
|
| Paint House IV |
Medium
|
|
|
| Reschedule Meetings for Maximum Free Time I |
Medium
|
|
|
| Reschedule Meetings for Maximum Free Time II |
Medium
|
|
|
| Smallest Index With Digit Sum Equal to Index |
Easy
|
|
|
| Stock Price Fluctuation |
Medium
|
|
|
| Minimum Time to Break Locks II |
Hard
|
|
|
| Range XOR Queries with Subarray Reversals |
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
|
|