| String Compression ↗ | Medium | Two Pointers, String | |
| Closest Equal Element Queries ↗ | Medium | Array, Hash Table, Binary Search | |
| LFU Cache ↗ | Hard | Hash Table, Linked List, Design | |
| Minimum Removals to Balance Array ↗ | Medium | Array, Binary Search, Sliding Window | |
| Subarray Product Less Than K ↗ | Medium | Array, Binary Search, Sliding Window | |
| Maximum Product of Three Numbers ↗ | Easy | Array, Math, Sorting | |
| Longest Substring Without Repeating Characters ↗ | Medium | Hash Table, String, Sliding Window | |
| Maximum Frequency Stack ↗ | Hard | Hash Table, Stack, Design | |
| Merge Intervals ↗ | Medium | Array, Sorting | |
| Number of Islands ↗ | Medium | Array, Depth-First Search, Breadth-First Search | |
| Matrix Similarity After Cyclic Shifts ↗ | Easy | Array, Math, Matrix | |
| Palindromic Substrings ↗ | Medium | Two Pointers, String, Dynamic Programming | |
| Delete and Earn ↗ | Medium | Array, Hash Table, Dynamic Programming | |
| LRU Cache ↗ | Medium | Hash Table, Linked List, Design | |
| Binary Tree Maximum Path Sum ↗ | Hard | Dynamic Programming, Tree, Depth-First Search | |
| Longest Common Subsequence ↗ | Medium | String, Dynamic Programming | |
| Best Time to Buy and Sell Stock ↗ | Easy | Array, Dynamic Programming | |
| Reverse Nodes in k-Group ↗ | Hard | Linked List, Recursion | |
| K-diff Pairs in an Array ↗ | Medium | Array, Hash Table, Two Pointers | |
| All Nodes Distance K in Binary Tree ↗ | Medium | Hash Table, Tree, Depth-First Search | |
| Count Subarrays With Median K ↗ | Hard | Array, Hash Table, Prefix Sum | |
| Two Sum ↗ | Easy | Array, Hash Table | |
| Trapping Rain Water ↗ | Hard | Array, Two Pointers, Dynamic Programming | |
| Longest Palindromic Substring ↗ | Medium | Two Pointers, String, Dynamic Programming | |
| Min Stack ↗ | Medium | Stack, Design | |
| Zigzag Conversion ↗ | Medium | String | |
| Number of Digit One ↗ | Hard | Math, Dynamic Programming, Recursion | |
| Subarray Sum Equals K ↗ | Medium | Array, Hash Table, Prefix Sum | |
| Group Anagrams ↗ | Medium | Array, Hash Table, String | |
| Generate Parentheses ↗ | Medium | String, Dynamic Programming, Backtracking | |
| Course Schedule ↗ | Medium | Depth-First Search, Breadth-First Search, Graph Theory | |
| Find Median from Data Stream ↗ | Hard | Two Pointers, Design, Sorting | |
| Subarrays with K Different Integers ↗ | Hard | Array, Hash Table, Sliding Window | |
| Course Schedule II ↗ | Medium | Depth-First Search, Breadth-First Search, Graph Theory | |
| Construct Binary Tree from Preorder and Inorder Traversal ↗ | Medium | Array, Hash Table, Divide and Conquer | |
| Valid Parenthesis String ↗ | Medium | String, Dynamic Programming, Stack | |
| Minimum Edge Reversals So Every Node Is Reachable ↗ | Hard | Dynamic Programming, Depth-First Search, Breadth-First Search | |
| Koko Eating Bananas ↗ | Medium | Array, Binary Search | |
| Top K Frequent Elements ↗ | Medium | Array, Hash Table, Divide and Conquer | |
| Kth Largest Element in an Array ↗ | Medium | Array, Divide and Conquer, Sorting | |