Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commitfb305c3

Browse files
authored
Updated readme
1 parentb7d8556 commitfb305c3

File tree

1 file changed

+106
-106
lines changed

1 file changed

+106
-106
lines changed

‎README.md

Lines changed: 106 additions & 106 deletions
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,6 @@ implementation 'com.github.javadev:leetcode-in-java:1.20'
3434
>["For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."](https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews)
3535
3636
##
37-
*[Graph Theory I](#graph-theory-i)
3837
*[SQL I](#sql-i)
3938
*[Level 1](#level-1)
4039
*[Level 2](#level-2)
@@ -48,110 +47,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.20'
4847
*[Dynamic Programming I](#dynamic-programming-i)
4948
*[Programming Skills I](#programming-skills-i)
5049
*[Programming Skills II](#programming-skills-ii)
51-
52-
###Graph Theory I
53-
54-
####Day 1 Matrix Related Problems
55-
56-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
57-
|-|-|-|-|-|-
58-
| 0733 |[Flood Fill](src/main/java/g0701_0800/s0733_flood_fill/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
59-
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
60-
61-
####Day 2 Matrix Related Problems
62-
63-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
64-
|-|-|-|-|-|-
65-
| 0695 |[Max Area of Island](src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 76.79
66-
| 1254 |[Number of Closed Islands](src/main/java/g1201_1300/s1254_number_of_closed_islands/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 55.59
67-
68-
####Day 3 Matrix Related Problems
69-
70-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
71-
|-|-|-|-|-|-
72-
| 1020 |[Number of Enclaves](src/main/java/g1001_1100/s1020_number_of_enclaves/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 6 | 68.24
73-
| 1905 |[Count Sub Islands](src/main/java/g1901_2000/s1905_count_sub_islands/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 24 | 85.54
74-
75-
####Day 4 Matrix Related Problems
76-
77-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
78-
|-|-|-|-|-|-
79-
| 1162 |[As Far from Land as Possible](src/main/java/g1101_1200/s1162_as_far_from_land_as_possible/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 12 | 89.17
80-
| 0417 |[Pacific Atlantic Water Flow](src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62
81-
82-
####Day 5 Matrix Related Problems
83-
84-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
85-
|-|-|-|-|-|-
86-
| 1091 |[Shortest Path in Binary Matrix](src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 22 | 69.99
87-
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
88-
89-
####Day 6 Matrix Related Problems
90-
91-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
92-
|-|-|-|-|-|-
93-
| 0934 |[Shortest Bridge](src/main/java/g0901_1000/s0934_shortest_bridge/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 6 | 97.87
94-
| 1926 |[Nearest Exit from Entrance in Maze](src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 12 | 40.55
95-
96-
####Day 7 Standard Traversal
97-
98-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
99-
|-|-|-|-|-|-
100-
| 0797 |[All Paths From Source to Target](src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 2 | 90.53
101-
| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 3 | 51.54
102-
103-
####Day 8 Standard Traversal
104-
105-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
106-
|-|-|-|-|-|-
107-
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
108-
| 1319 |[Number of Operations to Make Network Connected](src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 9 | 67.64
109-
110-
####Day 9 Standard Traversal
111-
112-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
113-
|-|-|-|-|-|-
114-
| 1376 |[Time Needed to Inform All Employees](src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree | 225 | 22.36
115-
| 0802 |[Find Eventual Safe States](src/main/java/g0801_0900/s0802_find_eventual_safe_states/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 7 | 74.93
116-
117-
####Day 10 Standard Traversal
118-
119-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
120-
|-|-|-|-|-|-
121-
| 1129 |[Shortest Path with Alternating Colors](src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java)| Medium | Breadth_First_Search, Graph | 5 | 90.28
122-
| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 39 | 97.71
123-
| 0847 |[Shortest Path Visiting All Nodes](src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java)| Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 14 | 78.72
124-
125-
####Day 11 Breadth First Search
126-
127-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
128-
|-|-|-|-|-|-
129-
| 1306 |[Jump Game III](src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23
130-
| 1654 |[Minimum Jumps to Reach Home](src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search | 6 | 99.87
131-
| 0365 |[Water and Jug Problem](src/main/java/g0301_0400/s0365_water_and_jug_problem/Solution.java)| Medium | Math, Depth_First_Search, Breadth_First_Search | 0 | 100.00
132-
133-
####Day 12 Breadth First Search
134-
135-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
136-
|-|-|-|-|-|-
137-
| 0433 |[Minimum Genetic Mutation](src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java)| Medium | String, Hash_Table, Breadth_First_Search | 1 | 90.95
138-
| 0752 |[Open the Lock](src/main/java/g0701_0800/s0752_open_the_lock/Solution.java)| Medium | Array, String, Hash_Table, Breadth_First_Search | 72 | 91.06
139-
| 0127 |[Word Ladder](src/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 37 | 94.58
140-
141-
####Day 13 Graph Theory
142-
143-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
144-
|-|-|-|-|-|-
145-
| 0997 |[Find the Town Judge](src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java)| Easy | Array, Hash_Table, Graph | 3 | 80.64
146-
| 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java)| Medium | Graph | 8 | 99.94
147-
148-
####Day 14 Graph Theory
149-
150-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
151-
|-|-|-|-|-|-
152-
| 1615 |[Maximal Network Rank](src/main/java/g1601_1700/s1615_maximal_network_rank/Solution.java)| Medium | Graph | 3 | 97.34
153-
| 0886 |[Possible Bipartition](src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 20 | 80.12
154-
| 0785 |[Is Graph Bipartite?](src/main/java/g0701_0800/s0785_is_graph_bipartite/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 0 | 100.00
50+
*[Graph Theory I](#graph-theory-i)
15551

15652
###SQL I
15753

@@ -1844,6 +1740,110 @@ implementation 'com.github.javadev:leetcode-in-java:1.20'
18441740
| 0622 |[Design Circular Queue](src/main/java/g0601_0700/s0622_design_circular_queue/MyCircularQueue.java)| Medium | Array, Design, Linked_List, Queue | 3 | 100.00
18451741
| 0729 |[My Calendar I](src/main/java/g0701_0800/s0729_my_calendar_i/MyCalendar.java)| Medium | Binary_Search, Design, Ordered_Set, Segment_Tree | 17 | 97.23
18461742

1743+
###Graph Theory I
1744+
1745+
####Day 1 Matrix Related Problems
1746+
1747+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1748+
|-|-|-|-|-|-
1749+
| 0733 |[Flood Fill](src/main/java/g0701_0800/s0733_flood_fill/Solution.java)| Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1750+
| 0200 |[Number of Islands](src/main/java/g0101_0200/s0200_number_of_islands/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 97.76
1751+
1752+
####Day 2 Matrix Related Problems
1753+
1754+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1755+
|-|-|-|-|-|-
1756+
| 0695 |[Max Area of Island](src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 76.79
1757+
| 1254 |[Number of Closed Islands](src/main/java/g1201_1300/s1254_number_of_closed_islands/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 55.59
1758+
1759+
####Day 3 Matrix Related Problems
1760+
1761+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1762+
|-|-|-|-|-|-
1763+
| 1020 |[Number of Enclaves](src/main/java/g1001_1100/s1020_number_of_enclaves/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 6 | 68.24
1764+
| 1905 |[Count Sub Islands](src/main/java/g1901_2000/s1905_count_sub_islands/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 24 | 85.54
1765+
1766+
####Day 4 Matrix Related Problems
1767+
1768+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1769+
|-|-|-|-|-|-
1770+
| 1162 |[As Far from Land as Possible](src/main/java/g1101_1200/s1162_as_far_from_land_as_possible/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 12 | 89.17
1771+
| 0417 |[Pacific Atlantic Water Flow](src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 5 | 92.62
1772+
1773+
####Day 5 Matrix Related Problems
1774+
1775+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1776+
|-|-|-|-|-|-
1777+
| 1091 |[Shortest Path in Binary Matrix](src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 22 | 69.99
1778+
| 0542 |[01 Matrix](src/main/java/g0501_0600/s0542_01_matrix/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
1779+
1780+
####Day 6 Matrix Related Problems
1781+
1782+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1783+
|-|-|-|-|-|-
1784+
| 0934 |[Shortest Bridge](src/main/java/g0901_1000/s0934_shortest_bridge/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix | 6 | 97.87
1785+
| 1926 |[Nearest Exit from Entrance in Maze](src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze/Solution.java)| Medium | Array, Breadth_First_Search, Matrix | 12 | 40.55
1786+
1787+
####Day 7 Standard Traversal
1788+
1789+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1790+
|-|-|-|-|-|-
1791+
| 0797 |[All Paths From Source to Target](src/main/java/g0701_0800/s0797_all_paths_from_source_to_target/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Backtracking | 2 | 90.53
1792+
| 0841 |[Keys and Rooms](src/main/java/g0801_0900/s0841_keys_and_rooms/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 3 | 51.54
1793+
1794+
####Day 8 Standard Traversal
1795+
1796+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1797+
|-|-|-|-|-|-
1798+
| 0547 |[Number of Provinces](src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 2 | 69.51
1799+
| 1319 |[Number of Operations to Make Network Connected](src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 9 | 67.64
1800+
1801+
####Day 9 Standard Traversal
1802+
1803+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1804+
|-|-|-|-|-|-
1805+
| 1376 |[Time Needed to Inform All Employees](src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Tree | 225 | 22.36
1806+
| 0802 |[Find Eventual Safe States](src/main/java/g0801_0900/s0802_find_eventual_safe_states/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 7 | 74.93
1807+
1808+
####Day 10 Standard Traversal
1809+
1810+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1811+
|-|-|-|-|-|-
1812+
| 1129 |[Shortest Path with Alternating Colors](src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors/Solution.java)| Medium | Breadth_First_Search, Graph | 5 | 90.28
1813+
| 1466 |[Reorder Routes to Make All Paths Lead to the City Zero](src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph | 39 | 97.71
1814+
| 0847 |[Shortest Path Visiting All Nodes](src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes/Solution.java)| Hard | Dynamic_Programming, Breadth_First_Search, Bit_Manipulation, Graph, Bitmask | 14 | 78.72
1815+
1816+
####Day 11 Breadth First Search
1817+
1818+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1819+
|-|-|-|-|-|-
1820+
| 1306 |[Jump Game III](src/main/java/g1301_1400/s1306_jump_game_iii/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search | 2 | 96.23
1821+
| 1654 |[Minimum Jumps to Reach Home](src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home/Solution.java)| Medium | Array, Dynamic_Programming, Breadth_First_Search | 6 | 99.87
1822+
| 0365 |[Water and Jug Problem](src/main/java/g0301_0400/s0365_water_and_jug_problem/Solution.java)| Medium | Math, Depth_First_Search, Breadth_First_Search | 0 | 100.00
1823+
1824+
####Day 12 Breadth First Search
1825+
1826+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1827+
|-|-|-|-|-|-
1828+
| 0433 |[Minimum Genetic Mutation](src/main/java/g0401_0500/s0433_minimum_genetic_mutation/Solution.java)| Medium | String, Hash_Table, Breadth_First_Search | 1 | 90.95
1829+
| 0752 |[Open the Lock](src/main/java/g0701_0800/s0752_open_the_lock/Solution.java)| Medium | Array, String, Hash_Table, Breadth_First_Search | 72 | 91.06
1830+
| 0127 |[Word Ladder](src/main/java/g0101_0200/s0127_word_ladder/Solution.java)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 37 | 94.58
1831+
1832+
####Day 13 Graph Theory
1833+
1834+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1835+
|-|-|-|-|-|-
1836+
| 0997 |[Find the Town Judge](src/main/java/g0901_1000/s0997_find_the_town_judge/Solution.java)| Easy | Array, Hash_Table, Graph | 3 | 80.64
1837+
| 1557 |[Minimum Number of Vertices to Reach All Nodes](src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes/Solution.java)| Medium | Graph | 8 | 99.94
1838+
1839+
####Day 14 Graph Theory
1840+
1841+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
1842+
|-|-|-|-|-|-
1843+
| 1615 |[Maximal Network Rank](src/main/java/g1601_1700/s1615_maximal_network_rank/Solution.java)| Medium | Graph | 3 | 97.34
1844+
| 0886 |[Possible Bipartition](src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 20 | 80.12
1845+
| 0785 |[Is Graph Bipartite?](src/main/java/g0701_0800/s0785_is_graph_bipartite/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find | 0 | 100.00
1846+
18471847
##Algorithms
18481848

18491849
| # | Title | Difficulty | Tag | Time, ms | Time, %
@@ -3577,7 +3577,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.20'
35773577
| 0312 |[Burst Balloons](src/main/java/g0301_0400/s0312_burst_balloons/Solution.java)| Hard | Array, Dynamic_Programming | 50 | 89.02
35783578
| 0310 |[Minimum Height Trees](src/main/java/g0301_0400/s0310_minimum_height_trees/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort | 25 | 93.99
35793579
| 0309 |[Best Time to Buy and Sell Stock with Cooldown](src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown/Solution.java)| Medium | Array, Dynamic_Programming, Dynamic_Programming_I_Day_8 | 0 | 100.00
3580-
| 0307 |[Range Sum Query - Mutable](src/main/java/g0301_0400/s0307_range_sum_query_mutable/NumArray.java)| Medium | Array, Design, Segment_Tree, Binary_Indexed_Tree |99 |88.96
3580+
| 0307 |[Range Sum Query - Mutable](src/main/java/g0301_0400/s0307_range_sum_query_mutable/NumArray.java)| Medium | Array, Design, Segment_Tree, Binary_Indexed_Tree |92 |90.27
35813581
| 0306 |[Additive Number](src/main/java/g0301_0400/s0306_additive_number/Solution.java)| Medium | String, Backtracking | 2 | 71.98
35823582
| 0304 |[Range Sum Query 2D - Immutable](src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable/NumMatrix.java)| Medium | Array, Matrix, Design, Prefix_Sum, Dynamic_Programming_I_Day_14, Programming_Skills_II_Day_13, Udemy_2D_Arrays/Matrix | 153 | 87.51
35833583
| 0303 |[Range Sum Query - Immutable](src/main/java/g0301_0400/s0303_range_sum_query_immutable/NumArray.java)| Easy | Array, Design, Prefix_Sum, Programming_Skills_I_Day_12_Class_and_Object | 7 | 100.00

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp