|
6 | 6 | [](https://github.com/LeetCode-Top-Interview-150/LeetCode-Top-Interview-150/fork) |
7 | 7 | > ["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) |
8 | 8 |
|
9 | | -* [Graph Theory I](#graph-theory-i) |
10 | 9 | * [SQL I](#sql-i) |
11 | 10 | * [Level 1](#level-1) |
12 | 11 | * [Level 2](#level-2) |
|
21 | 20 | * [Dynamic Programming I](#dynamic-programming-i) |
22 | 21 | * [Programming Skills I](#programming-skills-i) |
23 | 22 | * [Programming Skills II](#programming-skills-ii) |
24 | | - |
25 | | -### Graph Theory I |
26 | | - |
27 | | -#### Day 1 Matrix Related Problems |
28 | | - |
29 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
30 | | -|-|-|-|-|-|-|- |
31 | | -| 0200 |Number of Islands| [Java](src/main/java/g0101_0200/s0200_number_of_islands) [Kotlin](src/main/kotlin/g0101_0200/s0200_number_of_islands) [TypeScript](src/main/ts/g0101_0200/s0200_number_of_islands) [C#](src/main/csharp/g0101_0200/s0200_number_of_islands) [Go](src/main/go/g0101_0200/s0200_number_of_islands) [Python](src/main/python/g0101_0200/s0200_number_of_islands)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 |
32 | | - |
33 | | -#### Day 2 Matrix Related Problems |
34 | | - |
35 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
36 | | -|-|-|-|-|-|-|- |
37 | | - |
38 | | -#### Day 3 Matrix Related Problems |
39 | | - |
40 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
41 | | -|-|-|-|-|-|-|- |
42 | | - |
43 | | -#### Day 4 Matrix Related Problems |
44 | | - |
45 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
46 | | -|-|-|-|-|-|-|- |
47 | | - |
48 | | -#### Day 5 Matrix Related Problems |
49 | | - |
50 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
51 | | -|-|-|-|-|-|-|- |
52 | | - |
53 | | -#### Day 6 Matrix Related Problems |
54 | | - |
55 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
56 | | -|-|-|-|-|-|-|- |
57 | | - |
58 | | -#### Day 7 Standard Traversal |
59 | | - |
60 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
61 | | -|-|-|-|-|-|-|- |
62 | | - |
63 | | -#### Day 8 Standard Traversal |
64 | | - |
65 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
66 | | -|-|-|-|-|-|-|- |
67 | | - |
68 | | -#### Day 9 Standard Traversal |
69 | | - |
70 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
71 | | -|-|-|-|-|-|-|- |
72 | | - |
73 | | -#### Day 10 Standard Traversal |
74 | | - |
75 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
76 | | -|-|-|-|-|-|-|- |
77 | | - |
78 | | -#### Day 11 Breadth First Search |
79 | | - |
80 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
81 | | -|-|-|-|-|-|-|- |
82 | | - |
83 | | -#### Day 12 Breadth First Search |
84 | | - |
85 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
86 | | -|-|-|-|-|-|-|- |
87 | | -| 0433 |Minimum Genetic Mutation| [Java](src/main/java/g0401_0500/s0433_minimum_genetic_mutation) [Kotlin](src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation) [TypeScript](src/main/ts/g0401_0500/s0433_minimum_genetic_mutation) [C#](src/main/csharp/g0401_0500/s0433_minimum_genetic_mutation) [Go](src/main/go/g0401_0500/s0433_minimum_genetic_mutation) [Python](src/main/python/g0401_0500/s0433_minimum_genetic_mutation)| Medium | String, Hash_Table, Breadth_First_Search | 0 | 100.00 |
88 | | -| 0127 |Word Ladder| [Java](src/main/java/g0101_0200/s0127_word_ladder) [Kotlin](src/main/kotlin/g0101_0200/s0127_word_ladder) [TypeScript](src/main/ts/g0101_0200/s0127_word_ladder) [C#](src/main/csharp/g0101_0200/s0127_word_ladder) [Go](src/main/go/g0101_0200/s0127_word_ladder) [Python](src/main/python/g0101_0200/s0127_word_ladder)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 22 | 96.00 |
89 | | - |
90 | | -#### Day 13 Graph Theory |
91 | | - |
92 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
93 | | -|-|-|-|-|-|-|- |
94 | | - |
95 | | -#### Day 14 Graph Theory |
96 | | - |
97 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
98 | | -|-|-|-|-|-|-|- |
| 23 | +* [Graph Theory I](#graph-theory-i) |
99 | 24 |
|
100 | 25 | ### SQL I |
101 | 26 |
|
|
1697 | 1622 | |-|-|-|-|-|-|- |
1698 | 1623 | | 0380 |Insert Delete GetRandom O(1)| [Java](src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1) [Kotlin](src/main/kotlin/g0301_0400/s0380_insert_delete_getrandom_o1) [TypeScript](src/main/ts/g0301_0400/s0380_insert_delete_getrandom_o1) [C#](src/main/csharp/g0301_0400/s0380_insert_delete_getrandom_o1) [Go](src/main/go/g0301_0400/s0380_insert_delete_getrandom_o1) [Python](src/main/python/g0301_0400/s0380_insert_delete_getrandom_o1)| Medium | Array, Hash_Table, Math, Design, Randomized | 27 | 93.44 |
1699 | 1624 |
|
| 1625 | +### Graph Theory I |
| 1626 | + |
| 1627 | +#### Day 1 Matrix Related Problems |
| 1628 | + |
| 1629 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1630 | +|-|-|-|-|-|-|- |
| 1631 | +| 0200 |Number of Islands| [Java](src/main/java/g0101_0200/s0200_number_of_islands) [Kotlin](src/main/kotlin/g0101_0200/s0200_number_of_islands) [TypeScript](src/main/ts/g0101_0200/s0200_number_of_islands) [C#](src/main/csharp/g0101_0200/s0200_number_of_islands) [Go](src/main/go/g0101_0200/s0200_number_of_islands) [Python](src/main/python/g0101_0200/s0200_number_of_islands)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 |
| 1632 | + |
| 1633 | +#### Day 2 Matrix Related Problems |
| 1634 | + |
| 1635 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1636 | +|-|-|-|-|-|-|- |
| 1637 | + |
| 1638 | +#### Day 3 Matrix Related Problems |
| 1639 | + |
| 1640 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1641 | +|-|-|-|-|-|-|- |
| 1642 | + |
| 1643 | +#### Day 4 Matrix Related Problems |
| 1644 | + |
| 1645 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1646 | +|-|-|-|-|-|-|- |
| 1647 | + |
| 1648 | +#### Day 5 Matrix Related Problems |
| 1649 | + |
| 1650 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1651 | +|-|-|-|-|-|-|- |
| 1652 | + |
| 1653 | +#### Day 6 Matrix Related Problems |
| 1654 | + |
| 1655 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1656 | +|-|-|-|-|-|-|- |
| 1657 | + |
| 1658 | +#### Day 7 Standard Traversal |
| 1659 | + |
| 1660 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1661 | +|-|-|-|-|-|-|- |
| 1662 | + |
| 1663 | +#### Day 8 Standard Traversal |
| 1664 | + |
| 1665 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1666 | +|-|-|-|-|-|-|- |
| 1667 | + |
| 1668 | +#### Day 9 Standard Traversal |
| 1669 | + |
| 1670 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1671 | +|-|-|-|-|-|-|- |
| 1672 | + |
| 1673 | +#### Day 10 Standard Traversal |
| 1674 | + |
| 1675 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1676 | +|-|-|-|-|-|-|- |
| 1677 | + |
| 1678 | +#### Day 11 Breadth First Search |
| 1679 | + |
| 1680 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1681 | +|-|-|-|-|-|-|- |
| 1682 | + |
| 1683 | +#### Day 12 Breadth First Search |
| 1684 | + |
| 1685 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1686 | +|-|-|-|-|-|-|- |
| 1687 | +| 0433 |Minimum Genetic Mutation| [Java](src/main/java/g0401_0500/s0433_minimum_genetic_mutation) [Kotlin](src/main/kotlin/g0401_0500/s0433_minimum_genetic_mutation) [TypeScript](src/main/ts/g0401_0500/s0433_minimum_genetic_mutation) [C#](src/main/csharp/g0401_0500/s0433_minimum_genetic_mutation) [Go](src/main/go/g0401_0500/s0433_minimum_genetic_mutation) [Python](src/main/python/g0401_0500/s0433_minimum_genetic_mutation)| Medium | String, Hash_Table, Breadth_First_Search | 0 | 100.00 |
| 1688 | +| 0127 |Word Ladder| [Java](src/main/java/g0101_0200/s0127_word_ladder) [Kotlin](src/main/kotlin/g0101_0200/s0127_word_ladder) [TypeScript](src/main/ts/g0101_0200/s0127_word_ladder) [C#](src/main/csharp/g0101_0200/s0127_word_ladder) [Go](src/main/go/g0101_0200/s0127_word_ladder) [Python](src/main/python/g0101_0200/s0127_word_ladder)| Hard | Top_Interview_Questions, String, Hash_Table, Breadth_First_Search | 22 | 96.00 |
| 1689 | + |
| 1690 | +#### Day 13 Graph Theory |
| 1691 | + |
| 1692 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1693 | +|-|-|-|-|-|-|- |
| 1694 | + |
| 1695 | +#### Day 14 Graph Theory |
| 1696 | + |
| 1697 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1698 | +|-|-|-|-|-|-|- |
| 1699 | + |
1700 | 1700 | ## Algorithms |
1701 | 1701 |
|
1702 | 1702 | | # | Title | Language | Difficulty | Tag | Time, ms | Time, % |
|
0 commit comments