#
| Problem
| Difficulty
| Acceptance
|
460
| LFU Cache
| Hard
| 50.6%
|
443
| String Compression
| Medium
| 61.1%
|
2571
| Minimum Operations to Reduce an Integer to 0
| Medium
| 63.6%
|
2380
| Time Needed to Rearrange a Binary String
| Medium
| 53.8%
|
628
| Maximum Product of Three Numbers
| Easy
| 48.3%
|
3634
| Minimum Removals to Balance Array
| Medium
| 47.7%
|
210
| Course Schedule II
| Medium
| 56.5%
|
1962
| Remove Stones to Minimize the Total
| Medium
| 66.3%
|
2366
| Minimum Replacements to Sort the Array
| Hard
| 53.0%
|
2858
| Minimum Edge Reversals So Every Node Is Reachable
| Hard
| 60.2%
|
560
| Subarray Sum Equals K
| Medium
| 48.4%
|
3893
| Maximum Team Size with Overlapping Intervals
| Medium
| 42.4%
|
56
| Merge Intervals
| Medium
| 53.1%
|
1344
| Angle Between Hands of a Clock
| Medium
| 69.9%
|
1209
| Remove All Adjacent Duplicates in String II
| Medium
| 62.1%
|
904
| Fruit Into Baskets
| Medium
| 52.9%
|
465
| Optimal Account Balancing
| Hard
| 50.9%
|
735
| Asteroid Collision
| Medium
| 49.5%
|
2035
| Partition Array Into Two Arrays to Minimize Sum Difference
| Hard
| 24.9%
|
2385
| Amount of Time for Binary Tree to Be Infected
| Medium
| 66.2%
|
253
| Meeting Rooms II
| Medium
| 52.9%
|
23
| Merge k Sorted Lists
| Hard
| 60.9%
|
2062
| Count Vowel Substrings of a String
| Easy
| 73.8%
|
131
| Palindrome Partitioning
| Medium
| 74.9%
|
2204
| Distance to a Cycle in Undirected Graph
| Hard
| 73.7%
|
2551
| Put Marbles in Bags
| Hard
| 72.0%
|
2718
| Sum of Matrix After Queries
| Medium
| 31.7%
|
1200
| Minimum Absolute Difference
| Easy
| 75.2%
|
207
| Course Schedule
| Medium
| 52.5%
|
113
| Path Sum II
| Medium
| 63.2%
|
924
| Minimize Malware Spread
| Hard
| 43.6%
|