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
|
|
|
Concatenated Divisibility |
Hard
|
|
|
Count Beautiful Splits in an Array |
Medium
|
|
|
Count Connected Components in LCM Graph |
Hard
|
|
|
Count Covered Buildings |
Medium
|
|
|
Count Mentions Per User |
Medium
|
|
|
Count Non-Decreasing Subarrays After K Operations |
Hard
|
|
|
Count Numbers with Non-Decreasing Digits |
Hard
|
|
|
Count Paths With the Given XOR Value |
Medium
|
|
|
Design Spreadsheet |
Medium
|
|
|
Equal Sum Grid Partition I |
Medium
|
|
|
Fill a Special Grid |
Medium
|
|
|
Find Followers Count |
Easy
|
|
|
Find the Largest Almost Missing Integer |
Easy
|
|
|
Find the Minimum Amount of Time to Brew Potions |
Medium
|
|
|
Maximize Subarrays After Removing One Conflicting Pair |
Hard
|
|
|
Maximum Unique Subarray Sum After Deletion |
Easy
|
|
|
Minimum Cost to Reach Every Position |
Easy
|
|
|
Minimum Operations to Convert All Elements to Zero |
Medium
|
|
|
Minimum Pair Removal to Sort Array I |
Easy
|
|
|
Minimum Pair Removal to Sort Array II |
Hard
|
|
|
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
|
|
|
Reverse Degree of a String |
Easy
|
|
|
Smallest Index With Digit Sum Equal to Index |
Easy
|
|
|
Smallest Substring With Identical Characters I |
Hard
|
|
|
Smallest Substring With Identical Characters II |
Hard
|
|
|
Stock Price Fluctuation |
Medium
|
|
|
Subtree Inversion Sum |
Hard
|
|
|
Sum of Good Numbers |
Easy
|
|
|
Sum of K Subarrays With Length at Least M |
Medium
|
|
|
Minimum Operations to Make Subarray Elements Equal |
Medium
|
|
|
Minimum Runes to Add to Cast Spell |
Hard
|
|
|
Minimum Time to Break Locks II |
Hard
|
|
|
Minimum Unlocked Indices to Sort Nums |
Medium
|
|
|
Phone Number Prefix |
Easy
|
|
|
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
|
|
|