ID Title Difficulty AC Rate Tags

1 Two Sum Easy 51.60% Array; Hash Table;

3 Longest Substring Without Repeating Characters Medium 34.40% Hash Table; String; Sliding Window;

53 Maximum Subarray Medium 50.50% Array; Divide and Conquer; Dynamic Programming;

42 Trapping Rain Water Hard 60.50% Array; Two Pointers; Dynamic Programming; Stack; Monotonic Stack;

121 Best Time to Buy and Sell Stock Easy 53.50% Array; Dynamic Programming;

2 Add Two Numbers Medium 42.10% Linked List; Math; Recursion;

15 3Sum Medium 34.00% Array; Two Pointers; Sorting;

5 Longest Palindromic Substring Medium 33.50% String; Dynamic Programming;

11 Container With Most Water Medium 54.70% Array; Two Pointers; Greedy;

4 Median of Two Sorted Arrays Hard 39.10% Array; Binary Search; Divide and Conquer;

33 Search in Rotated Sorted Array Medium 40.30% Array; Binary Search;

20 Valid Parentheses Easy 40.40% String; Stack;

287 Find the Duplicate Number Medium 59.40% Array; Two Pointers; Binary Search; Bit Manipulation;

200 Number of Islands Medium 58.40% Array; Depth-First Search; Breadth-First Search; Union Find; Matrix;

56 Merge Intervals Medium 46.90% Array; Sorting;

70 Climbing Stairs Easy 52.80% Math; Dynamic Programming; Memoization;

238 Product of Array Except Self Medium 65.20% Array; Prefix Sum;

21 Merge Two Sorted Lists Easy 63.80% Linked List; Recursion;

560 Subarray Sum Equals K Medium 43.30% Array; Hash Table; Prefix Sum;

206 Reverse Linked List Easy 75.50% Linked List; Recursion;

198 House Robber Medium 50.70% Array; Dynamic Programming;

22 Generate Parentheses Medium 74.00% String; Dynamic Programming; Backtracking;

300 Longest Increasing Subsequence Medium 54.80% Array; Binary Search; Dynamic Programming;

146 LRU Cache Medium 42.00% Hash Table; Linked List; Design; Doubly-Linked List;

34 Find First and Last Position of Element in Sorted Array Medium 43.80% Array; Binary Search;

128 Longest Consecutive Sequence Medium 47.30% Array; Hash Table; Union Find;

23 Merge k Sorted Lists Hard 51.90% Linked List; Divide and Conquer; Heap (Priority Queue); Merge Sort;

55 Jump Game Medium 38.50% Array; Dynamic Programming; Greedy;

46 Permutations Medium 77.80% Array; Backtracking;

322 Coin Change Medium 43.40% Array; Dynamic Programming; Breadth-First Search;

39 Combination Sum Medium 70.70% Array; Backtracking;

49 Group Anagrams Medium 67.50% Array; Hash Table; String; Sorting;

169 Majority Element Easy 63.90% Array; Hash Table; Divide and Conquer; Sorting; Counting;

152 Maximum Product Subarray Medium 34.90% Array; Dynamic Programming;

17 Letter Combinations of a Phone Number Medium 59.70% Hash Table; String; Backtracking;

19 Remove Nth Node From End of List Medium 43.60% Linked List; Two Pointers;

31 Next Permutation Medium 39.20% Array; Two Pointers;

239 Sliding Window Maximum Hard 46.50% Array; Queue; Sliding Window; Heap (Priority Queue); Monotonic Queue;

75 Sort Colors Medium 61.40% Array; Two Pointers; Sorting;

189 Rotate Array Medium 40.20% Array; Math; Two Pointers;

48 Rotate Image Medium 73.50% Array; Math; Matrix;

76 Minimum Window Substring Hard 41.70% Hash Table; String; Sliding Window;

14 Longest Common Prefix Easy 42.20% String; Trie;

139 Word Break Medium 46.50% Array; Hash Table; String; Dynamic Programming; Trie; Memoization;

347 Top K Frequent Elements Medium 62.70% Array; Hash Table; Divide and Conquer; Sorting; Heap (Priority Queue); Bucket Sort; Counting; Quickselect;

215 Kth Largest Element in an Array Medium 66.80% Array; Divide and Conquer; Sorting; Heap (Priority Queue); Quickselect;

84 Largest Rectangle in Histogram Hard 43.90% Array; Stack; Monotonic Stack;

78 Subsets Medium 76.90% Array; Backtracking; Bit Manipulation;

98 Validate Binary Search Tree Medium 32.60% Tree; Depth-First Search; Binary Search Tree; Binary Tree;

62 Unique Paths Medium 64.00% Math; Dynamic Programming; Combinatorics;

124 Binary Tree Maximum Path Sum Hard 39.80% Dynamic Programming; Tree; Depth-First Search; Binary Tree;

283 Move Zeroes Easy 61.50% Array; Two Pointers;

136 Single Number Easy 72.20% Array; Bit Manipulation;

236 Lowest Common Ancestor of a Binary Tree Medium 61.30% Tree; Depth-First Search; Binary Tree;

234 Palindrome Linked List Easy 51.50% Linked List; Two Pointers; Stack; Recursion;

207 Course Schedule Medium 46.50% Depth-First Search; Breadth-First Search; Graph; Topological Sort;

41 First Missing Positive Hard 37.60% Array; Hash Table;

35 Search Insert Position Easy 45.20% Array; Binary Search;

74 Search a 2D Matrix Medium 49.60% Array; Binary Search; Matrix;

79 Word Search Medium 41.20% Array; Backtracking; Matrix;

102 Binary Tree Level Order Traversal Medium 66.50% Tree; Breadth-First Search; Binary Tree;

101 Symmetric Tree Easy 55.90% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

141 Linked List Cycle Easy 49.30% Hash Table; Linked List; Two Pointers;

160 Intersection of Two Linked Lists Easy 56.70% Hash Table; Linked List; Two Pointers;

105 Construct Binary Tree from Preorder and Inorder Traversal Medium 63.30% Array; Hash Table; Divide and Conquer; Tree; Binary Tree;

72 Edit Distance Medium 55.90% String; Dynamic Programming;

54 Spiral Matrix Medium 48.60% Array; Matrix; Simulation;

 45 Jump Game II Medium 40.30% Array; Dynamic Programming; Greedy;

73 Set Matrix Zeroes Medium 54.60% Array; Hash Table; Matrix;

88 Merge Sorted Array Easy 48.80% Array; Two Pointers; Sorting;

26 Remove Duplicates from Sorted Array Easy 54.50% Array; Two Pointers;

226 Invert Binary Tree Easy 76.40% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

155 Min Stack Medium 53.60% Stack; Design;

138 Copy List with Random Pointer Medium 55.20% Hash Table; Linked List;

13 Roman to Integer Easy 60.40% Hash Table; Math; String;

25 Reverse Nodes in k-Group Hard 57.70% Linked List; Recursion;

142 Linked List Cycle II Medium 50.60% Hash Table; Linked List; Two Pointers;

94 Binary Tree Inorder Traversal Easy 75.70% Stack; Tree; Depth-First Search; Binary Tree;

1250 Longest Common Subsequence Medium 57.90% String; Dynamic Programming;

122 Best Time to Buy and Sell Stock II Medium 65.80% Array; Dynamic Programming; Greedy;

543 Diameter of Binary Tree Easy 58.70% Tree; Depth-First Search; Binary Tree;

153 Find Minimum in Rotated Sorted Array Medium 49.90% Array; Binary Search;

7 Reverse Integer Medium 28.30% Math;

118 Pascal's Triangle Easy 73.70% Array; Dynamic Programming;

104 Maximum Depth of Binary Tree Easy 74.90% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

394 Decode String Medium 58.90% String; Stack; Recursion;

1036 Rotting Oranges Medium 53.80% Array; Breadth-First Search; Matrix;

209 Minimum Size Subarray Sum Medium 46.70% Array; Binary Search; Sliding Window; Prefix Sum;

739 Daily Temperatures Medium 65.90% Array; Stack; Monotonic Stack;

131 Palindrome Partitioning Medium 66.90% String; Dynamic Programming; Backtracking;

64 Minimum Path Sum Medium 63.40% Array; Dynamic Programming; Matrix;

438 Find All Anagrams in a String Medium 50.70% Hash Table; String; Sliding Window;

32 Longest Valid Parentheses Hard 33.60% String; Dynamic Programming; Stack;

9 Palindrome Number Easy 55.40% Math;

51 N-Queens Hard 67.30% Array; Backtracking;

416 Partition Equal Subset Sum Medium 46.20% Array; Dynamic Programming;

114 Flatten Binary Tree to Linked List Medium 64.20% Linked List; Stack; Tree; Depth-First Search; Binary Tree;

10 Regular Expression Matching Hard 28.10% String; Dynamic Programming; Recursion;

127 Word Ladder Hard 38.60% Hash Table; String; Breadth-First Search;

242 Valid Anagram Easy 64.10% Hash Table; String; Sorting;

24 Swap Nodes in Pairs Medium 63.70% Linked List; Recursion;

91 Decode Ways Medium 34.50% String; Dynamic Programming;

240 Search a 2D Matrix II Medium 52.20% Array; Binary Search; Divide and Conquer; Matrix;

199 Binary Tree Right Side View Medium 62.70% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

295 Find Median from Data Stream Hard 51.70% Two Pointers; Design; Sorting; Heap (Priority Queue); Data Stream;

134 Gas Station Medium 45.60% Array; Greedy;

217 Contains Duplicate Easy 61.30% Array; Hash Table; Sorting;

792 Binary Search Easy 57.10% Array; Binary Search;

162 Find Peak Element Medium 45.80% Array; Binary Search;

167 Two Sum II - Input Array Is Sorted Medium 60.80% Array; Two Pointers; Binary Search;

268 Missing Number Easy 64.90% Array; Hash Table; Math; Binary Search; Bit Manipulation; Sorting;

92 Reverse Linked List II Medium 47.40% Linked List;

208 Implement Trie (Prefix Tree) Medium 64.50% Hash Table; String; Design; Trie;

148 Sort List Medium 57.10% Linked List; Two Pointers; Divide and Conquer; Sorting; Merge Sort;

747 Min Cost Climbing Stairs Easy 65.40% Array; Dynamic Programming;

230 Kth Smallest Element in a BST Medium 71.90% Tree; Depth-First Search; Binary Search Tree; Binary Tree;

567 Permutation in String Medium 44.20% Hash Table; Two Pointers; String; Sliding Window;

908 Middle of the Linked List Easy 77.10% Linked List; Two Pointers;

18 4Sum Medium 36.00% Array; Two Pointers; Sorting;

100 Same Tree Easy 60.50% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

338 Counting Bits Easy 77.90% Dynamic Programming; Bit Manipulation;

540 Single Element in a Sorted Array Medium 59.00% Array; Binary Search;

235 Lowest Common Ancestor of a Binary Search Tree Medium 64.00% Tree; Depth-First Search; Binary Search Tree; Binary Tree;

108 Convert Sorted Array to Binary Search Tree Easy 71.20% Array; Divide and Conquer; Tree; Binary Search Tree; Binary Tree;

893 All Nodes Distance K in Binary Tree Medium 64.20% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

437 Path Sum III Medium 46.70% Tree; Depth-First Search; Binary Tree;

494 Target Sum Medium 46.40% Array; Dynamic Programming; Backtracking;

103 Binary Tree Zigzag Level Order Traversal Medium 58.40% Tree; Breadth-First Search; Binary Tree;

210 Course Schedule II Medium 49.90% Depth-First Search; Breadth-First Search; Graph; Topological Sort;

279 Perfect Squares Medium 53.10% Math; Dynamic Programming; Breadth-First Search;

110 Balanced Binary Tree Easy 51.30% Tree; Depth-First Search; Binary Tree;

36 Valid Sudoku Medium 59.20% Array; Hash Table; Matrix;

16 3Sum Closest Medium 45.60% Array; Two Pointers; Sorting;

96 Unique Binary Search Trees Medium 60.70% Math; Dynamic Programming; Tree; Binary Search Tree; Binary Tree;

143 Reorder List Medium 55.60% Linked List; Two Pointers; Stack; Recursion;
 768 Partition Labels Medium 79.80% Hash Table; Two Pointers; String; Greedy;

40 Combination Sum II Medium 54.10% Array; Backtracking;

424 Longest Repeating Character Replacement Medium 53.30% Hash Table; String; Sliding Window;

647 Palindromic Substrings Medium 68.30% String; Dynamic Programming;

202 Happy Number Easy 55.80% Hash Table; Math; Two Pointers;

297 Serialize and Deserialize Binary Tree Hard 56.40% String; Tree; Depth-First Search; Breadth-First Search; Design; Binary Tree;

221 Maximal Square Medium 46.10% Array; Dynamic Programming; Matrix;

907 Koko Eating Bananas Medium 49.20% Array; Binary Search;

695 Max Area of Island Medium 71.80% Array; Depth-First Search; Breadth-First Search; Union Find; Matrix;

378 Kth Smallest Element in a Sorted Matrix Medium 62.20% Array; Binary Search; Sorting; Heap (Priority Queue); Matrix;

85 Maximal Rectangle Hard 46.50% Array; Dynamic Programming; Stack; Matrix; Monotonic Stack;

328 Odd Even Linked List Medium 61.40% Linked List;

213 House Robber II Medium 41.80% Array; Dynamic Programming;

442 Find All Duplicates in an Array Medium 73.60% Array; Hash Table;

116 Populating Next Right Pointers in Each Node Medium 62.10% Linked List; Tree; Depth-First Search; Breadth-First Search; Binary Tree;

57 Insert Interval Medium 39.80% Array;

410 Split Array Largest Sum Hard 54.90% Array; Binary Search; Dynamic Programming; Greedy; Prefix Sum;

90 Subsets II Medium 56.90% Array; Backtracking; Bit Manipulation;

112 Path Sum Easy 49.80% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

123 Best Time to Buy and Sell Stock III Hard 47.40% Array; Dynamic Programming;

547 Number of Provinces Medium 65.80% Depth-First Search; Breadth-First Search; Union Find; Graph;

229 Majority Element II Medium 50.90% Array; Hash Table; Sorting; Counting;

621 Task Scheduler Medium 58.10% Array; Hash Table; Greedy; Sorting; Heap (Priority Queue); Counting;

516 Longest Palindromic Subsequence Medium 62.40% String; Dynamic Programming;

392 Is Subsequence Easy 47.90% Two Pointers; String; Dynamic Programming;

61 Rotate List Medium 37.20% Linked List; Two Pointers;

50 Pow(x, n) Medium 34.30% Math; Recursion;

120 Triangle Medium 56.10% Array; Dynamic Programming;

37 Sudoku Solver Hard 60.10% Array; Hash Table; Backtracking; Matrix;

448 Find All Numbers Disappeared in an Array Easy 60.70% Array; Hash Table;

309 Best Time to Buy and Sell Stock with Cooldown Medium 57.70% Array; Dynamic Programming;

212 Word Search II Hard 36.20% Array; String; Backtracking; Trie; Matrix;

133 Clone Graph Medium 56.10% Hash Table; Depth-First Search; Breadth-First Search; Graph;

542 01 Matrix Medium 48.10% Array; Dynamic Programming; Breadth-First Search; Matrix;

67 Add Binary Easy 53.10% Math; String; Bit Manipulation; Simulation;

518 Coin Change II Medium 63.50% Array; Dynamic Programming;

1056 Capacity To Ship Packages Within D Days Medium 68.90% Array; Binary Search;

803 Cheapest Flights Within K Stops Medium 37.40% Dynamic Programming; Depth-First Search; Breadth-First Search; Graph; Heap (Priority Queue); Shortest Path;

399 Evaluate Division Medium 61.50% Array; Depth-First Search; Breadth-First Search; Union Find; Graph; Shortest Path;

380 Insert Delete GetRandom O(1) Medium 54.30% Array; Hash Table; Math; Design; Randomized;

66 Plus One Easy 44.70% Array; Math;

125 Valid Palindrome Easy 46.60% Two Pointers; String;

329 Longest Increasing Path in a Matrix Hard 53.30% Array; Dynamic Programming; Depth-First Search; Breadth-First Search; Graph; Topological Sort; Memoization; Matrix;

312 Burst Balloons Hard 58.40% Array; Dynamic Programming;

450 Delete Node in a BST Medium 51.00% Tree; Binary Search Tree; Binary Tree;

315 Count of Smaller Numbers After Self Hard 42.40% Array; Binary Search; Divide and Conquer; Binary Indexed Tree; Segment Tree; Merge Sort; Ordered Set;

617 Merge Two Binary Trees Easy 78.90% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

1019 Squares of a Sorted Array Easy 71.80% Array; Two Pointers; Sorting;

82 Remove Duplicates from Sorted List II Medium 47.00% Linked List; Two Pointers;

63 Unique Paths II Medium 41.20% Array; Dynamic Programming; Matrix;

402 Remove K Digits Medium 30.90% String; Stack; Greedy; Monotonic Stack;

662 Maximum Width of Binary Tree Medium 42.80% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

316 Remove Duplicate Letters Medium 49.20% String; Stack; Greedy; Monotonic Stack;

387 First Unique Character in a String Easy 60.50% Hash Table; String; Queue; Counting;

83 Remove Duplicates from Sorted List Easy 52.00% Linked List;

222 Count Complete Tree Nodes Easy 64.00% Binary Search; Bit Manipulation; Tree; Binary Tree;

337 House Robber III Medium 54.10% Dynamic Programming; Tree; Depth-First Search; Binary Tree;

47 Permutations II Medium 58.60% Array; Backtracking;

173 Binary Search Tree Iterator Medium 71.40% Stack; Tree; Design; Binary Search Tree; Binary Tree; Iterator;

130 Surrounded Regions Medium 38.70% Array; Depth-First Search; Breadth-First Search; Union Find; Matrix;

778 Reorganize String Medium 54.40% Hash Table; String; Greedy; Sorting; Heap (Priority Queue); Counting;

278 First Bad Version Easy 44.10% Binary Search; Interactive;

81 Search in Rotated Sorted Array II Medium 37.40% Array; Binary Search;

1014 K Closest Points to Origin Medium 66.10% Array; Math; Divide and Conquer; Geometry; Sorting; Heap (Priority Queue); Quickselect;

344 Reverse String Easy 77.50% Two Pointers; String;

733 Flood Fill Easy 63.50% Array; Depth-First Search; Breadth-First Search; Matrix;

1046 Max Consecutive Ones III Medium 62.60% Array; Binary Search; Sliding Window; Prefix Sum;

203 Remove Linked List Elements Easy 48.00% Linked List; Recursion;
 205 Isomorphic Strings Easy 43.50% Hash Table; String;

724 Find Pivot Index Easy 56.80% Array; Prefix Sum;

77 Combinations Medium 69.90% Backtracking;

44 Wildcard Matching Hard 27.50% String; Dynamic Programming; Greedy; Recursion;

97 Interleaving String Medium 39.60% String; Dynamic Programming;

680 Valid Palindrome II Easy 40.10% Two Pointers; String; Greedy;

572 Subtree of Another Tree Easy 47.50% Tree; Depth-First Search; String Matching; Binary Tree; Hash Function;

801 Is Graph Bipartite? Medium 55.30% Depth-First Search; Breadth-First Search; Union Find; Graph;

151 Reverse Words in a String Medium 39.80% Two Pointers; String;

658 Find K Closest Elements Medium 47.10% Array; Two Pointers; Binary Search; Sliding Window; Sorting; Heap (Priority Queue);

1013 Fibonacci Number Easy 70.60% Math; Dynamic Programming; Recursion; Memoization;

435 Non-overlapping Intervals Medium 52.80% Array; Dynamic Programming; Greedy; Sorting;

69 Sqrt(x) Easy 38.30% Math; Binary Search;

106 Construct Binary Tree from Inorder and Postorder Traversal Medium 62.10% Array; Hash Table; Divide and Conquer; Tree; Binary Tree;

179 Largest Number Medium 35.70% Array; String; Greedy; Sorting;

943 Sum of Subarray Minimums Medium 37.50% Array; Dynamic Programming; Stack; Monotonic Stack;

334 Increasing Triplet Subsequence Medium 40.40% Array; Greedy;

144 Binary Tree Preorder Traversal Easy 68.90% Stack; Tree; Depth-First Search; Binary Tree;

113 Path Sum II Medium 58.10% Backtracking; Tree; Depth-First Search; Binary Tree;

204 Count Primes Medium 33.40% Array; Math; Enumeration; Number Theory;

99 Recover Binary Search Tree Medium 52.60% Tree; Depth-First Search; Binary Search Tree; Binary Tree;

1025 Minimum Cost For Tickets Medium 65.40% Array; Dynamic Programming;

503 Next Greater Element II Medium 63.60% Array; Stack; Monotonic Stack;

581 Shortest Unsorted Continuous Subarray Medium 36.70% Array; Two Pointers; Stack; Greedy; Sorting; Monotonic Stack;

1603 Running Sum of 1d Array Easy 86.60% Array; Prefix Sum;

137 Single Number II Medium 62.10% Array; Bit Manipulation;

496 Next Greater Element I Easy 71.90% Array; Hash Table; Stack; Monotonic Stack;

451 Sort Characters By Frequency Medium 70.70% Hash Table; String; Sorting; Heap (Priority Queue); Bucket Sort; Counting;

692 Top K Frequent Words Medium 57.70% Hash Table; String; Trie; Sorting; Heap (Priority Queue); Bucket Sort; Counting;

735 Asteroid Collision Medium 44.80% Array; Stack; Simulation;

135 Candy Hard 43.20% Array; Greedy;

95 Unique Binary Search Trees II Medium 57.10% Dynamic Programming; Backtracking; Tree; Binary Search Tree; Binary Tree;

129 Sum Root to Leaf Numbers Medium 62.90% Tree; Depth-First Search; Binary Tree;

211 Design Add and Search Words Data Structure Medium 44.80% String; Depth-First Search; Design; Trie;

874 Backspace String Compare Easy 49.10% Two Pointers; String; Stack; Simulation;

310 Minimum Height Trees Medium 38.80% Depth-First Search; Breadth-First Search; Graph; Topological Sort;

740 Delete and Earn Medium 56.50% Array; Hash Table; Dynamic Programming;

109 Convert Sorted List to Binary Search Tree Medium 61.40% Linked List; Divide and Conquer; Tree; Binary Search Tree; Binary Tree;

377 Combination Sum IV Medium 54.00% Array; Dynamic Programming;

188 Best Time to Buy and Sell Stock IV Hard 41.90% Array; Dynamic Programming;

1029 Vertical Order Traversal of a Binary Tree Hard 46.90% Hash Table; Tree; Depth-First Search; Breadth-First Search; Binary Tree;

882 Peak Index in a Mountain Array Medium 68.60% Array; Binary Search;

6 Zigzag Conversion Medium 47.00% String;

744 Network Delay Time Medium 53.30% Depth-First Search; Breadth-First Search; Graph; Heap (Priority Queue); Shortest Path;

86 Partition List Medium 55.70% Linked List; Two Pointers;

417 Pacific Atlantic Water Flow Medium 55.00% Array; Depth-First Search; Breadth-First Search; Matrix;

111 Minimum Depth of Binary Tree Easy 47.30% Tree; Depth-First Search; Breadth-First Search; Binary Tree;

Sheet by : @geekydev.in

https://www.instagram.com/geekydev.in