|
1 | 1 | # LeetCode June Challenge |
2 | 2 |
|
3 | | -| Day | Problem | Topics | Solution | |
4 | | -|:---:|:-------------------------------:|----------------------|:------------------------------------------------------------------------------------:| |
5 | | -| 1 | Invert Binary Tree | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/1.cpp) | |
6 | | -| 2 | Delete Node in a Linked List | LinkedList | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/2.cpp) | |
7 | | -| 3 | Two City Scheduling | Greedy | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/3.cpp) | |
8 | | -| 4 | Reverse String | String | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/4.cpp) | |
9 | | -| 5 | Random Pick with Weight | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/5.cpp) | |
10 | | -| 6 | Queue Reconstruction by Height | Greedy | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/6.cpp) | |
11 | | -| 7 | Coin Change 2 | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/7.cpp) | |
12 | | -| 8 | Power of Two | Bit Manipulation | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/8.cpp) | |
13 | | -| 9 | Is Subsequence | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/9.cpp) | |
14 | | -| 10 | Search Insert Position | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/10.cpp) | |
15 | | -| 11 | Sort Colors | Two Pointers | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/11.cpp) | |
16 | | -| 12 | Insert Delete GetRandom O(1) | Hashing | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/12.cpp) | |
17 | | -| 13 | Largest Divisible Subset | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/13.cpp) | |
| 3 | +| Day | Problem | Topics | Solution | |
| 4 | +|:---:|:-------------------------------:|:--------------------:|:------------------------------------------------------------------------------------:| |
| 5 | +| 1 | Invert Binary Tree | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/1.cpp) | |
| 6 | +| 2 | Delete Node in a Linked List | LinkedList | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/2.cpp) | |
| 7 | +| 3 | Two City Scheduling | Greedy | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/3.cpp) | |
| 8 | +| 4 | Reverse String | String | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/4.cpp) | |
| 9 | +| 5 | Random Pick with Weight | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/5.cpp) | |
| 10 | +| 6 | Queue Reconstruction by Height | Greedy | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/6.cpp) | |
| 11 | +| 7 | Coin Change 2 | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/7.cpp) | |
| 12 | +| 8 | Power of Two | Bit Manipulation | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/8.cpp) | |
| 13 | +| 9 | Is Subsequence | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/9.cpp) | |
| 14 | +| 10 | Search Insert Position | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/10.cpp) | |
| 15 | +| 11 | Sort Colors | Two Pointers | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/11.cpp) | |
| 16 | +| 12 | Insert Delete GetRandom O(1) | Hashing | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/12.cpp) | |
| 17 | +| 13 | Largest Divisible Subset | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/13.cpp) | |
18 | 18 | | 14 | Cheapest Flights Within K Stops | Breadth First Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/14.cpp) | |
19 | | -| 15 | Search in a Binary Search Tree | Tree | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/15.cpp) | |
20 | | -| 16 | Validate IP Address | Strings | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/16.cpp) | |
21 | | -| 17 | Surrounded Regions | Graph Theory | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/17.cpp) | |
22 | | -| 18 | H-Index II | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/18.cpp) | |
23 | | -| 19 | Longest Duplicate Substring | Hashing | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/19.cpp) | |
24 | | -| 20 | Permutation Sequence | Backtracking | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/20.cpp) | |
25 | | -| 21 | Dungeon Game | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/21.cpp) | |
26 | | -| 22 | Single Number II | Bit Manipulation | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/22.cpp) | |
27 | | -| 23 | Count Complete Tree Nodes | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/23.cpp) | |
28 | | -| 24 | Unique Binary Search Trees | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/24.cpp) | |
29 | | -| 25 | Find the Duplicate Number | Two Pointers | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/25.cpp) | |
30 | | -| 26 | Sum Root to Leaf Numbers | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/26.cpp) | |
31 | | -| 27 | Perfect Squares | Math | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/27.cpp) | |
32 | | -| 28 | Reconstruct Itinerary | Graph | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/28.cpp) | |
33 | | -| 29 | Unique Paths | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/29.cpp) | |
34 | | -| 30 | Word Search II | Trie | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/30.cpp) | |
| 19 | +| 15 | Search in a Binary Search Tree | Tree | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/15.cpp) | |
| 20 | +| 16 | Validate IP Address | Strings | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/16.cpp) | |
| 21 | +| 17 | Surrounded Regions | Graph Theory | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/17.cpp) | |
| 22 | +| 18 | H-Index II | Binary Search | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/18.cpp) | |
| 23 | +| 19 | Longest Duplicate Substring | Hashing | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/19.cpp) | |
| 24 | +| 20 | Permutation Sequence | Backtracking | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/20.cpp) | |
| 25 | +| 21 | Dungeon Game | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/21.cpp) | |
| 26 | +| 22 | Single Number II | Bit Manipulation | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/22.cpp) | |
| 27 | +| 23 | Count Complete Tree Nodes | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/23.cpp) | |
| 28 | +| 24 | Unique Binary Search Trees | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/24.cpp) | |
| 29 | +| 25 | Find the Duplicate Number | Two Pointers | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/25.cpp) | |
| 30 | +| 26 | Sum Root to Leaf Numbers | Trees | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/26.cpp) | |
| 31 | +| 27 | Perfect Squares | Math | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/27.cpp) | |
| 32 | +| 28 | Reconstruct Itinerary | Graph | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/28.cpp) | |
| 33 | +| 29 | Unique Paths | Dynamic Programming | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/29.cpp) | |
| 34 | +| 30 | Word Search II | Trie | [Link](https://github.com/ishpreet-singh/leetcode-june-challenge/blob/master/30.cpp) | |
0 commit comments