Skip to content

Commit d40109d

Browse files
javadevjavadev
authored
Updated readme
1 parent e915751 commit d40109d

File tree

2 files changed

+37
-2
lines changed

2 files changed

+37
-2
lines changed

‎README.md‎

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -128,11 +128,13 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
128128

129129
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
130130
|-|-|-|-|-|-
131+
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 29 | 87.37
131132

132133
#### Day 11 Dynamic Programming
133134

134135
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
135136
|-|-|-|-|-|-
137+
| 0062 |[Unique Paths](src/main/python/g0001_0100/s0062_unique_paths/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 24 | 98.19
136138

137139
#### Day 12 Sliding Window/Two Pointer
138140

@@ -250,6 +252,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
250252

251253
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
252254
|-|-|-|-|-|-
255+
| 0056 |[Merge Intervals](src/main/python/g0001_0100/s0056_merge_intervals/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 109 | 98.07
253256

254257
#### Day 18 Stack
255258

@@ -285,6 +288,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
285288
| 0020 |[Valid Parentheses](src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 24 | 98.16
286289
| 0005 |[Longest Palindromic Substring](src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 78 | 97.43
287290
| 0394 |[Decode String](src/main/python/g0301_0400/s0394_decode_string/Solution.py)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 28 | 91.14
291+
| 0049 |[Group Anagrams](src/main/python/g0001_0100/s0049_group_anagrams/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 79 | 93.60
288292

289293
#### Udemy Binary Search
290294

@@ -298,6 +302,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
298302
|-|-|-|-|-|-
299303
| 0283 |[Move Zeroes](src/main/python/g0201_0300/s0283_move_zeroes/Solution.py)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 113 | 97.70
300304
| 0001 |[Two Sum](src/main/python/g0001_0100/s0001_two_sum/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 62 | 53.52
305+
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 333 | 97.58
301306
| 0041 |[First Missing Positive](src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 334 | 98.05
302307
| 0239 |[Sliding Window Maximum](src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 1093 | 66.83
303308

@@ -312,6 +317,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
312317

313318
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
314319
|-|-|-|-|-|-
320+
| 0053 |[Maximum Subarray](src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 501 | 83.84
315321

316322
#### Udemy Sorting Algorithms
317323

@@ -322,6 +328,8 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
322328

323329
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
324330
|-|-|-|-|-|-
331+
| 0048 |[Rotate Image](src/main/python/g0001_0100/s0048_rotate_image/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 26 | 98.93
332+
| 0056 |[Merge Intervals](src/main/python/g0001_0100/s0056_merge_intervals/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 109 | 98.07
325333

326334
#### Udemy Linked List
327335

@@ -351,8 +359,11 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
351359

352360
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
353361
|-|-|-|-|-|-
362+
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 29 | 87.37
363+
| 0064 |[Minimum Path Sum](src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 72 | 97.25
354364
| 0300 |[Longest Increasing Subsequence](src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 58 | 96.98
355365
| 1143 |[Longest Common Subsequence](src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 452 | 81.00
366+
| 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 60 | 98.17
356367
| 0010 |[Regular Expression Matching](src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 23 | 99.97
357368

358369
#### Udemy Backtracking/Recursion
@@ -381,6 +392,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
381392

382393
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
383394
|-|-|-|-|-|-
395+
| 0053 |[Maximum Subarray](src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 501 | 83.84
384396

385397
#### Day 2 Array
386398

@@ -462,11 +474,13 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
462474

463475
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
464476
|-|-|-|-|-|-
477+
| 0056 |[Merge Intervals](src/main/python/g0001_0100/s0056_merge_intervals/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Big_O_Time_O(n_log_n)_Space_O(n) | 109 | 98.07
465478

466479
#### Day 3 Array
467480

468481
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
469482
|-|-|-|-|-|-
483+
| 0048 |[Rotate Image](src/main/python/g0001_0100/s0048_rotate_image/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 26 | 98.93
470484

471485
#### Day 4 Array
472486

@@ -495,6 +509,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
495509

496510
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
497511
|-|-|-|-|-|-
512+
| 0049 |[Group Anagrams](src/main/python/g0001_0100/s0049_group_anagrams/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 79 | 93.60
498513

499514
#### Day 9 String
500515

@@ -633,6 +648,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
633648

634649
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
635650
|-|-|-|-|-|-
651+
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 29 | 87.37
636652

637653
#### Day 13 Bit Manipulation
638654

@@ -713,12 +729,14 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
713729

714730
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
715731
|-|-|-|-|-|-
732+
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 333 | 97.58
716733

717734
#### Day 13 Dynamic Programming
718735

719736
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
720737
|-|-|-|-|-|-
721738
| 0045 |[Jump Game II](src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 89 | 99.30
739+
| 0062 |[Unique Paths](src/main/python/g0001_0100/s0062_unique_paths/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 24 | 98.19
722740

723741
#### Day 14 Dynamic Programming
724742

@@ -747,6 +765,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
747765

748766
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
749767
|-|-|-|-|-|-
768+
| 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 60 | 98.17
750769
| 0322 |[Coin Change](src/main/python/g0301_0400/s0322_coin_change/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 488 | 96.38
751770

752771
#### Day 19 Bit Manipulation
@@ -945,6 +964,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
945964

946965
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
947966
|-|-|-|-|-|-
967+
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 29 | 87.37
948968

949969
#### Day 3
950970

@@ -955,12 +975,14 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
955975

956976
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
957977
|-|-|-|-|-|-
978+
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 333 | 97.58
958979
| 0045 |[Jump Game II](src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 89 | 99.30
959980

960981
#### Day 5
961982

962983
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
963984
|-|-|-|-|-|-
985+
| 0053 |[Maximum Subarray](src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 501 | 83.84
964986

965987
#### Day 6
966988

@@ -1012,11 +1034,13 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
10121034

10131035
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10141036
|-|-|-|-|-|-
1037+
| 0062 |[Unique Paths](src/main/python/g0001_0100/s0062_unique_paths/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 24 | 98.19
10151038

10161039
#### Day 16
10171040

10181041
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10191042
|-|-|-|-|-|-
1043+
| 0064 |[Minimum Path Sum](src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 72 | 97.25
10201044

10211045
#### Day 17
10221046

@@ -1035,6 +1059,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
10351059
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10361060
|-|-|-|-|-|-
10371061
| 1143 |[Longest Common Subsequence](src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 452 | 81.00
1062+
| 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 60 | 98.17
10381063

10391064
#### Day 20
10401065

@@ -1147,6 +1172,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
11471172

11481173
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11491174
|-|-|-|-|-|-
1175+
| 0048 |[Rotate Image](src/main/python/g0001_0100/s0048_rotate_image/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 26 | 98.93
11501176

11511177
#### Day 8
11521178

@@ -1167,6 +1193,7 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
11671193

11681194
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11691195
|-|-|-|-|-|-
1196+
| 0049 |[Group Anagrams](src/main/python/g0001_0100/s0049_group_anagrams/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 79 | 93.60
11701197

11711198
#### Day 12
11721199

@@ -1311,6 +1338,16 @@ Python-based LeetCode algorithm problem solutions, regularly updated.
13111338
| 0283 |[Move Zeroes](src/main/python/g0201_0300/s0283_move_zeroes/Solution.py)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 113 | 97.70
13121339
| 0240 |[Search a 2D Matrix II](src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8, Big_O_Time_O(n+m)_Space_O(1) | 130 | 91.49
13131340
| 0239 |[Sliding Window Maximum](src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n\*k)_Space_O(n+k) | 1093 | 66.83
1341+
| 0072 |[Edit Distance](src/main/python/g0001_0100/s0072_edit_distance/Solution.py)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 60 | 98.17
1342+
| 0070 |[Climbing Stairs](src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_2, Level_1_Day_10_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 29 | 87.37
1343+
| 0064 |[Minimum Path Sum](src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 72 | 97.25
1344+
| 0062 |[Unique Paths](src/main/python/g0001_0100/s0062_unique_paths/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_15, Level_1_Day_11_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 24 | 98.19
1345+
| 0056 |[Merge Intervals](src/main/python/g0001_0100/s0056_merge_intervals/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Data_Structure_II_Day_2_Array, Level_2_Day_17_Interval, Udemy_2D_Arrays/Matrix, Big_O_Time_O(n_log_n)_Space_O(n) | 109 | 98.07
1346+
| 0055 |[Jump Game](src/main/python/g0001_0100/s0055_jump_game/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_4, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 333 | 97.58
1347+
| 0053 |[Maximum Subarray](src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Divide_and_Conquer, Data_Structure_I_Day_1_Array, Dynamic_Programming_I_Day_5, Udemy_Famous_Algorithm, Big_O_Time_O(n)_Space_O(1) | 501 | 83.84
1348+
| 0051 |[N-Queens](src/main/python/g0001_0100/s0051_n_queens/Solution.py)| Hard | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(N!)_Space_O(N) | 31 | 99.90
1349+
| 0049 |[Group Anagrams](src/main/python/g0001_0100/s0049_group_anagrams/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 79 | 93.60
1350+
| 0048 |[Rotate Image](src/main/python/g0001_0100/s0048_rotate_image/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Data_Structure_II_Day_3_Array, Programming_Skills_II_Day_7, Udemy_2D_Arrays/Matrix, Big_O_Time_O(n^2)_Space_O(1) | 26 | 98.93
13141351
| 0046 |[Permutations](src/main/python/g0001_0100/s0046_permutations/Solution.py)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 28 | 98.67
13151352
| 0045 |[Jump Game II](src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Big_O_Time_O(n)_Space_O(1) | 89 | 99.30
13161353
| 0042 |[Trapping Rain Water](src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 93 | 87.70

‎src/main/python/g0001_0100/s0001_two_sum/Solution.py‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,8 +2,6 @@
22
# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
33
# #2024_06_06_Time_62_ms_(53.52%)_Space_17.8_MB_(37.79%)
44

5-
from typing import List
6-
75
class Solution:
86
def twoSum(self, numbers: List[int], target: int) -> List[int]:
97
index_map = {}

0 commit comments

Comments
 (0)