// practice ground

Problems

# Title Topics Difficulty
126 Insert Interval
Arrays Intervals
Medium
127 Non-overlapping Intervals
Greedy Intervals
Medium
128 Letter Combinations of a Phone Number
Backtracking Strings
Medium
129 Palindrome Partitioning — Minimum Cuts
Backtracking Dynamic Programming Strings
Hard
130 Word Break
Dynamic Programming Hashing Strings
Medium
131 Partition Equal Subset Sum
Arrays Dynamic Programming
Medium
132 Longest Palindromic Substring
Dynamic Programming Strings Two Pointers
Medium
133 Minimum Path Sum
Dynamic Programming Matrix
Medium
134 Rod Cutting Problem
Dynamic Programming
Medium
135 Accounts Merge
Hashing Strings Union Find (Disjoint Set)
Medium
136 Most Stones Removed with Same Row or Column
Graphs Union Find (Disjoint Set)
Medium
137 LRU Cache Design
Design Hashing Linked List
Medium
138 Design a Twitter Feed (Simplified)
Design Hashing Heaps / Priority Queue
Hard
139 Koko Eating Bananas
Binary Search
Medium
140 Find Peak Element
Arrays Binary Search
Medium
141 Integer Square Root
Binary Search Math
Easy
142 Subsets using Bit Manipulation
Arrays Backtracking Bit Manipulation
Medium
143 Single Number II
Arrays Bit Manipulation
Medium
144 Counting Bits
Bit Manipulation Dynamic Programming
Easy
145 Modular Exponentiation
Bit Manipulation Math Number Theory
Medium
146 Extended Euclidean Algorithm
Math Number Theory
Medium
147 Closest Pair of Points
Divide and Conquer Geometry
Hard
148 Count Inversions
Arrays Divide and Conquer Sorting
Medium
149 Serialize and Deserialize Binary Tree
Design Trees
Hard
150 Quick Sort Implementation
Divide and Conquer Sorting
Medium
Showing 126–150 of 1062
Prev 4 5 6 7 8 Next