Skip to content

Commit 949714f

Browse files
Update readme.md
1 parent eb161d2 commit 949714f

File tree

1 file changed

+30
-31
lines changed

1 file changed

+30
-31
lines changed

LeetCode June Challenge/readme.md

Lines changed: 30 additions & 31 deletions
Original file line numberDiff line numberDiff line change
@@ -3,34 +3,33 @@
33

44
| # | Problem Statement| Solution (Java) | Related Topics | Difficulty |
55
| ----- | ------------- | ------------- |------------- | ------------- |
6-
| Day 1 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/1.%20Invert%20Binary%20Tree/Solution.java) | Tree | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
7-
| Day 2 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/2.%20Delete%20Node%20in%20a%20Linked%20List/Solution.java) | Linked List | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
8-
| Day 3 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/3.%20Two%20City%20Scheduling/Solution.java) | Greedy | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
9-
| Day 4 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/4.%20Reverse%20String/Solution.java) | Two Pointers, String | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
10-
| Day 5 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/5.%20Random%20Pick%20by%20Weight/Solution.java) | Binary Search, Random | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
11-
| Day 6 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/6.%20Queue%20Reconstuction%20by%20Height/Solution.java) | Greedy | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
12-
| Day 7 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/7.%20Coin%20Change%202/Solution.java) | DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
13-
| Day 8 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/8.%20Power%20of%202/Solution.java) | Math, Bit Manipulation | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
14-
| Day 9 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/9.%20Is%20Subsequence/Solution.java) | Binary Search, DP, Greedy | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
15-
| Day 10 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/10.%20Search%20Insert%20at%20Position/Solution.java) | Array, Binary Search | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
16-
| Day 11 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/11.%20Sort%20Colors/Solution.java) | Array, Two Pointers, Sort | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
17-
| Day 12 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/12.%20Insert%20Delete%20GetRandom%20O(1)/Solution.java) | Array, HashTable | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
18-
| Day 13 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/13.%20Largest%20Divisible%20Subset/Solution.java) | Math, DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
19-
| Day 14 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/14.%20Cheapest%20Flights%20Within%20K%20Stops/Solution.java) | DP, Heap, BFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
20-
| Day 15 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/15.%20Search%20in%20a%20Binary%20Search%20Tree/Solution.java) | Tree | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
21-
| Day 16 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/16.%20Validate%20IP%20Address/Solution.java) | String | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
22-
| Day 17 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/17.%20Surrounded%20Regions/Solution.java) | BFS, DFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
23-
| Day 18 | [H-Index II](https://leetcode.com/problems/h-index-ii/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/18.%20H%20Index%20-%20II/Solution.java) | Binary Search | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
24-
| Day 19 | [Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/19.%20Longest%20Duplicate%20Substring/Solution.java) | Hash Table, Binary Search | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |
25-
| Day 20 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/20.%20Permutation%20Sequence/Solution.java) | Math, Backtracking | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
26-
| Day 21 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/21.%20Dungeon%20Game/Solution.java) | Binary Search, DP | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |
27-
| Day 22 | [Single Numeber II](https://leetcode.com/problems/single-number-ii/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/22.%20Single%20Numeber%20II/Solution.java) | Bit Manipulation | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
28-
| Day 23 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/23.%20Count%20Complete%20Tree%20Nodes/Solution.java) | Binary Search, Tree | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
29-
| Day 24 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode/June%20Challenge/24.%20Unique%20Binary%20Search%20Trees/Solution.java) | DP, Tree | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
30-
| Day 25 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/25.%20Find%20the%20Duplicate%20Number/Solution.java) | Two Pointers, Binary Search | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
31-
| Day 26 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/26.%20Sum%20Root%20to%20Leaf%20Numbers/Solution.java) | Tree, DFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
32-
| Day 27 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/27.%20Perfect%20Squares/Solution.java) | Math, DP, BFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
33-
| Day 28 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/27.%20Perfect%20Squares/Solution.java) | DFS, Graph | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
34-
| Day 29 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/29.%20Unique%20Paths/Solution.java) | Array, DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
35-
| Day 30 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | [Solution](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/LeetCode%20June%20Challenge/30.%20Word%20Search%20II/Solution.java) | Backtracking, Trie | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |
36-
6+
| Day 1 | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Solution](./1.%20Invert%20Binary%20Tree/Solution.java) | Tree | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
7+
| Day 2 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Solution](./2.%20Delete%20Node%20in%20a%20Linked%20List/Solution.java) | Linked List | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
8+
| Day 3 | [Two City Scheduling](https://leetcode.com/problems/two-city-scheduling/) | [Solution](./3.%20Two%20City%20Scheduling/Solution.java) | Greedy | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
9+
| Day 4 | [Reverse String](https://leetcode.com/problems/reverse-string/) | [Solution](./4.%20Reverse%20String/Solution.java) | Two Pointers, String | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
10+
| Day 5 | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight/) | [Solution](./5.%20Random%20Pick%20by%20Weight/Solution.java) | Binary Search, Random | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
11+
| Day 6 | [Queue Reconstruction by Height](https://leetcode.com/problems/queue-reconstruction-by-height/) | [Solution]./6.%20Queue%20Reconstuction%20by%20Height/Solution.java) | Greedy | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
12+
| Day 7 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/) | [Solution](./7.%20Coin%20Change%202/Solution.java) | DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
13+
| Day 8 | [Power of Two](https://leetcode.com/problems/power-of-two/) | [Solution]./8.%20Power%20of%202/Solution.java) | Math, Bit Manipulation | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
14+
| Day 9 | [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Solution](./9.%20Is%20Subsequence/Solution.java) | Binary Search, DP, Greedy | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
15+
| Day 10 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Solution](./10.%20Search%20Insert%20at%20Position/Solution.java) | Array, Binary Search | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
16+
| Day 11 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | [Solution](./11.%20Sort%20Colors/Solution.java) | Array, Two Pointers, Sort | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
17+
| Day 12 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/) | [Solution](./12.%20Insert%20Delete%20GetRandom%20O(1)/Solution.java) | Array, HashTable | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
18+
| Day 13 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Solution](./13.%20Largest%20Divisible%20Subset/Solution.java) | Math, DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
19+
| Day 14 | [Cheapest Flights Within K Stops](https://leetcode.com/problems/cheapest-flights-within-k-stops/) | [Solution](./14.%20Cheapest%20Flights%20Within%20K%20Stops/Solution.java) | DP, Heap, BFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
20+
| Day 15 | [Search in a Binary Search Tree](https://leetcode.com/problems/search-in-a-binary-search-tree/) | [Solution](./15.%20Search%20in%20a%20Binary%20Search%20Tree/Solution.java) | Tree | ![Easy](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/easy.svg?raw=true) |
21+
| Day 16 | [Validate IP Address](https://leetcode.com/problems/validate-ip-address/) | [Solution](./16.%20Validate%20IP%20Address/Solution.java) | String | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
22+
| Day 17 | [Surrounded Regions](https://leetcode.com/problems/surrounded-regions/) | [Solution](./17.%20Surrounded%20Regions/Solution.java) | BFS, DFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
23+
| Day 18 | [H-Index II](https://leetcode.com/problems/h-index-ii/) | [Solution](./18.%20H%20Index%20-%20II/Solution.java) | Binary Search | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
24+
| Day 19 | [Longest Duplicate Substring](https://leetcode.com/problems/longest-duplicate-substring/) | [Solution]./19.%20Longest%20Duplicate%20Substring/Solution.java) | Hash Table, Binary Search | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |
25+
| Day 20 | [Permutation Sequence](https://leetcode.com/problems/permutation-sequence/) | [Solution](./20.%20Permutation%20Sequence/Solution.java) | Math, Backtracking | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
26+
| Day 21 | [Dungeon Game](https://leetcode.com/problems/dungeon-game/) | [Solution](./21.%20Dungeon%20Game/Solution.java) | Binary Search, DP | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |
27+
| Day 22 | [Single Numeber II](https://leetcode.com/problems/single-number-ii/) | [Solution](./22.%20Single%20Numeber%20II/Solution.java) | Bit Manipulation | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
28+
| Day 23 | [Count Complete Tree Nodes](https://leetcode.com/problems/count-complete-tree-nodes/) | [Solution](./23.%20Count%20Complete%20Tree%20Nodes/Solution.java) | Binary Search, Tree | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
29+
| Day 24 | [Unique Binary Search Trees](https://leetcode.com/problems/unique-binary-search-trees/) | [Solution](./24.%20Unique%20Binary%20Search%20Trees/Solution.java) | DP, Tree | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
30+
| Day 25 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [Solution](./25.%20Find%20the%20Duplicate%20Number/Solution.java) | Two Pointers, Binary Search | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
31+
| Day 26 | [Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/) | [Solution](./26.%20Sum%20Root%20to%20Leaf%20Numbers/Solution.java) | Tree, DFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
32+
| Day 27 | [Perfect Squares](https://leetcode.com/problems/perfect-squares/) | [Solution](./27.%20Perfect%20Squares/Solution.java) | Math, DP, BFS | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
33+
| Day 28 | [Reconstruct Itinerary](https://leetcode.com/problems/reconstruct-itinerary/) | [Solution](./27.%20Perfect%20Squares/Solution.java) | DFS, Graph | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
34+
| Day 29 | [Unique Paths](https://leetcode.com/problems/unique-paths/) | [Solution](h./29.%20Unique%20Paths/Solution.java) | Array, DP | ![Medium](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/medium.svg?raw=true) |
35+
| Day 30 | [Word Search II](https://leetcode.com/problems/word-search-ii/) | [Solution](./30.%20Word%20Search%20II/Solution.java) | Backtracking, Trie | ![Hard](https://github.com/rohitkumar-rk/Problem-Solving/blob/master/Tags/hard.svg?raw=true) |

0 commit comments

Comments
 (0)