Note
In difficulty:
- E: Easy
- M: Medium
- H: Hard
Number | Title | Solution | Difficulty |
---|---|---|---|
23 | Merge k Sorted Lists | go | H |
24 | Swap Nodes in Pairs | go | M |
25 | Reverse Nodes in k-Group | go | H |
45 | Jump Game II | go | M |
46 | Permutations | go | M |
50 | Pow(x, n) | go | M |
51 | N-Queens | go | H |
105 | Construct Binary Tree from Preorder and Inorder Tranversal | go | M |
124 | Binary Tree Maximum Path Sum | go | H |
135 | Candy | go | H |
140 | Word Break II | go | H |
146 | LRU Cache | go | M |
236 | Lowest Common Ancestor of a Binary Tree | go | M |
239 | Sliding Window Maximum | go | H |
322 | Coin Change | go | M |
460 | LFU Cache | go | H |
592 | Fraction Addition and Subtraction | go | M |
752 | Open the Lock | go | M |
757 | Set Intersection Size At Least Two | go | H |
815 | Bus Routes | go | H |
765 | Couples Holding Hands | go | H |
834 | Sum of Distances in Tree | go | H |
840 | Magic Squares In Grid | go | M |
881 | Boats to Save People | go | M |
912 | Sort an Array | go | M |
948 | Bag of Tokens | go | M |
1395 | Count Number of Trams | go | M |
2366 | Mimimum Replacements to Sort the Array | go | H |
2932 | Build A Matrix with Conditions | go | H |