|
6 | 6 | [](https://github.com/LeetCode-in-Rust/LeetCode-in-Rust/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 | | -* [Dynamic Programming I](#dynamic-programming-i) |
10 | 9 | * [Programming Skills I](#programming-skills-i) |
11 | 10 | * [Programming Skills II](#programming-skills-ii) |
12 | 11 | * [Graph Theory I](#graph-theory-i) |
|
21 | 20 | * [Algorithm II](#algorithm-ii) |
22 | 21 | * [Binary Search I](#binary-search-i) |
23 | 22 | * [Binary Search II](#binary-search-ii) |
24 | | - |
25 | | -### Dynamic Programming I |
26 | | - |
27 | | -#### Day 1 |
28 | | - |
29 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
30 | | -|-|-|-|-|-|- |
31 | | - |
32 | | -#### Day 2 |
33 | | - |
34 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
35 | | -|-|-|-|-|-|- |
36 | | -| 0070 |[Climbing Stairs](src/main/rust/g0001_0100/s0070_climbing_stairs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
37 | | - |
38 | | -#### Day 3 |
39 | | - |
40 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
41 | | -|-|-|-|-|-|- |
42 | | -| 0198 |[House Robber](src/main/rust/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
43 | | - |
44 | | -#### Day 4 |
45 | | - |
46 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
47 | | -|-|-|-|-|-|- |
48 | | -| 0055 |[Jump Game](src/main/rust/g0001_0100/s0055_jump_game)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
49 | | -| 0045 |[Jump Game II](src/main/rust/g0001_0100/s0045_jump_game_ii)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
50 | | - |
51 | | -#### Day 5 |
52 | | - |
53 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
54 | | -|-|-|-|-|-|- |
55 | | -| 0053 |[Maximum Subarray](src/main/rust/g0001_0100/s0053_maximum_subarray)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 7 | 89.94 |
56 | | - |
57 | | -#### Day 6 |
58 | | - |
59 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
60 | | -|-|-|-|-|-|- |
61 | | -| 0152 |[Maximum Product Subarray](src/main/rust/g0101_0200/s0152_maximum_product_subarray)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 71.23 |
62 | | - |
63 | | -#### Day 7 |
64 | | - |
65 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
66 | | -|-|-|-|-|-|- |
67 | | -| 0121 |[Best Time to Buy and Sell Stock](src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 3 | 98.62 |
68 | | - |
69 | | -#### Day 8 |
70 | | - |
71 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
72 | | -|-|-|-|-|-|- |
73 | | - |
74 | | -#### Day 9 |
75 | | - |
76 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
77 | | -|-|-|-|-|-|- |
78 | | -| 0139 |[Word Break](src/main/rust/g0101_0200/s0139_word_break)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00 |
79 | | -| 0042 |[Trapping Rain Water](src/main/rust/g0001_0100/s0042_trapping_rain_water)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
80 | | - |
81 | | -#### Day 10 |
82 | | - |
83 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
84 | | -|-|-|-|-|-|- |
85 | | - |
86 | | -#### Day 11 |
87 | | - |
88 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
89 | | -|-|-|-|-|-|- |
90 | | -| 0096 |[Unique Binary Search Trees](src/main/rust/g0001_0100/s0096_unique_binary_search_trees)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
91 | | - |
92 | | -#### Day 12 |
93 | | - |
94 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
95 | | -|-|-|-|-|-|- |
96 | | - |
97 | | -#### Day 13 |
98 | | - |
99 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
100 | | -|-|-|-|-|-|- |
101 | | - |
102 | | -#### Day 14 |
103 | | - |
104 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
105 | | -|-|-|-|-|-|- |
106 | | - |
107 | | -#### Day 15 |
108 | | - |
109 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
110 | | -|-|-|-|-|-|- |
111 | | -| 0062 |[Unique Paths](src/main/rust/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 |
112 | | - |
113 | | -#### Day 16 |
114 | | - |
115 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
116 | | -|-|-|-|-|-|- |
117 | | -| 0064 |[Minimum Path Sum](src/main/rust/g0001_0100/s0064_minimum_path_sum)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 |
118 | | -| 0221 |[Maximal Square](src/main/rust/g0201_0300/s0221_maximal_square)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 16 | 88.89 |
119 | | - |
120 | | -#### Day 17 |
121 | | - |
122 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
123 | | -|-|-|-|-|-|- |
124 | | -| 0005 |[Longest Palindromic Substring](src/main/rust/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 1 | 92.60 |
125 | | - |
126 | | -#### Day 18 |
127 | | - |
128 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
129 | | -|-|-|-|-|-|- |
130 | | -| 0300 |[Longest Increasing Subsequence](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00 |
131 | | - |
132 | | -#### Day 19 |
133 | | - |
134 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
135 | | -|-|-|-|-|-|- |
136 | | -| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99 |
137 | | -| 0072 |[Edit Distance](src/main/rust/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 0 | 100.00 |
138 | | - |
139 | | -#### Day 20 |
140 | | - |
141 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
142 | | -|-|-|-|-|-|- |
143 | | -| 0322 |[Coin Change](src/main/rust/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 3 | 100.00 |
144 | | - |
145 | | -#### Day 21 |
146 | | - |
147 | | -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
148 | | -|-|-|-|-|-|- |
| 23 | +* [Dynamic Programming I](#dynamic-programming-i) |
149 | 24 |
|
150 | 25 | ### Programming Skills I |
151 | 26 |
|
|
1576 | 1451 | | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
1577 | 1452 | |-|-|-|-|-|- |
1578 | 1453 |
|
| 1454 | +### Dynamic Programming I |
| 1455 | + |
| 1456 | +#### Day 1 |
| 1457 | + |
| 1458 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1459 | +|-|-|-|-|-|- |
| 1460 | + |
| 1461 | +#### Day 2 |
| 1462 | + |
| 1463 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1464 | +|-|-|-|-|-|- |
| 1465 | +| 0070 |[Climbing Stairs](src/main/rust/g0001_0100/s0070_climbing_stairs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 1466 | + |
| 1467 | +#### Day 3 |
| 1468 | + |
| 1469 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1470 | +|-|-|-|-|-|- |
| 1471 | +| 0198 |[House Robber](src/main/rust/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 |
| 1472 | + |
| 1473 | +#### Day 4 |
| 1474 | + |
| 1475 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1476 | +|-|-|-|-|-|- |
| 1477 | +| 0055 |[Jump Game](src/main/rust/g0001_0100/s0055_jump_game)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 1478 | +| 0045 |[Jump Game II](src/main/rust/g0001_0100/s0045_jump_game_ii)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 1479 | + |
| 1480 | +#### Day 5 |
| 1481 | + |
| 1482 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1483 | +|-|-|-|-|-|- |
| 1484 | +| 0053 |[Maximum Subarray](src/main/rust/g0001_0100/s0053_maximum_subarray)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 7 | 89.94 |
| 1485 | + |
| 1486 | +#### Day 6 |
| 1487 | + |
| 1488 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1489 | +|-|-|-|-|-|- |
| 1490 | +| 0152 |[Maximum Product Subarray](src/main/rust/g0101_0200/s0152_maximum_product_subarray)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 71.23 |
| 1491 | + |
| 1492 | +#### Day 7 |
| 1493 | + |
| 1494 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1495 | +|-|-|-|-|-|- |
| 1496 | +| 0121 |[Best Time to Buy and Sell Stock](src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 3 | 98.62 |
| 1497 | + |
| 1498 | +#### Day 8 |
| 1499 | + |
| 1500 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1501 | +|-|-|-|-|-|- |
| 1502 | + |
| 1503 | +#### Day 9 |
| 1504 | + |
| 1505 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1506 | +|-|-|-|-|-|- |
| 1507 | +| 0139 |[Word Break](src/main/rust/g0101_0200/s0139_word_break)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00 |
| 1508 | +| 0042 |[Trapping Rain Water](src/main/rust/g0001_0100/s0042_trapping_rain_water)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 1509 | + |
| 1510 | +#### Day 10 |
| 1511 | + |
| 1512 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1513 | +|-|-|-|-|-|- |
| 1514 | + |
| 1515 | +#### Day 11 |
| 1516 | + |
| 1517 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1518 | +|-|-|-|-|-|- |
| 1519 | +| 0096 |[Unique Binary Search Trees](src/main/rust/g0001_0100/s0096_unique_binary_search_trees)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 |
| 1520 | + |
| 1521 | +#### Day 12 |
| 1522 | + |
| 1523 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1524 | +|-|-|-|-|-|- |
| 1525 | + |
| 1526 | +#### Day 13 |
| 1527 | + |
| 1528 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1529 | +|-|-|-|-|-|- |
| 1530 | + |
| 1531 | +#### Day 14 |
| 1532 | + |
| 1533 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1534 | +|-|-|-|-|-|- |
| 1535 | + |
| 1536 | +#### Day 15 |
| 1537 | + |
| 1538 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1539 | +|-|-|-|-|-|- |
| 1540 | +| 0062 |[Unique Paths](src/main/rust/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 |
| 1541 | + |
| 1542 | +#### Day 16 |
| 1543 | + |
| 1544 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1545 | +|-|-|-|-|-|- |
| 1546 | +| 0064 |[Minimum Path Sum](src/main/rust/g0001_0100/s0064_minimum_path_sum)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 |
| 1547 | +| 0221 |[Maximal Square](src/main/rust/g0201_0300/s0221_maximal_square)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 16 | 88.89 |
| 1548 | + |
| 1549 | +#### Day 17 |
| 1550 | + |
| 1551 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1552 | +|-|-|-|-|-|- |
| 1553 | +| 0005 |[Longest Palindromic Substring](src/main/rust/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 1 | 92.60 |
| 1554 | + |
| 1555 | +#### Day 18 |
| 1556 | + |
| 1557 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1558 | +|-|-|-|-|-|- |
| 1559 | +| 0300 |[Longest Increasing Subsequence](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00 |
| 1560 | + |
| 1561 | +#### Day 19 |
| 1562 | + |
| 1563 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1564 | +|-|-|-|-|-|- |
| 1565 | +| 1143 |[Longest Common Subsequence](src/main/rust/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n\*m)_Space_O(n\*m) | 4 | 78.99 |
| 1566 | +| 0072 |[Edit Distance](src/main/rust/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Big_O_Time_O(n^2)_Space_O(n2) | 0 | 100.00 |
| 1567 | + |
| 1568 | +#### Day 20 |
| 1569 | + |
| 1570 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1571 | +|-|-|-|-|-|- |
| 1572 | +| 0322 |[Coin Change](src/main/rust/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 3 | 100.00 |
| 1573 | + |
| 1574 | +#### Day 21 |
| 1575 | + |
| 1576 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1577 | +|-|-|-|-|-|- |
| 1578 | + |
1579 | 1579 | ## Algorithms |
1580 | 1580 |
|
1581 | 1581 | | # | Title | Difficulty | Tag | Time, ms | Time, % |
|
0 commit comments