diff --git a/README.md b/README.md index 9542c5ab..dc104629 100644 --- a/README.md +++ b/README.md @@ -10,7 +10,6 @@ > ["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) ## -* [Binary Search II](#binary-search-ii) * [Dynamic Programming I](#dynamic-programming-i) * [Programming Skills I](#programming-skills-i) * [Programming Skills II](#programming-skills-ii) @@ -25,111 +24,7 @@ * [Algorithm I](#algorithm-i) * [Algorithm II](#algorithm-ii) * [Binary Search I](#binary-search-i) - -### Binary Search II - -#### Day 1 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 2 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 3 - -| | | | | | | -|-|-|-|-|-|-|- -| 0300 |Longest Increasing Subsequence| [Java](src/main/java/g0201_0300/s0300_longest_increasing_subsequence) [Kotlin](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence) [TypeScript](src/main/ts/g0201_0300/s0300_longest_increasing_subsequence) [Scala](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence) [Ruby](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence) [PHP](src/main/php/g0201_0300/s0300_longest_increasing_subsequence) [C#](src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence) [Go](src/main/go/g0201_0300/s0300_longest_increasing_subsequence) [Cpp](src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence) [Python](src/main/python/g0201_0300/s0300_longest_increasing_subsequence) [Swift](src/main/swift/g0201_0300/s0300_longest_increasing_subsequence) [Elixir](src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence) [Rust](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence) [Dart](src/main/dart/g0201_0300/s0300_longest_increasing_subsequence) [C](src/main/c/g0201_0300/s0300_longest_increasing_subsequence) [JavaScript](src/main/js/g0201_0300/s0300_longest_increasing_subsequence) [Erlang](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence) [Racket](src/main/racket/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) | 3 | 95.75 - -#### Day 4 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 5 - -| | | | | | | -|-|-|-|-|-|-|- -| 0287 |Find the Duplicate Number| [Java](src/main/java/g0201_0300/s0287_find_the_duplicate_number) [Kotlin](src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number) [TypeScript](src/main/ts/g0201_0300/s0287_find_the_duplicate_number) [Scala](src/main/scala/g0201_0300/s0287_find_the_duplicate_number) [Ruby](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number) [PHP](src/main/php/g0201_0300/s0287_find_the_duplicate_number) [C#](src/main/csharp/g0201_0300/s0287_find_the_duplicate_number) [Go](src/main/go/g0201_0300/s0287_find_the_duplicate_number) [Cpp](src/main/cpp/g0201_0300/s0287_find_the_duplicate_number) [Python](src/main/python/g0201_0300/s0287_find_the_duplicate_number) [Swift](src/main/swift/g0201_0300/s0287_find_the_duplicate_number) [Elixir](src/main/elixir/g0201_0300/s0287_find_the_duplicate_number) [Rust](src/main/rust/g0201_0300/s0287_find_the_duplicate_number) [Dart](src/main/dart/g0201_0300/s0287_find_the_duplicate_number) [C](src/main/c/g0201_0300/s0287_find_the_duplicate_number) [JavaScript](src/main/js/g0201_0300/s0287_find_the_duplicate_number) [Erlang](src/main/erlang/g0201_0300/s0287_find_the_duplicate_number) [Racket](src/main/racket/g0201_0300/s0287_find_the_duplicate_number)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 2 | 97.52 - -#### Day 6 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 7 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 8 - -| | | | | | | -|-|-|-|-|-|-|- -| 0240 |Search a 2D Matrix II| [Java](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii) [Kotlin](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii) [TypeScript](src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii) [Scala](src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii) [Ruby](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii) [PHP](src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii) [C#](src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii) [Go](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii) [Cpp](src/main/cpp/g0201_0300/s0240_search_a_2d_matrix_ii) [Python](src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii) [Swift](src/main/swift/g0201_0300/s0240_search_a_2d_matrix_ii) [Elixir](src/main/elixir/g0201_0300/s0240_search_a_2d_matrix_ii) [Rust](src/main/rust/g0201_0300/s0240_search_a_2d_matrix_ii) [Dart](src/main/dart/g0201_0300/s0240_search_a_2d_matrix_ii) [C](src/main/c/g0201_0300/s0240_search_a_2d_matrix_ii) [JavaScript](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii) [Erlang](src/main/erlang/g0201_0300/s0240_search_a_2d_matrix_ii) [Racket](src/main/racket/g0201_0300/s0240_search_a_2d_matrix_ii)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 5 | 99.92 - -#### Day 9 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 10 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 11 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 12 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 13 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 14 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 15 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 16 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 17 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 18 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 19 - -| | | | | | | -|-|-|-|-|-|-|- - -#### Day 20 - -| | | | | | | -|-|-|-|-|-|-|- +* [Binary Search II](#binary-search-ii) ### Dynamic Programming I @@ -148,7 +43,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/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 #### Day 4 @@ -217,7 +112,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/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 #### Day 16 @@ -242,8 +137,8 @@ | | | | | | | |-|-|-|-|-|-|- -| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 -| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/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) | 19 | 89.05 +| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/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) | 3 | 97.19 #### Day 20 @@ -287,7 +182,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 #### Day 7 Array @@ -308,7 +203,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 +| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 #### Day 11 Containers and Libraries @@ -351,7 +246,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0739 |Daily Temperatures| [Java](src/main/java/g0701_0800/s0739_daily_temperatures) [Kotlin](src/main/kotlin/g0701_0800/s0739_daily_temperatures) [TypeScript](src/main/ts/g0701_0800/s0739_daily_temperatures) [Scala](src/main/scala/g0701_0800/s0739_daily_temperatures) [Ruby](src/main/ruby/g0701_0800/s0739_daily_temperatures) [PHP](src/main/php/g0701_0800/s0739_daily_temperatures) [C#](src/main/csharp/g0701_0800/s0739_daily_temperatures) [Go](src/main/go/g0701_0800/s0739_daily_temperatures) [Cpp](src/main/cpp/g0701_0800/s0739_daily_temperatures) [Python](src/main/python/g0701_0800/s0739_daily_temperatures) [Swift](src/main/swift/g0701_0800/s0739_daily_temperatures) [Elixir](src/main/elixir/g0701_0800/s0739_daily_temperatures) [Rust](src/main/rust/g0701_0800/s0739_daily_temperatures) [Dart](src/main/dart/g0701_0800/s0739_daily_temperatures) [C](src/main/c/g0701_0800/s0739_daily_temperatures) [JavaScript](src/main/js/g0701_0800/s0739_daily_temperatures) [Erlang](src/main/erlang/g0701_0800/s0739_daily_temperatures) [Racket](src/main/racket/g0701_0800/s0739_daily_temperatures)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 +| 0739 |Daily Temperatures| [Java](src/main/java/g0701_0800/s0739_daily_temperatures) [Kotlin](src/main/kotlin/g0701_0800/s0739_daily_temperatures) [TypeScript](src/main/ts/g0701_0800/s0739_daily_temperatures) [Scala](src/main/scala/g0701_0800/s0739_daily_temperatures) [Ruby](src/main/ruby/g0701_0800/s0739_daily_temperatures) [PHP](src/main/php/g0701_0800/s0739_daily_temperatures) [C#](src/main/csharp/g0701_0800/s0739_daily_temperatures) [Go](src/main/go/g0701_0800/s0739_daily_temperatures) [Cpp](src/main/cpp/g0701_0800/s0739_daily_temperatures) [Python](src/main/python/g0701_0800/s0739_daily_temperatures) [Swift](src/main/swift/g0701_0800/s0739_daily_temperatures) [Elixir](src/main/elixir/g0701_0800/s0739_daily_temperatures) [Rust](src/main/rust/g0701_0800/s0739_daily_temperatures) [Dart](src/main/dart/g0701_0800/s0739_daily_temperatures) [C](src/main/c/g0701_0800/s0739_daily_temperatures) [JavaScript](src/main/js/g0701_0800/s0739_daily_temperatures) [Erlang](src/main/erlang/g0701_0800/s0739_daily_temperatures) [Racket](src/main/racket/g0701_0800/s0739_daily_temperatures)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 #### Day 7 @@ -571,7 +466,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0021 |Merge Two Sorted Lists| [Java](src/main/java/g0001_0100/s0021_merge_two_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists) [Scala](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists) [PHP](src/main/php/g0001_0100/s0021_merge_two_sorted_lists) [C#](src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists) [Go](src/main/go/g0001_0100/s0021_merge_two_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists) [Python](src/main/python/g0001_0100/s0021_merge_two_sorted_lists) [Swift](src/main/swift/g0001_0100/s0021_merge_two_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists) [Rust](src/main/rust/g0001_0100/s0021_merge_two_sorted_lists) [Dart](src/main/dart/g0001_0100/s0021_merge_two_sorted_lists) [C](src/main/c/g0001_0100/s0021_merge_two_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0021_merge_two_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists) [Racket](src/main/racket/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 -| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 #### Day 4 Linked List @@ -618,7 +513,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/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 #### Day 12 Sliding Window/Two Pointer @@ -636,7 +531,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 #### Day 15 Heap @@ -684,7 +579,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0543 |Diameter of Binary Tree| [Java](src/main/java/g0501_0600/s0543_diameter_of_binary_tree) [Kotlin](src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree) [TypeScript](src/main/ts/g0501_0600/s0543_diameter_of_binary_tree) [Scala](src/main/scala/g0501_0600/s0543_diameter_of_binary_tree) [Ruby](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree) [PHP](src/main/php/g0501_0600/s0543_diameter_of_binary_tree) [C#](src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree) [Go](src/main/go/g0501_0600/s0543_diameter_of_binary_tree) [Cpp](src/main/cpp/g0501_0600/s0543_diameter_of_binary_tree) [Python](src/main/python/g0501_0600/s0543_diameter_of_binary_tree) [Swift](src/main/swift/g0501_0600/s0543_diameter_of_binary_tree) [Elixir](src/main/elixir/g0501_0600/s0543_diameter_of_binary_tree) [Rust](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree) [Dart](src/main/dart/g0501_0600/s0543_diameter_of_binary_tree) [C](src/main/c/g0501_0600/s0543_diameter_of_binary_tree) [JavaScript](src/main/js/g0501_0600/s0543_diameter_of_binary_tree) [Erlang](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree) [Racket](src/main/racket/g0501_0600/s0543_diameter_of_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0437 |Path Sum III| [Java](src/main/java/g0401_0500/s0437_path_sum_iii) [Kotlin](src/main/kotlin/g0401_0500/s0437_path_sum_iii) [TypeScript](src/main/ts/g0401_0500/s0437_path_sum_iii) [Scala](src/main/scala/g0401_0500/s0437_path_sum_iii) [Ruby](src/main/ruby/g0401_0500/s0437_path_sum_iii) [PHP](src/main/php/g0401_0500/s0437_path_sum_iii) [C#](src/main/csharp/g0401_0500/s0437_path_sum_iii) [Go](src/main/go/g0401_0500/s0437_path_sum_iii) [Cpp](src/main/cpp/g0401_0500/s0437_path_sum_iii) [Python](src/main/python/g0401_0500/s0437_path_sum_iii) [Swift](src/main/swift/g0401_0500/s0437_path_sum_iii) [Elixir](src/main/elixir/g0401_0500/s0437_path_sum_iii) [Rust](src/main/rust/g0401_0500/s0437_path_sum_iii) [Dart](src/main/dart/g0401_0500/s0437_path_sum_iii) [C](src/main/c/g0401_0500/s0437_path_sum_iii) [JavaScript](src/main/js/g0401_0500/s0437_path_sum_iii) [Erlang](src/main/erlang/g0401_0500/s0437_path_sum_iii) [Racket](src/main/racket/g0401_0500/s0437_path_sum_iii)| Medium | Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 +| 0437 |Path Sum III| [Java](src/main/java/g0401_0500/s0437_path_sum_iii) [Kotlin](src/main/kotlin/g0401_0500/s0437_path_sum_iii) [TypeScript](src/main/ts/g0401_0500/s0437_path_sum_iii) [Scala](src/main/scala/g0401_0500/s0437_path_sum_iii) [Ruby](src/main/ruby/g0401_0500/s0437_path_sum_iii) [PHP](src/main/php/g0401_0500/s0437_path_sum_iii) [C#](src/main/csharp/g0401_0500/s0437_path_sum_iii) [Go](src/main/go/g0401_0500/s0437_path_sum_iii) [Cpp](src/main/cpp/g0401_0500/s0437_path_sum_iii) [Python](src/main/python/g0401_0500/s0437_path_sum_iii) [Swift](src/main/swift/g0401_0500/s0437_path_sum_iii) [Elixir](src/main/elixir/g0401_0500/s0437_path_sum_iii) [Rust](src/main/rust/g0401_0500/s0437_path_sum_iii) [Dart](src/main/dart/g0401_0500/s0437_path_sum_iii) [C](src/main/c/g0401_0500/s0437_path_sum_iii) [JavaScript](src/main/js/g0401_0500/s0437_path_sum_iii) [Erlang](src/main/erlang/g0401_0500/s0437_path_sum_iii) [Racket](src/main/racket/g0401_0500/s0437_path_sum_iii)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 #### Day 8 Binary Search @@ -713,7 +608,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/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 | 0322 |Coin Change| [Java](src/main/java/g0301_0400/s0322_coin_change) [Kotlin](src/main/kotlin/g0301_0400/s0322_coin_change) [TypeScript](src/main/ts/g0301_0400/s0322_coin_change) [Scala](src/main/scala/g0301_0400/s0322_coin_change) [Ruby](src/main/ruby/g0301_0400/s0322_coin_change) [PHP](src/main/php/g0301_0400/s0322_coin_change) [C#](src/main/csharp/g0301_0400/s0322_coin_change) [Go](src/main/go/g0301_0400/s0322_coin_change) [Cpp](src/main/cpp/g0301_0400/s0322_coin_change) [Python](src/main/python/g0301_0400/s0322_coin_change) [Swift](src/main/swift/g0301_0400/s0322_coin_change) [Elixir](src/main/elixir/g0301_0400/s0322_coin_change) [Rust](src/main/rust/g0301_0400/s0322_coin_change) [Dart](src/main/dart/g0301_0400/s0322_coin_change) [C](src/main/c/g0301_0400/s0322_coin_change) [JavaScript](src/main/js/g0301_0400/s0322_coin_change) [Erlang](src/main/erlang/g0301_0400/s0322_coin_change) [Racket](src/main/racket/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) | 12 | 92.59 #### Day 13 Dynamic Programming @@ -741,7 +636,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0155 |Min Stack| [Java](src/main/java/g0101_0200/s0155_min_stack) [Kotlin](src/main/kotlin/g0101_0200/s0155_min_stack) [TypeScript](src/main/ts/g0101_0200/s0155_min_stack) [Scala](src/main/scala/g0101_0200/s0155_min_stack) [Ruby](src/main/ruby/g0101_0200/s0155_min_stack) [PHP](src/main/php/g0101_0200/s0155_min_stack) [C#](src/main/csharp/g0101_0200/s0155_min_stack) [Go](src/main/go/g0101_0200/s0155_min_stack) [Cpp](src/main/cpp/g0101_0200/s0155_min_stack) [Python](src/main/python/g0101_0200/s0155_min_stack) [Swift](src/main/swift/g0101_0200/s0155_min_stack) [Elixir](src/main/elixir/g0101_0200/s0155_min_stack) [Rust](src/main/rust/g0101_0200/s0155_min_stack) [Dart](src/main/dart/g0101_0200/s0155_min_stack) [C](src/main/c/g0101_0200/s0155_min_stack) [JavaScript](src/main/js/g0101_0200/s0155_min_stack) [Erlang](src/main/erlang/g0101_0200/s0155_min_stack) [Racket](src/main/racket/g0101_0200/s0155_min_stack)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 -| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 +| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 #### Day 17 Interval @@ -772,7 +667,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0007 |Reverse Integer| [Java](src/main/java/g0001_0100/s0007_reverse_integer) [Kotlin](src/main/kotlin/g0001_0100/s0007_reverse_integer) [TypeScript](src/main/ts/g0001_0100/s0007_reverse_integer) [Scala](src/main/scala/g0001_0100/s0007_reverse_integer) [Ruby](src/main/ruby/g0001_0100/s0007_reverse_integer) [PHP](src/main/php/g0001_0100/s0007_reverse_integer) [C#](src/main/csharp/g0001_0100/s0007_reverse_integer) [Go](src/main/go/g0001_0100/s0007_reverse_integer) [Cpp](src/main/cpp/g0001_0100/s0007_reverse_integer) [Python](src/main/python/g0001_0100/s0007_reverse_integer) [Swift](src/main/swift/g0001_0100/s0007_reverse_integer) [Elixir](src/main/elixir/g0001_0100/s0007_reverse_integer) [Rust](src/main/rust/g0001_0100/s0007_reverse_integer) [Dart](src/main/dart/g0001_0100/s0007_reverse_integer) [C](src/main/c/g0001_0100/s0007_reverse_integer) [JavaScript](src/main/js/g0001_0100/s0007_reverse_integer) [Erlang](src/main/erlang/g0001_0100/s0007_reverse_integer) [Racket](src/main/racket/g0001_0100/s0007_reverse_integer)| Medium | Top_Interview_Questions, Math | 0 | 100.00 | 0009 |Palindrome Number| [Java](src/main/java/g0001_0100/s0009_palindrome_number) [Kotlin](src/main/kotlin/g0001_0100/s0009_palindrome_number) [TypeScript](src/main/ts/g0001_0100/s0009_palindrome_number) [Scala](src/main/scala/g0001_0100/s0009_palindrome_number) [Ruby](src/main/ruby/g0001_0100/s0009_palindrome_number) [PHP](src/main/php/g0001_0100/s0009_palindrome_number) [C#](src/main/csharp/g0001_0100/s0009_palindrome_number) [Go](src/main/go/g0001_0100/s0009_palindrome_number) [Cpp](src/main/cpp/g0001_0100/s0009_palindrome_number) [Python](src/main/python/g0001_0100/s0009_palindrome_number) [Swift](src/main/swift/g0001_0100/s0009_palindrome_number) [Elixir](src/main/elixir/g0001_0100/s0009_palindrome_number) [Rust](src/main/rust/g0001_0100/s0009_palindrome_number) [Dart](src/main/dart/g0001_0100/s0009_palindrome_number) [C](src/main/c/g0001_0100/s0009_palindrome_number) [JavaScript](src/main/js/g0001_0100/s0009_palindrome_number) [Erlang](src/main/erlang/g0001_0100/s0009_palindrome_number) [Racket](src/main/racket/g0001_0100/s0009_palindrome_number)| Easy | Math | 4 | 100.00 @@ -783,7 +678,7 @@ | 0003 |Longest Substring Without Repeating Characters| [Java](src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters) [Kotlin](src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters) [TypeScript](src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters) [Scala](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters) [Ruby](src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters) [PHP](src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters) [C#](src/main/csharp/g0001_0100/s0003_longest_substring_without_repeating_characters) [Go](src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters) [Cpp](src/main/cpp/g0001_0100/s0003_longest_substring_without_repeating_characters) [Python](src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters) [Swift](src/main/swift/g0001_0100/s0003_longest_substring_without_repeating_characters) [Elixir](src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters) [Rust](src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters) [Dart](src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters) [C](src/main/c/g0001_0100/s0003_longest_substring_without_repeating_characters) [JavaScript](src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters) [Erlang](src/main/erlang/g0001_0100/s0003_longest_substring_without_repeating_characters) [Racket](src/main/racket/g0001_0100/s0003_longest_substring_without_repeating_characters)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 | 0020 |Valid Parentheses| [Java](src/main/java/g0001_0100/s0020_valid_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0020_valid_parentheses) [TypeScript](src/main/ts/g0001_0100/s0020_valid_parentheses) [Scala](src/main/scala/g0001_0100/s0020_valid_parentheses) [Ruby](src/main/ruby/g0001_0100/s0020_valid_parentheses) [PHP](src/main/php/g0001_0100/s0020_valid_parentheses) [C#](src/main/csharp/g0001_0100/s0020_valid_parentheses) [Go](src/main/go/g0001_0100/s0020_valid_parentheses) [Cpp](src/main/cpp/g0001_0100/s0020_valid_parentheses) [Python](src/main/python/g0001_0100/s0020_valid_parentheses) [Swift](src/main/swift/g0001_0100/s0020_valid_parentheses) [Elixir](src/main/elixir/g0001_0100/s0020_valid_parentheses) [Rust](src/main/rust/g0001_0100/s0020_valid_parentheses) [Dart](src/main/dart/g0001_0100/s0020_valid_parentheses) [C](src/main/c/g0001_0100/s0020_valid_parentheses) [JavaScript](src/main/js/g0001_0100/s0020_valid_parentheses) [Erlang](src/main/erlang/g0001_0100/s0020_valid_parentheses) [Racket](src/main/racket/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 2 | 97.19 | 0005 |Longest Palindromic Substring| [Java](src/main/java/g0001_0100/s0005_longest_palindromic_substring) [Kotlin](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring) [TypeScript](src/main/ts/g0001_0100/s0005_longest_palindromic_substring) [Scala](src/main/scala/g0001_0100/s0005_longest_palindromic_substring) [Ruby](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring) [PHP](src/main/php/g0001_0100/s0005_longest_palindromic_substring) [C#](src/main/csharp/g0001_0100/s0005_longest_palindromic_substring) [Go](src/main/go/g0001_0100/s0005_longest_palindromic_substring) [Cpp](src/main/cpp/g0001_0100/s0005_longest_palindromic_substring) [Python](src/main/python/g0001_0100/s0005_longest_palindromic_substring) [Swift](src/main/swift/g0001_0100/s0005_longest_palindromic_substring) [Elixir](src/main/elixir/g0001_0100/s0005_longest_palindromic_substring) [Rust](src/main/rust/g0001_0100/s0005_longest_palindromic_substring) [Dart](src/main/dart/g0001_0100/s0005_longest_palindromic_substring) [C](src/main/c/g0001_0100/s0005_longest_palindromic_substring) [JavaScript](src/main/js/g0001_0100/s0005_longest_palindromic_substring) [Erlang](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring) [Racket](src/main/racket/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) | 7 | 97.82 -| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0049 |Group Anagrams| [Java](src/main/java/g0001_0100/s0049_group_anagrams) [Kotlin](src/main/kotlin/g0001_0100/s0049_group_anagrams) [TypeScript](src/main/ts/g0001_0100/s0049_group_anagrams) [Scala](src/main/scala/g0001_0100/s0049_group_anagrams) [Ruby](src/main/ruby/g0001_0100/s0049_group_anagrams) [PHP](src/main/php/g0001_0100/s0049_group_anagrams) [C#](src/main/csharp/g0001_0100/s0049_group_anagrams) [Go](src/main/go/g0001_0100/s0049_group_anagrams) [Cpp](src/main/cpp/g0001_0100/s0049_group_anagrams) [Python](src/main/python/g0001_0100/s0049_group_anagrams) [Swift](src/main/swift/g0001_0100/s0049_group_anagrams) [Elixir](src/main/elixir/g0001_0100/s0049_group_anagrams) [Rust](src/main/rust/g0001_0100/s0049_group_anagrams) [Dart](src/main/dart/g0001_0100/s0049_group_anagrams) [C](src/main/c/g0001_0100/s0049_group_anagrams) [JavaScript](src/main/js/g0001_0100/s0049_group_anagrams) [Erlang](src/main/erlang/g0001_0100/s0049_group_anagrams) [Racket](src/main/racket/g0001_0100/s0049_group_anagrams)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 6 | 97.61 #### Udemy Binary Search @@ -798,12 +693,12 @@ | | | | | | | |-|-|-|-|-|-|- | 0121 |Best Time to Buy and Sell Stock| [Java](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Kotlin](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [TypeScript](src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Scala](src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Ruby](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [PHP](src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C#](src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Go](src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Cpp](src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Python](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Swift](src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Elixir](src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Rust](src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Dart](src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C](src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [JavaScript](src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Erlang](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Racket](src/main/racket/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) | 1 | 99.78 -| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 | 0001 |Two Sum| [Java](src/main/java/g0001_0100/s0001_two_sum) [Kotlin](src/main/kotlin/g0001_0100/s0001_two_sum) [TypeScript](src/main/ts/g0001_0100/s0001_two_sum) [Scala](src/main/scala/g0001_0100/s0001_two_sum) [Ruby](src/main/ruby/g0001_0100/s0001_two_sum) [PHP](src/main/php/g0001_0100/s0001_two_sum) [C#](src/main/csharp/g0001_0100/s0001_two_sum) [Go](src/main/go/g0001_0100/s0001_two_sum) [Cpp](src/main/cpp/g0001_0100/s0001_two_sum) [Python](src/main/python/g0001_0100/s0001_two_sum) [Swift](src/main/swift/g0001_0100/s0001_two_sum) [Elixir](src/main/elixir/g0001_0100/s0001_two_sum) [Rust](src/main/rust/g0001_0100/s0001_two_sum) [Dart](src/main/dart/g0001_0100/s0001_two_sum) [C](src/main/c/g0001_0100/s0001_two_sum) [JavaScript](src/main/js/g0001_0100/s0001_two_sum) [Erlang](src/main/erlang/g0001_0100/s0001_two_sum) [Racket](src/main/racket/g0001_0100/s0001_two_sum)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 2 | 98.90 | 0189 |Rotate Array| [Java](src/main/java/g0101_0200/s0189_rotate_array) [Kotlin](src/main/kotlin/g0101_0200/s0189_rotate_array) [TypeScript](src/main/ts/g0101_0200/s0189_rotate_array) [Scala](src/main/scala/g0101_0200/s0189_rotate_array) [Ruby](src/main/ruby/g0101_0200/s0189_rotate_array) [PHP](src/main/php/g0101_0200/s0189_rotate_array) [C#](src/main/csharp/g0101_0200/s0189_rotate_array) [Go](src/main/go/g0101_0200/s0189_rotate_array) [Cpp](src/main/cpp/g0101_0200/s0189_rotate_array) [Python](src/main/python/g0101_0200/s0189_rotate_array) [Swift](src/main/swift/g0101_0200/s0189_rotate_array) [Elixir](src/main/elixir/g0101_0200/s0189_rotate_array) [Rust](src/main/rust/g0101_0200/s0189_rotate_array) [Dart](src/main/dart/g0101_0200/s0189_rotate_array) [C](src/main/c/g0101_0200/s0189_rotate_array) [JavaScript](src/main/js/g0101_0200/s0189_rotate_array) [Erlang](src/main/erlang/g0101_0200/s0189_rotate_array) [Racket](src/main/racket/g0101_0200/s0189_rotate_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0055 |Jump Game| [Java](src/main/java/g0001_0100/s0055_jump_game) [Kotlin](src/main/kotlin/g0001_0100/s0055_jump_game) [TypeScript](src/main/ts/g0001_0100/s0055_jump_game) [Scala](src/main/scala/g0001_0100/s0055_jump_game) [Ruby](src/main/ruby/g0001_0100/s0055_jump_game) [PHP](src/main/php/g0001_0100/s0055_jump_game) [C#](src/main/csharp/g0001_0100/s0055_jump_game) [Go](src/main/go/g0001_0100/s0055_jump_game) [Cpp](src/main/cpp/g0001_0100/s0055_jump_game) [Python](src/main/python/g0001_0100/s0055_jump_game) [Swift](src/main/swift/g0001_0100/s0055_jump_game) [Elixir](src/main/elixir/g0001_0100/s0055_jump_game) [Rust](src/main/rust/g0001_0100/s0055_jump_game) [Dart](src/main/dart/g0001_0100/s0055_jump_game) [C](src/main/c/g0001_0100/s0055_jump_game) [JavaScript](src/main/js/g0001_0100/s0055_jump_game) [Erlang](src/main/erlang/g0001_0100/s0055_jump_game) [Racket](src/main/racket/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) | 1 | 100.00 | 0075 |Sort Colors| [Java](src/main/java/g0001_0100/s0075_sort_colors) [Kotlin](src/main/kotlin/g0001_0100/s0075_sort_colors) [TypeScript](src/main/ts/g0001_0100/s0075_sort_colors) [Scala](src/main/scala/g0001_0100/s0075_sort_colors) [Ruby](src/main/ruby/g0001_0100/s0075_sort_colors) [PHP](src/main/php/g0001_0100/s0075_sort_colors) [C#](src/main/csharp/g0001_0100/s0075_sort_colors) [Go](src/main/go/g0001_0100/s0075_sort_colors) [Cpp](src/main/cpp/g0001_0100/s0075_sort_colors) [Python](src/main/python/g0001_0100/s0075_sort_colors) [Swift](src/main/swift/g0001_0100/s0075_sort_colors) [Elixir](src/main/elixir/g0001_0100/s0075_sort_colors) [Rust](src/main/rust/g0001_0100/s0075_sort_colors) [Dart](src/main/dart/g0001_0100/s0075_sort_colors) [C](src/main/c/g0001_0100/s0075_sort_colors) [JavaScript](src/main/js/g0001_0100/s0075_sort_colors) [Erlang](src/main/erlang/g0001_0100/s0075_sort_colors) [Racket](src/main/racket/g0001_0100/s0075_sort_colors)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 0041 |First Missing Positive| [Java](src/main/java/g0001_0100/s0041_first_missing_positive) [Kotlin](src/main/kotlin/g0001_0100/s0041_first_missing_positive) [TypeScript](src/main/ts/g0001_0100/s0041_first_missing_positive) [Scala](src/main/scala/g0001_0100/s0041_first_missing_positive) [Ruby](src/main/ruby/g0001_0100/s0041_first_missing_positive) [PHP](src/main/php/g0001_0100/s0041_first_missing_positive) [C#](src/main/csharp/g0001_0100/s0041_first_missing_positive) [Go](src/main/go/g0001_0100/s0041_first_missing_positive) [Cpp](src/main/cpp/g0001_0100/s0041_first_missing_positive) [Python](src/main/python/g0001_0100/s0041_first_missing_positive) [Swift](src/main/swift/g0001_0100/s0041_first_missing_positive) [Elixir](src/main/elixir/g0001_0100/s0041_first_missing_positive) [Rust](src/main/rust/g0001_0100/s0041_first_missing_positive) [Dart](src/main/dart/g0001_0100/s0041_first_missing_positive) [C](src/main/c/g0001_0100/s0041_first_missing_positive) [JavaScript](src/main/js/g0001_0100/s0041_first_missing_positive) [Erlang](src/main/erlang/g0001_0100/s0041_first_missing_positive) [Racket](src/main/racket/g0001_0100/s0041_first_missing_positive)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 1 | 100.00 | 0239 |Sliding Window Maximum| [Java](src/main/java/g0201_0300/s0239_sliding_window_maximum) [Kotlin](src/main/kotlin/g0201_0300/s0239_sliding_window_maximum) [TypeScript](src/main/ts/g0201_0300/s0239_sliding_window_maximum) [Scala](src/main/scala/g0201_0300/s0239_sliding_window_maximum) [Ruby](src/main/ruby/g0201_0300/s0239_sliding_window_maximum) [PHP](src/main/php/g0201_0300/s0239_sliding_window_maximum) [C#](src/main/csharp/g0201_0300/s0239_sliding_window_maximum) [Go](src/main/go/g0201_0300/s0239_sliding_window_maximum) [Cpp](src/main/cpp/g0201_0300/s0239_sliding_window_maximum) [Python](src/main/python/g0201_0300/s0239_sliding_window_maximum) [Swift](src/main/swift/g0201_0300/s0239_sliding_window_maximum) [Elixir](src/main/elixir/g0201_0300/s0239_sliding_window_maximum) [Rust](src/main/rust/g0201_0300/s0239_sliding_window_maximum) [Dart](src/main/dart/g0201_0300/s0239_sliding_window_maximum) [C](src/main/c/g0201_0300/s0239_sliding_window_maximum) [JavaScript](src/main/js/g0201_0300/s0239_sliding_window_maximum) [Erlang](src/main/erlang/g0201_0300/s0239_sliding_window_maximum) [Racket](src/main/racket/g0201_0300/s0239_sliding_window_maximum)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 26 | 95.89 @@ -843,7 +738,7 @@ | 0024 |Swap Nodes in Pairs| [Java](src/main/java/g0001_0100/s0024_swap_nodes_in_pairs) [Kotlin](src/main/kotlin/g0001_0100/s0024_swap_nodes_in_pairs) [TypeScript](src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs) [Scala](src/main/scala/g0001_0100/s0024_swap_nodes_in_pairs) [Ruby](src/main/ruby/g0001_0100/s0024_swap_nodes_in_pairs) [PHP](src/main/php/g0001_0100/s0024_swap_nodes_in_pairs) [C#](src/main/csharp/g0001_0100/s0024_swap_nodes_in_pairs) [Go](src/main/go/g0001_0100/s0024_swap_nodes_in_pairs) [Cpp](src/main/cpp/g0001_0100/s0024_swap_nodes_in_pairs) [Python](src/main/python/g0001_0100/s0024_swap_nodes_in_pairs) [Swift](src/main/swift/g0001_0100/s0024_swap_nodes_in_pairs) [Elixir](src/main/elixir/g0001_0100/s0024_swap_nodes_in_pairs) [Rust](src/main/rust/g0001_0100/s0024_swap_nodes_in_pairs) [Dart](src/main/dart/g0001_0100/s0024_swap_nodes_in_pairs) [C](src/main/c/g0001_0100/s0024_swap_nodes_in_pairs) [JavaScript](src/main/js/g0001_0100/s0024_swap_nodes_in_pairs) [Erlang](src/main/erlang/g0001_0100/s0024_swap_nodes_in_pairs) [Racket](src/main/racket/g0001_0100/s0024_swap_nodes_in_pairs)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0142 |Linked List Cycle II| [Java](src/main/java/g0101_0200/s0142_linked_list_cycle_ii) [Kotlin](src/main/kotlin/g0101_0200/s0142_linked_list_cycle_ii) [TypeScript](src/main/ts/g0101_0200/s0142_linked_list_cycle_ii) [Scala](src/main/scala/g0101_0200/s0142_linked_list_cycle_ii) [Ruby](src/main/ruby/g0101_0200/s0142_linked_list_cycle_ii) [PHP](src/main/php/g0101_0200/s0142_linked_list_cycle_ii) [C#](src/main/csharp/g0101_0200/s0142_linked_list_cycle_ii) [Go](src/main/go/g0101_0200/s0142_linked_list_cycle_ii) [Cpp](src/main/cpp/g0101_0200/s0142_linked_list_cycle_ii) [Python](src/main/python/g0101_0200/s0142_linked_list_cycle_ii) [Swift](src/main/swift/g0101_0200/s0142_linked_list_cycle_ii) [Elixir](src/main/elixir/g0101_0200/s0142_linked_list_cycle_ii) [Rust](src/main/rust/g0101_0200/s0142_linked_list_cycle_ii) [Dart](src/main/dart/g0101_0200/s0142_linked_list_cycle_ii) [C](src/main/c/g0101_0200/s0142_linked_list_cycle_ii) [JavaScript](src/main/js/g0101_0200/s0142_linked_list_cycle_ii) [Erlang](src/main/erlang/g0101_0200/s0142_linked_list_cycle_ii) [Racket](src/main/racket/g0101_0200/s0142_linked_list_cycle_ii)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0141 |Linked List Cycle| [Java](src/main/java/g0101_0200/s0141_linked_list_cycle) [Kotlin](src/main/kotlin/g0101_0200/s0141_linked_list_cycle) [TypeScript](src/main/ts/g0101_0200/s0141_linked_list_cycle) [Scala](src/main/scala/g0101_0200/s0141_linked_list_cycle) [Ruby](src/main/ruby/g0101_0200/s0141_linked_list_cycle) [PHP](src/main/php/g0101_0200/s0141_linked_list_cycle) [C#](src/main/csharp/g0101_0200/s0141_linked_list_cycle) [Go](src/main/go/g0101_0200/s0141_linked_list_cycle) [Cpp](src/main/cpp/g0101_0200/s0141_linked_list_cycle) [Python](src/main/python/g0101_0200/s0141_linked_list_cycle) [Swift](src/main/swift/g0101_0200/s0141_linked_list_cycle) [Elixir](src/main/elixir/g0101_0200/s0141_linked_list_cycle) [Rust](src/main/rust/g0101_0200/s0141_linked_list_cycle) [Dart](src/main/dart/g0101_0200/s0141_linked_list_cycle) [C](src/main/c/g0101_0200/s0141_linked_list_cycle) [JavaScript](src/main/js/g0101_0200/s0141_linked_list_cycle) [Erlang](src/main/erlang/g0101_0200/s0141_linked_list_cycle) [Racket](src/main/racket/g0101_0200/s0141_linked_list_cycle)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 -| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0021 |Merge Two Sorted Lists| [Java](src/main/java/g0001_0100/s0021_merge_two_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists) [Scala](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists) [PHP](src/main/php/g0001_0100/s0021_merge_two_sorted_lists) [C#](src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists) [Go](src/main/go/g0001_0100/s0021_merge_two_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists) [Python](src/main/python/g0001_0100/s0021_merge_two_sorted_lists) [Swift](src/main/swift/g0001_0100/s0021_merge_two_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists) [Rust](src/main/rust/g0001_0100/s0021_merge_two_sorted_lists) [Dart](src/main/dart/g0001_0100/s0021_merge_two_sorted_lists) [C](src/main/c/g0001_0100/s0021_merge_two_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0021_merge_two_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists) [Racket](src/main/racket/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 | 0160 |Intersection of Two Linked Lists| [Java](src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists) [Kotlin](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists) [TypeScript](src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists) [Scala](src/main/scala/g0101_0200/s0160_intersection_of_two_linked_lists) [Ruby](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists) [PHP](src/main/php/g0101_0200/s0160_intersection_of_two_linked_lists) [C#](src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists) [Go](src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists) [Cpp](src/main/cpp/g0101_0200/s0160_intersection_of_two_linked_lists) [Python](src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists) [Swift](src/main/swift/g0101_0200/s0160_intersection_of_two_linked_lists) [Elixir](src/main/elixir/g0101_0200/s0160_intersection_of_two_linked_lists) [Rust](src/main/rust/g0101_0200/s0160_intersection_of_two_linked_lists) [Dart](src/main/dart/g0101_0200/s0160_intersection_of_two_linked_lists) [C](src/main/c/g0101_0200/s0160_intersection_of_two_linked_lists) [JavaScript](src/main/js/g0101_0200/s0160_intersection_of_two_linked_lists) [Erlang](src/main/erlang/g0101_0200/s0160_intersection_of_two_linked_lists) [Racket](src/main/racket/g0101_0200/s0160_intersection_of_two_linked_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 1 | 99.92 | 0234 |Palindrome Linked List| [Java](src/main/java/g0201_0300/s0234_palindrome_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list) [TypeScript](src/main/ts/g0201_0300/s0234_palindrome_linked_list) [Scala](src/main/scala/g0201_0300/s0234_palindrome_linked_list) [Ruby](src/main/ruby/g0201_0300/s0234_palindrome_linked_list) [PHP](src/main/php/g0201_0300/s0234_palindrome_linked_list) [C#](src/main/csharp/g0201_0300/s0234_palindrome_linked_list) [Go](src/main/go/g0201_0300/s0234_palindrome_linked_list) [Cpp](src/main/cpp/g0201_0300/s0234_palindrome_linked_list) [Python](src/main/python/g0201_0300/s0234_palindrome_linked_list) [Swift](src/main/swift/g0201_0300/s0234_palindrome_linked_list) [Elixir](src/main/elixir/g0201_0300/s0234_palindrome_linked_list) [Rust](src/main/rust/g0201_0300/s0234_palindrome_linked_list) [Dart](src/main/dart/g0201_0300/s0234_palindrome_linked_list) [C](src/main/c/g0201_0300/s0234_palindrome_linked_list) [JavaScript](src/main/js/g0201_0300/s0234_palindrome_linked_list) [Erlang](src/main/erlang/g0201_0300/s0234_palindrome_linked_list) [Racket](src/main/racket/g0201_0300/s0234_palindrome_linked_list)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 @@ -859,16 +754,16 @@ | 0102 |Binary Tree Level Order Traversal| [Java](src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal) [Kotlin](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal) [TypeScript](src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal) [Scala](src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal) [Ruby](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal) [PHP](src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal) [C#](src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal) [Go](src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal) [Cpp](src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal) [Python](src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal) [Swift](src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal) [Elixir](src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal) [Rust](src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal) [Dart](src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal) [C](src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal) [JavaScript](src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal) [Erlang](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal) [Racket](src/main/racket/g0101_0200/s0102_binary_tree_level_order_traversal)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 | 0543 |Diameter of Binary Tree| [Java](src/main/java/g0501_0600/s0543_diameter_of_binary_tree) [Kotlin](src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree) [TypeScript](src/main/ts/g0501_0600/s0543_diameter_of_binary_tree) [Scala](src/main/scala/g0501_0600/s0543_diameter_of_binary_tree) [Ruby](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree) [PHP](src/main/php/g0501_0600/s0543_diameter_of_binary_tree) [C#](src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree) [Go](src/main/go/g0501_0600/s0543_diameter_of_binary_tree) [Cpp](src/main/cpp/g0501_0600/s0543_diameter_of_binary_tree) [Python](src/main/python/g0501_0600/s0543_diameter_of_binary_tree) [Swift](src/main/swift/g0501_0600/s0543_diameter_of_binary_tree) [Elixir](src/main/elixir/g0501_0600/s0543_diameter_of_binary_tree) [Rust](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree) [Dart](src/main/dart/g0501_0600/s0543_diameter_of_binary_tree) [C](src/main/c/g0501_0600/s0543_diameter_of_binary_tree) [JavaScript](src/main/js/g0501_0600/s0543_diameter_of_binary_tree) [Erlang](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree) [Racket](src/main/racket/g0501_0600/s0543_diameter_of_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0226 |Invert Binary Tree| [Java](src/main/java/g0201_0300/s0226_invert_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0226_invert_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0226_invert_binary_tree) [Scala](src/main/scala/g0201_0300/s0226_invert_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0226_invert_binary_tree) [PHP](src/main/php/g0201_0300/s0226_invert_binary_tree) [C#](src/main/csharp/g0201_0300/s0226_invert_binary_tree) [Go](src/main/go/g0201_0300/s0226_invert_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0226_invert_binary_tree) [Python](src/main/python/g0201_0300/s0226_invert_binary_tree) [Swift](src/main/swift/g0201_0300/s0226_invert_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0226_invert_binary_tree) [Rust](src/main/rust/g0201_0300/s0226_invert_binary_tree) [Dart](src/main/dart/g0201_0300/s0226_invert_binary_tree) [C](src/main/c/g0201_0300/s0226_invert_binary_tree) [JavaScript](src/main/js/g0201_0300/s0226_invert_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0226_invert_binary_tree) [Racket](src/main/racket/g0201_0300/s0226_invert_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 +| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 | 0124 |Binary Tree Maximum Path Sum| [Java](src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum) [Kotlin](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum) [TypeScript](src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum) [Scala](src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum) [Ruby](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum) [PHP](src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum) [C#](src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Go](src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum) [Cpp](src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Python](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum) [Swift](src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum) [Elixir](src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum) [Rust](src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum) [Dart](src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum) [C](src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum) [JavaScript](src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum) [Erlang](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum) [Racket](src/main/racket/g0101_0200/s0124_binary_tree_maximum_path_sum)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0098 |Validate Binary Search Tree| [Java](src/main/java/g0001_0100/s0098_validate_binary_search_tree) [Kotlin](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree) [TypeScript](src/main/ts/g0001_0100/s0098_validate_binary_search_tree) [Scala](src/main/scala/g0001_0100/s0098_validate_binary_search_tree) [Ruby](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree) [PHP](src/main/php/g0001_0100/s0098_validate_binary_search_tree) [C#](src/main/csharp/g0001_0100/s0098_validate_binary_search_tree) [Go](src/main/go/g0001_0100/s0098_validate_binary_search_tree) [Cpp](src/main/cpp/g0001_0100/s0098_validate_binary_search_tree) [Python](src/main/python/g0001_0100/s0098_validate_binary_search_tree) [Swift](src/main/swift/g0001_0100/s0098_validate_binary_search_tree) [Elixir](src/main/elixir/g0001_0100/s0098_validate_binary_search_tree) [Rust](src/main/rust/g0001_0100/s0098_validate_binary_search_tree) [Dart](src/main/dart/g0001_0100/s0098_validate_binary_search_tree) [C](src/main/c/g0001_0100/s0098_validate_binary_search_tree) [JavaScript](src/main/js/g0001_0100/s0098_validate_binary_search_tree) [Erlang](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree) [Racket](src/main/racket/g0001_0100/s0098_validate_binary_search_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 -| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 #### Udemy Trie and Heap | | | | | | | |-|-|-|-|-|-|- -| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 +| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 #### Udemy Graph @@ -882,12 +777,12 @@ |-|-|-|-|-|-|- | 0139 |Word Break| [Java](src/main/java/g0101_0200/s0139_word_break) [Kotlin](src/main/kotlin/g0101_0200/s0139_word_break) [TypeScript](src/main/ts/g0101_0200/s0139_word_break) [Scala](src/main/scala/g0101_0200/s0139_word_break) [Ruby](src/main/ruby/g0101_0200/s0139_word_break) [PHP](src/main/php/g0101_0200/s0139_word_break) [C#](src/main/csharp/g0101_0200/s0139_word_break) [Go](src/main/go/g0101_0200/s0139_word_break) [Cpp](src/main/cpp/g0101_0200/s0139_word_break) [Python](src/main/python/g0101_0200/s0139_word_break) [Swift](src/main/swift/g0101_0200/s0139_word_break) [Elixir](src/main/elixir/g0101_0200/s0139_word_break) [Rust](src/main/rust/g0101_0200/s0139_word_break) [Dart](src/main/dart/g0101_0200/s0139_word_break) [C](src/main/c/g0101_0200/s0139_word_break) [JavaScript](src/main/js/g0101_0200/s0139_word_break) [Erlang](src/main/erlang/g0101_0200/s0139_word_break) [Racket](src/main/racket/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) | 1 | 99.42 | 0152 |Maximum Product Subarray| [Java](src/main/java/g0101_0200/s0152_maximum_product_subarray) [Kotlin](src/main/kotlin/g0101_0200/s0152_maximum_product_subarray) [TypeScript](src/main/ts/g0101_0200/s0152_maximum_product_subarray) [Scala](src/main/scala/g0101_0200/s0152_maximum_product_subarray) [Ruby](src/main/ruby/g0101_0200/s0152_maximum_product_subarray) [PHP](src/main/php/g0101_0200/s0152_maximum_product_subarray) [C#](src/main/csharp/g0101_0200/s0152_maximum_product_subarray) [Go](src/main/go/g0101_0200/s0152_maximum_product_subarray) [Cpp](src/main/cpp/g0101_0200/s0152_maximum_product_subarray) [Python](src/main/python/g0101_0200/s0152_maximum_product_subarray) [Swift](src/main/swift/g0101_0200/s0152_maximum_product_subarray) [Elixir](src/main/elixir/g0101_0200/s0152_maximum_product_subarray) [Rust](src/main/rust/g0101_0200/s0152_maximum_product_subarray) [Dart](src/main/dart/g0101_0200/s0152_maximum_product_subarray) [C](src/main/c/g0101_0200/s0152_maximum_product_subarray) [JavaScript](src/main/js/g0101_0200/s0152_maximum_product_subarray) [Erlang](src/main/erlang/g0101_0200/s0152_maximum_product_subarray) [Racket](src/main/racket/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 | 92.74 -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/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 | 0070 |Climbing Stairs| [Java](src/main/java/g0001_0100/s0070_climbing_stairs) [Kotlin](src/main/kotlin/g0001_0100/s0070_climbing_stairs) [TypeScript](src/main/ts/g0001_0100/s0070_climbing_stairs) [Scala](src/main/scala/g0001_0100/s0070_climbing_stairs) [Ruby](src/main/ruby/g0001_0100/s0070_climbing_stairs) [PHP](src/main/php/g0001_0100/s0070_climbing_stairs) [C#](src/main/csharp/g0001_0100/s0070_climbing_stairs) [Go](src/main/go/g0001_0100/s0070_climbing_stairs) [Cpp](src/main/cpp/g0001_0100/s0070_climbing_stairs) [Python](src/main/python/g0001_0100/s0070_climbing_stairs) [Swift](src/main/swift/g0001_0100/s0070_climbing_stairs) [Elixir](src/main/elixir/g0001_0100/s0070_climbing_stairs) [Rust](src/main/rust/g0001_0100/s0070_climbing_stairs) [Dart](src/main/dart/g0001_0100/s0070_climbing_stairs) [C](src/main/c/g0001_0100/s0070_climbing_stairs) [JavaScript](src/main/js/g0001_0100/s0070_climbing_stairs) [Erlang](src/main/erlang/g0001_0100/s0070_climbing_stairs) [Racket](src/main/racket/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 | 0064 |Minimum Path Sum| [Java](src/main/java/g0001_0100/s0064_minimum_path_sum) [Kotlin](src/main/kotlin/g0001_0100/s0064_minimum_path_sum) [TypeScript](src/main/ts/g0001_0100/s0064_minimum_path_sum) [Scala](src/main/scala/g0001_0100/s0064_minimum_path_sum) [Ruby](src/main/ruby/g0001_0100/s0064_minimum_path_sum) [PHP](src/main/php/g0001_0100/s0064_minimum_path_sum) [C#](src/main/csharp/g0001_0100/s0064_minimum_path_sum) [Go](src/main/go/g0001_0100/s0064_minimum_path_sum) [Cpp](src/main/cpp/g0001_0100/s0064_minimum_path_sum) [Python](src/main/python/g0001_0100/s0064_minimum_path_sum) [Swift](src/main/swift/g0001_0100/s0064_minimum_path_sum) [Elixir](src/main/elixir/g0001_0100/s0064_minimum_path_sum) [Rust](src/main/rust/g0001_0100/s0064_minimum_path_sum) [Dart](src/main/dart/g0001_0100/s0064_minimum_path_sum) [C](src/main/c/g0001_0100/s0064_minimum_path_sum) [JavaScript](src/main/js/g0001_0100/s0064_minimum_path_sum) [Erlang](src/main/erlang/g0001_0100/s0064_minimum_path_sum) [Racket](src/main/racket/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) | 1 | 99.73 | 0300 |Longest Increasing Subsequence| [Java](src/main/java/g0201_0300/s0300_longest_increasing_subsequence) [Kotlin](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence) [TypeScript](src/main/ts/g0201_0300/s0300_longest_increasing_subsequence) [Scala](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence) [Ruby](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence) [PHP](src/main/php/g0201_0300/s0300_longest_increasing_subsequence) [C#](src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence) [Go](src/main/go/g0201_0300/s0300_longest_increasing_subsequence) [Cpp](src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence) [Python](src/main/python/g0201_0300/s0300_longest_increasing_subsequence) [Swift](src/main/swift/g0201_0300/s0300_longest_increasing_subsequence) [Elixir](src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence) [Rust](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence) [Dart](src/main/dart/g0201_0300/s0300_longest_increasing_subsequence) [C](src/main/c/g0201_0300/s0300_longest_increasing_subsequence) [JavaScript](src/main/js/g0201_0300/s0300_longest_increasing_subsequence) [Erlang](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence) [Racket](src/main/racket/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) | 3 | 95.75 -| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 -| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/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) | 19 | 89.05 +| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/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) | 3 | 97.19 | 0010 |Regular Expression Matching| [Java](src/main/java/g0001_0100/s0010_regular_expression_matching) [Kotlin](src/main/kotlin/g0001_0100/s0010_regular_expression_matching) [TypeScript](src/main/ts/g0001_0100/s0010_regular_expression_matching) [Scala](src/main/scala/g0001_0100/s0010_regular_expression_matching) [Ruby](src/main/ruby/g0001_0100/s0010_regular_expression_matching) [PHP](src/main/php/g0001_0100/s0010_regular_expression_matching) [C#](src/main/csharp/g0001_0100/s0010_regular_expression_matching) [Go](src/main/go/g0001_0100/s0010_regular_expression_matching) [Cpp](src/main/cpp/g0001_0100/s0010_regular_expression_matching) [Python](src/main/python/g0001_0100/s0010_regular_expression_matching) [Swift](src/main/swift/g0001_0100/s0010_regular_expression_matching) [Elixir](src/main/elixir/g0001_0100/s0010_regular_expression_matching) [Rust](src/main/rust/g0001_0100/s0010_regular_expression_matching) [Dart](src/main/dart/g0001_0100/s0010_regular_expression_matching) [C](src/main/c/g0001_0100/s0010_regular_expression_matching) [JavaScript](src/main/js/g0001_0100/s0010_regular_expression_matching) [Erlang](src/main/erlang/g0001_0100/s0010_regular_expression_matching) [Racket](src/main/racket/g0001_0100/s0010_regular_expression_matching)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 100.00 #### Udemy Backtracking/Recursion @@ -897,14 +792,14 @@ | 0022 |Generate Parentheses| [Java](src/main/java/g0001_0100/s0022_generate_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0022_generate_parentheses) [TypeScript](src/main/ts/g0001_0100/s0022_generate_parentheses) [Scala](src/main/scala/g0001_0100/s0022_generate_parentheses) [Ruby](src/main/ruby/g0001_0100/s0022_generate_parentheses) [PHP](src/main/php/g0001_0100/s0022_generate_parentheses) [C#](src/main/csharp/g0001_0100/s0022_generate_parentheses) [Go](src/main/go/g0001_0100/s0022_generate_parentheses) [Cpp](src/main/cpp/g0001_0100/s0022_generate_parentheses) [Python](src/main/python/g0001_0100/s0022_generate_parentheses) [Swift](src/main/swift/g0001_0100/s0022_generate_parentheses) [Elixir](src/main/elixir/g0001_0100/s0022_generate_parentheses) [Rust](src/main/rust/g0001_0100/s0022_generate_parentheses) [Dart](src/main/dart/g0001_0100/s0022_generate_parentheses) [C](src/main/c/g0001_0100/s0022_generate_parentheses) [JavaScript](src/main/js/g0001_0100/s0022_generate_parentheses) [Erlang](src/main/erlang/g0001_0100/s0022_generate_parentheses) [Racket](src/main/racket/g0001_0100/s0022_generate_parentheses)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 | 0039 |Combination Sum| [Java](src/main/java/g0001_0100/s0039_combination_sum) [Kotlin](src/main/kotlin/g0001_0100/s0039_combination_sum) [TypeScript](src/main/ts/g0001_0100/s0039_combination_sum) [Scala](src/main/scala/g0001_0100/s0039_combination_sum) [Ruby](src/main/ruby/g0001_0100/s0039_combination_sum) [PHP](src/main/php/g0001_0100/s0039_combination_sum) [C#](src/main/csharp/g0001_0100/s0039_combination_sum) [Go](src/main/go/g0001_0100/s0039_combination_sum) [Cpp](src/main/cpp/g0001_0100/s0039_combination_sum) [Python](src/main/python/g0001_0100/s0039_combination_sum) [Swift](src/main/swift/g0001_0100/s0039_combination_sum) [Elixir](src/main/elixir/g0001_0100/s0039_combination_sum) [Rust](src/main/rust/g0001_0100/s0039_combination_sum) [Dart](src/main/dart/g0001_0100/s0039_combination_sum) [C](src/main/c/g0001_0100/s0039_combination_sum) [JavaScript](src/main/js/g0001_0100/s0039_combination_sum) [Erlang](src/main/erlang/g0001_0100/s0039_combination_sum) [Racket](src/main/racket/g0001_0100/s0039_combination_sum)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 | 0078 |Subsets| [Java](src/main/java/g0001_0100/s0078_subsets) [Kotlin](src/main/kotlin/g0001_0100/s0078_subsets) [TypeScript](src/main/ts/g0001_0100/s0078_subsets) [Scala](src/main/scala/g0001_0100/s0078_subsets) [Ruby](src/main/ruby/g0001_0100/s0078_subsets) [PHP](src/main/php/g0001_0100/s0078_subsets) [C#](src/main/csharp/g0001_0100/s0078_subsets) [Go](src/main/go/g0001_0100/s0078_subsets) [Cpp](src/main/cpp/g0001_0100/s0078_subsets) [Python](src/main/python/g0001_0100/s0078_subsets) [Swift](src/main/swift/g0001_0100/s0078_subsets) [Elixir](src/main/elixir/g0001_0100/s0078_subsets) [Rust](src/main/rust/g0001_0100/s0078_subsets) [Dart](src/main/dart/g0001_0100/s0078_subsets) [C](src/main/c/g0001_0100/s0078_subsets) [JavaScript](src/main/js/g0001_0100/s0078_subsets) [Erlang](src/main/erlang/g0001_0100/s0078_subsets) [Racket](src/main/racket/g0001_0100/s0078_subsets)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 0 | 100.00 -| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0046 |Permutations| [Java](src/main/java/g0001_0100/s0046_permutations) [Kotlin](src/main/kotlin/g0001_0100/s0046_permutations) [TypeScript](src/main/ts/g0001_0100/s0046_permutations) [Scala](src/main/scala/g0001_0100/s0046_permutations) [Ruby](src/main/ruby/g0001_0100/s0046_permutations) [PHP](src/main/php/g0001_0100/s0046_permutations) [C#](src/main/csharp/g0001_0100/s0046_permutations) [Go](src/main/go/g0001_0100/s0046_permutations) [Cpp](src/main/cpp/g0001_0100/s0046_permutations) [Python](src/main/python/g0001_0100/s0046_permutations) [Swift](src/main/swift/g0001_0100/s0046_permutations) [Elixir](src/main/elixir/g0001_0100/s0046_permutations) [Rust](src/main/rust/g0001_0100/s0046_permutations) [Dart](src/main/dart/g0001_0100/s0046_permutations) [C](src/main/c/g0001_0100/s0046_permutations) [JavaScript](src/main/js/g0001_0100/s0046_permutations) [Erlang](src/main/erlang/g0001_0100/s0046_permutations) [Racket](src/main/racket/g0001_0100/s0046_permutations)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08 #### Udemy Bit Manipulation | | | | | | | |-|-|-|-|-|-|- -| 0338 |Counting Bits| [Java](src/main/java/g0301_0400/s0338_counting_bits) [Kotlin](src/main/kotlin/g0301_0400/s0338_counting_bits) [TypeScript](src/main/ts/g0301_0400/s0338_counting_bits) [Scala](src/main/scala/g0301_0400/s0338_counting_bits) [Ruby](src/main/ruby/g0301_0400/s0338_counting_bits) [PHP](src/main/php/g0301_0400/s0338_counting_bits) [C#](src/main/csharp/g0301_0400/s0338_counting_bits) [Go](src/main/go/g0301_0400/s0338_counting_bits) [Cpp](src/main/cpp/g0301_0400/s0338_counting_bits) [Python](src/main/python/g0301_0400/s0338_counting_bits) [Swift](src/main/swift/g0301_0400/s0338_counting_bits) [Elixir](src/main/elixir/g0301_0400/s0338_counting_bits) [Rust](src/main/rust/g0301_0400/s0338_counting_bits) [Dart](src/main/dart/g0301_0400/s0338_counting_bits) [C](src/main/c/g0301_0400/s0338_counting_bits) [JavaScript](src/main/js/g0301_0400/s0338_counting_bits) [Erlang](src/main/erlang/g0301_0400/s0338_counting_bits) [Racket](src/main/racket/g0301_0400/s0338_counting_bits)| Easy | Dynamic_Programming, Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 +| 0338 |Counting Bits| [Java](src/main/java/g0301_0400/s0338_counting_bits) [Kotlin](src/main/kotlin/g0301_0400/s0338_counting_bits) [TypeScript](src/main/ts/g0301_0400/s0338_counting_bits) [Scala](src/main/scala/g0301_0400/s0338_counting_bits) [Ruby](src/main/ruby/g0301_0400/s0338_counting_bits) [PHP](src/main/php/g0301_0400/s0338_counting_bits) [C#](src/main/csharp/g0301_0400/s0338_counting_bits) [Go](src/main/go/g0301_0400/s0338_counting_bits) [Cpp](src/main/cpp/g0301_0400/s0338_counting_bits) [Python](src/main/python/g0301_0400/s0338_counting_bits) [Swift](src/main/swift/g0301_0400/s0338_counting_bits) [Elixir](src/main/elixir/g0301_0400/s0338_counting_bits) [Rust](src/main/rust/g0301_0400/s0338_counting_bits) [Dart](src/main/dart/g0301_0400/s0338_counting_bits) [C](src/main/c/g0301_0400/s0338_counting_bits) [JavaScript](src/main/js/g0301_0400/s0338_counting_bits) [Erlang](src/main/erlang/g0301_0400/s0338_counting_bits) [Racket](src/main/racket/g0301_0400/s0338_counting_bits)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 #### Udemy Design @@ -923,7 +818,7 @@ | 0121 |Best Time to Buy and Sell Stock| [Java](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Kotlin](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [TypeScript](src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Scala](src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Ruby](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [PHP](src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C#](src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Go](src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Cpp](src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Python](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Swift](src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Elixir](src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Rust](src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Dart](src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C](src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [JavaScript](src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Erlang](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Racket](src/main/racket/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) | 1 | 99.78 | 0055 |Jump Game| [Java](src/main/java/g0001_0100/s0055_jump_game) [Kotlin](src/main/kotlin/g0001_0100/s0055_jump_game) [TypeScript](src/main/ts/g0001_0100/s0055_jump_game) [Scala](src/main/scala/g0001_0100/s0055_jump_game) [Ruby](src/main/ruby/g0001_0100/s0055_jump_game) [PHP](src/main/php/g0001_0100/s0055_jump_game) [C#](src/main/csharp/g0001_0100/s0055_jump_game) [Go](src/main/go/g0001_0100/s0055_jump_game) [Cpp](src/main/cpp/g0001_0100/s0055_jump_game) [Python](src/main/python/g0001_0100/s0055_jump_game) [Swift](src/main/swift/g0001_0100/s0055_jump_game) [Elixir](src/main/elixir/g0001_0100/s0055_jump_game) [Rust](src/main/rust/g0001_0100/s0055_jump_game) [Dart](src/main/dart/g0001_0100/s0055_jump_game) [C](src/main/c/g0001_0100/s0055_jump_game) [JavaScript](src/main/js/g0001_0100/s0055_jump_game) [Erlang](src/main/erlang/g0001_0100/s0055_jump_game) [Racket](src/main/racket/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) | 1 | 100.00 | 0045 |Jump Game II| [Java](src/main/java/g0001_0100/s0045_jump_game_ii) [Kotlin](src/main/kotlin/g0001_0100/s0045_jump_game_ii) [TypeScript](src/main/ts/g0001_0100/s0045_jump_game_ii) [Scala](src/main/scala/g0001_0100/s0045_jump_game_ii) [Ruby](src/main/ruby/g0001_0100/s0045_jump_game_ii) [PHP](src/main/php/g0001_0100/s0045_jump_game_ii) [C#](src/main/csharp/g0001_0100/s0045_jump_game_ii) [Go](src/main/go/g0001_0100/s0045_jump_game_ii) [Cpp](src/main/cpp/g0001_0100/s0045_jump_game_ii) [Python](src/main/python/g0001_0100/s0045_jump_game_ii) [Swift](src/main/swift/g0001_0100/s0045_jump_game_ii) [Elixir](src/main/elixir/g0001_0100/s0045_jump_game_ii) [Rust](src/main/rust/g0001_0100/s0045_jump_game_ii) [Dart](src/main/dart/g0001_0100/s0045_jump_game_ii) [C](src/main/c/g0001_0100/s0045_jump_game_ii) [JavaScript](src/main/js/g0001_0100/s0045_jump_game_ii) [Erlang](src/main/erlang/g0001_0100/s0045_jump_game_ii) [Racket](src/main/racket/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 -| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 0042 |Trapping Rain Water| [Java](src/main/java/g0001_0100/s0042_trapping_rain_water) [Kotlin](src/main/kotlin/g0001_0100/s0042_trapping_rain_water) [TypeScript](src/main/ts/g0001_0100/s0042_trapping_rain_water) [Scala](src/main/scala/g0001_0100/s0042_trapping_rain_water) [Ruby](src/main/ruby/g0001_0100/s0042_trapping_rain_water) [PHP](src/main/php/g0001_0100/s0042_trapping_rain_water) [C#](src/main/csharp/g0001_0100/s0042_trapping_rain_water) [Go](src/main/go/g0001_0100/s0042_trapping_rain_water) [Cpp](src/main/cpp/g0001_0100/s0042_trapping_rain_water) [Python](src/main/python/g0001_0100/s0042_trapping_rain_water) [Swift](src/main/swift/g0001_0100/s0042_trapping_rain_water) [Elixir](src/main/elixir/g0001_0100/s0042_trapping_rain_water) [Rust](src/main/rust/g0001_0100/s0042_trapping_rain_water) [Dart](src/main/dart/g0001_0100/s0042_trapping_rain_water) [C](src/main/c/g0001_0100/s0042_trapping_rain_water) [JavaScript](src/main/js/g0001_0100/s0042_trapping_rain_water) [Erlang](src/main/erlang/g0001_0100/s0042_trapping_rain_water) [Racket](src/main/racket/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 | 0006 |Zigzag Conversion| [Java](src/main/java/g0001_0100/s0006_zigzag_conversion) [Kotlin](src/main/kotlin/g0001_0100/s0006_zigzag_conversion) [TypeScript](src/main/ts/g0001_0100/s0006_zigzag_conversion) [Scala](src/main/scala/g0001_0100/s0006_zigzag_conversion) [Ruby](src/main/ruby/g0001_0100/s0006_zigzag_conversion) [PHP](src/main/php/g0001_0100/s0006_zigzag_conversion) [C#](src/main/csharp/g0001_0100/s0006_zigzag_conversion) [Go](src/main/go/g0001_0100/s0006_zigzag_conversion) [Cpp](src/main/cpp/g0001_0100/s0006_zigzag_conversion) [Python](src/main/python/g0001_0100/s0006_zigzag_conversion) [Swift](src/main/swift/g0001_0100/s0006_zigzag_conversion) [Elixir](src/main/elixir/g0001_0100/s0006_zigzag_conversion) [Rust](src/main/rust/g0001_0100/s0006_zigzag_conversion) [Dart](src/main/dart/g0001_0100/s0006_zigzag_conversion) [C](src/main/c/g0001_0100/s0006_zigzag_conversion) [JavaScript](src/main/js/g0001_0100/s0006_zigzag_conversion) [Erlang](src/main/erlang/g0001_0100/s0006_zigzag_conversion) [Racket](src/main/racket/g0001_0100/s0006_zigzag_conversion)| Medium | String | 2 | 99.71 @@ -931,7 +826,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 | 0015 |3Sum| [Java](src/main/java/g0001_0100/s0015_3sum) [Kotlin](src/main/kotlin/g0001_0100/s0015_3sum) [TypeScript](src/main/ts/g0001_0100/s0015_3sum) [Scala](src/main/scala/g0001_0100/s0015_3sum) [Ruby](src/main/ruby/g0001_0100/s0015_3sum) [PHP](src/main/php/g0001_0100/s0015_3sum) [C#](src/main/csharp/g0001_0100/s0015_3sum) [Go](src/main/go/g0001_0100/s0015_3sum) [Cpp](src/main/cpp/g0001_0100/s0015_3sum) [Python](src/main/python/g0001_0100/s0015_3sum) [Swift](src/main/swift/g0001_0100/s0015_3sum) [Elixir](src/main/elixir/g0001_0100/s0015_3sum) [Rust](src/main/rust/g0001_0100/s0015_3sum) [Dart](src/main/dart/g0001_0100/s0015_3sum) [C](src/main/c/g0001_0100/s0015_3sum) [JavaScript](src/main/js/g0001_0100/s0015_3sum) [Erlang](src/main/erlang/g0001_0100/s0015_3sum) [Racket](src/main/racket/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02 #### Top Interview 150 Sliding Window @@ -985,13 +880,13 @@ | | | | | | | |-|-|-|-|-|-|- -| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 +| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 | 0226 |Invert Binary Tree| [Java](src/main/java/g0201_0300/s0226_invert_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0226_invert_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0226_invert_binary_tree) [Scala](src/main/scala/g0201_0300/s0226_invert_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0226_invert_binary_tree) [PHP](src/main/php/g0201_0300/s0226_invert_binary_tree) [C#](src/main/csharp/g0201_0300/s0226_invert_binary_tree) [Go](src/main/go/g0201_0300/s0226_invert_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0226_invert_binary_tree) [Python](src/main/python/g0201_0300/s0226_invert_binary_tree) [Swift](src/main/swift/g0201_0300/s0226_invert_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0226_invert_binary_tree) [Rust](src/main/rust/g0201_0300/s0226_invert_binary_tree) [Dart](src/main/dart/g0201_0300/s0226_invert_binary_tree) [C](src/main/c/g0201_0300/s0226_invert_binary_tree) [JavaScript](src/main/js/g0201_0300/s0226_invert_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0226_invert_binary_tree) [Racket](src/main/racket/g0201_0300/s0226_invert_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0101 |Symmetric Tree| [Java](src/main/java/g0101_0200/s0101_symmetric_tree) [Kotlin](src/main/kotlin/g0101_0200/s0101_symmetric_tree) [TypeScript](src/main/ts/g0101_0200/s0101_symmetric_tree) [Scala](src/main/scala/g0101_0200/s0101_symmetric_tree) [Ruby](src/main/ruby/g0101_0200/s0101_symmetric_tree) [PHP](src/main/php/g0101_0200/s0101_symmetric_tree) [C#](src/main/csharp/g0101_0200/s0101_symmetric_tree) [Go](src/main/go/g0101_0200/s0101_symmetric_tree) [Cpp](src/main/cpp/g0101_0200/s0101_symmetric_tree) [Python](src/main/python/g0101_0200/s0101_symmetric_tree) [Swift](src/main/swift/g0101_0200/s0101_symmetric_tree) [Elixir](src/main/elixir/g0101_0200/s0101_symmetric_tree) [Rust](src/main/rust/g0101_0200/s0101_symmetric_tree) [Dart](src/main/dart/g0101_0200/s0101_symmetric_tree) [C](src/main/c/g0101_0200/s0101_symmetric_tree) [JavaScript](src/main/js/g0101_0200/s0101_symmetric_tree) [Erlang](src/main/erlang/g0101_0200/s0101_symmetric_tree) [Racket](src/main/racket/g0101_0200/s0101_symmetric_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 | 0105 |Construct Binary Tree from Preorder and Inorder Traversal| [Java](src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Kotlin](src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [TypeScript](src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Scala](src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Ruby](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [PHP](src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [C#](src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Go](src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Cpp](src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Python](src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Swift](src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Elixir](src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Rust](src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Dart](src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [C](src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [JavaScript](src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Erlang](src/main/erlang/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Racket](src/main/racket/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Big_O_Time_O(N)_Space_O(N) | 1 | 96.33 | 0114 |Flatten Binary Tree to Linked List| [Java](src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Kotlin](src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [TypeScript](src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Scala](src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Ruby](src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [PHP](src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [C#](src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Go](src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Cpp](src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Python](src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Swift](src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Elixir](src/main/elixir/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Rust](src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Dart](src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [C](src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [JavaScript](src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Erlang](src/main/erlang/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Racket](src/main/racket/g0101_0200/s0114_flatten_binary_tree_to_linked_list)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0124 |Binary Tree Maximum Path Sum| [Java](src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum) [Kotlin](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum) [TypeScript](src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum) [Scala](src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum) [Ruby](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum) [PHP](src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum) [C#](src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Go](src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum) [Cpp](src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Python](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum) [Swift](src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum) [Elixir](src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum) [Rust](src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum) [Dart](src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum) [C](src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum) [JavaScript](src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum) [Erlang](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum) [Racket](src/main/racket/g0101_0200/s0124_binary_tree_maximum_path_sum)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 -| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 #### Top Interview 150 Binary Tree BFS @@ -1022,13 +917,13 @@ | | | | | | | |-|-|-|-|-|-|- -| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 +| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 #### Top Interview 150 Backtracking | | | | | | | |-|-|-|-|-|-|- -| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0046 |Permutations| [Java](src/main/java/g0001_0100/s0046_permutations) [Kotlin](src/main/kotlin/g0001_0100/s0046_permutations) [TypeScript](src/main/ts/g0001_0100/s0046_permutations) [Scala](src/main/scala/g0001_0100/s0046_permutations) [Ruby](src/main/ruby/g0001_0100/s0046_permutations) [PHP](src/main/php/g0001_0100/s0046_permutations) [C#](src/main/csharp/g0001_0100/s0046_permutations) [Go](src/main/go/g0001_0100/s0046_permutations) [Cpp](src/main/cpp/g0001_0100/s0046_permutations) [Python](src/main/python/g0001_0100/s0046_permutations) [Swift](src/main/swift/g0001_0100/s0046_permutations) [Elixir](src/main/elixir/g0001_0100/s0046_permutations) [Rust](src/main/rust/g0001_0100/s0046_permutations) [Dart](src/main/dart/g0001_0100/s0046_permutations) [C](src/main/c/g0001_0100/s0046_permutations) [JavaScript](src/main/js/g0001_0100/s0046_permutations) [Erlang](src/main/erlang/g0001_0100/s0046_permutations) [Racket](src/main/racket/g0001_0100/s0046_permutations)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08 | 0039 |Combination Sum| [Java](src/main/java/g0001_0100/s0039_combination_sum) [Kotlin](src/main/kotlin/g0001_0100/s0039_combination_sum) [TypeScript](src/main/ts/g0001_0100/s0039_combination_sum) [Scala](src/main/scala/g0001_0100/s0039_combination_sum) [Ruby](src/main/ruby/g0001_0100/s0039_combination_sum) [PHP](src/main/php/g0001_0100/s0039_combination_sum) [C#](src/main/csharp/g0001_0100/s0039_combination_sum) [Go](src/main/go/g0001_0100/s0039_combination_sum) [Cpp](src/main/cpp/g0001_0100/s0039_combination_sum) [Python](src/main/python/g0001_0100/s0039_combination_sum) [Swift](src/main/swift/g0001_0100/s0039_combination_sum) [Elixir](src/main/elixir/g0001_0100/s0039_combination_sum) [Rust](src/main/rust/g0001_0100/s0039_combination_sum) [Dart](src/main/dart/g0001_0100/s0039_combination_sum) [C](src/main/c/g0001_0100/s0039_combination_sum) [JavaScript](src/main/js/g0001_0100/s0039_combination_sum) [Erlang](src/main/erlang/g0001_0100/s0039_combination_sum) [Racket](src/main/racket/g0001_0100/s0039_combination_sum)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 | 0022 |Generate Parentheses| [Java](src/main/java/g0001_0100/s0022_generate_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0022_generate_parentheses) [TypeScript](src/main/ts/g0001_0100/s0022_generate_parentheses) [Scala](src/main/scala/g0001_0100/s0022_generate_parentheses) [Ruby](src/main/ruby/g0001_0100/s0022_generate_parentheses) [PHP](src/main/php/g0001_0100/s0022_generate_parentheses) [C#](src/main/csharp/g0001_0100/s0022_generate_parentheses) [Go](src/main/go/g0001_0100/s0022_generate_parentheses) [Cpp](src/main/cpp/g0001_0100/s0022_generate_parentheses) [Python](src/main/python/g0001_0100/s0022_generate_parentheses) [Swift](src/main/swift/g0001_0100/s0022_generate_parentheses) [Elixir](src/main/elixir/g0001_0100/s0022_generate_parentheses) [Rust](src/main/rust/g0001_0100/s0022_generate_parentheses) [Dart](src/main/dart/g0001_0100/s0022_generate_parentheses) [C](src/main/c/g0001_0100/s0022_generate_parentheses) [JavaScript](src/main/js/g0001_0100/s0022_generate_parentheses) [Erlang](src/main/erlang/g0001_0100/s0022_generate_parentheses) [Racket](src/main/racket/g0001_0100/s0022_generate_parentheses)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 @@ -1062,14 +957,14 @@ | | | | | | | |-|-|-|-|-|-|- -| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 +| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 | 0295 |Find Median from Data Stream| [Java](src/main/java/g0201_0300/s0295_find_median_from_data_stream) [Kotlin](src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream) [TypeScript](src/main/ts/g0201_0300/s0295_find_median_from_data_stream) [Scala](src/main/scala/g0201_0300/s0295_find_median_from_data_stream) [Ruby](src/main/ruby/g0201_0300/s0295_find_median_from_data_stream) [PHP](src/main/php/g0201_0300/s0295_find_median_from_data_stream) [C#](src/main/csharp/g0201_0300/s0295_find_median_from_data_stream) [Go](src/main/go/g0201_0300/s0295_find_median_from_data_stream) [Cpp](src/main/cpp/g0201_0300/s0295_find_median_from_data_stream) [Python](src/main/python/g0201_0300/s0295_find_median_from_data_stream) [Swift](src/main/swift/g0201_0300/s0295_find_median_from_data_stream) [Elixir](src/main/elixir/g0201_0300/s0295_find_median_from_data_stream) [Rust](src/main/rust/g0201_0300/s0295_find_median_from_data_stream) [Dart](src/main/dart/g0201_0300/s0295_find_median_from_data_stream) [C](src/main/c/g0201_0300/s0295_find_median_from_data_stream) [JavaScript](src/main/js/g0201_0300/s0295_find_median_from_data_stream) [Erlang](src/main/erlang/g0201_0300/s0295_find_median_from_data_stream) [Racket](src/main/racket/g0201_0300/s0295_find_median_from_data_stream)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 83 | 99.56 #### Top Interview 150 Bit Manipulation | | | | | | | |-|-|-|-|-|-|- -| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 #### Top Interview 150 Math @@ -1082,7 +977,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0070 |Climbing Stairs| [Java](src/main/java/g0001_0100/s0070_climbing_stairs) [Kotlin](src/main/kotlin/g0001_0100/s0070_climbing_stairs) [TypeScript](src/main/ts/g0001_0100/s0070_climbing_stairs) [Scala](src/main/scala/g0001_0100/s0070_climbing_stairs) [Ruby](src/main/ruby/g0001_0100/s0070_climbing_stairs) [PHP](src/main/php/g0001_0100/s0070_climbing_stairs) [C#](src/main/csharp/g0001_0100/s0070_climbing_stairs) [Go](src/main/go/g0001_0100/s0070_climbing_stairs) [Cpp](src/main/cpp/g0001_0100/s0070_climbing_stairs) [Python](src/main/python/g0001_0100/s0070_climbing_stairs) [Swift](src/main/swift/g0001_0100/s0070_climbing_stairs) [Elixir](src/main/elixir/g0001_0100/s0070_climbing_stairs) [Rust](src/main/rust/g0001_0100/s0070_climbing_stairs) [Dart](src/main/dart/g0001_0100/s0070_climbing_stairs) [C](src/main/c/g0001_0100/s0070_climbing_stairs) [JavaScript](src/main/js/g0001_0100/s0070_climbing_stairs) [Erlang](src/main/erlang/g0001_0100/s0070_climbing_stairs) [Racket](src/main/racket/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 -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/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 | 0139 |Word Break| [Java](src/main/java/g0101_0200/s0139_word_break) [Kotlin](src/main/kotlin/g0101_0200/s0139_word_break) [TypeScript](src/main/ts/g0101_0200/s0139_word_break) [Scala](src/main/scala/g0101_0200/s0139_word_break) [Ruby](src/main/ruby/g0101_0200/s0139_word_break) [PHP](src/main/php/g0101_0200/s0139_word_break) [C#](src/main/csharp/g0101_0200/s0139_word_break) [Go](src/main/go/g0101_0200/s0139_word_break) [Cpp](src/main/cpp/g0101_0200/s0139_word_break) [Python](src/main/python/g0101_0200/s0139_word_break) [Swift](src/main/swift/g0101_0200/s0139_word_break) [Elixir](src/main/elixir/g0101_0200/s0139_word_break) [Rust](src/main/rust/g0101_0200/s0139_word_break) [Dart](src/main/dart/g0101_0200/s0139_word_break) [C](src/main/c/g0101_0200/s0139_word_break) [JavaScript](src/main/js/g0101_0200/s0139_word_break) [Erlang](src/main/erlang/g0101_0200/s0139_word_break) [Racket](src/main/racket/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) | 1 | 99.42 | 0322 |Coin Change| [Java](src/main/java/g0301_0400/s0322_coin_change) [Kotlin](src/main/kotlin/g0301_0400/s0322_coin_change) [TypeScript](src/main/ts/g0301_0400/s0322_coin_change) [Scala](src/main/scala/g0301_0400/s0322_coin_change) [Ruby](src/main/ruby/g0301_0400/s0322_coin_change) [PHP](src/main/php/g0301_0400/s0322_coin_change) [C#](src/main/csharp/g0301_0400/s0322_coin_change) [Go](src/main/go/g0301_0400/s0322_coin_change) [Cpp](src/main/cpp/g0301_0400/s0322_coin_change) [Python](src/main/python/g0301_0400/s0322_coin_change) [Swift](src/main/swift/g0301_0400/s0322_coin_change) [Elixir](src/main/elixir/g0301_0400/s0322_coin_change) [Rust](src/main/rust/g0301_0400/s0322_coin_change) [Dart](src/main/dart/g0301_0400/s0322_coin_change) [C](src/main/c/g0301_0400/s0322_coin_change) [JavaScript](src/main/js/g0301_0400/s0322_coin_change) [Erlang](src/main/erlang/g0301_0400/s0322_coin_change) [Racket](src/main/racket/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) | 12 | 92.59 | 0300 |Longest Increasing Subsequence| [Java](src/main/java/g0201_0300/s0300_longest_increasing_subsequence) [Kotlin](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence) [TypeScript](src/main/ts/g0201_0300/s0300_longest_increasing_subsequence) [Scala](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence) [Ruby](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence) [PHP](src/main/php/g0201_0300/s0300_longest_increasing_subsequence) [C#](src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence) [Go](src/main/go/g0201_0300/s0300_longest_increasing_subsequence) [Cpp](src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence) [Python](src/main/python/g0201_0300/s0300_longest_increasing_subsequence) [Swift](src/main/swift/g0201_0300/s0300_longest_increasing_subsequence) [Elixir](src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence) [Rust](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence) [Dart](src/main/dart/g0201_0300/s0300_longest_increasing_subsequence) [C](src/main/c/g0201_0300/s0300_longest_increasing_subsequence) [JavaScript](src/main/js/g0201_0300/s0300_longest_increasing_subsequence) [Erlang](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence) [Racket](src/main/racket/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) | 3 | 95.75 @@ -1093,7 +988,7 @@ |-|-|-|-|-|-|- | 0064 |Minimum Path Sum| [Java](src/main/java/g0001_0100/s0064_minimum_path_sum) [Kotlin](src/main/kotlin/g0001_0100/s0064_minimum_path_sum) [TypeScript](src/main/ts/g0001_0100/s0064_minimum_path_sum) [Scala](src/main/scala/g0001_0100/s0064_minimum_path_sum) [Ruby](src/main/ruby/g0001_0100/s0064_minimum_path_sum) [PHP](src/main/php/g0001_0100/s0064_minimum_path_sum) [C#](src/main/csharp/g0001_0100/s0064_minimum_path_sum) [Go](src/main/go/g0001_0100/s0064_minimum_path_sum) [Cpp](src/main/cpp/g0001_0100/s0064_minimum_path_sum) [Python](src/main/python/g0001_0100/s0064_minimum_path_sum) [Swift](src/main/swift/g0001_0100/s0064_minimum_path_sum) [Elixir](src/main/elixir/g0001_0100/s0064_minimum_path_sum) [Rust](src/main/rust/g0001_0100/s0064_minimum_path_sum) [Dart](src/main/dart/g0001_0100/s0064_minimum_path_sum) [C](src/main/c/g0001_0100/s0064_minimum_path_sum) [JavaScript](src/main/js/g0001_0100/s0064_minimum_path_sum) [Erlang](src/main/erlang/g0001_0100/s0064_minimum_path_sum) [Racket](src/main/racket/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) | 1 | 99.73 | 0005 |Longest Palindromic Substring| [Java](src/main/java/g0001_0100/s0005_longest_palindromic_substring) [Kotlin](src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring) [TypeScript](src/main/ts/g0001_0100/s0005_longest_palindromic_substring) [Scala](src/main/scala/g0001_0100/s0005_longest_palindromic_substring) [Ruby](src/main/ruby/g0001_0100/s0005_longest_palindromic_substring) [PHP](src/main/php/g0001_0100/s0005_longest_palindromic_substring) [C#](src/main/csharp/g0001_0100/s0005_longest_palindromic_substring) [Go](src/main/go/g0001_0100/s0005_longest_palindromic_substring) [Cpp](src/main/cpp/g0001_0100/s0005_longest_palindromic_substring) [Python](src/main/python/g0001_0100/s0005_longest_palindromic_substring) [Swift](src/main/swift/g0001_0100/s0005_longest_palindromic_substring) [Elixir](src/main/elixir/g0001_0100/s0005_longest_palindromic_substring) [Rust](src/main/rust/g0001_0100/s0005_longest_palindromic_substring) [Dart](src/main/dart/g0001_0100/s0005_longest_palindromic_substring) [C](src/main/c/g0001_0100/s0005_longest_palindromic_substring) [JavaScript](src/main/js/g0001_0100/s0005_longest_palindromic_substring) [Erlang](src/main/erlang/g0001_0100/s0005_longest_palindromic_substring) [Racket](src/main/racket/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) | 7 | 97.82 -| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/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) | 3 | 97.19 | 0221 |Maximal Square| [Java](src/main/java/g0201_0300/s0221_maximal_square) [Kotlin](src/main/kotlin/g0201_0300/s0221_maximal_square) [TypeScript](src/main/ts/g0201_0300/s0221_maximal_square) [Scala](src/main/scala/g0201_0300/s0221_maximal_square) [Ruby](src/main/ruby/g0201_0300/s0221_maximal_square) [PHP](src/main/php/g0201_0300/s0221_maximal_square) [C#](src/main/csharp/g0201_0300/s0221_maximal_square) [Go](src/main/go/g0201_0300/s0221_maximal_square) [Cpp](src/main/cpp/g0201_0300/s0221_maximal_square) [Python](src/main/python/g0201_0300/s0221_maximal_square) [Swift](src/main/swift/g0201_0300/s0221_maximal_square) [Elixir](src/main/elixir/g0201_0300/s0221_maximal_square) [Rust](src/main/rust/g0201_0300/s0221_maximal_square) [Dart](src/main/dart/g0201_0300/s0221_maximal_square) [C](src/main/c/g0201_0300/s0221_maximal_square) [JavaScript](src/main/js/g0201_0300/s0221_maximal_square) [Erlang](src/main/erlang/g0201_0300/s0221_maximal_square) [Racket](src/main/racket/g0201_0300/s0221_maximal_square)| Medium | Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 6 | 97.07 ### Data Structure I @@ -1143,7 +1038,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 #### Day 9 Stack Queue @@ -1162,7 +1057,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0102 |Binary Tree Level Order Traversal| [Java](src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal) [Kotlin](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal) [TypeScript](src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal) [Scala](src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal) [Ruby](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal) [PHP](src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal) [C#](src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal) [Go](src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal) [Cpp](src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal) [Python](src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal) [Swift](src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal) [Elixir](src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal) [Rust](src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal) [Dart](src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal) [C](src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal) [JavaScript](src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal) [Erlang](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal) [Racket](src/main/racket/g0101_0200/s0102_binary_tree_level_order_traversal)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 -| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 +| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 | 0101 |Symmetric Tree| [Java](src/main/java/g0101_0200/s0101_symmetric_tree) [Kotlin](src/main/kotlin/g0101_0200/s0101_symmetric_tree) [TypeScript](src/main/ts/g0101_0200/s0101_symmetric_tree) [Scala](src/main/scala/g0101_0200/s0101_symmetric_tree) [Ruby](src/main/ruby/g0101_0200/s0101_symmetric_tree) [PHP](src/main/php/g0101_0200/s0101_symmetric_tree) [C#](src/main/csharp/g0101_0200/s0101_symmetric_tree) [Go](src/main/go/g0101_0200/s0101_symmetric_tree) [Cpp](src/main/cpp/g0101_0200/s0101_symmetric_tree) [Python](src/main/python/g0101_0200/s0101_symmetric_tree) [Swift](src/main/swift/g0101_0200/s0101_symmetric_tree) [Elixir](src/main/elixir/g0101_0200/s0101_symmetric_tree) [Rust](src/main/rust/g0101_0200/s0101_symmetric_tree) [Dart](src/main/dart/g0101_0200/s0101_symmetric_tree) [C](src/main/c/g0101_0200/s0101_symmetric_tree) [JavaScript](src/main/js/g0101_0200/s0101_symmetric_tree) [Erlang](src/main/erlang/g0101_0200/s0101_symmetric_tree) [Racket](src/main/racket/g0101_0200/s0101_symmetric_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 #### Day 12 Tree @@ -1188,7 +1083,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0169 |Majority Element| [Java](src/main/java/g0101_0200/s0169_majority_element) [Kotlin](src/main/kotlin/g0101_0200/s0169_majority_element) [TypeScript](src/main/ts/g0101_0200/s0169_majority_element) [Scala](src/main/scala/g0101_0200/s0169_majority_element) [Ruby](src/main/ruby/g0101_0200/s0169_majority_element) [PHP](src/main/php/g0101_0200/s0169_majority_element) [C#](src/main/csharp/g0101_0200/s0169_majority_element) [Go](src/main/go/g0101_0200/s0169_majority_element) [Cpp](src/main/cpp/g0101_0200/s0169_majority_element) [Python](src/main/python/g0101_0200/s0169_majority_element) [Swift](src/main/swift/g0101_0200/s0169_majority_element) [Elixir](src/main/elixir/g0101_0200/s0169_majority_element) [Rust](src/main/rust/g0101_0200/s0169_majority_element) [Dart](src/main/dart/g0101_0200/s0169_majority_element) [C](src/main/c/g0101_0200/s0169_majority_element) [JavaScript](src/main/js/g0101_0200/s0169_majority_element) [Erlang](src/main/erlang/g0101_0200/s0169_majority_element) [Racket](src/main/racket/g0101_0200/s0169_majority_element)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 | 0015 |3Sum| [Java](src/main/java/g0001_0100/s0015_3sum) [Kotlin](src/main/kotlin/g0001_0100/s0015_3sum) [TypeScript](src/main/ts/g0001_0100/s0015_3sum) [Scala](src/main/scala/g0001_0100/s0015_3sum) [Ruby](src/main/ruby/g0001_0100/s0015_3sum) [PHP](src/main/php/g0001_0100/s0015_3sum) [C#](src/main/csharp/g0001_0100/s0015_3sum) [Go](src/main/go/g0001_0100/s0015_3sum) [Cpp](src/main/cpp/g0001_0100/s0015_3sum) [Python](src/main/python/g0001_0100/s0015_3sum) [Swift](src/main/swift/g0001_0100/s0015_3sum) [Elixir](src/main/elixir/g0001_0100/s0015_3sum) [Rust](src/main/rust/g0001_0100/s0015_3sum) [Dart](src/main/dart/g0001_0100/s0015_3sum) [C](src/main/c/g0001_0100/s0015_3sum) [JavaScript](src/main/js/g0001_0100/s0015_3sum) [Erlang](src/main/erlang/g0001_0100/s0015_3sum) [Racket](src/main/racket/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02 @@ -1215,7 +1110,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 | 0560 |Subarray Sum Equals K| [Java](src/main/java/g0501_0600/s0560_subarray_sum_equals_k) [Kotlin](src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k) [TypeScript](src/main/ts/g0501_0600/s0560_subarray_sum_equals_k) [Scala](src/main/scala/g0501_0600/s0560_subarray_sum_equals_k) [Ruby](src/main/ruby/g0501_0600/s0560_subarray_sum_equals_k) [PHP](src/main/php/g0501_0600/s0560_subarray_sum_equals_k) [C#](src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k) [Go](src/main/go/g0501_0600/s0560_subarray_sum_equals_k) [Cpp](src/main/cpp/g0501_0600/s0560_subarray_sum_equals_k) [Python](src/main/python/g0501_0600/s0560_subarray_sum_equals_k) [Swift](src/main/swift/g0501_0600/s0560_subarray_sum_equals_k) [Elixir](src/main/elixir/g0501_0600/s0560_subarray_sum_equals_k) [Rust](src/main/rust/g0501_0600/s0560_subarray_sum_equals_k) [Dart](src/main/dart/g0501_0600/s0560_subarray_sum_equals_k) [C](src/main/c/g0501_0600/s0560_subarray_sum_equals_k) [JavaScript](src/main/js/g0501_0600/s0560_subarray_sum_equals_k) [Erlang](src/main/erlang/g0501_0600/s0560_subarray_sum_equals_k) [Racket](src/main/racket/g0501_0600/s0560_subarray_sum_equals_k)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Big_O_Time_O(n)_Space_O(n) | 22 | 95.17 #### Day 6 String @@ -1293,7 +1188,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 #### Day 19 Graph @@ -1304,7 +1199,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 +| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 | 0347 |Top K Frequent Elements| [Java](src/main/java/g0301_0400/s0347_top_k_frequent_elements) [Kotlin](src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements) [TypeScript](src/main/ts/g0301_0400/s0347_top_k_frequent_elements) [Scala](src/main/scala/g0301_0400/s0347_top_k_frequent_elements) [Ruby](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements) [PHP](src/main/php/g0301_0400/s0347_top_k_frequent_elements) [C#](src/main/csharp/g0301_0400/s0347_top_k_frequent_elements) [Go](src/main/go/g0301_0400/s0347_top_k_frequent_elements) [Cpp](src/main/cpp/g0301_0400/s0347_top_k_frequent_elements) [Python](src/main/python/g0301_0400/s0347_top_k_frequent_elements) [Swift](src/main/swift/g0301_0400/s0347_top_k_frequent_elements) [Elixir](src/main/elixir/g0301_0400/s0347_top_k_frequent_elements) [Rust](src/main/rust/g0301_0400/s0347_top_k_frequent_elements) [Dart](src/main/dart/g0301_0400/s0347_top_k_frequent_elements) [C](src/main/c/g0301_0400/s0347_top_k_frequent_elements) [JavaScript](src/main/js/g0301_0400/s0347_top_k_frequent_elements) [Erlang](src/main/erlang/g0301_0400/s0347_top_k_frequent_elements) [Racket](src/main/racket/g0301_0400/s0347_top_k_frequent_elements)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Big_O_Time_O(n\*log(n))_Space_O(k) | 9 | 97.30 #### Day 21 Heap Priority Queue @@ -1330,7 +1225,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 +| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 #### Day 4 Two Pointers @@ -1369,7 +1264,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0021 |Merge Two Sorted Lists| [Java](src/main/java/g0001_0100/s0021_merge_two_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists) [Scala](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists) [PHP](src/main/php/g0001_0100/s0021_merge_two_sorted_lists) [C#](src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists) [Go](src/main/go/g0001_0100/s0021_merge_two_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists) [Python](src/main/python/g0001_0100/s0021_merge_two_sorted_lists) [Swift](src/main/swift/g0001_0100/s0021_merge_two_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists) [Rust](src/main/rust/g0001_0100/s0021_merge_two_sorted_lists) [Dart](src/main/dart/g0001_0100/s0021_merge_two_sorted_lists) [C](src/main/c/g0001_0100/s0021_merge_two_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0021_merge_two_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists) [Racket](src/main/racket/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 -| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 #### Day 11 Recursion Backtracking @@ -1382,7 +1277,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0070 |Climbing Stairs| [Java](src/main/java/g0001_0100/s0070_climbing_stairs) [Kotlin](src/main/kotlin/g0001_0100/s0070_climbing_stairs) [TypeScript](src/main/ts/g0001_0100/s0070_climbing_stairs) [Scala](src/main/scala/g0001_0100/s0070_climbing_stairs) [Ruby](src/main/ruby/g0001_0100/s0070_climbing_stairs) [PHP](src/main/php/g0001_0100/s0070_climbing_stairs) [C#](src/main/csharp/g0001_0100/s0070_climbing_stairs) [Go](src/main/go/g0001_0100/s0070_climbing_stairs) [Cpp](src/main/cpp/g0001_0100/s0070_climbing_stairs) [Python](src/main/python/g0001_0100/s0070_climbing_stairs) [Swift](src/main/swift/g0001_0100/s0070_climbing_stairs) [Elixir](src/main/elixir/g0001_0100/s0070_climbing_stairs) [Rust](src/main/rust/g0001_0100/s0070_climbing_stairs) [Dart](src/main/dart/g0001_0100/s0070_climbing_stairs) [C](src/main/c/g0001_0100/s0070_climbing_stairs) [JavaScript](src/main/js/g0001_0100/s0070_climbing_stairs) [Erlang](src/main/erlang/g0001_0100/s0070_climbing_stairs) [Racket](src/main/racket/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 -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/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 #### Day 13 Bit Manipulation @@ -1393,7 +1288,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 ### Algorithm II @@ -1421,7 +1316,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 #### Day 5 Sliding Window @@ -1461,7 +1356,7 @@ | | | | | | | |-|-|-|-|-|-|- -| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0022 |Generate Parentheses| [Java](src/main/java/g0001_0100/s0022_generate_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0022_generate_parentheses) [TypeScript](src/main/ts/g0001_0100/s0022_generate_parentheses) [Scala](src/main/scala/g0001_0100/s0022_generate_parentheses) [Ruby](src/main/ruby/g0001_0100/s0022_generate_parentheses) [PHP](src/main/php/g0001_0100/s0022_generate_parentheses) [C#](src/main/csharp/g0001_0100/s0022_generate_parentheses) [Go](src/main/go/g0001_0100/s0022_generate_parentheses) [Cpp](src/main/cpp/g0001_0100/s0022_generate_parentheses) [Python](src/main/python/g0001_0100/s0022_generate_parentheses) [Swift](src/main/swift/g0001_0100/s0022_generate_parentheses) [Elixir](src/main/elixir/g0001_0100/s0022_generate_parentheses) [Rust](src/main/rust/g0001_0100/s0022_generate_parentheses) [Dart](src/main/dart/g0001_0100/s0022_generate_parentheses) [C](src/main/c/g0001_0100/s0022_generate_parentheses) [JavaScript](src/main/js/g0001_0100/s0022_generate_parentheses) [Erlang](src/main/erlang/g0001_0100/s0022_generate_parentheses) [Racket](src/main/racket/g0001_0100/s0022_generate_parentheses)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00 | 0079 |Word Search| [Java](src/main/java/g0001_0100/s0079_word_search) [Kotlin](src/main/kotlin/g0001_0100/s0079_word_search) [TypeScript](src/main/ts/g0001_0100/s0079_word_search) [Scala](src/main/scala/g0001_0100/s0079_word_search) [Ruby](src/main/ruby/g0001_0100/s0079_word_search) [PHP](src/main/php/g0001_0100/s0079_word_search) [C#](src/main/csharp/g0001_0100/s0079_word_search) [Go](src/main/go/g0001_0100/s0079_word_search) [Cpp](src/main/cpp/g0001_0100/s0079_word_search) [Python](src/main/python/g0001_0100/s0079_word_search) [Swift](src/main/swift/g0001_0100/s0079_word_search) [Elixir](src/main/elixir/g0001_0100/s0079_word_search) [Rust](src/main/rust/g0001_0100/s0079_word_search) [Dart](src/main/dart/g0001_0100/s0079_word_search) [C](src/main/c/g0001_0100/s0079_word_search) [JavaScript](src/main/js/g0001_0100/s0079_word_search) [Erlang](src/main/erlang/g0001_0100/s0079_word_search) [Racket](src/main/racket/g0001_0100/s0079_word_search)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 64 | 98.51 @@ -1476,7 +1371,7 @@ | | | | | | | |-|-|-|-|-|-|- | 0045 |Jump Game II| [Java](src/main/java/g0001_0100/s0045_jump_game_ii) [Kotlin](src/main/kotlin/g0001_0100/s0045_jump_game_ii) [TypeScript](src/main/ts/g0001_0100/s0045_jump_game_ii) [Scala](src/main/scala/g0001_0100/s0045_jump_game_ii) [Ruby](src/main/ruby/g0001_0100/s0045_jump_game_ii) [PHP](src/main/php/g0001_0100/s0045_jump_game_ii) [C#](src/main/csharp/g0001_0100/s0045_jump_game_ii) [Go](src/main/go/g0001_0100/s0045_jump_game_ii) [Cpp](src/main/cpp/g0001_0100/s0045_jump_game_ii) [Python](src/main/python/g0001_0100/s0045_jump_game_ii) [Swift](src/main/swift/g0001_0100/s0045_jump_game_ii) [Elixir](src/main/elixir/g0001_0100/s0045_jump_game_ii) [Rust](src/main/rust/g0001_0100/s0045_jump_game_ii) [Dart](src/main/dart/g0001_0100/s0045_jump_game_ii) [C](src/main/c/g0001_0100/s0045_jump_game_ii) [JavaScript](src/main/js/g0001_0100/s0045_jump_game_ii) [Erlang](src/main/erlang/g0001_0100/s0045_jump_game_ii) [Racket](src/main/racket/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 -| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 +| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/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 #### Day 14 Dynamic Programming @@ -1500,13 +1395,13 @@ | | | | | | | |-|-|-|-|-|-|- -| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 +| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/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) | 19 | 89.05 #### Day 18 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/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) | 3 | 97.19 | 0322 |Coin Change| [Java](src/main/java/g0301_0400/s0322_coin_change) [Kotlin](src/main/kotlin/g0301_0400/s0322_coin_change) [TypeScript](src/main/ts/g0301_0400/s0322_coin_change) [Scala](src/main/scala/g0301_0400/s0322_coin_change) [Ruby](src/main/ruby/g0301_0400/s0322_coin_change) [PHP](src/main/php/g0301_0400/s0322_coin_change) [C#](src/main/csharp/g0301_0400/s0322_coin_change) [Go](src/main/go/g0301_0400/s0322_coin_change) [Cpp](src/main/cpp/g0301_0400/s0322_coin_change) [Python](src/main/python/g0301_0400/s0322_coin_change) [Swift](src/main/swift/g0301_0400/s0322_coin_change) [Elixir](src/main/elixir/g0301_0400/s0322_coin_change) [Rust](src/main/rust/g0301_0400/s0322_coin_change) [Dart](src/main/dart/g0301_0400/s0322_coin_change) [C](src/main/c/g0301_0400/s0322_coin_change) [JavaScript](src/main/js/g0301_0400/s0322_coin_change) [Erlang](src/main/erlang/g0301_0400/s0322_coin_change) [Racket](src/main/racket/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) | 12 | 92.59 #### Day 19 Bit Manipulation @@ -1591,42 +1486,147 @@ |-|-|-|-|-|-|- | 0153 |Find Minimum in Rotated Sorted Array| [Java](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [TypeScript](src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Scala](src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Ruby](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [PHP](src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [C#](src/main/csharp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Go](src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Cpp](src/main/cpp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Python](src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Swift](src/main/swift/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Elixir](src/main/elixir/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Rust](src/main/rust/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Dart](src/main/dart/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [C](src/main/c/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [JavaScript](src/main/js/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Erlang](src/main/erlang/g0101_0200/s0153_find_minimum_in_rotated_sorted_array) [Racket](src/main/racket/g0101_0200/s0153_find_minimum_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 +### Binary Search II + +#### Day 1 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 2 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 3 + +| | | | | | | +|-|-|-|-|-|-|- +| 0300 |Longest Increasing Subsequence| [Java](src/main/java/g0201_0300/s0300_longest_increasing_subsequence) [Kotlin](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence) [TypeScript](src/main/ts/g0201_0300/s0300_longest_increasing_subsequence) [Scala](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence) [Ruby](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence) [PHP](src/main/php/g0201_0300/s0300_longest_increasing_subsequence) [C#](src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence) [Go](src/main/go/g0201_0300/s0300_longest_increasing_subsequence) [Cpp](src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence) [Python](src/main/python/g0201_0300/s0300_longest_increasing_subsequence) [Swift](src/main/swift/g0201_0300/s0300_longest_increasing_subsequence) [Elixir](src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence) [Rust](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence) [Dart](src/main/dart/g0201_0300/s0300_longest_increasing_subsequence) [C](src/main/c/g0201_0300/s0300_longest_increasing_subsequence) [JavaScript](src/main/js/g0201_0300/s0300_longest_increasing_subsequence) [Erlang](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence) [Racket](src/main/racket/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) | 3 | 95.75 + +#### Day 4 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 5 + +| | | | | | | +|-|-|-|-|-|-|- +| 0287 |Find the Duplicate Number| [Java](src/main/java/g0201_0300/s0287_find_the_duplicate_number) [Kotlin](src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number) [TypeScript](src/main/ts/g0201_0300/s0287_find_the_duplicate_number) [Scala](src/main/scala/g0201_0300/s0287_find_the_duplicate_number) [Ruby](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number) [PHP](src/main/php/g0201_0300/s0287_find_the_duplicate_number) [C#](src/main/csharp/g0201_0300/s0287_find_the_duplicate_number) [Go](src/main/go/g0201_0300/s0287_find_the_duplicate_number) [Cpp](src/main/cpp/g0201_0300/s0287_find_the_duplicate_number) [Python](src/main/python/g0201_0300/s0287_find_the_duplicate_number) [Swift](src/main/swift/g0201_0300/s0287_find_the_duplicate_number) [Elixir](src/main/elixir/g0201_0300/s0287_find_the_duplicate_number) [Rust](src/main/rust/g0201_0300/s0287_find_the_duplicate_number) [Dart](src/main/dart/g0201_0300/s0287_find_the_duplicate_number) [C](src/main/c/g0201_0300/s0287_find_the_duplicate_number) [JavaScript](src/main/js/g0201_0300/s0287_find_the_duplicate_number) [Erlang](src/main/erlang/g0201_0300/s0287_find_the_duplicate_number) [Racket](src/main/racket/g0201_0300/s0287_find_the_duplicate_number)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 2 | 97.52 + +#### Day 6 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 7 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 8 + +| | | | | | | +|-|-|-|-|-|-|- +| 0240 |Search a 2D Matrix II| [Java](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii) [Kotlin](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii) [TypeScript](src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii) [Scala](src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii) [Ruby](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii) [PHP](src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii) [C#](src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii) [Go](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii) [Cpp](src/main/cpp/g0201_0300/s0240_search_a_2d_matrix_ii) [Python](src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii) [Swift](src/main/swift/g0201_0300/s0240_search_a_2d_matrix_ii) [Elixir](src/main/elixir/g0201_0300/s0240_search_a_2d_matrix_ii) [Rust](src/main/rust/g0201_0300/s0240_search_a_2d_matrix_ii) [Dart](src/main/dart/g0201_0300/s0240_search_a_2d_matrix_ii) [C](src/main/c/g0201_0300/s0240_search_a_2d_matrix_ii) [JavaScript](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii) [Erlang](src/main/erlang/g0201_0300/s0240_search_a_2d_matrix_ii) [Racket](src/main/racket/g0201_0300/s0240_search_a_2d_matrix_ii)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 5 | 99.92 + +#### Day 9 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 10 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 11 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 12 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 13 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 14 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 15 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 16 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 17 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 18 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 19 + +| | | | | | | +|-|-|-|-|-|-|- + +#### Day 20 + +| | | | | | | +|-|-|-|-|-|-|- + ## Algorithms | # | Title | Language | Difficulty | Tag | Time, ms | Time, % |------|----------------|-----------|-------------|-------------|----------|--------- -| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 +| 1143 |Longest Common Subsequence| [Java](src/main/java/g1101_1200/s1143_longest_common_subsequence) [Kotlin](src/main/kotlin/g1101_1200/s1143_longest_common_subsequence) [TypeScript](src/main/ts/g1101_1200/s1143_longest_common_subsequence) [Scala](src/main/scala/g1101_1200/s1143_longest_common_subsequence) [Ruby](src/main/ruby/g1101_1200/s1143_longest_common_subsequence) [PHP](src/main/php/g1101_1200/s1143_longest_common_subsequence) [C#](src/main/csharp/g1101_1200/s1143_longest_common_subsequence) [Go](src/main/go/g1101_1200/s1143_longest_common_subsequence) [Cpp](src/main/cpp/g1101_1200/s1143_longest_common_subsequence) [Python](src/main/python/g1101_1200/s1143_longest_common_subsequence) [Swift](src/main/swift/g1101_1200/s1143_longest_common_subsequence) [Elixir](src/main/elixir/g1101_1200/s1143_longest_common_subsequence) [Rust](src/main/rust/g1101_1200/s1143_longest_common_subsequence) [Dart](src/main/dart/g1101_1200/s1143_longest_common_subsequence) [C](src/main/c/g1101_1200/s1143_longest_common_subsequence) [JavaScript](src/main/js/g1101_1200/s1143_longest_common_subsequence) [Erlang](src/main/erlang/g1101_1200/s1143_longest_common_subsequence) [Racket](src/main/racket/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_17_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 19 | 89.05 | 0763 |Partition Labels| [Java](src/main/java/g0701_0800/s0763_partition_labels) [Kotlin](src/main/kotlin/g0701_0800/s0763_partition_labels) [TypeScript](src/main/ts/g0701_0800/s0763_partition_labels) [Scala](src/main/scala/g0701_0800/s0763_partition_labels) [Ruby](src/main/ruby/g0701_0800/s0763_partition_labels) [PHP](src/main/php/g0701_0800/s0763_partition_labels) [C#](src/main/csharp/g0701_0800/s0763_partition_labels) [Go](src/main/go/g0701_0800/s0763_partition_labels) [Cpp](src/main/cpp/g0701_0800/s0763_partition_labels) [Python](src/main/python/g0701_0800/s0763_partition_labels) [Swift](src/main/swift/g0701_0800/s0763_partition_labels) [Elixir](src/main/elixir/g0701_0800/s0763_partition_labels) [Rust](src/main/rust/g0701_0800/s0763_partition_labels) [Dart](src/main/dart/g0701_0800/s0763_partition_labels) [C](src/main/c/g0701_0800/s0763_partition_labels) [JavaScript](src/main/js/g0701_0800/s0763_partition_labels) [Erlang](src/main/erlang/g0701_0800/s0763_partition_labels) [Racket](src/main/racket/g0701_0800/s0763_partition_labels)| Medium | String, Hash_Table, Greedy, Two_Pointers, Data_Structure_II_Day_7_String, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00 -| 0739 |Daily Temperatures| [Java](src/main/java/g0701_0800/s0739_daily_temperatures) [Kotlin](src/main/kotlin/g0701_0800/s0739_daily_temperatures) [TypeScript](src/main/ts/g0701_0800/s0739_daily_temperatures) [Scala](src/main/scala/g0701_0800/s0739_daily_temperatures) [Ruby](src/main/ruby/g0701_0800/s0739_daily_temperatures) [PHP](src/main/php/g0701_0800/s0739_daily_temperatures) [C#](src/main/csharp/g0701_0800/s0739_daily_temperatures) [Go](src/main/go/g0701_0800/s0739_daily_temperatures) [Cpp](src/main/cpp/g0701_0800/s0739_daily_temperatures) [Python](src/main/python/g0701_0800/s0739_daily_temperatures) [Swift](src/main/swift/g0701_0800/s0739_daily_temperatures) [Elixir](src/main/elixir/g0701_0800/s0739_daily_temperatures) [Rust](src/main/rust/g0701_0800/s0739_daily_temperatures) [Dart](src/main/dart/g0701_0800/s0739_daily_temperatures) [C](src/main/c/g0701_0800/s0739_daily_temperatures) [JavaScript](src/main/js/g0701_0800/s0739_daily_temperatures) [Erlang](src/main/erlang/g0701_0800/s0739_daily_temperatures) [Racket](src/main/racket/g0701_0800/s0739_daily_temperatures)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 +| 0739 |Daily Temperatures| [Java](src/main/java/g0701_0800/s0739_daily_temperatures) [Kotlin](src/main/kotlin/g0701_0800/s0739_daily_temperatures) [TypeScript](src/main/ts/g0701_0800/s0739_daily_temperatures) [Scala](src/main/scala/g0701_0800/s0739_daily_temperatures) [Ruby](src/main/ruby/g0701_0800/s0739_daily_temperatures) [PHP](src/main/php/g0701_0800/s0739_daily_temperatures) [C#](src/main/csharp/g0701_0800/s0739_daily_temperatures) [Go](src/main/go/g0701_0800/s0739_daily_temperatures) [Cpp](src/main/cpp/g0701_0800/s0739_daily_temperatures) [Python](src/main/python/g0701_0800/s0739_daily_temperatures) [Swift](src/main/swift/g0701_0800/s0739_daily_temperatures) [Elixir](src/main/elixir/g0701_0800/s0739_daily_temperatures) [Rust](src/main/rust/g0701_0800/s0739_daily_temperatures) [Dart](src/main/dart/g0701_0800/s0739_daily_temperatures) [C](src/main/c/g0701_0800/s0739_daily_temperatures) [JavaScript](src/main/js/g0701_0800/s0739_daily_temperatures) [Erlang](src/main/erlang/g0701_0800/s0739_daily_temperatures) [Racket](src/main/racket/g0701_0800/s0739_daily_temperatures)| Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Programming_Skills_II_Day_6, Big_O_Time_O(n)_Space_O(n) | 8 | 96.83 | 0647 |Palindromic Substrings| [Java](src/main/java/g0601_0700/s0647_palindromic_substrings) [Kotlin](src/main/kotlin/g0601_0700/s0647_palindromic_substrings) [TypeScript](src/main/ts/g0601_0700/s0647_palindromic_substrings) [Scala](src/main/scala/g0601_0700/s0647_palindromic_substrings) [Ruby](src/main/ruby/g0601_0700/s0647_palindromic_substrings) [PHP](src/main/php/g0601_0700/s0647_palindromic_substrings) [C#](src/main/csharp/g0601_0700/s0647_palindromic_substrings) [Go](src/main/go/g0601_0700/s0647_palindromic_substrings) [Cpp](src/main/cpp/g0601_0700/s0647_palindromic_substrings) [Python](src/main/python/g0601_0700/s0647_palindromic_substrings) [Swift](src/main/swift/g0601_0700/s0647_palindromic_substrings) [Elixir](src/main/elixir/g0601_0700/s0647_palindromic_substrings) [Rust](src/main/rust/g0601_0700/s0647_palindromic_substrings) [Dart](src/main/dart/g0601_0700/s0647_palindromic_substrings) [C](src/main/c/g0601_0700/s0647_palindromic_substrings) [JavaScript](src/main/js/g0601_0700/s0647_palindromic_substrings) [Erlang](src/main/erlang/g0601_0700/s0647_palindromic_substrings) [Racket](src/main/racket/g0601_0700/s0647_palindromic_substrings)| Medium | String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n) | 2 | 99.31 | 0560 |Subarray Sum Equals K| [Java](src/main/java/g0501_0600/s0560_subarray_sum_equals_k) [Kotlin](src/main/kotlin/g0501_0600/s0560_subarray_sum_equals_k) [TypeScript](src/main/ts/g0501_0600/s0560_subarray_sum_equals_k) [Scala](src/main/scala/g0501_0600/s0560_subarray_sum_equals_k) [Ruby](src/main/ruby/g0501_0600/s0560_subarray_sum_equals_k) [PHP](src/main/php/g0501_0600/s0560_subarray_sum_equals_k) [C#](src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k) [Go](src/main/go/g0501_0600/s0560_subarray_sum_equals_k) [Cpp](src/main/cpp/g0501_0600/s0560_subarray_sum_equals_k) [Python](src/main/python/g0501_0600/s0560_subarray_sum_equals_k) [Swift](src/main/swift/g0501_0600/s0560_subarray_sum_equals_k) [Elixir](src/main/elixir/g0501_0600/s0560_subarray_sum_equals_k) [Rust](src/main/rust/g0501_0600/s0560_subarray_sum_equals_k) [Dart](src/main/dart/g0501_0600/s0560_subarray_sum_equals_k) [C](src/main/c/g0501_0600/s0560_subarray_sum_equals_k) [JavaScript](src/main/js/g0501_0600/s0560_subarray_sum_equals_k) [Erlang](src/main/erlang/g0501_0600/s0560_subarray_sum_equals_k) [Racket](src/main/racket/g0501_0600/s0560_subarray_sum_equals_k)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Prefix_Sum, Data_Structure_II_Day_5_Array, Big_O_Time_O(n)_Space_O(n) | 22 | 95.17 | 0543 |Diameter of Binary Tree| [Java](src/main/java/g0501_0600/s0543_diameter_of_binary_tree) [Kotlin](src/main/kotlin/g0501_0600/s0543_diameter_of_binary_tree) [TypeScript](src/main/ts/g0501_0600/s0543_diameter_of_binary_tree) [Scala](src/main/scala/g0501_0600/s0543_diameter_of_binary_tree) [Ruby](src/main/ruby/g0501_0600/s0543_diameter_of_binary_tree) [PHP](src/main/php/g0501_0600/s0543_diameter_of_binary_tree) [C#](src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree) [Go](src/main/go/g0501_0600/s0543_diameter_of_binary_tree) [Cpp](src/main/cpp/g0501_0600/s0543_diameter_of_binary_tree) [Python](src/main/python/g0501_0600/s0543_diameter_of_binary_tree) [Swift](src/main/swift/g0501_0600/s0543_diameter_of_binary_tree) [Elixir](src/main/elixir/g0501_0600/s0543_diameter_of_binary_tree) [Rust](src/main/rust/g0501_0600/s0543_diameter_of_binary_tree) [Dart](src/main/dart/g0501_0600/s0543_diameter_of_binary_tree) [C](src/main/c/g0501_0600/s0543_diameter_of_binary_tree) [JavaScript](src/main/js/g0501_0600/s0543_diameter_of_binary_tree) [Erlang](src/main/erlang/g0501_0600/s0543_diameter_of_binary_tree) [Racket](src/main/racket/g0501_0600/s0543_diameter_of_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0494 |Target Sum| [Java](src/main/java/g0401_0500/s0494_target_sum) [Kotlin](src/main/kotlin/g0401_0500/s0494_target_sum) [TypeScript](src/main/ts/g0401_0500/s0494_target_sum) [Scala](src/main/scala/g0401_0500/s0494_target_sum) [Ruby](src/main/ruby/g0401_0500/s0494_target_sum) [PHP](src/main/php/g0401_0500/s0494_target_sum) [C#](src/main/csharp/g0401_0500/s0494_target_sum) [Go](src/main/go/g0401_0500/s0494_target_sum) [Cpp](src/main/cpp/g0401_0500/s0494_target_sum) [Python](src/main/python/g0401_0500/s0494_target_sum) [Swift](src/main/swift/g0401_0500/s0494_target_sum) [Elixir](src/main/elixir/g0401_0500/s0494_target_sum) [Rust](src/main/rust/g0401_0500/s0494_target_sum) [Dart](src/main/dart/g0401_0500/s0494_target_sum) [C](src/main/c/g0401_0500/s0494_target_sum) [JavaScript](src/main/js/g0401_0500/s0494_target_sum) [Erlang](src/main/erlang/g0401_0500/s0494_target_sum) [Racket](src/main/racket/g0401_0500/s0494_target_sum)| Medium | Array, Dynamic_Programming, Backtracking, Big_O_Time_O(n\*(sum+s))_Space_O(n\*(sum+s)) | 4 | 92.28 | 0438 |Find All Anagrams in a String| [Java](src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string) [Kotlin](src/main/kotlin/g0401_0500/s0438_find_all_anagrams_in_a_string) [TypeScript](src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string) [Scala](src/main/scala/g0401_0500/s0438_find_all_anagrams_in_a_string) [Ruby](src/main/ruby/g0401_0500/s0438_find_all_anagrams_in_a_string) [PHP](src/main/php/g0401_0500/s0438_find_all_anagrams_in_a_string) [C#](src/main/csharp/g0401_0500/s0438_find_all_anagrams_in_a_string) [Go](src/main/go/g0401_0500/s0438_find_all_anagrams_in_a_string) [Cpp](src/main/cpp/g0401_0500/s0438_find_all_anagrams_in_a_string) [Python](src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string) [Swift](src/main/swift/g0401_0500/s0438_find_all_anagrams_in_a_string) [Elixir](src/main/elixir/g0401_0500/s0438_find_all_anagrams_in_a_string) [Rust](src/main/rust/g0401_0500/s0438_find_all_anagrams_in_a_string) [Dart](src/main/dart/g0401_0500/s0438_find_all_anagrams_in_a_string) [C](src/main/c/g0401_0500/s0438_find_all_anagrams_in_a_string) [JavaScript](src/main/js/g0401_0500/s0438_find_all_anagrams_in_a_string) [Erlang](src/main/erlang/g0401_0500/s0438_find_all_anagrams_in_a_string) [Racket](src/main/racket/g0401_0500/s0438_find_all_anagrams_in_a_string)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 -| 0437 |Path Sum III| [Java](src/main/java/g0401_0500/s0437_path_sum_iii) [Kotlin](src/main/kotlin/g0401_0500/s0437_path_sum_iii) [TypeScript](src/main/ts/g0401_0500/s0437_path_sum_iii) [Scala](src/main/scala/g0401_0500/s0437_path_sum_iii) [Ruby](src/main/ruby/g0401_0500/s0437_path_sum_iii) [PHP](src/main/php/g0401_0500/s0437_path_sum_iii) [C#](src/main/csharp/g0401_0500/s0437_path_sum_iii) [Go](src/main/go/g0401_0500/s0437_path_sum_iii) [Cpp](src/main/cpp/g0401_0500/s0437_path_sum_iii) [Python](src/main/python/g0401_0500/s0437_path_sum_iii) [Swift](src/main/swift/g0401_0500/s0437_path_sum_iii) [Elixir](src/main/elixir/g0401_0500/s0437_path_sum_iii) [Rust](src/main/rust/g0401_0500/s0437_path_sum_iii) [Dart](src/main/dart/g0401_0500/s0437_path_sum_iii) [C](src/main/c/g0401_0500/s0437_path_sum_iii) [JavaScript](src/main/js/g0401_0500/s0437_path_sum_iii) [Erlang](src/main/erlang/g0401_0500/s0437_path_sum_iii) [Racket](src/main/racket/g0401_0500/s0437_path_sum_iii)| Medium | Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 +| 0437 |Path Sum III| [Java](src/main/java/g0401_0500/s0437_path_sum_iii) [Kotlin](src/main/kotlin/g0401_0500/s0437_path_sum_iii) [TypeScript](src/main/ts/g0401_0500/s0437_path_sum_iii) [Scala](src/main/scala/g0401_0500/s0437_path_sum_iii) [Ruby](src/main/ruby/g0401_0500/s0437_path_sum_iii) [PHP](src/main/php/g0401_0500/s0437_path_sum_iii) [C#](src/main/csharp/g0401_0500/s0437_path_sum_iii) [Go](src/main/go/g0401_0500/s0437_path_sum_iii) [Cpp](src/main/cpp/g0401_0500/s0437_path_sum_iii) [Python](src/main/python/g0401_0500/s0437_path_sum_iii) [Swift](src/main/swift/g0401_0500/s0437_path_sum_iii) [Elixir](src/main/elixir/g0401_0500/s0437_path_sum_iii) [Rust](src/main/rust/g0401_0500/s0437_path_sum_iii) [Dart](src/main/dart/g0401_0500/s0437_path_sum_iii) [C](src/main/c/g0401_0500/s0437_path_sum_iii) [JavaScript](src/main/js/g0401_0500/s0437_path_sum_iii) [Erlang](src/main/erlang/g0401_0500/s0437_path_sum_iii) [Racket](src/main/racket/g0401_0500/s0437_path_sum_iii)| Medium | Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 | 0416 |Partition Equal Subset Sum| [Java](src/main/java/g0401_0500/s0416_partition_equal_subset_sum) [Kotlin](src/main/kotlin/g0401_0500/s0416_partition_equal_subset_sum) [TypeScript](src/main/ts/g0401_0500/s0416_partition_equal_subset_sum) [Scala](src/main/scala/g0401_0500/s0416_partition_equal_subset_sum) [Ruby](src/main/ruby/g0401_0500/s0416_partition_equal_subset_sum) [PHP](src/main/php/g0401_0500/s0416_partition_equal_subset_sum) [C#](src/main/csharp/g0401_0500/s0416_partition_equal_subset_sum) [Go](src/main/go/g0401_0500/s0416_partition_equal_subset_sum) [Cpp](src/main/cpp/g0401_0500/s0416_partition_equal_subset_sum) [Python](src/main/python/g0401_0500/s0416_partition_equal_subset_sum) [Swift](src/main/swift/g0401_0500/s0416_partition_equal_subset_sum) [Elixir](src/main/elixir/g0401_0500/s0416_partition_equal_subset_sum) [Rust](src/main/rust/g0401_0500/s0416_partition_equal_subset_sum) [Dart](src/main/dart/g0401_0500/s0416_partition_equal_subset_sum) [C](src/main/c/g0401_0500/s0416_partition_equal_subset_sum) [JavaScript](src/main/js/g0401_0500/s0416_partition_equal_subset_sum) [Erlang](src/main/erlang/g0401_0500/s0416_partition_equal_subset_sum) [Racket](src/main/racket/g0401_0500/s0416_partition_equal_subset_sum)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n\*sums)_Space_O(n\*sums) | 5 | 99.88 -| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0394 |Decode String| [Java](src/main/java/g0301_0400/s0394_decode_string) [Kotlin](src/main/kotlin/g0301_0400/s0394_decode_string) [TypeScript](src/main/ts/g0301_0400/s0394_decode_string) [Scala](src/main/scala/g0301_0400/s0394_decode_string) [Ruby](src/main/ruby/g0301_0400/s0394_decode_string) [PHP](src/main/php/g0301_0400/s0394_decode_string) [C#](src/main/csharp/g0301_0400/s0394_decode_string) [Go](src/main/go/g0301_0400/s0394_decode_string) [Cpp](src/main/cpp/g0301_0400/s0394_decode_string) [Python](src/main/python/g0301_0400/s0394_decode_string) [Swift](src/main/swift/g0301_0400/s0394_decode_string) [Elixir](src/main/elixir/g0301_0400/s0394_decode_string) [Rust](src/main/rust/g0301_0400/s0394_decode_string) [Dart](src/main/dart/g0301_0400/s0394_decode_string) [C](src/main/c/g0301_0400/s0394_decode_string) [JavaScript](src/main/js/g0301_0400/s0394_decode_string) [Erlang](src/main/erlang/g0301_0400/s0394_decode_string) [Racket](src/main/racket/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, LeetCode_75_Stack, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0347 |Top K Frequent Elements| [Java](src/main/java/g0301_0400/s0347_top_k_frequent_elements) [Kotlin](src/main/kotlin/g0301_0400/s0347_top_k_frequent_elements) [TypeScript](src/main/ts/g0301_0400/s0347_top_k_frequent_elements) [Scala](src/main/scala/g0301_0400/s0347_top_k_frequent_elements) [Ruby](src/main/ruby/g0301_0400/s0347_top_k_frequent_elements) [PHP](src/main/php/g0301_0400/s0347_top_k_frequent_elements) [C#](src/main/csharp/g0301_0400/s0347_top_k_frequent_elements) [Go](src/main/go/g0301_0400/s0347_top_k_frequent_elements) [Cpp](src/main/cpp/g0301_0400/s0347_top_k_frequent_elements) [Python](src/main/python/g0301_0400/s0347_top_k_frequent_elements) [Swift](src/main/swift/g0301_0400/s0347_top_k_frequent_elements) [Elixir](src/main/elixir/g0301_0400/s0347_top_k_frequent_elements) [Rust](src/main/rust/g0301_0400/s0347_top_k_frequent_elements) [Dart](src/main/dart/g0301_0400/s0347_top_k_frequent_elements) [C](src/main/c/g0301_0400/s0347_top_k_frequent_elements) [JavaScript](src/main/js/g0301_0400/s0347_top_k_frequent_elements) [Erlang](src/main/erlang/g0301_0400/s0347_top_k_frequent_elements) [Racket](src/main/racket/g0301_0400/s0347_top_k_frequent_elements)| Medium | Top_100_Liked_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(k) | 9 | 97.30 -| 0338 |Counting Bits| [Java](src/main/java/g0301_0400/s0338_counting_bits) [Kotlin](src/main/kotlin/g0301_0400/s0338_counting_bits) [TypeScript](src/main/ts/g0301_0400/s0338_counting_bits) [Scala](src/main/scala/g0301_0400/s0338_counting_bits) [Ruby](src/main/ruby/g0301_0400/s0338_counting_bits) [PHP](src/main/php/g0301_0400/s0338_counting_bits) [C#](src/main/csharp/g0301_0400/s0338_counting_bits) [Go](src/main/go/g0301_0400/s0338_counting_bits) [Cpp](src/main/cpp/g0301_0400/s0338_counting_bits) [Python](src/main/python/g0301_0400/s0338_counting_bits) [Swift](src/main/swift/g0301_0400/s0338_counting_bits) [Elixir](src/main/elixir/g0301_0400/s0338_counting_bits) [Rust](src/main/rust/g0301_0400/s0338_counting_bits) [Dart](src/main/dart/g0301_0400/s0338_counting_bits) [C](src/main/c/g0301_0400/s0338_counting_bits) [JavaScript](src/main/js/g0301_0400/s0338_counting_bits) [Erlang](src/main/erlang/g0301_0400/s0338_counting_bits) [Racket](src/main/racket/g0301_0400/s0338_counting_bits)| Easy | Dynamic_Programming, Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 +| 0338 |Counting Bits| [Java](src/main/java/g0301_0400/s0338_counting_bits) [Kotlin](src/main/kotlin/g0301_0400/s0338_counting_bits) [TypeScript](src/main/ts/g0301_0400/s0338_counting_bits) [Scala](src/main/scala/g0301_0400/s0338_counting_bits) [Ruby](src/main/ruby/g0301_0400/s0338_counting_bits) [PHP](src/main/php/g0301_0400/s0338_counting_bits) [C#](src/main/csharp/g0301_0400/s0338_counting_bits) [Go](src/main/go/g0301_0400/s0338_counting_bits) [Cpp](src/main/cpp/g0301_0400/s0338_counting_bits) [Python](src/main/python/g0301_0400/s0338_counting_bits) [Swift](src/main/swift/g0301_0400/s0338_counting_bits) [Elixir](src/main/elixir/g0301_0400/s0338_counting_bits) [Rust](src/main/rust/g0301_0400/s0338_counting_bits) [Dart](src/main/dart/g0301_0400/s0338_counting_bits) [C](src/main/c/g0301_0400/s0338_counting_bits) [JavaScript](src/main/js/g0301_0400/s0338_counting_bits) [Erlang](src/main/erlang/g0301_0400/s0338_counting_bits) [Racket](src/main/racket/g0301_0400/s0338_counting_bits)| Easy | Dynamic_Programming, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 | 0322 |Coin Change| [Java](src/main/java/g0301_0400/s0322_coin_change) [Kotlin](src/main/kotlin/g0301_0400/s0322_coin_change) [TypeScript](src/main/ts/g0301_0400/s0322_coin_change) [Scala](src/main/scala/g0301_0400/s0322_coin_change) [Ruby](src/main/ruby/g0301_0400/s0322_coin_change) [PHP](src/main/php/g0301_0400/s0322_coin_change) [C#](src/main/csharp/g0301_0400/s0322_coin_change) [Go](src/main/go/g0301_0400/s0322_coin_change) [Cpp](src/main/cpp/g0301_0400/s0322_coin_change) [Python](src/main/python/g0301_0400/s0322_coin_change) [Swift](src/main/swift/g0301_0400/s0322_coin_change) [Elixir](src/main/elixir/g0301_0400/s0322_coin_change) [Rust](src/main/rust/g0301_0400/s0322_coin_change) [Dart](src/main/dart/g0301_0400/s0322_coin_change) [C](src/main/c/g0301_0400/s0322_coin_change) [JavaScript](src/main/js/g0301_0400/s0322_coin_change) [Erlang](src/main/erlang/g0301_0400/s0322_coin_change) [Racket](src/main/racket/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(m\*n)_Space_O(amount) | 12 | 92.59 | 0300 |Longest Increasing Subsequence| [Java](src/main/java/g0201_0300/s0300_longest_increasing_subsequence) [Kotlin](src/main/kotlin/g0201_0300/s0300_longest_increasing_subsequence) [TypeScript](src/main/ts/g0201_0300/s0300_longest_increasing_subsequence) [Scala](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence) [Ruby](src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence) [PHP](src/main/php/g0201_0300/s0300_longest_increasing_subsequence) [C#](src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence) [Go](src/main/go/g0201_0300/s0300_longest_increasing_subsequence) [Cpp](src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence) [Python](src/main/python/g0201_0300/s0300_longest_increasing_subsequence) [Swift](src/main/swift/g0201_0300/s0300_longest_increasing_subsequence) [Elixir](src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence) [Rust](src/main/rust/g0201_0300/s0300_longest_increasing_subsequence) [Dart](src/main/dart/g0201_0300/s0300_longest_increasing_subsequence) [C](src/main/c/g0201_0300/s0300_longest_increasing_subsequence) [JavaScript](src/main/js/g0201_0300/s0300_longest_increasing_subsequence) [Erlang](src/main/erlang/g0201_0300/s0300_longest_increasing_subsequence) [Racket](src/main/racket/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n\*log_n)_Space_O(n) | 3 | 95.75 | 0295 |Find Median from Data Stream| [Java](src/main/java/g0201_0300/s0295_find_median_from_data_stream) [Kotlin](src/main/kotlin/g0201_0300/s0295_find_median_from_data_stream) [TypeScript](src/main/ts/g0201_0300/s0295_find_median_from_data_stream) [Scala](src/main/scala/g0201_0300/s0295_find_median_from_data_stream) [Ruby](src/main/ruby/g0201_0300/s0295_find_median_from_data_stream) [PHP](src/main/php/g0201_0300/s0295_find_median_from_data_stream) [C#](src/main/csharp/g0201_0300/s0295_find_median_from_data_stream) [Go](src/main/go/g0201_0300/s0295_find_median_from_data_stream) [Cpp](src/main/cpp/g0201_0300/s0295_find_median_from_data_stream) [Python](src/main/python/g0201_0300/s0295_find_median_from_data_stream) [Swift](src/main/swift/g0201_0300/s0295_find_median_from_data_stream) [Elixir](src/main/elixir/g0201_0300/s0295_find_median_from_data_stream) [Rust](src/main/rust/g0201_0300/s0295_find_median_from_data_stream) [Dart](src/main/dart/g0201_0300/s0295_find_median_from_data_stream) [C](src/main/c/g0201_0300/s0295_find_median_from_data_stream) [JavaScript](src/main/js/g0201_0300/s0295_find_median_from_data_stream) [Erlang](src/main/erlang/g0201_0300/s0295_find_median_from_data_stream) [Racket](src/main/racket/g0201_0300/s0295_find_median_from_data_stream)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Top_Interview_150_Heap, Big_O_Time_O(n\*log_n)_Space_O(n) | 83 | 99.56 | 0287 |Find the Duplicate Number| [Java](src/main/java/g0201_0300/s0287_find_the_duplicate_number) [Kotlin](src/main/kotlin/g0201_0300/s0287_find_the_duplicate_number) [TypeScript](src/main/ts/g0201_0300/s0287_find_the_duplicate_number) [Scala](src/main/scala/g0201_0300/s0287_find_the_duplicate_number) [Ruby](src/main/ruby/g0201_0300/s0287_find_the_duplicate_number) [PHP](src/main/php/g0201_0300/s0287_find_the_duplicate_number) [C#](src/main/csharp/g0201_0300/s0287_find_the_duplicate_number) [Go](src/main/go/g0201_0300/s0287_find_the_duplicate_number) [Cpp](src/main/cpp/g0201_0300/s0287_find_the_duplicate_number) [Python](src/main/python/g0201_0300/s0287_find_the_duplicate_number) [Swift](src/main/swift/g0201_0300/s0287_find_the_duplicate_number) [Elixir](src/main/elixir/g0201_0300/s0287_find_the_duplicate_number) [Rust](src/main/rust/g0201_0300/s0287_find_the_duplicate_number) [Dart](src/main/dart/g0201_0300/s0287_find_the_duplicate_number) [C](src/main/c/g0201_0300/s0287_find_the_duplicate_number) [JavaScript](src/main/js/g0201_0300/s0287_find_the_duplicate_number) [Erlang](src/main/erlang/g0201_0300/s0287_find_the_duplicate_number) [Racket](src/main/racket/g0201_0300/s0287_find_the_duplicate_number)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n) | 2 | 97.52 -| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| 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) | 2 | 83.99 +| 0283 |Move Zeroes| [Java](src/main/java/g0201_0300/s0283_move_zeroes) [Kotlin](src/main/kotlin/g0201_0300/s0283_move_zeroes) [TypeScript](src/main/ts/g0201_0300/s0283_move_zeroes) [Scala](src/main/scala/g0201_0300/s0283_move_zeroes) [Ruby](src/main/ruby/g0201_0300/s0283_move_zeroes) [PHP](src/main/php/g0201_0300/s0283_move_zeroes) [C#](src/main/csharp/g0201_0300/s0283_move_zeroes) [Go](src/main/go/g0201_0300/s0283_move_zeroes) [Cpp](src/main/cpp/g0201_0300/s0283_move_zeroes) [Python](src/main/python/g0201_0300/s0283_move_zeroes) [Swift](src/main/swift/g0201_0300/s0283_move_zeroes) [Elixir](src/main/elixir/g0201_0300/s0283_move_zeroes) [Rust](src/main/rust/g0201_0300/s0283_move_zeroes) [Dart](src/main/dart/g0201_0300/s0283_move_zeroes) [C](src/main/c/g0201_0300/s0283_move_zeroes) [JavaScript](src/main/js/g0201_0300/s0283_move_zeroes) [Erlang](src/main/erlang/g0201_0300/s0283_move_zeroes) [Racket](src/main/racket/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 2 | 83.99 | 0240 |Search a 2D Matrix II| [Java](src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii) [Kotlin](src/main/kotlin/g0201_0300/s0240_search_a_2d_matrix_ii) [TypeScript](src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii) [Scala](src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii) [Ruby](src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii) [PHP](src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii) [C#](src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii) [Go](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii) [Cpp](src/main/cpp/g0201_0300/s0240_search_a_2d_matrix_ii) [Python](src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii) [Swift](src/main/swift/g0201_0300/s0240_search_a_2d_matrix_ii) [Elixir](src/main/elixir/g0201_0300/s0240_search_a_2d_matrix_ii) [Rust](src/main/rust/g0201_0300/s0240_search_a_2d_matrix_ii) [Dart](src/main/dart/g0201_0300/s0240_search_a_2d_matrix_ii) [C](src/main/c/g0201_0300/s0240_search_a_2d_matrix_ii) [JavaScript](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii) [Erlang](src/main/erlang/g0201_0300/s0240_search_a_2d_matrix_ii) [Racket](src/main/racket/g0201_0300/s0240_search_a_2d_matrix_ii)| 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) | 5 | 99.92 | 0239 |Sliding Window Maximum| [Java](src/main/java/g0201_0300/s0239_sliding_window_maximum) [Kotlin](src/main/kotlin/g0201_0300/s0239_sliding_window_maximum) [TypeScript](src/main/ts/g0201_0300/s0239_sliding_window_maximum) [Scala](src/main/scala/g0201_0300/s0239_sliding_window_maximum) [Ruby](src/main/ruby/g0201_0300/s0239_sliding_window_maximum) [PHP](src/main/php/g0201_0300/s0239_sliding_window_maximum) [C#](src/main/csharp/g0201_0300/s0239_sliding_window_maximum) [Go](src/main/go/g0201_0300/s0239_sliding_window_maximum) [Cpp](src/main/cpp/g0201_0300/s0239_sliding_window_maximum) [Python](src/main/python/g0201_0300/s0239_sliding_window_maximum) [Swift](src/main/swift/g0201_0300/s0239_sliding_window_maximum) [Elixir](src/main/elixir/g0201_0300/s0239_sliding_window_maximum) [Rust](src/main/rust/g0201_0300/s0239_sliding_window_maximum) [Dart](src/main/dart/g0201_0300/s0239_sliding_window_maximum) [C](src/main/c/g0201_0300/s0239_sliding_window_maximum) [JavaScript](src/main/js/g0201_0300/s0239_sliding_window_maximum) [Erlang](src/main/erlang/g0201_0300/s0239_sliding_window_maximum) [Racket](src/main/racket/g0201_0300/s0239_sliding_window_maximum)| 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) | 26 | 95.89 -| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 -| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 +| 0238 |Product of Array Except Self| [Java](src/main/java/g0201_0300/s0238_product_of_array_except_self) [Kotlin](src/main/kotlin/g0201_0300/s0238_product_of_array_except_self) [TypeScript](src/main/ts/g0201_0300/s0238_product_of_array_except_self) [Scala](src/main/scala/g0201_0300/s0238_product_of_array_except_self) [Ruby](src/main/ruby/g0201_0300/s0238_product_of_array_except_self) [PHP](src/main/php/g0201_0300/s0238_product_of_array_except_self) [C#](src/main/csharp/g0201_0300/s0238_product_of_array_except_self) [Go](src/main/go/g0201_0300/s0238_product_of_array_except_self) [Cpp](src/main/cpp/g0201_0300/s0238_product_of_array_except_self) [Python](src/main/python/g0201_0300/s0238_product_of_array_except_self) [Swift](src/main/swift/g0201_0300/s0238_product_of_array_except_self) [Elixir](src/main/elixir/g0201_0300/s0238_product_of_array_except_self) [Rust](src/main/rust/g0201_0300/s0238_product_of_array_except_self) [Dart](src/main/dart/g0201_0300/s0238_product_of_array_except_self) [C](src/main/c/g0201_0300/s0238_product_of_array_except_self) [JavaScript](src/main/js/g0201_0300/s0238_product_of_array_except_self) [Erlang](src/main/erlang/g0201_0300/s0238_product_of_array_except_self) [Racket](src/main/racket/g0201_0300/s0238_product_of_array_except_self)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, LeetCode_75_Array/String, Data_Structure_II_Day_5_Array, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n^2)_Space_O(n) | 1 | 99.66 +| 0236 |Lowest Common Ancestor of a Binary Tree| [Java](src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Scala](src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [PHP](src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C#](src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Go](src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Python](src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Swift](src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Rust](src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Dart](src/main/dart/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [C](src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [JavaScript](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree) [Racket](src/main/racket/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 | 0234 |Palindrome Linked List| [Java](src/main/java/g0201_0300/s0234_palindrome_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0234_palindrome_linked_list) [TypeScript](src/main/ts/g0201_0300/s0234_palindrome_linked_list) [Scala](src/main/scala/g0201_0300/s0234_palindrome_linked_list) [Ruby](src/main/ruby/g0201_0300/s0234_palindrome_linked_list) [PHP](src/main/php/g0201_0300/s0234_palindrome_linked_list) [C#](src/main/csharp/g0201_0300/s0234_palindrome_linked_list) [Go](src/main/go/g0201_0300/s0234_palindrome_linked_list) [Cpp](src/main/cpp/g0201_0300/s0234_palindrome_linked_list) [Python](src/main/python/g0201_0300/s0234_palindrome_linked_list) [Swift](src/main/swift/g0201_0300/s0234_palindrome_linked_list) [Elixir](src/main/elixir/g0201_0300/s0234_palindrome_linked_list) [Rust](src/main/rust/g0201_0300/s0234_palindrome_linked_list) [Dart](src/main/dart/g0201_0300/s0234_palindrome_linked_list) [C](src/main/c/g0201_0300/s0234_palindrome_linked_list) [JavaScript](src/main/js/g0201_0300/s0234_palindrome_linked_list) [Erlang](src/main/erlang/g0201_0300/s0234_palindrome_linked_list) [Racket](src/main/racket/g0201_0300/s0234_palindrome_linked_list)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 | 0230 |Kth Smallest Element in a BST| [Java](src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Kotlin](src/main/kotlin/g0201_0300/s0230_kth_smallest_element_in_a_bst) [TypeScript](src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Scala](src/main/scala/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Ruby](src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst) [PHP](src/main/php/g0201_0300/s0230_kth_smallest_element_in_a_bst) [C#](src/main/csharp/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Go](src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Cpp](src/main/cpp/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Python](src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Swift](src/main/swift/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Elixir](src/main/elixir/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Rust](src/main/rust/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Dart](src/main/dart/g0201_0300/s0230_kth_smallest_element_in_a_bst) [C](src/main/c/g0201_0300/s0230_kth_smallest_element_in_a_bst) [JavaScript](src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Erlang](src/main/erlang/g0201_0300/s0230_kth_smallest_element_in_a_bst) [Racket](src/main/racket/g0201_0300/s0230_kth_smallest_element_in_a_bst)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0226 |Invert Binary Tree| [Java](src/main/java/g0201_0300/s0226_invert_binary_tree) [Kotlin](src/main/kotlin/g0201_0300/s0226_invert_binary_tree) [TypeScript](src/main/ts/g0201_0300/s0226_invert_binary_tree) [Scala](src/main/scala/g0201_0300/s0226_invert_binary_tree) [Ruby](src/main/ruby/g0201_0300/s0226_invert_binary_tree) [PHP](src/main/php/g0201_0300/s0226_invert_binary_tree) [C#](src/main/csharp/g0201_0300/s0226_invert_binary_tree) [Go](src/main/go/g0201_0300/s0226_invert_binary_tree) [Cpp](src/main/cpp/g0201_0300/s0226_invert_binary_tree) [Python](src/main/python/g0201_0300/s0226_invert_binary_tree) [Swift](src/main/swift/g0201_0300/s0226_invert_binary_tree) [Elixir](src/main/elixir/g0201_0300/s0226_invert_binary_tree) [Rust](src/main/rust/g0201_0300/s0226_invert_binary_tree) [Dart](src/main/dart/g0201_0300/s0226_invert_binary_tree) [C](src/main/c/g0201_0300/s0226_invert_binary_tree) [JavaScript](src/main/js/g0201_0300/s0226_invert_binary_tree) [Erlang](src/main/erlang/g0201_0300/s0226_invert_binary_tree) [Racket](src/main/racket/g0201_0300/s0226_invert_binary_tree)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0221 |Maximal Square| [Java](src/main/java/g0201_0300/s0221_maximal_square) [Kotlin](src/main/kotlin/g0201_0300/s0221_maximal_square) [TypeScript](src/main/ts/g0201_0300/s0221_maximal_square) [Scala](src/main/scala/g0201_0300/s0221_maximal_square) [Ruby](src/main/ruby/g0201_0300/s0221_maximal_square) [PHP](src/main/php/g0201_0300/s0221_maximal_square) [C#](src/main/csharp/g0201_0300/s0221_maximal_square) [Go](src/main/go/g0201_0300/s0221_maximal_square) [Cpp](src/main/cpp/g0201_0300/s0221_maximal_square) [Python](src/main/python/g0201_0300/s0221_maximal_square) [Swift](src/main/swift/g0201_0300/s0221_maximal_square) [Elixir](src/main/elixir/g0201_0300/s0221_maximal_square) [Rust](src/main/rust/g0201_0300/s0221_maximal_square) [Dart](src/main/dart/g0201_0300/s0221_maximal_square) [C](src/main/c/g0201_0300/s0221_maximal_square) [JavaScript](src/main/js/g0201_0300/s0221_maximal_square) [Erlang](src/main/erlang/g0201_0300/s0221_maximal_square) [Racket](src/main/racket/g0201_0300/s0221_maximal_square)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\*n)_Space_O(m\*n) | 6 | 97.07 -| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 -| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 +| 0215 |Kth Largest Element in an Array| [Java](src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array) [Kotlin](src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array) [TypeScript](src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array) [Scala](src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array) [Ruby](src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array) [PHP](src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array) [C#](src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array) [Go](src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array) [Cpp](src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array) [Python](src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array) [Swift](src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array) [Elixir](src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array) [Rust](src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array) [Dart](src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array) [C](src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array) [JavaScript](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array) [Erlang](src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array) [Racket](src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, LeetCode_75_Heap/Priority_Queue, Data_Structure_II_Day_20_Heap_Priority_Queue, Top_Interview_150_Heap, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 5 | 70.82 +| 0208 |Implement Trie (Prefix Tree)| [Java](src/main/java/g0201_0300/s0208_implement_trie_prefix_tree) [Kotlin](src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree) [TypeScript](src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree) [Scala](src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree) [Ruby](src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree) [PHP](src/main/php/g0201_0300/s0208_implement_trie_prefix_tree) [C#](src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree) [Go](src/main/go/g0201_0300/s0208_implement_trie_prefix_tree) [Cpp](src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree) [Python](src/main/python/g0201_0300/s0208_implement_trie_prefix_tree) [Swift](src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree) [Elixir](src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree) [Rust](src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree) [Dart](src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree) [C](src/main/c/g0201_0300/s0208_implement_trie_prefix_tree) [JavaScript](src/main/js/g0201_0300/s0208_implement_trie_prefix_tree) [Erlang](src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree) [Racket](src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Design, Trie, LeetCode_75_Trie, Level_2_Day_16_Design, Udemy_Trie_and_Heap, Top_Interview_150_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 | 0207 |Course Schedule| [Java](src/main/java/g0201_0300/s0207_course_schedule) [Kotlin](src/main/kotlin/g0201_0300/s0207_course_schedule) [TypeScript](src/main/ts/g0201_0300/s0207_course_schedule) [Scala](src/main/scala/g0201_0300/s0207_course_schedule) [Ruby](src/main/ruby/g0201_0300/s0207_course_schedule) [PHP](src/main/php/g0201_0300/s0207_course_schedule) [C#](src/main/csharp/g0201_0300/s0207_course_schedule) [Go](src/main/go/g0201_0300/s0207_course_schedule) [Cpp](src/main/cpp/g0201_0300/s0207_course_schedule) [Python](src/main/python/g0201_0300/s0207_course_schedule) [Swift](src/main/swift/g0201_0300/s0207_course_schedule) [Elixir](src/main/elixir/g0201_0300/s0207_course_schedule) [Rust](src/main/rust/g0201_0300/s0207_course_schedule) [Dart](src/main/dart/g0201_0300/s0207_course_schedule) [C](src/main/c/g0201_0300/s0207_course_schedule) [JavaScript](src/main/js/g0201_0300/s0207_course_schedule) [Erlang](src/main/erlang/g0201_0300/s0207_course_schedule) [Racket](src/main/racket/g0201_0300/s0207_course_schedule)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Graph, Topological_Sort, Top_Interview_150_Graph_General, Big_O_Time_O(N)_Space_O(N) | 3 | 99.99 -| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 +| 0206 |Reverse Linked List| [Java](src/main/java/g0201_0300/s0206_reverse_linked_list) [Kotlin](src/main/kotlin/g0201_0300/s0206_reverse_linked_list) [TypeScript](src/main/ts/g0201_0300/s0206_reverse_linked_list) [Scala](src/main/scala/g0201_0300/s0206_reverse_linked_list) [Ruby](src/main/ruby/g0201_0300/s0206_reverse_linked_list) [PHP](src/main/php/g0201_0300/s0206_reverse_linked_list) [C#](src/main/csharp/g0201_0300/s0206_reverse_linked_list) [Go](src/main/go/g0201_0300/s0206_reverse_linked_list) [Cpp](src/main/cpp/g0201_0300/s0206_reverse_linked_list) [Python](src/main/python/g0201_0300/s0206_reverse_linked_list) [Swift](src/main/swift/g0201_0300/s0206_reverse_linked_list) [Elixir](src/main/elixir/g0201_0300/s0206_reverse_linked_list) [Rust](src/main/rust/g0201_0300/s0206_reverse_linked_list) [Dart](src/main/dart/g0201_0300/s0206_reverse_linked_list) [C](src/main/c/g0201_0300/s0206_reverse_linked_list) [JavaScript](src/main/js/g0201_0300/s0206_reverse_linked_list) [Erlang](src/main/erlang/g0201_0300/s0206_reverse_linked_list) [Racket](src/main/racket/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, LeetCode_75_LinkedList, Data_Structure_I_Day_8_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 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) [Scala](src/main/scala/g0101_0200/s0200_number_of_islands) [Ruby](src/main/ruby/g0101_0200/s0200_number_of_islands) [PHP](src/main/php/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) [Cpp](src/main/cpp/g0101_0200/s0200_number_of_islands) [Python](src/main/python/g0101_0200/s0200_number_of_islands) [Swift](src/main/swift/g0101_0200/s0200_number_of_islands) [Elixir](src/main/elixir/g0101_0200/s0200_number_of_islands) [Rust](src/main/rust/g0101_0200/s0200_number_of_islands) [Dart](src/main/dart/g0101_0200/s0200_number_of_islands) [C](src/main/c/g0101_0200/s0200_number_of_islands) [JavaScript](src/main/js/g0101_0200/s0200_number_of_islands) [Erlang](src/main/erlang/g0101_0200/s0200_number_of_islands) [Racket](src/main/racket/g0101_0200/s0200_number_of_islands)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search, Graph_Theory_I_Day_1_Matrix_Related_Problems, Level_1_Day_9_Graph/BFS/DFS, Udemy_Graph, Top_Interview_150_Graph_General, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0198 |House Robber| [Java](src/main/java/g0101_0200/s0198_house_robber) [Kotlin](src/main/kotlin/g0101_0200/s0198_house_robber) [TypeScript](src/main/ts/g0101_0200/s0198_house_robber) [Scala](src/main/scala/g0101_0200/s0198_house_robber) [Ruby](src/main/ruby/g0101_0200/s0198_house_robber) [PHP](src/main/php/g0101_0200/s0198_house_robber) [C#](src/main/csharp/g0101_0200/s0198_house_robber) [Go](src/main/go/g0101_0200/s0198_house_robber) [Cpp](src/main/cpp/g0101_0200/s0198_house_robber) [Python](src/main/python/g0101_0200/s0198_house_robber) [Swift](src/main/swift/g0101_0200/s0198_house_robber) [Elixir](src/main/elixir/g0101_0200/s0198_house_robber) [Rust](src/main/rust/g0101_0200/s0198_house_robber) [Dart](src/main/dart/g0101_0200/s0198_house_robber) [C](src/main/c/g0101_0200/s0198_house_robber) [JavaScript](src/main/js/g0101_0200/s0198_house_robber) [Erlang](src/main/erlang/g0101_0200/s0198_house_robber) [Racket](src/main/racket/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, LeetCode_75_DP/1D, Algorithm_I_Day_12_Dynamic_Programming, Dynamic_Programming_I_Day_3, Level_2_Day_12_Dynamic_Programming, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0189 |Rotate Array| [Java](src/main/java/g0101_0200/s0189_rotate_array) [Kotlin](src/main/kotlin/g0101_0200/s0189_rotate_array) [TypeScript](src/main/ts/g0101_0200/s0189_rotate_array) [Scala](src/main/scala/g0101_0200/s0189_rotate_array) [Ruby](src/main/ruby/g0101_0200/s0189_rotate_array) [PHP](src/main/php/g0101_0200/s0189_rotate_array) [C#](src/main/csharp/g0101_0200/s0189_rotate_array) [Go](src/main/go/g0101_0200/s0189_rotate_array) [Cpp](src/main/cpp/g0101_0200/s0189_rotate_array) [Python](src/main/python/g0101_0200/s0189_rotate_array) [Swift](src/main/swift/g0101_0200/s0189_rotate_array) [Elixir](src/main/elixir/g0101_0200/s0189_rotate_array) [Rust](src/main/rust/g0101_0200/s0189_rotate_array) [Dart](src/main/dart/g0101_0200/s0189_rotate_array) [C](src/main/c/g0101_0200/s0189_rotate_array) [JavaScript](src/main/js/g0101_0200/s0189_rotate_array) [Erlang](src/main/erlang/g0101_0200/s0189_rotate_array) [Racket](src/main/racket/g0101_0200/s0189_rotate_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Algorithm_I_Day_2_Two_Pointers, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0169 |Majority Element| [Java](src/main/java/g0101_0200/s0169_majority_element) [Kotlin](src/main/kotlin/g0101_0200/s0169_majority_element) [TypeScript](src/main/ts/g0101_0200/s0169_majority_element) [Scala](src/main/scala/g0101_0200/s0169_majority_element) [Ruby](src/main/ruby/g0101_0200/s0169_majority_element) [PHP](src/main/php/g0101_0200/s0169_majority_element) [C#](src/main/csharp/g0101_0200/s0169_majority_element) [Go](src/main/go/g0101_0200/s0169_majority_element) [Cpp](src/main/cpp/g0101_0200/s0169_majority_element) [Python](src/main/python/g0101_0200/s0169_majority_element) [Swift](src/main/swift/g0101_0200/s0169_majority_element) [Elixir](src/main/elixir/g0101_0200/s0169_majority_element) [Rust](src/main/rust/g0101_0200/s0169_majority_element) [Dart](src/main/dart/g0101_0200/s0169_majority_element) [C](src/main/c/g0101_0200/s0169_majority_element) [JavaScript](src/main/js/g0101_0200/s0169_majority_element) [Erlang](src/main/erlang/g0101_0200/s0169_majority_element) [Racket](src/main/racket/g0101_0200/s0169_majority_element)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Data_Structure_II_Day_1_Array, Udemy_Famous_Algorithm, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 | 0160 |Intersection of Two Linked Lists| [Java](src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists) [Kotlin](src/main/kotlin/g0101_0200/s0160_intersection_of_two_linked_lists) [TypeScript](src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists) [Scala](src/main/scala/g0101_0200/s0160_intersection_of_two_linked_lists) [Ruby](src/main/ruby/g0101_0200/s0160_intersection_of_two_linked_lists) [PHP](src/main/php/g0101_0200/s0160_intersection_of_two_linked_lists) [C#](src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists) [Go](src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists) [Cpp](src/main/cpp/g0101_0200/s0160_intersection_of_two_linked_lists) [Python](src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists) [Swift](src/main/swift/g0101_0200/s0160_intersection_of_two_linked_lists) [Elixir](src/main/elixir/g0101_0200/s0160_intersection_of_two_linked_lists) [Rust](src/main/rust/g0101_0200/s0160_intersection_of_two_linked_lists) [Dart](src/main/dart/g0101_0200/s0160_intersection_of_two_linked_lists) [C](src/main/c/g0101_0200/s0160_intersection_of_two_linked_lists) [JavaScript](src/main/js/g0101_0200/s0160_intersection_of_two_linked_lists) [Erlang](src/main/erlang/g0101_0200/s0160_intersection_of_two_linked_lists) [Racket](src/main/racket/g0101_0200/s0160_intersection_of_two_linked_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_11_Linked_List, Udemy_Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 1 | 99.92 @@ -1639,14 +1639,14 @@ | 0141 |Linked List Cycle| [Java](src/main/java/g0101_0200/s0141_linked_list_cycle) [Kotlin](src/main/kotlin/g0101_0200/s0141_linked_list_cycle) [TypeScript](src/main/ts/g0101_0200/s0141_linked_list_cycle) [Scala](src/main/scala/g0101_0200/s0141_linked_list_cycle) [Ruby](src/main/ruby/g0101_0200/s0141_linked_list_cycle) [PHP](src/main/php/g0101_0200/s0141_linked_list_cycle) [C#](src/main/csharp/g0101_0200/s0141_linked_list_cycle) [Go](src/main/go/g0101_0200/s0141_linked_list_cycle) [Cpp](src/main/cpp/g0101_0200/s0141_linked_list_cycle) [Python](src/main/python/g0101_0200/s0141_linked_list_cycle) [Swift](src/main/swift/g0101_0200/s0141_linked_list_cycle) [Elixir](src/main/elixir/g0101_0200/s0141_linked_list_cycle) [Rust](src/main/rust/g0101_0200/s0141_linked_list_cycle) [Dart](src/main/dart/g0101_0200/s0141_linked_list_cycle) [C](src/main/c/g0101_0200/s0141_linked_list_cycle) [JavaScript](src/main/js/g0101_0200/s0141_linked_list_cycle) [Erlang](src/main/erlang/g0101_0200/s0141_linked_list_cycle) [Racket](src/main/racket/g0101_0200/s0141_linked_list_cycle)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 | 0139 |Word Break| [Java](src/main/java/g0101_0200/s0139_word_break) [Kotlin](src/main/kotlin/g0101_0200/s0139_word_break) [TypeScript](src/main/ts/g0101_0200/s0139_word_break) [Scala](src/main/scala/g0101_0200/s0139_word_break) [Ruby](src/main/ruby/g0101_0200/s0139_word_break) [PHP](src/main/php/g0101_0200/s0139_word_break) [C#](src/main/csharp/g0101_0200/s0139_word_break) [Go](src/main/go/g0101_0200/s0139_word_break) [Cpp](src/main/cpp/g0101_0200/s0139_word_break) [Python](src/main/python/g0101_0200/s0139_word_break) [Swift](src/main/swift/g0101_0200/s0139_word_break) [Elixir](src/main/elixir/g0101_0200/s0139_word_break) [Rust](src/main/rust/g0101_0200/s0139_word_break) [Dart](src/main/dart/g0101_0200/s0139_word_break) [C](src/main/c/g0101_0200/s0139_word_break) [JavaScript](src/main/js/g0101_0200/s0139_word_break) [Erlang](src/main/erlang/g0101_0200/s0139_word_break) [Racket](src/main/racket/g0101_0200/s0139_word_break)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Top_Interview_150_1D_DP, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 1 | 99.42 | 0138 |Copy List with Random Pointer| [Java](src/main/java/g0101_0200/s0138_copy_list_with_random_pointer) [Kotlin](src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer) [TypeScript](src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer) [Scala](src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer) [Ruby](src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer) [PHP](src/main/php/g0101_0200/s0138_copy_list_with_random_pointer) [C#](src/main/csharp/g0101_0200/s0138_copy_list_with_random_pointer) [Go](src/main/go/g0101_0200/s0138_copy_list_with_random_pointer) [Cpp](src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer) [Python](src/main/python/g0101_0200/s0138_copy_list_with_random_pointer) [Swift](src/main/swift/g0101_0200/s0138_copy_list_with_random_pointer) [Elixir](src/main/elixir/g0101_0200/s0138_copy_list_with_random_pointer) [Rust](src/main/rust/g0101_0200/s0138_copy_list_with_random_pointer) [Dart](src/main/dart/g0101_0200/s0138_copy_list_with_random_pointer) [C](src/main/c/g0101_0200/s0138_copy_list_with_random_pointer) [JavaScript](src/main/js/g0101_0200/s0138_copy_list_with_random_pointer) [Erlang](src/main/erlang/g0101_0200/s0138_copy_list_with_random_pointer) [Racket](src/main/racket/g0101_0200/s0138_copy_list_with_random_pointer)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Programming_Skills_II_Day_14, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 -| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 0136 |Single Number| [Java](src/main/java/g0101_0200/s0136_single_number) [Kotlin](src/main/kotlin/g0101_0200/s0136_single_number) [TypeScript](src/main/ts/g0101_0200/s0136_single_number) [Scala](src/main/scala/g0101_0200/s0136_single_number) [Ruby](src/main/ruby/g0101_0200/s0136_single_number) [PHP](src/main/php/g0101_0200/s0136_single_number) [C#](src/main/csharp/g0101_0200/s0136_single_number) [Go](src/main/go/g0101_0200/s0136_single_number) [Cpp](src/main/cpp/g0101_0200/s0136_single_number) [Python](src/main/python/g0101_0200/s0136_single_number) [Swift](src/main/swift/g0101_0200/s0136_single_number) [Elixir](src/main/elixir/g0101_0200/s0136_single_number) [Rust](src/main/rust/g0101_0200/s0136_single_number) [Dart](src/main/dart/g0101_0200/s0136_single_number) [C](src/main/c/g0101_0200/s0136_single_number) [JavaScript](src/main/js/g0101_0200/s0136_single_number) [Erlang](src/main/erlang/g0101_0200/s0136_single_number) [Racket](src/main/racket/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, LeetCode_75_Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Top_Interview_150_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 | 0131 |Palindrome Partitioning| [Java](src/main/java/g0101_0200/s0131_palindrome_partitioning) [Kotlin](src/main/kotlin/g0101_0200/s0131_palindrome_partitioning) [TypeScript](src/main/ts/g0101_0200/s0131_palindrome_partitioning) [Scala](src/main/scala/g0101_0200/s0131_palindrome_partitioning) [Ruby](src/main/ruby/g0101_0200/s0131_palindrome_partitioning) [PHP](src/main/php/g0101_0200/s0131_palindrome_partitioning) [C#](src/main/csharp/g0101_0200/s0131_palindrome_partitioning) [Go](src/main/go/g0101_0200/s0131_palindrome_partitioning) [Cpp](src/main/cpp/g0101_0200/s0131_palindrome_partitioning) [Python](src/main/python/g0101_0200/s0131_palindrome_partitioning) [Swift](src/main/swift/g0101_0200/s0131_palindrome_partitioning) [Elixir](src/main/elixir/g0101_0200/s0131_palindrome_partitioning) [Rust](src/main/rust/g0101_0200/s0131_palindrome_partitioning) [Dart](src/main/dart/g0101_0200/s0131_palindrome_partitioning) [C](src/main/c/g0101_0200/s0131_palindrome_partitioning) [JavaScript](src/main/js/g0101_0200/s0131_palindrome_partitioning) [Erlang](src/main/erlang/g0101_0200/s0131_palindrome_partitioning) [Racket](src/main/racket/g0101_0200/s0131_palindrome_partitioning)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\*2^N)_Space_O(2^N\*N) | 7 | 98.55 | 0128 |Longest Consecutive Sequence| [Java](src/main/java/g0101_0200/s0128_longest_consecutive_sequence) [Kotlin](src/main/kotlin/g0101_0200/s0128_longest_consecutive_sequence) [TypeScript](src/main/ts/g0101_0200/s0128_longest_consecutive_sequence) [Scala](src/main/scala/g0101_0200/s0128_longest_consecutive_sequence) [Ruby](src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence) [PHP](src/main/php/g0101_0200/s0128_longest_consecutive_sequence) [C#](src/main/csharp/g0101_0200/s0128_longest_consecutive_sequence) [Go](src/main/go/g0101_0200/s0128_longest_consecutive_sequence) [Cpp](src/main/cpp/g0101_0200/s0128_longest_consecutive_sequence) [Python](src/main/python/g0101_0200/s0128_longest_consecutive_sequence) [Swift](src/main/swift/g0101_0200/s0128_longest_consecutive_sequence) [Elixir](src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence) [Rust](src/main/rust/g0101_0200/s0128_longest_consecutive_sequence) [Dart](src/main/dart/g0101_0200/s0128_longest_consecutive_sequence) [C](src/main/c/g0101_0200/s0128_longest_consecutive_sequence) [JavaScript](src/main/js/g0101_0200/s0128_longest_consecutive_sequence) [Erlang](src/main/erlang/g0101_0200/s0128_longest_consecutive_sequence) [Racket](src/main/racket/g0101_0200/s0128_longest_consecutive_sequence)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Top_Interview_150_Hashmap, Big_O_Time_O(N_log_N)_Space_O(1) | 14 | 98.89 | 0124 |Binary Tree Maximum Path Sum| [Java](src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum) [Kotlin](src/main/kotlin/g0101_0200/s0124_binary_tree_maximum_path_sum) [TypeScript](src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum) [Scala](src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum) [Ruby](src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum) [PHP](src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum) [C#](src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Go](src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum) [Cpp](src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum) [Python](src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum) [Swift](src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum) [Elixir](src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum) [Rust](src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum) [Dart](src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum) [C](src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum) [JavaScript](src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum) [Erlang](src/main/erlang/g0101_0200/s0124_binary_tree_maximum_path_sum) [Racket](src/main/racket/g0101_0200/s0124_binary_tree_maximum_path_sum)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0121 |Best Time to Buy and Sell Stock| [Java](src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Kotlin](src/main/kotlin/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [TypeScript](src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Scala](src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Ruby](src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [PHP](src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C#](src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Go](src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Cpp](src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Python](src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Swift](src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Elixir](src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Rust](src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Dart](src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [C](src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [JavaScript](src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Erlang](src/main/erlang/g0101_0200/s0121_best_time_to_buy_and_sell_stock) [Racket](src/main/racket/g0101_0200/s0121_best_time_to_buy_and_sell_stock)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Top_Interview_150_Array/String, Big_O_Time_O(N)_Space_O(1) | 1 | 99.78 | 0114 |Flatten Binary Tree to Linked List| [Java](src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Kotlin](src/main/kotlin/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [TypeScript](src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Scala](src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Ruby](src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [PHP](src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [C#](src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Go](src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Cpp](src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Python](src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Swift](src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Elixir](src/main/elixir/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Rust](src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Dart](src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [C](src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [JavaScript](src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Erlang](src/main/erlang/g0101_0200/s0114_flatten_binary_tree_to_linked_list) [Racket](src/main/racket/g0101_0200/s0114_flatten_binary_tree_to_linked_list)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 | 0105 |Construct Binary Tree from Preorder and Inorder Traversal| [Java](src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Kotlin](src/main/kotlin/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [TypeScript](src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Scala](src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Ruby](src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [PHP](src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [C#](src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Go](src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Cpp](src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Python](src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Swift](src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Elixir](src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Rust](src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Dart](src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [C](src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [JavaScript](src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Erlang](src/main/erlang/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal) [Racket](src/main/racket/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(N) | 1 | 96.33 -| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 +| 0104 |Maximum Depth of Binary Tree| [Java](src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree) [Kotlin](src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree) [TypeScript](src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree) [Scala](src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree) [Ruby](src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree) [PHP](src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree) [C#](src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Go](src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree) [Cpp](src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree) [Python](src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree) [Swift](src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree) [Elixir](src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree) [Rust](src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree) [Dart](src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree) [C](src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree) [JavaScript](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree) [Erlang](src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree) [Racket](src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00 | 0102 |Binary Tree Level Order Traversal| [Java](src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal) [Kotlin](src/main/kotlin/g0101_0200/s0102_binary_tree_level_order_traversal) [TypeScript](src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal) [Scala](src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal) [Ruby](src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal) [PHP](src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal) [C#](src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal) [Go](src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal) [Cpp](src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal) [Python](src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal) [Swift](src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal) [Elixir](src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal) [Rust](src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal) [Dart](src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal) [C](src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal) [JavaScript](src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal) [Erlang](src/main/erlang/g0101_0200/s0102_binary_tree_level_order_traversal) [Racket](src/main/racket/g0101_0200/s0102_binary_tree_level_order_traversal)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_1_Day_6_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Tree_BFS, Big_O_Time_O(N)_Space_O(N) | 1 | 91.19 | 0101 |Symmetric Tree| [Java](src/main/java/g0101_0200/s0101_symmetric_tree) [Kotlin](src/main/kotlin/g0101_0200/s0101_symmetric_tree) [TypeScript](src/main/ts/g0101_0200/s0101_symmetric_tree) [Scala](src/main/scala/g0101_0200/s0101_symmetric_tree) [Ruby](src/main/ruby/g0101_0200/s0101_symmetric_tree) [PHP](src/main/php/g0101_0200/s0101_symmetric_tree) [C#](src/main/csharp/g0101_0200/s0101_symmetric_tree) [Go](src/main/go/g0101_0200/s0101_symmetric_tree) [Cpp](src/main/cpp/g0101_0200/s0101_symmetric_tree) [Python](src/main/python/g0101_0200/s0101_symmetric_tree) [Swift](src/main/swift/g0101_0200/s0101_symmetric_tree) [Elixir](src/main/elixir/g0101_0200/s0101_symmetric_tree) [Rust](src/main/rust/g0101_0200/s0101_symmetric_tree) [Dart](src/main/dart/g0101_0200/s0101_symmetric_tree) [C](src/main/c/g0101_0200/s0101_symmetric_tree) [JavaScript](src/main/js/g0101_0200/s0101_symmetric_tree) [Erlang](src/main/erlang/g0101_0200/s0101_symmetric_tree) [Racket](src/main/racket/g0101_0200/s0101_symmetric_tree)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_11_Tree, Level_2_Day_15_Tree, Top_Interview_150_Binary_Tree_General, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 | 0098 |Validate Binary Search Tree| [Java](src/main/java/g0001_0100/s0098_validate_binary_search_tree) [Kotlin](src/main/kotlin/g0001_0100/s0098_validate_binary_search_tree) [TypeScript](src/main/ts/g0001_0100/s0098_validate_binary_search_tree) [Scala](src/main/scala/g0001_0100/s0098_validate_binary_search_tree) [Ruby](src/main/ruby/g0001_0100/s0098_validate_binary_search_tree) [PHP](src/main/php/g0001_0100/s0098_validate_binary_search_tree) [C#](src/main/csharp/g0001_0100/s0098_validate_binary_search_tree) [Go](src/main/go/g0001_0100/s0098_validate_binary_search_tree) [Cpp](src/main/cpp/g0001_0100/s0098_validate_binary_search_tree) [Python](src/main/python/g0001_0100/s0098_validate_binary_search_tree) [Swift](src/main/swift/g0001_0100/s0098_validate_binary_search_tree) [Elixir](src/main/elixir/g0001_0100/s0098_validate_binary_search_tree) [Rust](src/main/rust/g0001_0100/s0098_validate_binary_search_tree) [Dart](src/main/dart/g0001_0100/s0098_validate_binary_search_tree) [C](src/main/c/g0001_0100/s0098_validate_binary_search_tree) [JavaScript](src/main/js/g0001_0100/s0098_validate_binary_search_tree) [Erlang](src/main/erlang/g0001_0100/s0098_validate_binary_search_tree) [Racket](src/main/racket/g0001_0100/s0098_validate_binary_search_tree)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_I_Day_14_Tree, Level_1_Day_8_Binary_Search_Tree, Udemy_Tree_Stack_Queue, Top_Interview_150_Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 @@ -1659,10 +1659,10 @@ | 0075 |Sort Colors| [Java](src/main/java/g0001_0100/s0075_sort_colors) [Kotlin](src/main/kotlin/g0001_0100/s0075_sort_colors) [TypeScript](src/main/ts/g0001_0100/s0075_sort_colors) [Scala](src/main/scala/g0001_0100/s0075_sort_colors) [Ruby](src/main/ruby/g0001_0100/s0075_sort_colors) [PHP](src/main/php/g0001_0100/s0075_sort_colors) [C#](src/main/csharp/g0001_0100/s0075_sort_colors) [Go](src/main/go/g0001_0100/s0075_sort_colors) [Cpp](src/main/cpp/g0001_0100/s0075_sort_colors) [Python](src/main/python/g0001_0100/s0075_sort_colors) [Swift](src/main/swift/g0001_0100/s0075_sort_colors) [Elixir](src/main/elixir/g0001_0100/s0075_sort_colors) [Rust](src/main/rust/g0001_0100/s0075_sort_colors) [Dart](src/main/dart/g0001_0100/s0075_sort_colors) [C](src/main/c/g0001_0100/s0075_sort_colors) [JavaScript](src/main/js/g0001_0100/s0075_sort_colors) [Erlang](src/main/erlang/g0001_0100/s0075_sort_colors) [Racket](src/main/racket/g0001_0100/s0075_sort_colors)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_2_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0074 |Search a 2D Matrix| [Java](src/main/java/g0001_0100/s0074_search_a_2d_matrix) [Kotlin](src/main/kotlin/g0001_0100/s0074_search_a_2d_matrix) [TypeScript](src/main/ts/g0001_0100/s0074_search_a_2d_matrix) [Scala](src/main/scala/g0001_0100/s0074_search_a_2d_matrix) [Ruby](src/main/ruby/g0001_0100/s0074_search_a_2d_matrix) [PHP](src/main/php/g0001_0100/s0074_search_a_2d_matrix) [C#](src/main/csharp/g0001_0100/s0074_search_a_2d_matrix) [Go](src/main/go/g0001_0100/s0074_search_a_2d_matrix) [Cpp](src/main/cpp/g0001_0100/s0074_search_a_2d_matrix) [Python](src/main/python/g0001_0100/s0074_search_a_2d_matrix) [Swift](src/main/swift/g0001_0100/s0074_search_a_2d_matrix) [Elixir](src/main/elixir/g0001_0100/s0074_search_a_2d_matrix) [Rust](src/main/rust/g0001_0100/s0074_search_a_2d_matrix) [Dart](src/main/dart/g0001_0100/s0074_search_a_2d_matrix) [C](src/main/c/g0001_0100/s0074_search_a_2d_matrix) [JavaScript](src/main/js/g0001_0100/s0074_search_a_2d_matrix) [Erlang](src/main/erlang/g0001_0100/s0074_search_a_2d_matrix) [Racket](src/main/racket/g0001_0100/s0074_search_a_2d_matrix)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Data_Structure_I_Day_5_Array, Algorithm_II_Day_1_Binary_Search, Binary_Search_I_Day_8, Level_2_Day_8_Binary_Search, Udemy_2D_Arrays/Matrix, Top_Interview_150_Binary_Search, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 | 0073 |Set Matrix Zeroes| [Java](src/main/java/g0001_0100/s0073_set_matrix_zeroes) [Kotlin](src/main/kotlin/g0001_0100/s0073_set_matrix_zeroes) [TypeScript](src/main/ts/g0001_0100/s0073_set_matrix_zeroes) [Scala](src/main/scala/g0001_0100/s0073_set_matrix_zeroes) [Ruby](src/main/ruby/g0001_0100/s0073_set_matrix_zeroes) [PHP](src/main/php/g0001_0100/s0073_set_matrix_zeroes) [C#](src/main/csharp/g0001_0100/s0073_set_matrix_zeroes) [Go](src/main/go/g0001_0100/s0073_set_matrix_zeroes) [Cpp](src/main/cpp/g0001_0100/s0073_set_matrix_zeroes) [Python](src/main/python/g0001_0100/s0073_set_matrix_zeroes) [Swift](src/main/swift/g0001_0100/s0073_set_matrix_zeroes) [Elixir](src/main/elixir/g0001_0100/s0073_set_matrix_zeroes) [Rust](src/main/rust/g0001_0100/s0073_set_matrix_zeroes) [Dart](src/main/dart/g0001_0100/s0073_set_matrix_zeroes) [C](src/main/c/g0001_0100/s0073_set_matrix_zeroes) [JavaScript](src/main/js/g0001_0100/s0073_set_matrix_zeroes) [Erlang](src/main/erlang/g0001_0100/s0073_set_matrix_zeroes) [Racket](src/main/racket/g0001_0100/s0073_set_matrix_zeroes)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Matrix, Udemy_2D_Arrays/Matrix, Top_Interview_150_Matrix, Big_O_Time_O(m\*n)_Space_O(1) | 0 | 100.00 -| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 +| 0072 |Edit Distance| [Java](src/main/java/g0001_0100/s0072_edit_distance) [Kotlin](src/main/kotlin/g0001_0100/s0072_edit_distance) [TypeScript](src/main/ts/g0001_0100/s0072_edit_distance) [Scala](src/main/scala/g0001_0100/s0072_edit_distance) [Ruby](src/main/ruby/g0001_0100/s0072_edit_distance) [PHP](src/main/php/g0001_0100/s0072_edit_distance) [C#](src/main/csharp/g0001_0100/s0072_edit_distance) [Go](src/main/go/g0001_0100/s0072_edit_distance) [Cpp](src/main/cpp/g0001_0100/s0072_edit_distance) [Python](src/main/python/g0001_0100/s0072_edit_distance) [Swift](src/main/swift/g0001_0100/s0072_edit_distance) [Elixir](src/main/elixir/g0001_0100/s0072_edit_distance) [Rust](src/main/rust/g0001_0100/s0072_edit_distance) [Dart](src/main/dart/g0001_0100/s0072_edit_distance) [C](src/main/c/g0001_0100/s0072_edit_distance) [JavaScript](src/main/js/g0001_0100/s0072_edit_distance) [Erlang](src/main/erlang/g0001_0100/s0072_edit_distance) [Racket](src/main/racket/g0001_0100/s0072_edit_distance)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, LeetCode_75_DP/Multidimensional, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_19, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n^2)_Space_O(n2) | 3 | 97.19 | 0070 |Climbing Stairs| [Java](src/main/java/g0001_0100/s0070_climbing_stairs) [Kotlin](src/main/kotlin/g0001_0100/s0070_climbing_stairs) [TypeScript](src/main/ts/g0001_0100/s0070_climbing_stairs) [Scala](src/main/scala/g0001_0100/s0070_climbing_stairs) [Ruby](src/main/ruby/g0001_0100/s0070_climbing_stairs) [PHP](src/main/php/g0001_0100/s0070_climbing_stairs) [C#](src/main/csharp/g0001_0100/s0070_climbing_stairs) [Go](src/main/go/g0001_0100/s0070_climbing_stairs) [Cpp](src/main/cpp/g0001_0100/s0070_climbing_stairs) [Python](src/main/python/g0001_0100/s0070_climbing_stairs) [Swift](src/main/swift/g0001_0100/s0070_climbing_stairs) [Elixir](src/main/elixir/g0001_0100/s0070_climbing_stairs) [Rust](src/main/rust/g0001_0100/s0070_climbing_stairs) [Dart](src/main/dart/g0001_0100/s0070_climbing_stairs) [C](src/main/c/g0001_0100/s0070_climbing_stairs) [JavaScript](src/main/js/g0001_0100/s0070_climbing_stairs) [Erlang](src/main/erlang/g0001_0100/s0070_climbing_stairs) [Racket](src/main/racket/g0001_0100/s0070_climbing_stairs)| 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, Top_Interview_150_1D_DP, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 | 0064 |Minimum Path Sum| [Java](src/main/java/g0001_0100/s0064_minimum_path_sum) [Kotlin](src/main/kotlin/g0001_0100/s0064_minimum_path_sum) [TypeScript](src/main/ts/g0001_0100/s0064_minimum_path_sum) [Scala](src/main/scala/g0001_0100/s0064_minimum_path_sum) [Ruby](src/main/ruby/g0001_0100/s0064_minimum_path_sum) [PHP](src/main/php/g0001_0100/s0064_minimum_path_sum) [C#](src/main/csharp/g0001_0100/s0064_minimum_path_sum) [Go](src/main/go/g0001_0100/s0064_minimum_path_sum) [Cpp](src/main/cpp/g0001_0100/s0064_minimum_path_sum) [Python](src/main/python/g0001_0100/s0064_minimum_path_sum) [Swift](src/main/swift/g0001_0100/s0064_minimum_path_sum) [Elixir](src/main/elixir/g0001_0100/s0064_minimum_path_sum) [Rust](src/main/rust/g0001_0100/s0064_minimum_path_sum) [Dart](src/main/dart/g0001_0100/s0064_minimum_path_sum) [C](src/main/c/g0001_0100/s0064_minimum_path_sum) [JavaScript](src/main/js/g0001_0100/s0064_minimum_path_sum) [Erlang](src/main/erlang/g0001_0100/s0064_minimum_path_sum) [Racket](src/main/racket/g0001_0100/s0064_minimum_path_sum)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Udemy_Dynamic_Programming, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 99.73 -| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/g0001_0100/s0062_unique_paths)| 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) | 0 | 100.00 +| 0062 |Unique Paths| [Java](src/main/java/g0001_0100/s0062_unique_paths) [Kotlin](src/main/kotlin/g0001_0100/s0062_unique_paths) [TypeScript](src/main/ts/g0001_0100/s0062_unique_paths) [Scala](src/main/scala/g0001_0100/s0062_unique_paths) [Ruby](src/main/ruby/g0001_0100/s0062_unique_paths) [PHP](src/main/php/g0001_0100/s0062_unique_paths) [C#](src/main/csharp/g0001_0100/s0062_unique_paths) [Go](src/main/go/g0001_0100/s0062_unique_paths) [Cpp](src/main/cpp/g0001_0100/s0062_unique_paths) [Python](src/main/python/g0001_0100/s0062_unique_paths) [Swift](src/main/swift/g0001_0100/s0062_unique_paths) [Elixir](src/main/elixir/g0001_0100/s0062_unique_paths) [Rust](src/main/rust/g0001_0100/s0062_unique_paths) [Dart](src/main/dart/g0001_0100/s0062_unique_paths) [C](src/main/c/g0001_0100/s0062_unique_paths) [JavaScript](src/main/js/g0001_0100/s0062_unique_paths) [Erlang](src/main/erlang/g0001_0100/s0062_unique_paths) [Racket](src/main/racket/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, LeetCode_75_DP/Multidimensional, 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) | 0 | 100.00 | 0056 |Merge Intervals| [Java](src/main/java/g0001_0100/s0056_merge_intervals) [Kotlin](src/main/kotlin/g0001_0100/s0056_merge_intervals) [TypeScript](src/main/ts/g0001_0100/s0056_merge_intervals) [Scala](src/main/scala/g0001_0100/s0056_merge_intervals) [Ruby](src/main/ruby/g0001_0100/s0056_merge_intervals) [PHP](src/main/php/g0001_0100/s0056_merge_intervals) [C#](src/main/csharp/g0001_0100/s0056_merge_intervals) [Go](src/main/go/g0001_0100/s0056_merge_intervals) [Cpp](src/main/cpp/g0001_0100/s0056_merge_intervals) [Python](src/main/python/g0001_0100/s0056_merge_intervals) [Swift](src/main/swift/g0001_0100/s0056_merge_intervals) [Elixir](src/main/elixir/g0001_0100/s0056_merge_intervals) [Rust](src/main/rust/g0001_0100/s0056_merge_intervals) [Dart](src/main/dart/g0001_0100/s0056_merge_intervals) [C](src/main/c/g0001_0100/s0056_merge_intervals) [JavaScript](src/main/js/g0001_0100/s0056_merge_intervals) [Erlang](src/main/erlang/g0001_0100/s0056_merge_intervals) [Racket](src/main/racket/g0001_0100/s0056_merge_intervals)| 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, Top_Interview_150_Intervals, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 | 0055 |Jump Game| [Java](src/main/java/g0001_0100/s0055_jump_game) [Kotlin](src/main/kotlin/g0001_0100/s0055_jump_game) [TypeScript](src/main/ts/g0001_0100/s0055_jump_game) [Scala](src/main/scala/g0001_0100/s0055_jump_game) [Ruby](src/main/ruby/g0001_0100/s0055_jump_game) [PHP](src/main/php/g0001_0100/s0055_jump_game) [C#](src/main/csharp/g0001_0100/s0055_jump_game) [Go](src/main/go/g0001_0100/s0055_jump_game) [Cpp](src/main/cpp/g0001_0100/s0055_jump_game) [Python](src/main/python/g0001_0100/s0055_jump_game) [Swift](src/main/swift/g0001_0100/s0055_jump_game) [Elixir](src/main/elixir/g0001_0100/s0055_jump_game) [Rust](src/main/rust/g0001_0100/s0055_jump_game) [Dart](src/main/dart/g0001_0100/s0055_jump_game) [C](src/main/c/g0001_0100/s0055_jump_game) [JavaScript](src/main/js/g0001_0100/s0055_jump_game) [Erlang](src/main/erlang/g0001_0100/s0055_jump_game) [Racket](src/main/racket/g0001_0100/s0055_jump_game)| 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, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00 | 0053 |Maximum Subarray| [Java](src/main/java/g0001_0100/s0053_maximum_subarray) [Kotlin](src/main/kotlin/g0001_0100/s0053_maximum_subarray) [TypeScript](src/main/ts/g0001_0100/s0053_maximum_subarray) [Scala](src/main/scala/g0001_0100/s0053_maximum_subarray) [Ruby](src/main/ruby/g0001_0100/s0053_maximum_subarray) [PHP](src/main/php/g0001_0100/s0053_maximum_subarray) [C#](src/main/csharp/g0001_0100/s0053_maximum_subarray) [Go](src/main/go/g0001_0100/s0053_maximum_subarray) [Cpp](src/main/cpp/g0001_0100/s0053_maximum_subarray) [Python](src/main/python/g0001_0100/s0053_maximum_subarray) [Swift](src/main/swift/g0001_0100/s0053_maximum_subarray) [Elixir](src/main/elixir/g0001_0100/s0053_maximum_subarray) [Rust](src/main/rust/g0001_0100/s0053_maximum_subarray) [Dart](src/main/dart/g0001_0100/s0053_maximum_subarray) [C](src/main/c/g0001_0100/s0053_maximum_subarray) [JavaScript](src/main/js/g0001_0100/s0053_maximum_subarray) [Erlang](src/main/erlang/g0001_0100/s0053_maximum_subarray) [Racket](src/main/racket/g0001_0100/s0053_maximum_subarray)| 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, Top_Interview_150_Kadane's_Algorithm, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 @@ -1686,9 +1686,9 @@ | 0021 |Merge Two Sorted Lists| [Java](src/main/java/g0001_0100/s0021_merge_two_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0021_merge_two_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists) [Scala](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists) [PHP](src/main/php/g0001_0100/s0021_merge_two_sorted_lists) [C#](src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists) [Go](src/main/go/g0001_0100/s0021_merge_two_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists) [Python](src/main/python/g0001_0100/s0021_merge_two_sorted_lists) [Swift](src/main/swift/g0001_0100/s0021_merge_two_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists) [Rust](src/main/rust/g0001_0100/s0021_merge_two_sorted_lists) [Dart](src/main/dart/g0001_0100/s0021_merge_two_sorted_lists) [C](src/main/c/g0001_0100/s0021_merge_two_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0021_merge_two_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0021_merge_two_sorted_lists) [Racket](src/main/racket/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Data_Structure_I_Day_7_Linked_List, Algorithm_I_Day_10_Recursion_Backtracking, Level_1_Day_3_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00 | 0020 |Valid Parentheses| [Java](src/main/java/g0001_0100/s0020_valid_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0020_valid_parentheses) [TypeScript](src/main/ts/g0001_0100/s0020_valid_parentheses) [Scala](src/main/scala/g0001_0100/s0020_valid_parentheses) [Ruby](src/main/ruby/g0001_0100/s0020_valid_parentheses) [PHP](src/main/php/g0001_0100/s0020_valid_parentheses) [C#](src/main/csharp/g0001_0100/s0020_valid_parentheses) [Go](src/main/go/g0001_0100/s0020_valid_parentheses) [Cpp](src/main/cpp/g0001_0100/s0020_valid_parentheses) [Python](src/main/python/g0001_0100/s0020_valid_parentheses) [Swift](src/main/swift/g0001_0100/s0020_valid_parentheses) [Elixir](src/main/elixir/g0001_0100/s0020_valid_parentheses) [Rust](src/main/rust/g0001_0100/s0020_valid_parentheses) [Dart](src/main/dart/g0001_0100/s0020_valid_parentheses) [C](src/main/c/g0001_0100/s0020_valid_parentheses) [JavaScript](src/main/js/g0001_0100/s0020_valid_parentheses) [Erlang](src/main/erlang/g0001_0100/s0020_valid_parentheses) [Racket](src/main/racket/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Top_Interview_150_Stack, Big_O_Time_O(n)_Space_O(n) | 2 | 97.19 | 0019 |Remove Nth Node From End of List| [Java](src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Kotlin](src/main/kotlin/g0001_0100/s0019_remove_nth_node_from_end_of_list) [TypeScript](src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Scala](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Ruby](src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list) [PHP](src/main/php/g0001_0100/s0019_remove_nth_node_from_end_of_list) [C#](src/main/csharp/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Go](src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Cpp](src/main/cpp/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Python](src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Swift](src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Elixir](src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Rust](src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Dart](src/main/dart/g0001_0100/s0019_remove_nth_node_from_end_of_list) [C](src/main/c/g0001_0100/s0019_remove_nth_node_from_end_of_list) [JavaScript](src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Erlang](src/main/erlang/g0001_0100/s0019_remove_nth_node_from_end_of_list) [Racket](src/main/racket/g0001_0100/s0019_remove_nth_node_from_end_of_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 -| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 +| 0017 |Letter Combinations of a Phone Number| [Java](src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Kotlin](src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number) [TypeScript](src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Scala](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Ruby](src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number) [PHP](src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C#](src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Go](src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Cpp](src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Python](src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Swift](src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Elixir](src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Rust](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Dart](src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number) [C](src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number) [JavaScript](src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Erlang](src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number) [Racket](src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, LeetCode_75_Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00 | 0015 |3Sum| [Java](src/main/java/g0001_0100/s0015_3sum) [Kotlin](src/main/kotlin/g0001_0100/s0015_3sum) [TypeScript](src/main/ts/g0001_0100/s0015_3sum) [Scala](src/main/scala/g0001_0100/s0015_3sum) [Ruby](src/main/ruby/g0001_0100/s0015_3sum) [PHP](src/main/php/g0001_0100/s0015_3sum) [C#](src/main/csharp/g0001_0100/s0015_3sum) [Go](src/main/go/g0001_0100/s0015_3sum) [Cpp](src/main/cpp/g0001_0100/s0015_3sum) [Python](src/main/python/g0001_0100/s0015_3sum) [Swift](src/main/swift/g0001_0100/s0015_3sum) [Elixir](src/main/elixir/g0001_0100/s0015_3sum) [Rust](src/main/rust/g0001_0100/s0015_3sum) [Dart](src/main/dart/g0001_0100/s0015_3sum) [C](src/main/c/g0001_0100/s0015_3sum) [JavaScript](src/main/js/g0001_0100/s0015_3sum) [Erlang](src/main/erlang/g0001_0100/s0015_3sum) [Racket](src/main/racket/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02 -| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0011 |Container With Most Water| [Java](src/main/java/g0001_0100/s0011_container_with_most_water) [Kotlin](src/main/kotlin/g0001_0100/s0011_container_with_most_water) [TypeScript](src/main/ts/g0001_0100/s0011_container_with_most_water) [Scala](src/main/scala/g0001_0100/s0011_container_with_most_water) [Ruby](src/main/ruby/g0001_0100/s0011_container_with_most_water) [PHP](src/main/php/g0001_0100/s0011_container_with_most_water) [C#](src/main/csharp/g0001_0100/s0011_container_with_most_water) [Go](src/main/go/g0001_0100/s0011_container_with_most_water) [Cpp](src/main/cpp/g0001_0100/s0011_container_with_most_water) [Python](src/main/python/g0001_0100/s0011_container_with_most_water) [Swift](src/main/swift/g0001_0100/s0011_container_with_most_water) [Elixir](src/main/elixir/g0001_0100/s0011_container_with_most_water) [Rust](src/main/rust/g0001_0100/s0011_container_with_most_water) [Dart](src/main/dart/g0001_0100/s0011_container_with_most_water) [C](src/main/c/g0001_0100/s0011_container_with_most_water) [JavaScript](src/main/js/g0001_0100/s0011_container_with_most_water) [Erlang](src/main/erlang/g0001_0100/s0011_container_with_most_water) [Racket](src/main/racket/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, LeetCode_75_Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Top_Interview_150_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 | 0010 |Regular Expression Matching| [Java](src/main/java/g0001_0100/s0010_regular_expression_matching) [Kotlin](src/main/kotlin/g0001_0100/s0010_regular_expression_matching) [TypeScript](src/main/ts/g0001_0100/s0010_regular_expression_matching) [Scala](src/main/scala/g0001_0100/s0010_regular_expression_matching) [Ruby](src/main/ruby/g0001_0100/s0010_regular_expression_matching) [PHP](src/main/php/g0001_0100/s0010_regular_expression_matching) [C#](src/main/csharp/g0001_0100/s0010_regular_expression_matching) [Go](src/main/go/g0001_0100/s0010_regular_expression_matching) [Cpp](src/main/cpp/g0001_0100/s0010_regular_expression_matching) [Python](src/main/python/g0001_0100/s0010_regular_expression_matching) [Swift](src/main/swift/g0001_0100/s0010_regular_expression_matching) [Elixir](src/main/elixir/g0001_0100/s0010_regular_expression_matching) [Rust](src/main/rust/g0001_0100/s0010_regular_expression_matching) [Dart](src/main/dart/g0001_0100/s0010_regular_expression_matching) [C](src/main/c/g0001_0100/s0010_regular_expression_matching) [JavaScript](src/main/js/g0001_0100/s0010_regular_expression_matching) [Erlang](src/main/erlang/g0001_0100/s0010_regular_expression_matching) [Racket](src/main/racket/g0001_0100/s0010_regular_expression_matching)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 1 | 100.00 | 0009 |Palindrome Number| [Java](src/main/java/g0001_0100/s0009_palindrome_number) [Kotlin](src/main/kotlin/g0001_0100/s0009_palindrome_number) [TypeScript](src/main/ts/g0001_0100/s0009_palindrome_number) [Scala](src/main/scala/g0001_0100/s0009_palindrome_number) [Ruby](src/main/ruby/g0001_0100/s0009_palindrome_number) [PHP](src/main/php/g0001_0100/s0009_palindrome_number) [C#](src/main/csharp/g0001_0100/s0009_palindrome_number) [Go](src/main/go/g0001_0100/s0009_palindrome_number) [Cpp](src/main/cpp/g0001_0100/s0009_palindrome_number) [Python](src/main/python/g0001_0100/s0009_palindrome_number) [Swift](src/main/swift/g0001_0100/s0009_palindrome_number) [Elixir](src/main/elixir/g0001_0100/s0009_palindrome_number) [Rust](src/main/rust/g0001_0100/s0009_palindrome_number) [Dart](src/main/dart/g0001_0100/s0009_palindrome_number) [C](src/main/c/g0001_0100/s0009_palindrome_number) [JavaScript](src/main/js/g0001_0100/s0009_palindrome_number) [Erlang](src/main/erlang/g0001_0100/s0009_palindrome_number) [Racket](src/main/racket/g0001_0100/s0009_palindrome_number)| Easy | Math, Udemy_Integers, Top_Interview_150_Math | 4 | 100.00 | 0008 |String to Integer (atoi)| [Java](src/main/java/g0001_0100/s0008_string_to_integer_atoi) [Kotlin](src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi) [TypeScript](src/main/ts/g0001_0100/s0008_string_to_integer_atoi) [Scala](src/main/scala/g0001_0100/s0008_string_to_integer_atoi) [Ruby](src/main/ruby/g0001_0100/s0008_string_to_integer_atoi) [PHP](src/main/php/g0001_0100/s0008_string_to_integer_atoi) [C#](src/main/csharp/g0001_0100/s0008_string_to_integer_atoi) [Go](src/main/go/g0001_0100/s0008_string_to_integer_atoi) [Cpp](src/main/cpp/g0001_0100/s0008_string_to_integer_atoi) [Python](src/main/python/g0001_0100/s0008_string_to_integer_atoi) [Swift](src/main/swift/g0001_0100/s0008_string_to_integer_atoi) [Elixir](src/main/elixir/g0001_0100/s0008_string_to_integer_atoi) [Rust](src/main/rust/g0001_0100/s0008_string_to_integer_atoi) [Dart](src/main/dart/g0001_0100/s0008_string_to_integer_atoi) [C](src/main/c/g0001_0100/s0008_string_to_integer_atoi) [JavaScript](src/main/js/g0001_0100/s0008_string_to_integer_atoi) [Erlang](src/main/erlang/g0001_0100/s0008_string_to_integer_atoi) [Racket](src/main/racket/g0001_0100/s0008_string_to_integer_atoi)| Medium | Top_Interview_Questions, String | 1 | 100.00 diff --git a/src/main/cpp/g0001_0100/s0001_two_sum/Solution.cpp b/src/main/cpp/g0001_0100/s0001_two_sum/Solution.cpp index 542812ff..2340ef28 100644 --- a/src/main/cpp/g0001_0100/s0001_two_sum/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0001_two_sum/Solution.cpp @@ -1,5 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task // #2024_05_12_Time_4_ms_(94.42%)_Space_14.1_MB_(17.14%) #include diff --git a/src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp b/src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp index 8de7c54e..331e294d 100644 --- a/src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_05_12_Time_16_ms_(82.17%)_Space_76.1_MB_(52.68%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2024_05_12_Time_16_ms_(82.17%)_Space_76.1_MB_(52.68%) /** * Definition for singly-linked list. diff --git a/src/main/cpp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cpp b/src/main/cpp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cpp index 0cd7e752..9db099e2 100644 --- a/src/main/cpp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #2024_05_12_Time_5_ms_(86.87%)_Space_10.4_MB_(74.49%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2024_05_12_Time_5_ms_(86.87%)_Space_10.4_MB_(74.49%) #include #include diff --git a/src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cpp b/src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cpp index b3448abe..310b0803 100644 --- a/src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cpp @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_05_22_Time_19_ms_(85.75%)_Space_94.4_MB_(74.87%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2024_05_22_Time_19_ms_(85.75%)_Space_94.4_MB_(74.87%) #include #include diff --git a/src/main/cpp/g0001_0100/s0005_longest_palindromic_substring/Solution.cpp b/src/main/cpp/g0001_0100/s0005_longest_palindromic_substring/Solution.cpp index 7d4b1483..fe11fde5 100644 --- a/src/main/cpp/g0001_0100/s0005_longest_palindromic_substring/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0005_longest_palindromic_substring/Solution.cpp @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_05_22_Time_7_ms_(94.72%)_Space_9.2_MB_(70.29%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_05_22_Time_7_ms_(94.72%)_Space_9.2_MB_(70.29%) #include #include diff --git a/src/main/cpp/g0001_0100/s0006_zigzag_conversion/Solution.cpp b/src/main/cpp/g0001_0100/s0006_zigzag_conversion/Solution.cpp index ac8e1c54..4e3e879b 100644 --- a/src/main/cpp/g0001_0100/s0006_zigzag_conversion/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0006_zigzag_conversion/Solution.cpp @@ -1,4 +1,5 @@ -// #Medium #String #2024_05_23_Time_3_ms_(97.69%)_Space_10_MB_(97.13%) +// #Medium #String #Top_Interview_150_Array/String +// #2024_05_23_Time_3_ms_(97.69%)_Space_10_MB_(97.13%) #include #include diff --git a/src/main/cpp/g0001_0100/s0009_palindrome_number/Solution.cpp b/src/main/cpp/g0001_0100/s0009_palindrome_number/Solution.cpp index 27500394..dec11de7 100644 --- a/src/main/cpp/g0001_0100/s0009_palindrome_number/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0009_palindrome_number/Solution.cpp @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_05_23_Time_0_ms_(100.00%)_Space_8.2_MB_(48.20%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2024_05_23_Time_0_ms_(100.00%)_Space_8.2_MB_(48.20%) class Solution { public: diff --git a/src/main/cpp/g0001_0100/s0011_container_with_most_water/Solution.cpp b/src/main/cpp/g0001_0100/s0011_container_with_most_water/Solution.cpp index cfbb2676..d062eb3a 100644 --- a/src/main/cpp/g0001_0100/s0011_container_with_most_water/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0011_container_with_most_water/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_05_22_Time_54_ms_(88.17%)_Space_61.5_MB_(24.44%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_05_22_Time_54_ms_(88.17%)_Space_61.5_MB_(24.44%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0015_3sum/Solution.cpp b/src/main/cpp/g0001_0100/s0015_3sum/Solution.cpp index bdcf65d3..b7fabb96 100644 --- a/src/main/cpp/g0001_0100/s0015_3sum/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0015_3sum/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_05_22_Time_53_ms_(90.17%)_Space_27.2_MB_(64.08%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_05_22_Time_53_ms_(90.17%)_Space_27.2_MB_(64.08%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cpp b/src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cpp index c696f15a..a1153f78 100644 --- a/src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2024_05_23_Time_0_ms_(100.00%)_Space_7.8_MB_(91.42%) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2024_05_23_Time_0_ms_(100.00%)_Space_7.8_MB_(91.42%) #include #include diff --git a/src/main/cpp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cpp b/src/main/cpp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cpp index 6a902082..77f05628 100644 --- a/src/main/cpp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2024_05_23_Time_0_ms_(100.00%)_Space_13.2_MB_(92.45%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2024_05_23_Time_0_ms_(100.00%)_Space_13.2_MB_(92.45%) /** * Definition for singly-linked list. diff --git a/src/main/cpp/g0001_0100/s0020_valid_parentheses/Solution.cpp b/src/main/cpp/g0001_0100/s0020_valid_parentheses/Solution.cpp index 4ca09e33..5946902e 100644 --- a/src/main/cpp/g0001_0100/s0020_valid_parentheses/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0020_valid_parentheses/Solution.cpp @@ -1,6 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_05_23_Time_0_ms_(100.00%)_Space_7.6_MB_(59.50%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_05_23_Time_0_ms_(100.00%)_Space_7.6_MB_(59.50%) #include #include diff --git a/src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cpp b/src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cpp index aad892d3..eff1cbeb 100644 --- a/src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cpp @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2024_05_23_Time_0_ms_(100.00%)_Space_18.5_MB_(7.09%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2024_05_23_Time_0_ms_(100.00%)_Space_18.5_MB_(7.09%) /** * Definition for singly-linked list. diff --git a/src/main/cpp/g0001_0100/s0022_generate_parentheses/Solution.cpp b/src/main/cpp/g0001_0100/s0022_generate_parentheses/Solution.cpp index 55fa4684..f5ed6e4c 100644 --- a/src/main/cpp/g0001_0100/s0022_generate_parentheses/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0022_generate_parentheses/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2024_05_23_Time_0_ms_(100.00%)_Space_11.7_MB_(85.25%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_05_23_Time_0_ms_(100.00%)_Space_11.7_MB_(85.25%) #include #include diff --git a/src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cpp b/src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cpp index 5e06ca2e..bfcc70bf 100644 --- a/src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cpp @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) -// #2024_05_23_Time_7_ms_(98.72%)_Space_16.5_MB_(98.90%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_05_23_Time_7_ms_(98.72%)_Space_16.5_MB_(98.90%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cpp b/src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cpp index 35baa6da..161ebb7a 100644 --- a/src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cpp @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) // #2024_05_24_Time_3_ms_(98.79%)_Space_14.9_MB_(96.07%) /** diff --git a/src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cpp b/src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cpp index 186f6715..ea5c313d 100644 --- a/src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_05_24_Time_0_ms_(100.00%)_Space_13.4_MB_(96.47%) #include diff --git a/src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cpp b/src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cpp index b055d357..2219f0b6 100644 --- a/src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2024_05_24_Time_0_ms_(100.00%)_Space_15.9_MB_(98.52%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2024_05_24_Time_0_ms_(100.00%)_Space_15.9_MB_(98.52%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0035_search_insert_position/Solution.cpp b/src/main/cpp/g0001_0100/s0035_search_insert_position/Solution.cpp index 6985e378..fbb9872a 100644 --- a/src/main/cpp/g0001_0100/s0035_search_insert_position/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0035_search_insert_position/Solution.cpp @@ -1,5 +1,5 @@ // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_05_24_Time_0_ms_(100.00%)_Space_12.1_MB_(7.57%) #include diff --git a/src/main/cpp/g0001_0100/s0039_combination_sum/Solution.cpp b/src/main/cpp/g0001_0100/s0039_combination_sum/Solution.cpp index 749d31ef..ea3bf7b8 100644 --- a/src/main/cpp/g0001_0100/s0039_combination_sum/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0039_combination_sum/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_05_24_Time_0_ms_(100.00%)_Space_12.2_MB_(97.15%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_05_24_Time_0_ms_(100.00%)_Space_12.2_MB_(97.15%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0042_trapping_rain_water/Solution.cpp b/src/main/cpp/g0001_0100/s0042_trapping_rain_water/Solution.cpp index a8fc99fd..02fb3c07 100644 --- a/src/main/cpp/g0001_0100/s0042_trapping_rain_water/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0042_trapping_rain_water/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_24_Time_3_ms_(99.04%)_Space_22.2_MB_(96.00%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_05_24_Time_3_ms_(99.04%)_Space_22.2_MB_(96.00%) #include using namespace std; diff --git a/src/main/cpp/g0001_0100/s0045_jump_game_ii/Solution.cpp b/src/main/cpp/g0001_0100/s0045_jump_game_ii/Solution.cpp index eca8ae35..d15817db 100644 --- a/src/main/cpp/g0001_0100/s0045_jump_game_ii/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0045_jump_game_ii/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_25_Time_8_ms_(82.92%)_Space_18.9_MB_(87.16%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_05_25_Time_8_ms_(82.92%)_Space_18.9_MB_(87.16%) #include #include diff --git a/src/main/cpp/g0001_0100/s0046_permutations/Solution.cpp b/src/main/cpp/g0001_0100/s0046_permutations/Solution.cpp index 80d2b22f..94eb86d4 100644 --- a/src/main/cpp/g0001_0100/s0046_permutations/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0046_permutations/Solution.cpp @@ -1,6 +1,6 @@ // #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!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2024_05_25_Time_0_ms_(100.00%)_Space_9.6_MB_(50.28%) #include diff --git a/src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp b/src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp index 0bcca6a3..ba5cc6fc 100644 --- a/src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_25_Time_0_ms_(100.00%)_Space_9.1_MB_(21.55%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_05_25_Time_0_ms_(100.00%)_Space_9.1_MB_(21.55%) #include diff --git a/src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp b/src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp index f25d39c6..3c413be6 100644 --- a/src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_25_Time_18_ms_(96.16%)_Space_22.7_MB_(93.37%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_05_25_Time_18_ms_(96.16%)_Space_22.7_MB_(93.37%) #include #include diff --git a/src/main/cpp/g0001_0100/s0053_maximum_subarray/Solution.cpp b/src/main/cpp/g0001_0100/s0053_maximum_subarray/Solution.cpp index 12a4e890..39302d6a 100644 --- a/src/main/cpp/g0001_0100/s0053_maximum_subarray/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0053_maximum_subarray/Solution.cpp @@ -1,6 +1,6 @@ // #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) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) // #2024_05_25_Time_65_ms_(93.14%)_Space_70.2_MB_(66.74%) #include diff --git a/src/main/cpp/g0001_0100/s0055_jump_game/Solution.cpp b/src/main/cpp/g0001_0100/s0055_jump_game/Solution.cpp index e136a6b7..e2fffd59 100644 --- a/src/main/cpp/g0001_0100/s0055_jump_game/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0055_jump_game/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_25_Time_31_ms_(96.95%)_Space_50.8_MB_(80.64%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_05_25_Time_31_ms_(96.95%)_Space_50.8_MB_(80.64%) #include #include diff --git a/src/main/cpp/g0001_0100/s0056_merge_intervals/Solution.cpp b/src/main/cpp/g0001_0100/s0056_merge_intervals/Solution.cpp index 081ba2af..c8de6a52 100644 --- a/src/main/cpp/g0001_0100/s0056_merge_intervals/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0056_merge_intervals/Solution.cpp @@ -1,6 +1,7 @@ // #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) #2024_05_25_Time_19_ms_(85.51%)_Space_22.8_MB_(41.78%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_05_25_Time_19_ms_(85.51%)_Space_22.8_MB_(41.78%) class Solution { public: diff --git a/src/main/cpp/g0001_0100/s0062_unique_paths/Solution.cpp b/src/main/cpp/g0001_0100/s0062_unique_paths/Solution.cpp index cc70ceb0..c10738c8 100644 --- a/src/main/cpp/g0001_0100/s0062_unique_paths/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0062_unique_paths/Solution.cpp @@ -1,7 +1,7 @@ // #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) -// #2024_05_25_Time_0_ms_(100.00%)_Space_7.7_MB_(44.80%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2024_05_25_Time_0_ms_(100.00%)_Space_7.7_MB_(44.80%) #include diff --git a/src/main/cpp/g0001_0100/s0064_minimum_path_sum/Solution.cpp b/src/main/cpp/g0001_0100/s0064_minimum_path_sum/Solution.cpp index 0434886e..b23a8a11 100644 --- a/src/main/cpp/g0001_0100/s0064_minimum_path_sum/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0064_minimum_path_sum/Solution.cpp @@ -1,6 +1,6 @@ // #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) -// #2024_05_25_Time_2_ms_(95.63%)_Space_12.5_MB_(61.47%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_05_25_Time_2_ms_(95.63%)_Space_12.5_MB_(61.47%) #include #include diff --git a/src/main/cpp/g0001_0100/s0070_climbing_stairs/Solution.cpp b/src/main/cpp/g0001_0100/s0070_climbing_stairs/Solution.cpp index 86334ba2..ce291311 100644 --- a/src/main/cpp/g0001_0100/s0070_climbing_stairs/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0070_climbing_stairs/Solution.cpp @@ -1,7 +1,7 @@ // #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) -// #2024_05_26_Time_0_ms_(100.00%)_Space_7.3_MB_(31.62%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_05_26_Time_0_ms_(100.00%)_Space_7.3_MB_(31.62%) #include diff --git a/src/main/cpp/g0001_0100/s0072_edit_distance/Solution.cpp b/src/main/cpp/g0001_0100/s0072_edit_distance/Solution.cpp index 3186a640..4eda95c2 100644 --- a/src/main/cpp/g0001_0100/s0072_edit_distance/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0072_edit_distance/Solution.cpp @@ -1,6 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2024_05_26_Time_0_ms_(100.00%)_Space_8.7_MB_(99.94%) #include diff --git a/src/main/cpp/g0001_0100/s0073_set_matrix_zeroes/Solution.cpp b/src/main/cpp/g0001_0100/s0073_set_matrix_zeroes/Solution.cpp index 2181e00d..eedc3d02 100644 --- a/src/main/cpp/g0001_0100/s0073_set_matrix_zeroes/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0073_set_matrix_zeroes/Solution.cpp @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) // #2024_05_26_Time_7_ms_(83.11%)_Space_16.5_MB_(34.88%) #include diff --git a/src/main/cpp/g0001_0100/s0074_search_a_2d_matrix/Solution.cpp b/src/main/cpp/g0001_0100/s0074_search_a_2d_matrix/Solution.cpp index 74c7a016..c9bcaa29 100644 --- a/src/main/cpp/g0001_0100/s0074_search_a_2d_matrix/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0074_search_a_2d_matrix/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2024_05_26_Time_0_ms_(100.00%)_Space_11.9_MB_(86.21%) #include diff --git a/src/main/cpp/g0001_0100/s0076_minimum_window_substring/Solution.cpp b/src/main/cpp/g0001_0100/s0076_minimum_window_substring/Solution.cpp index 9995d1e2..e3dc434a 100644 --- a/src/main/cpp/g0001_0100/s0076_minimum_window_substring/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0076_minimum_window_substring/Solution.cpp @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2024_05_26_Time_5_ms_(91.46%)_Space_9.2_MB_(99.62%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_05_26_Time_5_ms_(91.46%)_Space_9.2_MB_(99.62%) #include #include diff --git a/src/main/cpp/g0001_0100/s0079_word_search/Solution.cpp b/src/main/cpp/g0001_0100/s0079_word_search/Solution.cpp index 7cd16f9e..f1b0f89d 100644 --- a/src/main/cpp/g0001_0100/s0079_word_search/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0079_word_search/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2024_05_26_Time_391_ms_(63.85%)_Space_10.8_MB_(51.48%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_05_26_Time_391_ms_(63.85%)_Space_10.8_MB_(51.48%) #include diff --git a/src/main/cpp/g0001_0100/s0098_validate_binary_search_tree/Solution.cpp b/src/main/cpp/g0001_0100/s0098_validate_binary_search_tree/Solution.cpp index 098063e1..7602ed28 100644 --- a/src/main/cpp/g0001_0100/s0098_validate_binary_search_tree/Solution.cpp +++ b/src/main/cpp/g0001_0100/s0098_validate_binary_search_tree/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) // #2024_05_27_Time_3_ms_(97.92%)_Space_20.3_MB_(28.52%) #include diff --git a/src/main/cpp/g0101_0200/s0101_symmetric_tree/Solution.cpp b/src/main/cpp/g0101_0200/s0101_symmetric_tree/Solution.cpp index ae72dde0..7b844964 100644 --- a/src/main/cpp/g0101_0200/s0101_symmetric_tree/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0101_symmetric_tree/Solution.cpp @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2024_05_27_Time_0_ms_(100.00%)_Space_17.4_MB_(37.66%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_05_27_Time_0_ms_(100.00%)_Space_17.4_MB_(37.66%) /** * Definition for a binary tree node. diff --git a/src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cpp b/src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cpp index 6b280a32..f0046cb6 100644 --- a/src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2024_05_27_Time_3_ms_(82.17%)_Space_14.8_MB_(87.63%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_05_27_Time_3_ms_(82.17%)_Space_14.8_MB_(87.63%) #include #include diff --git a/src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cpp b/src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cpp index c43ac0bc..e0fdc958 100644 --- a/src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cpp @@ -1,7 +1,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2024_05_27_Time_4_ms_(78.98%)_Space_17.4_MB_(79.78%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_05_27_Time_4_ms_(78.98%)_Space_17.4_MB_(79.78%) #include diff --git a/src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cpp b/src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cpp index 6e87f8dc..7a0a8d0a 100644 --- a/src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2024_05_27_Time_3_ms_(99.30%)_Space_26.1_MB_(37.92%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_05_27_Time_3_ms_(99.30%)_Space_26.1_MB_(37.92%) #include #include diff --git a/src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cpp b/src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cpp index 640aaadd..f07157c0 100644 --- a/src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cpp @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -// #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) // #2024_05_27_Time_0_ms_(100.00%)_Space_15.6_MB_(59.01%) /** diff --git a/src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cpp b/src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cpp index 4669ecef..482a6c25 100644 --- a/src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cpp @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2024_05_27_Time_69_ms_(96.21%)_Space_95.8_MB_(68.67%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_05_27_Time_69_ms_(96.21%)_Space_95.8_MB_(68.67%) #include #include diff --git a/src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cpp b/src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cpp index 981ebb2d..984484c9 100644 --- a/src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cpp @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2024_05_27_Time_12_ms_(92.72%)_Space_26_MB_(75.74%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_05_27_Time_12_ms_(92.72%)_Space_26_MB_(75.74%) #include #include diff --git a/src/main/cpp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cpp b/src/main/cpp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cpp index 8c092774..cc61ec9d 100644 --- a/src/main/cpp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cpp @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_05_27_Time_63_ms_(92.78%)_Space_49.3_MB_(84.61%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_05_27_Time_63_ms_(92.78%)_Space_49.3_MB_(84.61%) #include #include diff --git a/src/main/cpp/g0101_0200/s0136_single_number/Solution.cpp b/src/main/cpp/g0101_0200/s0136_single_number/Solution.cpp index d9f155a7..a7d7b6ab 100644 --- a/src/main/cpp/g0101_0200/s0136_single_number/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0136_single_number/Solution.cpp @@ -1,5 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation // #Big_O_Time_O(N)_Space_O(1) #2024_05_27_Time_11_ms_(82.25%)_Space_19.1_MB_(84.99%) #include diff --git a/src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp b/src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp index cd74f627..a33a30cb 100644 --- a/src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -// #2024_05_27_Time_5_ms_(65.69%)_Space_12.9_MB_(73.88%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2024_05_27_Time_5_ms_(65.69%)_Space_12.9_MB_(73.88%) /* // Definition for a Node. diff --git a/src/main/cpp/g0101_0200/s0139_word_break/Solution.cpp b/src/main/cpp/g0101_0200/s0139_word_break/Solution.cpp index 04a83975..e2ef05e6 100644 --- a/src/main/cpp/g0101_0200/s0139_word_break/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0139_word_break/Solution.cpp @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2024_05_27_Time_5_ms_(70.91%)_Space_10.8_MB_(74.12%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_05_27_Time_5_ms_(70.91%)_Space_10.8_MB_(74.12%) #include #include diff --git a/src/main/cpp/g0101_0200/s0141_linked_list_cycle/Solution.cpp b/src/main/cpp/g0101_0200/s0141_linked_list_cycle/Solution.cpp index 0c7c3350..90e52c60 100644 --- a/src/main/cpp/g0101_0200/s0141_linked_list_cycle/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0141_linked_list_cycle/Solution.cpp @@ -1,6 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_05_27_Time_7_ms_(84.60%)_Space_10.7_MB_(18.04%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_05_27_Time_7_ms_(84.60%)_Space_10.7_MB_(18.04%) /** * Definition for singly-linked list. diff --git a/src/main/cpp/g0101_0200/s0146_lru_cache/LRUCache.cpp b/src/main/cpp/g0101_0200/s0146_lru_cache/LRUCache.cpp index 10b130c1..20d670fa 100644 --- a/src/main/cpp/g0101_0200/s0146_lru_cache/LRUCache.cpp +++ b/src/main/cpp/g0101_0200/s0146_lru_cache/LRUCache.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2024_05_27_Time_315_ms_(91.40%)_Space_168.7_MB_(78.28%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_05_27_Time_315_ms_(91.40%)_Space_168.7_MB_(78.28%) #include diff --git a/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp b/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp index f5aece93..9afb9e80 100644 --- a/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2024_05_27_Time_130_ms_(50.49%)_Space_73.5_MB_(37.52%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_05_27_Time_130_ms_(50.49%)_Space_73.5_MB_(37.52%) class Solution { public: diff --git a/src/main/cpp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cpp b/src/main/cpp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cpp index c0c3f861..0da08d58 100644 --- a/src/main/cpp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2024_05_27_Time_2_ms_(59.43%)_Space_12.5_MB_(58.76%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_05_27_Time_2_ms_(59.43%)_Space_12.5_MB_(58.76%) #include diff --git a/src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp b/src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp index fc4aa256..1060c97e 100644 --- a/src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp +++ b/src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2024_05_27_Time_10_ms_(96.74%)_Space_20.3_MB_(61.17%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2024_05_27_Time_10_ms_(96.74%)_Space_20.3_MB_(61.17%) #include #include diff --git a/src/main/cpp/g0101_0200/s0169_majority_element/Solution.cpp b/src/main/cpp/g0101_0200/s0169_majority_element/Solution.cpp index 4948cf3c..9c00aaba 100644 --- a/src/main/cpp/g0101_0200/s0169_majority_element/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0169_majority_element/Solution.cpp @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2024_05_26_Time_10_ms_(95.79%)_Space_26.6_MB_(90.80%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_05_26_Time_10_ms_(95.79%)_Space_26.6_MB_(90.80%) #include using namespace std; diff --git a/src/main/cpp/g0101_0200/s0189_rotate_array/Solution.cpp b/src/main/cpp/g0101_0200/s0189_rotate_array/Solution.cpp index 52848372..8f5c2757 100644 --- a/src/main/cpp/g0101_0200/s0189_rotate_array/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0189_rotate_array/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2024_05_26_Time_18_ms_(77.84%)_Space_27.3_MB_(54.21%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_05_26_Time_18_ms_(77.84%)_Space_27.3_MB_(54.21%) #include using namespace std; diff --git a/src/main/cpp/g0101_0200/s0198_house_robber/Solution.cpp b/src/main/cpp/g0101_0200/s0198_house_robber/Solution.cpp index e9ff48cf..b62262d5 100644 --- a/src/main/cpp/g0101_0200/s0198_house_robber/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0198_house_robber/Solution.cpp @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2024_05_26_Time_2_ms_(40.41%)_Space_9.2_MB_(58.86%) +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_05_26_Time_2_ms_(40.41%)_Space_9.2_MB_(58.86%) #include #include diff --git a/src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp b/src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp index bcd96f31..b42e74a1 100644 --- a/src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp @@ -2,7 +2,8 @@ // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2024_05_26_Time_19_ms_(97.48%)_Space_15.7_MB_(92.21%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_05_26_Time_19_ms_(97.48%)_Space_15.7_MB_(92.21%) #include diff --git a/src/main/cpp/g0201_0300/s0206_reverse_linked_list/Solution.cpp b/src/main/cpp/g0201_0300/s0206_reverse_linked_list/Solution.cpp index 812ca934..23067a9e 100644 --- a/src/main/cpp/g0201_0300/s0206_reverse_linked_list/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0206_reverse_linked_list/Solution.cpp @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_05_26_Time_0_ms_(100.00%)_Space_11.7_MB_(33.31%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_05_26_Time_0_ms_(100.00%)_Space_11.7_MB_(33.31%) /** * Definition for singly-linked list. diff --git a/src/main/cpp/g0201_0300/s0207_course_schedule/Solution.cpp b/src/main/cpp/g0201_0300/s0207_course_schedule/Solution.cpp index 033c057c..cb92bc59 100644 --- a/src/main/cpp/g0201_0300/s0207_course_schedule/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0207_course_schedule/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2024_05_26_Time_15_ms_(70.71%)_Space_16.9_MB_(73.42%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_05_26_Time_15_ms_(70.71%)_Space_16.9_MB_(73.42%) #include diff --git a/src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cpp b/src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cpp index a8005299..09f2b910 100644 --- a/src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cpp +++ b/src/main/cpp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cpp @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2024_05_26_Time_57_ms_(37.76%)_Space_52.1_MB_(16.23%) diff --git a/src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cpp b/src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cpp index 4be21233..6687d0fa 100644 --- a/src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cpp @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap // #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_05_26_Time_74_ms_(91.60%)_Space_58.9_MB_(73.66%) #include diff --git a/src/main/cpp/g0201_0300/s0221_maximal_square/Solution.cpp b/src/main/cpp/g0201_0300/s0221_maximal_square/Solution.cpp index 9afac308..ee19a3e8 100644 --- a/src/main/cpp/g0201_0300/s0221_maximal_square/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0221_maximal_square/Solution.cpp @@ -1,5 +1,6 @@ // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 -// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_05_26_Time_56_ms_(84.56%)_Space_24.5_MB_(55.52%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_05_26_Time_56_ms_(84.56%)_Space_24.5_MB_(55.52%) #include #include diff --git a/src/main/cpp/g0201_0300/s0226_invert_binary_tree/Solution.cpp b/src/main/cpp/g0201_0300/s0226_invert_binary_tree/Solution.cpp index a6307507..c3dedc72 100644 --- a/src/main/cpp/g0201_0300/s0226_invert_binary_tree/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0226_invert_binary_tree/Solution.cpp @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2024_05_24_Time_2_ms_(45.75%)_Space_11.2_MB_(98.21%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_05_24_Time_2_ms_(45.75%)_Space_11.2_MB_(98.21%) /** * Definition for a binary tree node. diff --git a/src/main/cpp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cpp b/src/main/cpp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cpp index 32c71399..c32c6ae2 100644 --- a/src/main/cpp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cpp @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree -// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) // #2024_05_24_Time_7_ms_(94.52%)_Space_22.5_MB_(58.62%) /** diff --git a/src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cpp b/src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cpp index b0a41b4b..e6be98aa 100644 --- a/src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cpp @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) // #2024_05_24_Time_13_ms_(55.40%)_Space_16_MB_(48.50%) /** diff --git a/src/main/cpp/g0201_0300/s0238_product_of_array_except_self/Solution.cpp b/src/main/cpp/g0201_0300/s0238_product_of_array_except_self/Solution.cpp index d0f2f31c..980416e2 100644 --- a/src/main/cpp/g0201_0300/s0238_product_of_array_except_self/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0238_product_of_array_except_self/Solution.cpp @@ -1,4 +1,5 @@ -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String // #Big_O_Time_O(n^2)_Space_O(n) #2024_05_24_Time_21_ms_(88.52%)_Space_38_MB_(86.36%) #include diff --git a/src/main/cpp/g0201_0300/s0283_move_zeroes/Solution.cpp b/src/main/cpp/g0201_0300/s0283_move_zeroes/Solution.cpp index dacad31c..d95fc2d8 100644 --- a/src/main/cpp/g0201_0300/s0283_move_zeroes/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0283_move_zeroes/Solution.cpp @@ -1,6 +1,6 @@ -// #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) -// #2024_05_24_Time_6_ms_(98.89%)_Space_21.6_MB_(73.28%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2024_05_24_Time_6_ms_(98.89%)_Space_21.6_MB_(73.28%) #include diff --git a/src/main/cpp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cpp b/src/main/cpp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cpp index ab36f581..738b3a09 100644 --- a/src/main/cpp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cpp +++ b/src/main/cpp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cpp @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream -// #Big_O_Time_O(n*log_n)_Space_O(n) #2024_05_24_Time_231_ms_(98.67%)_Space_121.7_MB_(55.30%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_05_24_Time_231_ms_(98.67%)_Space_121.7_MB_(55.30%) class MedianFinder { public: diff --git a/src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cpp b/src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cpp index 93ff0604..71788b0c 100644 --- a/src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cpp +++ b/src/main/cpp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search // #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) // #2024_05_22_Time_4_ms_(94.11%)_Space_12.9_MB_(61.94%) #include diff --git a/src/main/cpp/g0301_0400/s0322_coin_change/Solution.cpp b/src/main/cpp/g0301_0400/s0322_coin_change/Solution.cpp index fa0b7bbb..8982ab6d 100644 --- a/src/main/cpp/g0301_0400/s0322_coin_change/Solution.cpp +++ b/src/main/cpp/g0301_0400/s0322_coin_change/Solution.cpp @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) // #2024_05_22_Time_12_ms_(97.65%)_Space_16_MB_(67.57%) #include diff --git a/src/main/cpp/g0301_0400/s0338_counting_bits/Solution.cpp b/src/main/cpp/g0301_0400/s0338_counting_bits/Solution.cpp index 4003ba84..df74eb80 100644 --- a/src/main/cpp/g0301_0400/s0338_counting_bits/Solution.cpp +++ b/src/main/cpp/g0301_0400/s0338_counting_bits/Solution.cpp @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_05_22_Time_0_ms_(100.00%)_Space_8.9_MB_(80.27%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_05_22_Time_0_ms_(100.00%)_Space_8.9_MB_(80.27%) #include using namespace std; diff --git a/src/main/cpp/g0301_0400/s0394_decode_string/Solution.cpp b/src/main/cpp/g0301_0400/s0394_decode_string/Solution.cpp index 15da325e..d3525ed0 100644 --- a/src/main/cpp/g0301_0400/s0394_decode_string/Solution.cpp +++ b/src/main/cpp/g0301_0400/s0394_decode_string/Solution.cpp @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2024_05_22_Time_0_ms_(100.00%)_Space_7.6_MB_(79.31%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2024_05_22_Time_0_ms_(100.00%)_Space_7.6_MB_(79.31%) #include #include diff --git a/src/main/cpp/g0401_0500/s0437_path_sum_iii/Solution.cpp b/src/main/cpp/g0401_0500/s0437_path_sum_iii/Solution.cpp index 3ec077c3..16f16bac 100644 --- a/src/main/cpp/g0401_0500/s0437_path_sum_iii/Solution.cpp +++ b/src/main/cpp/g0401_0500/s0437_path_sum_iii/Solution.cpp @@ -1,5 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2024_05_22_Time_15_ms_(70.45%)_Space_17.4_MB_(87.83%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2024_05_22_Time_15_ms_(70.45%)_Space_17.4_MB_(87.83%) #include diff --git a/src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp b/src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp index 4faff128..ffa3cb79 100644 --- a/src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp +++ b/src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2024_05_21_Time_103_ms_(91.31%)_Space_100.9_MB_(86.96%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2024_05_21_Time_103_ms_(91.31%)_Space_100.9_MB_(86.96%) #include diff --git a/src/main/cpp/g1101_1200/s1143_longest_common_subsequence/Solution.cpp b/src/main/cpp/g1101_1200/s1143_longest_common_subsequence/Solution.cpp index 3e11bb38..6d64e943 100644 --- a/src/main/cpp/g1101_1200/s1143_longest_common_subsequence/Solution.cpp +++ b/src/main/cpp/g1101_1200/s1143_longest_common_subsequence/Solution.cpp @@ -1,4 +1,4 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2024_05_21_Time_23_ms_(62.70%)_Space_25.6_MB_(50.39%) diff --git a/src/main/csharp/g0001_0100/s0001_two_sum/Solution.cs b/src/main/csharp/g0001_0100/s0001_two_sum/Solution.cs index 687719f6..8b39fa93 100644 --- a/src/main/csharp/g0001_0100/s0001_two_sum/Solution.cs +++ b/src/main/csharp/g0001_0100/s0001_two_sum/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0001_0100.S0001_two_sum { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) -// #2023_12_18_Time_134_ms_(81.26%)_Space_44.8_MB_(19.72%) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task +// #2025_06_12_Time_1_ms_(98.51%)_Space_49.32_MB_(14.31%) public class Solution { public int[] TwoSum(int[] numbers, int target) { @@ -18,4 +19,3 @@ public int[] TwoSum(int[] numbers, int target) { } } } - \ No newline at end of file diff --git a/src/main/csharp/g0001_0100/s0002_add_two_numbers/Solution.cs b/src/main/csharp/g0001_0100/s0002_add_two_numbers/Solution.cs index 1556d407..068ad255 100644 --- a/src/main/csharp/g0001_0100/s0002_add_two_numbers/Solution.cs +++ b/src/main/csharp/g0001_0100/s0002_add_two_numbers/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0002_add_two_numbers { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2023_12_19_Time_84_ms_(77.30%)_Space_49.4_MB_(51.01%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2025_06_12_Time_1_ms_(91.39%)_Space_54.13_MB_(18.69%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cs b/src/main/csharp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cs index dda61549..aacf6cd8 100644 --- a/src/main/csharp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cs +++ b/src/main/csharp/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0003_longest_substring_without_repeating_chara // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #2023_12_22_Time_50_ms_(98.40%)_Space_41.9_MB_(30.26%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2025_06_12_Time_3_ms_(96.84%)_Space_44.64_MB_(30.11%) public class Solution { public int LengthOfLongestSubstring(string s) { diff --git a/src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cs b/src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cs index 1e89c215..b7833918 100644 --- a/src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cs +++ b/src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.cs @@ -1,7 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0004_median_of_two_sorted_arrays { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_12_22_Time_83_ms_(96.35%)_Space_54_MB_(6.56%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2025_06_12_Time_0_ms_(100.00%)_Space_55.92_MB_(53.97%) public class Solution { public double FindMedianSortedArrays(int[] nums1, int[] nums2) { diff --git a/src/main/csharp/g0001_0100/s0005_longest_palindromic_substring/Solution.cs b/src/main/csharp/g0001_0100/s0005_longest_palindromic_substring/Solution.cs index 5b47a409..50a25f5d 100644 --- a/src/main/csharp/g0001_0100/s0005_longest_palindromic_substring/Solution.cs +++ b/src/main/csharp/g0001_0100/s0005_longest_palindromic_substring/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0005_longest_palindromic_substring { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_12_22_Time_61_ms_(99.50%)_Space_40_MB_(56.86%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_06_12_Time_7_ms_(95.82%)_Space_41.34_MB_(65.26%) public class Solution { public string LongestPalindrome(string s) { diff --git a/src/main/csharp/g0001_0100/s0006_zigzag_conversion/Solution.cs b/src/main/csharp/g0001_0100/s0006_zigzag_conversion/Solution.cs index 9ef5f99d..21dd5be8 100644 --- a/src/main/csharp/g0001_0100/s0006_zigzag_conversion/Solution.cs +++ b/src/main/csharp/g0001_0100/s0006_zigzag_conversion/Solution.cs @@ -1,6 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0006_zigzag_conversion { -// #Medium #String #2023_12_22_Time_59_ms_(99.87%)_Space_45.1_MB_(74.68%) +// #Medium #String #Top_Interview_150_Array/String +// #2025_06_12_Time_3_ms_(95.39%)_Space_46.59_MB_(85.85%) using System.Text; diff --git a/src/main/csharp/g0001_0100/s0007_reverse_integer/Solution.cs b/src/main/csharp/g0001_0100/s0007_reverse_integer/Solution.cs index 9cf2ba04..4e48b2dd 100644 --- a/src/main/csharp/g0001_0100/s0007_reverse_integer/Solution.cs +++ b/src/main/csharp/g0001_0100/s0007_reverse_integer/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0007_reverse_integer { // #Medium #Top_Interview_Questions #Math #Udemy_Integers -// #2023_12_22_Time_23_ms_(59.02%)_Space_26.3_MB_(99.19%) +// #2025_06_12_Time_14_ms_(99.26%)_Space_29.02_MB_(67.56%) public class Solution { public int Reverse(int x) { diff --git a/src/main/csharp/g0001_0100/s0008_string_to_integer_atoi/Solution.cs b/src/main/csharp/g0001_0100/s0008_string_to_integer_atoi/Solution.cs index 33aea849..aa4b5b11 100644 --- a/src/main/csharp/g0001_0100/s0008_string_to_integer_atoi/Solution.cs +++ b/src/main/csharp/g0001_0100/s0008_string_to_integer_atoi/Solution.cs @@ -1,6 +1,6 @@ namespace LeetCodeNet.G0001_0100.S0008_string_to_integer_atoi { -// #Medium #Top_Interview_Questions #String #2023_12_22_Time_43_ms_(99.83%)_Space_39.7_MB_(23.14%) +// #Medium #Top_Interview_Questions #String #2025_06_12_Time_0_ms_(100.00%)_Space_41.82_MB_(46.21%) public class Solution { public int MyAtoi(string str) { diff --git a/src/main/csharp/g0001_0100/s0009_palindrome_number/Solution.cs b/src/main/csharp/g0001_0100/s0009_palindrome_number/Solution.cs index a515ae4e..1f947491 100644 --- a/src/main/csharp/g0001_0100/s0009_palindrome_number/Solution.cs +++ b/src/main/csharp/g0001_0100/s0009_palindrome_number/Solution.cs @@ -1,6 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0009_palindrome_number { -// #Easy #Math #Udemy_Integers #2023_12_22_Time_42_ms_(34.61%)_Space_31_MB_(36.04%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2025_06_12_Time_1_ms_(99.90%)_Space_34.74_MB_(67.61%) public class Solution { public bool IsPalindrome(int x) { diff --git a/src/main/csharp/g0001_0100/s0010_regular_expression_matching/Solution.cs b/src/main/csharp/g0001_0100/s0010_regular_expression_matching/Solution.cs index 9e197dda..1c67bf8b 100644 --- a/src/main/csharp/g0001_0100/s0010_regular_expression_matching/Solution.cs +++ b/src/main/csharp/g0001_0100/s0010_regular_expression_matching/Solution.cs @@ -1,8 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0010_regular_expression_matching { -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion -// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -// #2023_12_22_Time_59_ms_(96.10%)_Space_40.5_MB_(47.63%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_06_12_Time_1_ms_(99.81%)_Space_42.56_MB_(59.73%) public class Solution { private bool?[,] cache; diff --git a/src/main/csharp/g0001_0100/s0011_container_with_most_water/Solution.cs b/src/main/csharp/g0001_0100/s0011_container_with_most_water/Solution.cs index fcb5d20e..943b2f76 100644 --- a/src/main/csharp/g0001_0100/s0011_container_with_most_water/Solution.cs +++ b/src/main/csharp/g0001_0100/s0011_container_with_most_water/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0011_container_with_most_water { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_01_11_Time_251_ms_(30.70%)_Space_61.5_MB_(26.65%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2025_06_12_Time_1_ms_(99.97%)_Space_63.66_MB_(17.36%) public class Solution { public int MaxArea(int[] height) { diff --git a/src/main/csharp/g0001_0100/s0015_3sum/Solution.cs b/src/main/csharp/g0001_0100/s0015_3sum/Solution.cs index 1c130d30..e792ff9d 100644 --- a/src/main/csharp/g0001_0100/s0015_3sum/Solution.cs +++ b/src/main/csharp/g0001_0100/s0015_3sum/Solution.cs @@ -2,21 +2,19 @@ namespace LeetCodeNet.G0001_0100.S0015_3sum { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_12_26_Time_173_ms_(75.85%)_Space_74.7_MB_(28.23%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2025_06_12_Time_34_ms_(76.14%)_Space_66.14_MB_(37.36%) public class Solution { public IList> ThreeSum(int[] nums) { Array.Sort(nums); int len = nums.Length; IList> result = new List>(); - for (int i = 0; i < len - 2; i++) { int l = i + 1; int r = len - 1; - while (r > l) { int sum = nums[i] + nums[l] + nums[r]; - if (sum < 0) { l++; } else if (sum > 0) { @@ -24,25 +22,20 @@ public IList> ThreeSum(int[] nums) { } else { IList list = new List { nums[i], nums[l], nums[r] }; result.Add(list); - while (l < r && nums[l + 1] == nums[l]) { l++; } - while (r > l && nums[r - 1] == nums[r]) { r--; } - l++; r--; } } - while (i < len - 1 && nums[i + 1] == nums[i]) { i++; } } - return result; } } diff --git a/src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cs b/src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cs index ef645018..a2e6e7c9 100644 --- a/src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cs +++ b/src/main/csharp/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0001_0100.S0017_letter_combinations_of_a_phone_number { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2023_12_26_Time_108_ms_(95.24%)_Space_46.3_MB_(5.39%) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2025_06_12_Time_0_ms_(100.00%)_Space_48.12_MB_(16.34%) using System.Text; @@ -12,25 +13,25 @@ public IList LetterCombinations(string digits) { return new List(); } string[] letters = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"}; - IList ans = new List(); + List ans = new List(); StringBuilder sb = new StringBuilder(); FindCombinations(0, digits, letters, sb, ans); return ans; } private void FindCombinations( - int start, string nums, string[] letters, StringBuilder curr, IList ans) { + int start, string nums, string[] letters, StringBuilder curr, List ans) { if (curr.Length == nums.Length) { ans.Add(curr.ToString()); return; } for (int i = start; i < nums.Length; i++) { - int n = int.Parse(nums[i].ToString()); + int n = nums[i] - '0'; // Convert char to int for (int j = 0; j < letters[n].Length; j++) { char ch = letters[n][j]; curr.Append(ch); FindCombinations(i + 1, nums, letters, curr, ans); - curr.Length--; // Equivalent to deleting the last character in StringBuilder + curr.Remove(curr.Length - 1, 1); // Remove last character } } } diff --git a/src/main/csharp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cs b/src/main/csharp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cs index 7d89c575..955e100b 100644 --- a/src/main/csharp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cs +++ b/src/main/csharp/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0019_remove_nth_node_from_end_of_list { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2023_12_26_Time_69_ms_(90.79%)_Space_40_MB_(5.04%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2025_06_12_Time_0_ms_(100.00%)_Space_42.68_MB_(23.67%) using LeetCodeNet.Com_github_leetcode; @@ -33,7 +33,6 @@ private void RemoveNth(ListNode node) { } RemoveNth(node.next); this.n--; - if (this.n == 0) { node.next = node.next.next; } diff --git a/src/main/csharp/g0001_0100/s0020_valid_parentheses/Solution.cs b/src/main/csharp/g0001_0100/s0020_valid_parentheses/Solution.cs index d3b195e9..8d2ef713 100644 --- a/src/main/csharp/g0001_0100/s0020_valid_parentheses/Solution.cs +++ b/src/main/csharp/g0001_0100/s0020_valid_parentheses/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0020_valid_parentheses { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_12_26_Time_53_ms_(96.68%)_Space_39.3_MB_(10.78%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2025_06_12_Time_2_ms_(82.01%)_Space_42.00_MB_(72.34%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cs b/src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cs index de1772b3..2b3d0260 100644 --- a/src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cs +++ b/src/main/csharp/g0001_0100/s0021_merge_two_sorted_lists/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0021_merge_two_sorted_lists { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2023_12_26_Time_69_ms_(92.74%)_Space_41.4_MB_(5.11%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2025_06_12_Time_0_ms_(100.00%)_Space_43.51_MB_(35.63%) using LeetCodeNet.Com_github_leetcode; @@ -22,7 +22,6 @@ public class Solution { public ListNode MergeTwoLists(ListNode l1, ListNode l2) { ListNode list = new ListNode(-1); ListNode head = list; - while (l1 != null || l2 != null) { if (l1 != null && l2 != null) { if (l1.val <= l2.val) { @@ -41,7 +40,6 @@ public ListNode MergeTwoLists(ListNode l1, ListNode l2) { } list = list.next; } - return head.next; } } diff --git a/src/main/csharp/g0001_0100/s0022_generate_parentheses/Solution.cs b/src/main/csharp/g0001_0100/s0022_generate_parentheses/Solution.cs index 747aa77f..b934befb 100644 --- a/src/main/csharp/g0001_0100/s0022_generate_parentheses/Solution.cs +++ b/src/main/csharp/g0001_0100/s0022_generate_parentheses/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0022_generate_parentheses { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2023_12_26_Time_81_ms_(99.57%)_Space_48.3_MB_(12.19%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2025_06_12_Time_0_ms_(100.00%)_Space_49.67_MB_(93.07%) using System.Collections.Generic; using System.Text; diff --git a/src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cs b/src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cs index 60eb7e91..4c634c1d 100644 --- a/src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cs +++ b/src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0023_merge_k_sorted_lists { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) -// #2023_12_26_Time_78_ms_(98.24%)_Space_45_MB_(13.27%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2025_06_12_Time_3_ms_(97.54%)_Space_48.23_MB_(85.01%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0001_0100/s0024_swap_nodes_in_pairs/Solution.cs b/src/main/csharp/g0001_0100/s0024_swap_nodes_in_pairs/Solution.cs index 7d63c719..46411c66 100644 --- a/src/main/csharp/g0001_0100/s0024_swap_nodes_in_pairs/Solution.cs +++ b/src/main/csharp/g0001_0100/s0024_swap_nodes_in_pairs/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0024_swap_nodes_in_pairs { // #Medium #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_12_Linked_List // #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) -// #2023_12_26_Time_58_ms_(98.51%)_Space_40_MB_(9.14%) +// #2025_06_12_Time_0_ms_(100.00%)_Space_41.28_MB_(72.95%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cs b/src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cs index be3b8dcd..997f9a0f 100644 --- a/src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cs +++ b/src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0025_reverse_nodes_in_k_group { // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) -// #2023_12_26_Time_75_ms_(86.97%)_Space_43.9_MB_(5.81%) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #2025_06_12_Time_0_ms_(100.00%)_Space_46.05_MB_(68.15%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0001_0100/s0031_next_permutation/Solution.cs b/src/main/csharp/g0001_0100/s0031_next_permutation/Solution.cs index 350fcda6..7a8f5e59 100644 --- a/src/main/csharp/g0001_0100/s0031_next_permutation/Solution.cs +++ b/src/main/csharp/g0001_0100/s0031_next_permutation/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0031_next_permutation { // #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_01_11_Time_98_ms_(94.17%)_Space_46_MB_(24.35%) +// #2025_06_12_Time_0_ms_(100.00%)_Space_47.82_MB_(11.04%) public class Solution { public void NextPermutation(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0032_longest_valid_parentheses/Solution.cs b/src/main/csharp/g0001_0100/s0032_longest_valid_parentheses/Solution.cs index 1c4ce1c6..bd09d50a 100644 --- a/src/main/csharp/g0001_0100/s0032_longest_valid_parentheses/Solution.cs +++ b/src/main/csharp/g0001_0100/s0032_longest_valid_parentheses/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0032_longest_valid_parentheses { // #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1) -// #2023_12_28_Time_49_ms_(96.18%)_Space_38.5_MB_(13.54%) +// #2025_06_12_Time_2_ms_(94.56%)_Space_40.52_MB_(91.98%) public class Solution { public int LongestValidParentheses(string s) { diff --git a/src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cs b/src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cs index e01fcd32..71385617 100644 --- a/src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cs +++ b/src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0033_search_in_rotated_sorted_array { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) -// #2023_12_28_Time_63_ms_(96.89%)_Space_41.1_MB_(5.40%) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_06_12_Time_0_ms_(100.00%)_Space_42.66_MB_(42.72%) public class Solution { public int Search(int[] nums, int target) { diff --git a/src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs b/src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs index 7b897899..7c510ec9 100644 --- a/src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs +++ b/src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0034_find_first_and_last_position_of_element_in_sorted_array { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2024_01_11_Time_120_ms_(81.66%)_Space_48.8_MB_(8.72%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2025_06_12_Time_0_ms_(100.00%)_Space_49.94_MB_(35.02%) public class Solution { public int[] SearchRange(int[] nums, int target) { diff --git a/src/main/csharp/g0001_0100/s0035_search_insert_position/Solution.cs b/src/main/csharp/g0001_0100/s0035_search_insert_position/Solution.cs index a61b2405..76f85f2f 100644 --- a/src/main/csharp/g0001_0100/s0035_search_insert_position/Solution.cs +++ b/src/main/csharp/g0001_0100/s0035_search_insert_position/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0035_search_insert_position { // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) -// #2024_01_11_Time_64_ms_(95.18%)_Space_41.4_MB_(28.65%) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_06_12_Time_0_ms_(100.00%)_Space_43.13_MB_(61.70%) public class Solution { public int SearchInsert(int[] nums, int target) { diff --git a/src/main/csharp/g0001_0100/s0039_combination_sum/Solution.cs b/src/main/csharp/g0001_0100/s0039_combination_sum/Solution.cs index 5bf883da..f616f484 100644 --- a/src/main/csharp/g0001_0100/s0039_combination_sum/Solution.cs +++ b/src/main/csharp/g0001_0100/s0039_combination_sum/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0039_combination_sum { // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_12_28_Time_94_ms_(99.60%)_Space_46.5_MB_(23.61%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2025_06_12_Time_1_ms_(100.00%)_Space_48.21_MB_(42.68%) using System.Collections.Generic; diff --git a/src/main/csharp/g0001_0100/s0041_first_missing_positive/Solution.cs b/src/main/csharp/g0001_0100/s0041_first_missing_positive/Solution.cs index c9c61af0..4928ab0d 100644 --- a/src/main/csharp/g0001_0100/s0041_first_missing_positive/Solution.cs +++ b/src/main/csharp/g0001_0100/s0041_first_missing_positive/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0041_first_missing_positive { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(n) #2024_01_11_Time_178_ms_(36.64%)_Space_57.6_MB_(32.67%) +// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_2_ms_(75.71%)_Space_64.37_MB_(37.65%) public class Solution { public int FirstMissingPositive(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0042_trapping_rain_water/Solution.cs b/src/main/csharp/g0001_0100/s0042_trapping_rain_water/Solution.cs index 6a75842f..3f74c860 100644 --- a/src/main/csharp/g0001_0100/s0042_trapping_rain_water/Solution.cs +++ b/src/main/csharp/g0001_0100/s0042_trapping_rain_water/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0042_trapping_rain_water { // #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) #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_06_13_Time_1_ms_(63.59%)_Space_47.29_MB_(68.13%) public class Solution { public int Trap(int[] height) { diff --git a/src/main/csharp/g0001_0100/s0045_jump_game_ii/Solution.cs b/src/main/csharp/g0001_0100/s0045_jump_game_ii/Solution.cs index ad58a7d3..a9a62197 100644 --- a/src/main/csharp/g0001_0100/s0045_jump_game_ii/Solution.cs +++ b/src/main/csharp/g0001_0100/s0045_jump_game_ii/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0045_jump_game_ii { // #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) #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_06_13_Time_0_ms_(100.00%)_Space_45.96_MB_(59.61%) public class Solution { public int Jump(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0046_permutations/Solution.cs b/src/main/csharp/g0001_0100/s0046_permutations/Solution.cs index cb0fedf2..560ed1fb 100644 --- a/src/main/csharp/g0001_0100/s0046_permutations/Solution.cs +++ b/src/main/csharp/g0001_0100/s0046_permutations/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0046_permutations { // #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!) -// #2024_01_11_Time_96_ms_(96.56%)_Space_46.4_MB_(12.40%) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) +// #2025_06_13_Time_1_ms_(85.02%)_Space_47.83_MB_(33.15%) using System.Collections.Generic; diff --git a/src/main/csharp/g0001_0100/s0048_rotate_image/Solution.cs b/src/main/csharp/g0001_0100/s0048_rotate_image/Solution.cs index efa5cf50..2e426b92 100644 --- a/src/main/csharp/g0001_0100/s0048_rotate_image/Solution.cs +++ b/src/main/csharp/g0001_0100/s0048_rotate_image/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0048_rotate_image { // #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) #2024_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2025_06_13_Time_0_ms_(100.00%)_Space_46.67_MB_(84.34%) public class Solution { public void Rotate(int[][] matrix) { diff --git a/src/main/csharp/g0001_0100/s0049_group_anagrams/Solution.cs b/src/main/csharp/g0001_0100/s0049_group_anagrams/Solution.cs index d276aef4..38c947fe 100644 --- a/src/main/csharp/g0001_0100/s0049_group_anagrams/Solution.cs +++ b/src/main/csharp/g0001_0100/s0049_group_anagrams/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0049_group_anagrams { // #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) #2024_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2025_06_13_Time_17_ms_(83.74%)_Space_66.82_MB_(51.04%) public class Solution { public IList> GroupAnagrams(string[] strs) { diff --git a/src/main/csharp/g0001_0100/s0051_n_queens/Solution.cs b/src/main/csharp/g0001_0100/s0051_n_queens/Solution.cs index c6f6764d..48531462 100644 --- a/src/main/csharp/g0001_0100/s0051_n_queens/Solution.cs +++ b/src/main/csharp/g0001_0100/s0051_n_queens/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0001_0100.S0051_n_queens { // #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N) -// #2024_01_04_Time_106_ms_(96.34%)_Space_54.6_MB_(5.79%) +// #2025_06_13_Time_14_ms_(47.20%)_Space_56.24_MB_(10.62%) public class Solution { public IList> SolveNQueens(int n) { diff --git a/src/main/csharp/g0001_0100/s0053_maximum_subarray/Solution.cs b/src/main/csharp/g0001_0100/s0053_maximum_subarray/Solution.cs index 711bf1b9..99388774 100644 --- a/src/main/csharp/g0001_0100/s0053_maximum_subarray/Solution.cs +++ b/src/main/csharp/g0001_0100/s0053_maximum_subarray/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0001_0100.S0053_maximum_subarray { -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming +// #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) -// #2024_01_11_Time_270_ms_(38.35%)_Space_62.7_MB_(7.88%) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) +// #2025_06_13_Time_1_ms_(100.00%)_Space_63.72_MB_(62.67%) public class Solution { public int MaxSubArray(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0055_jump_game/Solution.cs b/src/main/csharp/g0001_0100/s0055_jump_game/Solution.cs index 91c3df0f..54b438c2 100644 --- a/src/main/csharp/g0001_0100/s0055_jump_game/Solution.cs +++ b/src/main/csharp/g0001_0100/s0055_jump_game/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0055_jump_game { // #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) #2024_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_06_13_Time_1_ms_(99.82%)_Space_61.18_MB_(41.64%) public class Solution { public bool CanJump(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0056_merge_intervals/Solution.cs b/src/main/csharp/g0001_0100/s0056_merge_intervals/Solution.cs index 437d2f65..5575cc46 100644 --- a/src/main/csharp/g0001_0100/s0056_merge_intervals/Solution.cs +++ b/src/main/csharp/g0001_0100/s0056_merge_intervals/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0056_merge_intervals { // #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) #2024_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2025_06_13_Time_6_ms_(39.00%)_Space_56.11_MB_(92.27%) public class Solution { public int[][] Merge(int[][] intervals) { diff --git a/src/main/csharp/g0001_0100/s0062_unique_paths/Solution.cs b/src/main/csharp/g0001_0100/s0062_unique_paths/Solution.cs index a9f55cd4..c5707464 100644 --- a/src/main/csharp/g0001_0100/s0062_unique_paths/Solution.cs +++ b/src/main/csharp/g0001_0100/s0062_unique_paths/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0001_0100.S0062_unique_paths { // #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) -// #2024_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2025_06_13_Time_0_ms_(100.00%)_Space_28.91_MB_(75.80%) public class Solution { public int UniquePaths(int m, int n) { diff --git a/src/main/csharp/g0001_0100/s0064_minimum_path_sum/Solution.cs b/src/main/csharp/g0001_0100/s0064_minimum_path_sum/Solution.cs index dbe2da6d..b840a32a 100644 --- a/src/main/csharp/g0001_0100/s0064_minimum_path_sum/Solution.cs +++ b/src/main/csharp/g0001_0100/s0064_minimum_path_sum/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0064_minimum_path_sum { // #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) -// #2024_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_06_13_Time_1_ms_(100.00%)_Space_46.72_MB_(52.77%) public class Solution { public int MinPathSum(int[][] grid) { diff --git a/src/main/csharp/g0001_0100/s0070_climbing_stairs/Solution.cs b/src/main/csharp/g0001_0100/s0070_climbing_stairs/Solution.cs index a65593f3..b19b9541 100644 --- a/src/main/csharp/g0001_0100/s0070_climbing_stairs/Solution.cs +++ b/src/main/csharp/g0001_0100/s0070_climbing_stairs/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0070_climbing_stairs { // #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) -// #2024_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_0_ms_(100.00%)_Space_29.08_MB_(56.18%) public class Solution { public int ClimbStairs(int n) { diff --git a/src/main/csharp/g0001_0100/s0072_edit_distance/Solution.cs b/src/main/csharp/g0001_0100/s0072_edit_distance/Solution.cs index 4e124c0b..ea51f0eb 100644 --- a/src/main/csharp/g0001_0100/s0072_edit_distance/Solution.cs +++ b/src/main/csharp/g0001_0100/s0072_edit_distance/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0001_0100.S0072_edit_distance { -// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) -// #2024_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) +// #2025_06_13_Time_4_ms_(89.69%)_Space_46.23_MB_(62.11%) public class Solution { public int MinDistance(string word1, string word2) { diff --git a/src/main/csharp/g0001_0100/s0073_set_matrix_zeroes/Solution.cs b/src/main/csharp/g0001_0100/s0073_set_matrix_zeroes/Solution.cs index 06a8cfb1..eb6911a5 100644 --- a/src/main/csharp/g0001_0100/s0073_set_matrix_zeroes/Solution.cs +++ b/src/main/csharp/g0001_0100/s0073_set_matrix_zeroes/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0073_set_matrix_zeroes { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) -// #2024_01_05_Time_124_ms_(96.92%)_Space_52_MB_(9.38%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #2025_06_13_Time_2_ms_(73.03%)_Space_53.69_MB_(33.71%) public class Solution { // Approach: Use first row and first column for storing whether in future diff --git a/src/main/csharp/g0001_0100/s0074_search_a_2d_matrix/Solution.cs b/src/main/csharp/g0001_0100/s0074_search_a_2d_matrix/Solution.cs index 089f03a7..d0ae9b00 100644 --- a/src/main/csharp/g0001_0100/s0074_search_a_2d_matrix/Solution.cs +++ b/src/main/csharp/g0001_0100/s0074_search_a_2d_matrix/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0074_search_a_2d_matrix { // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) -// #2024_01_05_Time_76_ms_(90.98%)_Space_43.2_MB_(9.93%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #2025_06_13_Time_0_ms_(100.00%)_Space_44.41_MB_(51.93%) public class Solution { public bool SearchMatrix(int[][] matrix, int target) { diff --git a/src/main/csharp/g0001_0100/s0075_sort_colors/Solution.cs b/src/main/csharp/g0001_0100/s0075_sort_colors/Solution.cs index 773d6797..dd721d7d 100644 --- a/src/main/csharp/g0001_0100/s0075_sort_colors/Solution.cs +++ b/src/main/csharp/g0001_0100/s0075_sort_colors/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0075_sort_colors { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2024_01_05_Time_98_ms_(93.59%)_Space_45.3_MB_(5.46%) +// #2025_06_13_Time_0_ms_(100.00%)_Space_46.46_MB_(73.50%) public class Solution { public void SortColors(int[] nums) { diff --git a/src/main/csharp/g0001_0100/s0076_minimum_window_substring/Solution.cs b/src/main/csharp/g0001_0100/s0076_minimum_window_substring/Solution.cs index 4714b61d..510998b2 100644 --- a/src/main/csharp/g0001_0100/s0076_minimum_window_substring/Solution.cs +++ b/src/main/csharp/g0001_0100/s0076_minimum_window_substring/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0076_minimum_window_substring { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2024_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2025_06_13_Time_3_ms_(99.36%)_Space_44.55_MB_(73.13%) public class Solution { public string MinWindow(string s, string t) { diff --git a/src/main/csharp/g0001_0100/s0078_subsets/Solution.cs b/src/main/csharp/g0001_0100/s0078_subsets/Solution.cs index 82382972..45121ece 100644 --- a/src/main/csharp/g0001_0100/s0078_subsets/Solution.cs +++ b/src/main/csharp/g0001_0100/s0078_subsets/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0078_subsets { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation #Backtracking // #Algorithm_II_Day_9_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2024_01_05_Time_101_ms_(94.29%)_Space_45.7_MB_(8.93%) +// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_06_13_Time_0_ms_(100.00%)_Space_46.76_MB_(82.95%) using System.Collections.Generic; diff --git a/src/main/csharp/g0001_0100/s0079_word_search/Solution.cs b/src/main/csharp/g0001_0100/s0079_word_search/Solution.cs index 09ab5989..4e0f7626 100644 --- a/src/main/csharp/g0001_0100/s0079_word_search/Solution.cs +++ b/src/main/csharp/g0001_0100/s0079_word_search/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0079_word_search { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2024_01_05_Time_152_ms_(99.69%)_Space_42.3_MB_(26.96%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_06_13_Time_100_ms_(95.52%)_Space_42.99_MB_(98.44%) public class Solution { public bool Exist(char[][] board, string word) { @@ -26,7 +26,6 @@ private bool helper(int r, int c, char[][] board, string word, int count) { char currChar = board[r][c]; board[r][c] = '!'; char nextChar = word[count]; - if (r > 0 && board[r - 1][c] == nextChar) { if (helper(r - 1, c, board, word, count + 1)) return true; } diff --git a/src/main/csharp/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.cs b/src/main/csharp/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.cs index b94e23db..f2d9e59e 100644 --- a/src/main/csharp/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.cs +++ b/src/main/csharp/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.cs @@ -1,24 +1,20 @@ namespace LeetCodeNet.G0001_0100.S0084_largest_rectangle_in_histogram { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack -// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_01_08_Time_304_ms_(30.92%)_Space_52.4_MB_(29.92%) +// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_06_13_Time_5_ms_(100.00%)_Space_57.76_MB_(41.84%) public class Solution { public int LargestRectangleArea(int[] heights) { - int maxArea = 0, i = 0; + int len = heights.Length; + int maxArea = 0; Stack stack = new Stack(); - while (i <= heights.Length) { - var currHeight = i == heights.Length ? 0 : heights[i]; - if (!stack.Any() || currHeight >= heights[stack.Peek()]) { - stack.Push(i); - i++; - } - else { - int index = stack.Pop(); - int height = heights[index]; - int width = (!stack.Any()) ? i : (i - 1) - stack.Peek(); + for (int i = 0; i <= len; i++) { + while (stack.Count > 0 && (i == len || heights[stack.Peek()] >= (i < len ? heights[i] : 0))) { + int height = heights[stack.Pop()]; + int width = stack.Count == 0 ? i : i - stack.Peek() - 1; maxArea = Math.Max(maxArea, height * width); } + stack.Push(i); } return maxArea; } diff --git a/src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.cs b/src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.cs index 9a829341..11ca9f88 100644 --- a/src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.cs +++ b/src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0094_binary_tree_inorder_traversal { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) -// #2024_01_08_Time_90_ms_(99.30%)_Space_45.5_MB_(6.37%) +// #2025_06_13_Time_0_ms_(100.00%)_Space_46.64_MB_(63.38%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0001_0100/s0096_unique_binary_search_trees/Solution.cs b/src/main/csharp/g0001_0100/s0096_unique_binary_search_trees/Solution.cs index ddee847c..f540a2eb 100644 --- a/src/main/csharp/g0001_0100/s0096_unique_binary_search_trees/Solution.cs +++ b/src/main/csharp/g0001_0100/s0096_unique_binary_search_trees/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0001_0100.S0096_unique_binary_search_trees { -// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree -// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) -// #2024_01_08_Time_13_ms_(98.48%)_Space_26.2_MB_(88.64%) +// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +// #2025_06_13_Time_0_ms_(100.00%)_Space_28.70_MB_(95.42%) public class Solution { public int NumTrees(int n) { diff --git a/src/main/csharp/g0001_0100/s0098_validate_binary_search_tree/Solution.cs b/src/main/csharp/g0001_0100/s0098_validate_binary_search_tree/Solution.cs index 4ca8426e..ae553900 100644 --- a/src/main/csharp/g0001_0100/s0098_validate_binary_search_tree/Solution.cs +++ b/src/main/csharp/g0001_0100/s0098_validate_binary_search_tree/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0001_0100.S0098_validate_binary_search_tree { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) -// #2024_01_08_Time_75_ms_(97.31%)_Space_45.3_MB_(19.73%) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_06_13_Time_0_ms_(100.00%)_Space_46.68_MB_(61.87%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0101_symmetric_tree/Solution.cs b/src/main/csharp/g0101_0200/s0101_symmetric_tree/Solution.cs index 2ed62a21..6dfabbf2 100644 --- a/src/main/csharp/g0101_0200/s0101_symmetric_tree/Solution.cs +++ b/src/main/csharp/g0101_0200/s0101_symmetric_tree/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0101_symmetric_tree { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2024_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_06_13_Time_0_ms_(100.00%)_Space_44.58_MB_(38.09%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cs b/src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cs index fceef366..768e6584 100644 --- a/src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cs +++ b/src/main/csharp/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0102_binary_tree_level_order_traversal { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2024_01_09_Time_97_ms_(98.14%)_Space_47.4_MB_(12.94%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2025_06_13_Time_0_ms_(100.00%)_Space_48.60_MB_(46.34%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cs b/src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cs index 4face7f8..76771750 100644 --- a/src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cs +++ b/src/main/csharp/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.cs @@ -1,9 +1,10 @@ namespace LeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2024_01_09_Time_65_ms_(93.31%)_Space_42.3_MB_(9.74%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2025_06_14_Time_0_ms_(100.00%)_Space_43.99_MB_(15.02%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs b/src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs index 53bca8e6..e91ad902 100644 --- a/src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs +++ b/src/main/csharp/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0105_construct_binary_tree_from_preorder_and_inorder_traversal { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2024_01_09_Time_53_ms_(99.83%)_Space_42.5_MB_(46.06%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_1_ms_(96.98%)_Space_44.75_MB_(46.98%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cs b/src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cs index 8167fe9b..2c9b105d 100644 --- a/src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cs +++ b/src/main/csharp/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0114_flatten_binary_tree_to_linked_list { // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -// #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -// #2024_01_09_Time_52_ms_(98.71%)_Space_41.3_MB_(6.68%) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) +// #2025_06_14_Time_0_ms_(100.00%)_Space_43.08_MB_(22.09%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cs b/src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cs index a19a4865..17e052a4 100644 --- a/src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cs +++ b/src/main/csharp/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0121_best_time_to_buy_and_sell_stock { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_328_ms_(35.43%)_Space_58.2_MB_(5.29%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2025_06_14_Time_1_ms_(100.00%)_Space_58.91_MB_(55.50%) public class Solution { public int MaxProfit(int[] prices) { diff --git a/src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cs b/src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cs index 820c21fe..eb43fee7 100644 --- a/src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cs +++ b/src/main/csharp/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0124_binary_tree_maximum_path_sum { // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2024_01_09_Time_85_ms_(91.69%)_Space_47.6_MB_(23.52%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_0_ms_(100.00%)_Space_49.31_MB_(15.65%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cs b/src/main/csharp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cs index d4526442..cec27536 100644 --- a/src/main/csharp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cs +++ b/src/main/csharp/g0101_0200/s0128_longest_consecutive_sequence/Solution.cs @@ -1,29 +1,34 @@ namespace LeetCodeNet.G0101_0200.S0128_longest_consecutive_sequence { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_01_09_Time_201_ms_(61.50%)_Space_61.2_MB_(52.89%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2025_06_14_Time_16_ms_(100.00%)_Space_75.12_MB_(14.84%) public class Solution { public int LongestConsecutive(int[] nums) { - if (nums.Length == 0) { - return 0; - } - Array.Sort(nums); - int max = int.MinValue; - int thsMax = 1; - for (int i = 0; i < nums.Length - 1; i++) { - if (nums[i + 1] == nums[i] + 1) { - thsMax += 1; + Dictionary mapToHighest = new(nums.Length); + int best = 0; + for (int i = 0; i < nums.Length; i++) { + int rangeLow = 0; + int rangeHigh = 0; + if (mapToHighest.ContainsKey(nums[i])) { continue; } - if (nums[i + 1] == nums[i]) { - continue; + if (mapToHighest.TryGetValue(nums[i]-1, out var downCount)) { + rangeLow = downCount; + } + if (mapToHighest.TryGetValue(nums[i]+1, out var upCount)) { + rangeHigh = upCount; + } + int thisSum = rangeLow + rangeHigh + 1; + mapToHighest[nums[i] - rangeLow] = thisSum; + mapToHighest[nums[i] + rangeHigh] = thisSum; + if (rangeLow != 0 && rangeHigh != 0) { + mapToHighest[nums[i]] = 1; } - // Start of a new Sequene - max = Math.Max(max, thsMax); - thsMax = 1; + best = Math.Max(thisSum, best); } - return Math.Max(max, thsMax); + return best; } } } diff --git a/src/main/csharp/g0101_0200/s0131_palindrome_partitioning/Solution.cs b/src/main/csharp/g0101_0200/s0131_palindrome_partitioning/Solution.cs index dcf5a135..2ad860ea 100644 --- a/src/main/csharp/g0101_0200/s0131_palindrome_partitioning/Solution.cs +++ b/src/main/csharp/g0101_0200/s0131_palindrome_partitioning/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0101_0200.S0131_palindrome_partitioning { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N) -// #2024_01_09_Time_677_ms_(38.30%)_Space_148_MB_(5.53%) +// #2025_06_14_Time_19_ms_(39.67%)_Space_84.16_MB_(63.28%) public class Solution { public IList> Partition(string s) { diff --git a/src/main/csharp/g0101_0200/s0136_single_number/Solution.cs b/src/main/csharp/g0101_0200/s0136_single_number/Solution.cs index 806e56e5..ed559d61 100644 --- a/src/main/csharp/g0101_0200/s0136_single_number/Solution.cs +++ b/src/main/csharp/g0101_0200/s0136_single_number/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0101_0200.S0136_single_number { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%) +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation +// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_46.90_MB_(50.83%) public class Solution { public int SingleNumber(int[] nums) { diff --git a/src/main/csharp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cs b/src/main/csharp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cs index 17ede66c..3c6fc291 100644 --- a/src/main/csharp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cs +++ b/src/main/csharp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0138_copy_list_with_random_pointer { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -// #2024_01_09_Time_59_ms_(96.51%)_Space_41.4_MB_(18.90%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_77_ms_(48.03%)_Space_43.05_MB_(30.16%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0139_word_break/Solution.cs b/src/main/csharp/g0101_0200/s0139_word_break/Solution.cs index 3657ea97..2a317a46 100644 --- a/src/main/csharp/g0101_0200/s0139_word_break/Solution.cs +++ b/src/main/csharp/g0101_0200/s0139_word_break/Solution.cs @@ -2,8 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0139_word_break { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2024_01_09_Time_64_ms_(98.44%)_Space_49.2_MB_(10.24%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2025_06_14_Time_6_ms_(55.14%)_Space_51.82_MB_(11.12%) public class Solution { private Dictionary visited = new(); diff --git a/src/main/csharp/g0101_0200/s0141_linked_list_cycle/Solution.cs b/src/main/csharp/g0101_0200/s0141_linked_list_cycle/Solution.cs index 93ee826d..0a5ad252 100644 --- a/src/main/csharp/g0101_0200/s0141_linked_list_cycle/Solution.cs +++ b/src/main/csharp/g0101_0200/s0141_linked_list_cycle/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0141_linked_list_cycle { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_01_09_Time_76_ms_(99.02%)_Space_46.5_MB_(16.05%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_107_ms_(37.72%)_Space_47.78_MB_(44.58%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cs b/src/main/csharp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cs index b49aa74d..410bd2e0 100644 --- a/src/main/csharp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cs +++ b/src/main/csharp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0101_0200.S0142_linked_list_cycle_ii { // #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List -// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_72_ms_(94.58%)_Space_43.8_MB_(18.67%) +// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_95_ms_(48.82%)_Space_45.61_MB_(50.94%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0146_lru_cache/LRUCache.cs b/src/main/csharp/g0101_0200/s0146_lru_cache/LRUCache.cs index 2bf9fb1e..c7946c0b 100644 --- a/src/main/csharp/g0101_0200/s0146_lru_cache/LRUCache.cs +++ b/src/main/csharp/g0101_0200/s0146_lru_cache/LRUCache.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0146_lru_cache { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2024_01_09_Time_780_ms_(34.57%)_Space_239.2_MB_(12.44%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2025_06_14_Time_28_ms_(80.36%)_Space_174.73_MB_(41.35%) public class LRUCache { private readonly int capacity; diff --git a/src/main/csharp/g0101_0200/s0148_sort_list/Solution.cs b/src/main/csharp/g0101_0200/s0148_sort_list/Solution.cs index 5910e8ee..e86242e0 100644 --- a/src/main/csharp/g0101_0200/s0148_sort_list/Solution.cs +++ b/src/main/csharp/g0101_0200/s0148_sort_list/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0148_sort_list { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2024_01_09_Time_141_ms_(45.08%)_Space_67.7_MB_(18.18%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2025_06_14_Time_37_ms_(40.62%)_Space_76.59_MB_(5.13%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0152_maximum_product_subarray/Solution.cs b/src/main/csharp/g0101_0200/s0152_maximum_product_subarray/Solution.cs index c7d47744..9a322314 100644 --- a/src/main/csharp/g0101_0200/s0152_maximum_product_subarray/Solution.cs +++ b/src/main/csharp/g0101_0200/s0152_maximum_product_subarray/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0101_0200.S0152_maximum_product_subarray { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Dynamic_Programming_I_Day_6 #Level_2_Day_13_Dynamic_Programming #Udemy_Dynamic_Programming -// #Big_O_Time_O(N)_Space_O(1) #2024_01_11_Time_71_ms_(90.35%)_Space_42.7_MB_(13.88%) +// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_44.05_MB_(67.13%) public class Solution { public int MaxProduct(int[] nums) { diff --git a/src/main/csharp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cs b/src/main/csharp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cs index a71c2a87..2262bbee 100644 --- a/src/main/csharp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cs +++ b/src/main/csharp/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0153_find_minimum_in_rotated_sorted_array { // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2024_01_11_Time_64_ms_(88.59%)_Space_40.9_MB_(17.68%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2025_06_14_Time_0_ms_(100.00%)_Space_42.21_MB_(58.48%) public class Solution { private int FindMinUtil(int[] nums, int l, int r) { diff --git a/src/main/csharp/g0101_0200/s0155_min_stack/MinStack.cs b/src/main/csharp/g0101_0200/s0155_min_stack/MinStack.cs index 06fe7d50..ad613cfa 100644 --- a/src/main/csharp/g0101_0200/s0155_min_stack/MinStack.cs +++ b/src/main/csharp/g0101_0200/s0155_min_stack/MinStack.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0101_0200.S0155_min_stack { -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) -// #2024_01_11_Time_105_ms_(95.77%)_Space_55.6_MB_(13.78%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2025_06_14_Time_1_ms_(100.00%)_Space_54.77_MB_(33.45%) public class MinStack { private class Node { diff --git a/src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.cs b/src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.cs index 026b5728..b4462c82 100644 --- a/src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.cs +++ b/src/main/csharp/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0101_0200.S0160_intersection_of_two_linked_lists { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List // #Data_Structure_II_Day_11_Linked_List #Udemy_Linked_List #Big_O_Time_O(M+N)_Space_O(1) -// #2024_01_11_Time_118_ms_(53.65%)_Space_54.6_MB_(23.25%) +// #2025_06_14_Time_145_ms_(64.32%)_Space_56.64_MB_(43.98%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0101_0200/s0169_majority_element/Solution.cs b/src/main/csharp/g0101_0200/s0169_majority_element/Solution.cs index c6ba7fd7..ab582d43 100644 --- a/src/main/csharp/g0101_0200/s0169_majority_element/Solution.cs +++ b/src/main/csharp/g0101_0200/s0169_majority_element/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0101_0200.S0169_majority_element { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2024_01_11_Time_98_ms_(66.71%)_Space_46.4_MB_(15.32%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_06_14_Time_1_ms_(66.60%)_Space_50.05_MB_(28.42%) public class Solution { public int MajorityElement(int[] arr) { diff --git a/src/main/csharp/g0101_0200/s0189_rotate_array/Solution.cs b/src/main/csharp/g0101_0200/s0189_rotate_array/Solution.cs index f3a814df..c315ae01 100644 --- a/src/main/csharp/g0101_0200/s0189_rotate_array/Solution.cs +++ b/src/main/csharp/g0101_0200/s0189_rotate_array/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0101_0200.S0189_rotate_array { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2024_01_11_Time_143_ms_(94.32%)_Space_62.9_MB_(24.95%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_66.44_MB_(15.51%) public class Solution { private void Reverse(int[] nums, int l, int r) { diff --git a/src/main/csharp/g0101_0200/s0198_house_robber/Solution.cs b/src/main/csharp/g0101_0200/s0198_house_robber/Solution.cs index 80a03e8b..60198dd0 100644 --- a/src/main/csharp/g0101_0200/s0198_house_robber/Solution.cs +++ b/src/main/csharp/g0101_0200/s0198_house_robber/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0101_0200.S0198_house_robber { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2024_01_11_Time_44_ms_(99.89%)_Space_39.8_MB_(13.60%) +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_06_14_Time_0_ms_(100.00%)_Space_41.15_MB_(69.24%) public class Solution { public int Rob(int[] nums) { diff --git a/src/main/csharp/g0101_0200/s0200_number_of_islands/Solution.cs b/src/main/csharp/g0101_0200/s0200_number_of_islands/Solution.cs index 28769b71..8c363e10 100644 --- a/src/main/csharp/g0101_0200/s0200_number_of_islands/Solution.cs +++ b/src/main/csharp/g0101_0200/s0200_number_of_islands/Solution.cs @@ -4,7 +4,8 @@ namespace LeetCodeNet.G0101_0200.S0200_number_of_islands { // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2024_01_11_Time_119_ms_(51.45%)_Space_51_MB_(45.02%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2025_06_14_Time_131_ms_(65.99%)_Space_52.77_MB_(58.07%) public class Solution { public int NumIslands(char[][] grid) { diff --git a/src/main/csharp/g0201_0300/s0206_reverse_linked_list/Solution.cs b/src/main/csharp/g0201_0300/s0206_reverse_linked_list/Solution.cs index 918047d7..09514e06 100644 --- a/src/main/csharp/g0201_0300/s0206_reverse_linked_list/Solution.cs +++ b/src/main/csharp/g0201_0300/s0206_reverse_linked_list/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0206_reverse_linked_list { // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_42.83_MB_(33.17%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0201_0300/s0207_course_schedule/Solution.cs b/src/main/csharp/g0201_0300/s0207_course_schedule/Solution.cs index 051ba3f6..5b703fcc 100644 --- a/src/main/csharp/g0201_0300/s0207_course_schedule/Solution.cs +++ b/src/main/csharp/g0201_0300/s0207_course_schedule/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0207_course_schedule { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2024_01_10_Time_95_ms_(91.94%)_Space_47.1_MB_(36.27%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_4_ms_(91.60%)_Space_50.04_MB_(65.44%) using System.Collections.Generic; diff --git a/src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cs b/src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cs index a0bc4d0d..eee04de0 100644 --- a/src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cs +++ b/src/main/csharp/g0201_0300/s0208_implement_trie_prefix_tree/Trie.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0208_implement_trie_prefix_tree { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) -// #2024_01_10_Time_178_ms_(88.12%)_Space_133.5_MB_(9.47%) +// #2025_06_14_Time_7_ms_(100.00%)_Space_84.76_MB_(14.87%) public class Trie { private TrieNode root; diff --git a/src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cs b/src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cs index b8bc57b5..58a05bff 100644 --- a/src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cs +++ b/src/main/csharp/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0215_kth_largest_element_in_an_array { // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%) +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_06_14_Time_85_ms_(88.50%)_Space_59.24_MB_(25.42%) using System; diff --git a/src/main/csharp/g0201_0300/s0221_maximal_square/Solution.cs b/src/main/csharp/g0201_0300/s0221_maximal_square/Solution.cs index 9670d845..42697818 100644 --- a/src/main/csharp/g0201_0300/s0221_maximal_square/Solution.cs +++ b/src/main/csharp/g0201_0300/s0221_maximal_square/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0221_maximal_square { -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) -// #2024_01_10_Time_199_ms_(36.75%)_Space_59.5_MB_(84.44%) +// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2025_06_15_Time_3_ms_(96.90%)_Space_67.76_MB_(80.23%) public class Solution { public int MaximalSquare(char[][] matrix) { diff --git a/src/main/csharp/g0201_0300/s0226_invert_binary_tree/Solution.cs b/src/main/csharp/g0201_0300/s0226_invert_binary_tree/Solution.cs index 6220bb78..b22ba08a 100644 --- a/src/main/csharp/g0201_0300/s0226_invert_binary_tree/Solution.cs +++ b/src/main/csharp/g0201_0300/s0226_invert_binary_tree/Solution.cs @@ -2,7 +2,8 @@ namespace LeetCodeNet.G0201_0300.S0226_invert_binary_tree { // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2024_01_10_Time_58_ms_(94.38%)_Space_40.3_MB_(8.09%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2025_06_15_Time_0_ms_(100.00%)_Space_41.66_MB_(64.48%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cs b/src/main/csharp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cs index a79f6c75..42dd4bfe 100644 --- a/src/main/csharp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cs +++ b/src/main/csharp/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0230_kth_smallest_element_in_a_bst { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -// #Big_O_Time_O(n)_Space_O(n) #2024_01_10_Time_69_ms_(98.79%)_Space_45.2_MB_(12.59%) +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #2025_06_15_Time_0_ms_(100.00%)_Space_46.22_MB_(89.61%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0201_0300/s0234_palindrome_linked_list/Solution.cs b/src/main/csharp/g0201_0300/s0234_palindrome_linked_list/Solution.cs index fb0a774c..c362fd22 100644 --- a/src/main/csharp/g0201_0300/s0234_palindrome_linked_list/Solution.cs +++ b/src/main/csharp/g0201_0300/s0234_palindrome_linked_list/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0234_palindrome_linked_list { -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List -// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) -// #2024_01_10_Time_306_ms_(31.81%)_Space_66.1_MB_(33.64%) +// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion +// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +// #2025_06_16_Time_4_ms_(60.29%)_Space_66.97_MB_(96.10%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs b/src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs index 19142766..bf01f1dd 100644 --- a/src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs +++ b/src/main/csharp/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.cs @@ -1,8 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0236_lowest_common_ancestor_of_a_binary_tree { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) -// #2024_01_10_Time_76_ms_(98.04%)_Space_45.9_MB_(13.60%) +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2025_06_16_Time_93_ms_(68.06%)_Space_47.24_MB_(38.78%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0201_0300/s0238_product_of_array_except_self/Solution.cs b/src/main/csharp/g0201_0300/s0238_product_of_array_except_self/Solution.cs index 795391cf..7dc665b6 100644 --- a/src/main/csharp/g0201_0300/s0238_product_of_array_except_self/Solution.cs +++ b/src/main/csharp/g0201_0300/s0238_product_of_array_except_self/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0238_product_of_array_except_self { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum -// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) -// #2024_01_10_Time_141_ms_(94.24%)_Space_58.3_MB_(10.01%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2025_06_16_Time_1_ms_(100.00%)_Space_66.76_MB_(65.40%) public class Solution { public int[] ProductExceptSelf(int[] nums) { diff --git a/src/main/csharp/g0201_0300/s0239_sliding_window_maximum/Solution.cs b/src/main/csharp/g0201_0300/s0239_sliding_window_maximum/Solution.cs index 75313b46..31968355 100644 --- a/src/main/csharp/g0201_0300/s0239_sliding_window_maximum/Solution.cs +++ b/src/main/csharp/g0201_0300/s0239_sliding_window_maximum/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0239_sliding_window_maximum { -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue -// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) -// #2024_01_07_Time_493_ms_(46.05%)_Space_133.5_MB_(14.15%) +// #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) +// #2025_06_16_Time_32_ms_(94.92%)_Space_83.28_MB_(70.68%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.cs b/src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.cs index 53d84174..1498abbd 100644 --- a/src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.cs +++ b/src/main/csharp/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0240_search_a_2d_matrix_ii { -// #Medium #Top_100_Liked_Questions #Top_Interview_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) #2024_01_07_Time_142_ms_(60.76%)_Space_54_MB_(79.75%) +// #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) +// #2025_06_16_Time_156_ms_(77.90%)_Space_55.51_MB_(19.48%) public class Solution { public bool SearchMatrix(int[][] matrix, int target) { diff --git a/src/main/csharp/g0201_0300/s0283_move_zeroes/Solution.cs b/src/main/csharp/g0201_0300/s0283_move_zeroes/Solution.cs index b36d38ed..d4c1d014 100644 --- a/src/main/csharp/g0201_0300/s0283_move_zeroes/Solution.cs +++ b/src/main/csharp/g0201_0300/s0283_move_zeroes/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0283_move_zeroes { -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers // #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(1) #2024_01_07_Time_133_ms_(96.30%)_Space_57_MB_(17.07%) +// #Big_O_Time_O(n)_Space_O(1) #2025_06_16_Time_1_ms_(96.12%)_Space_58.35_MB_(71.18%) public class Solution { public void MoveZeroes(int[] nums) { diff --git a/src/main/csharp/g0201_0300/s0287_find_the_duplicate_number/Solution.cs b/src/main/csharp/g0201_0300/s0287_find_the_duplicate_number/Solution.cs index a00e62a2..efe1f16a 100644 --- a/src/main/csharp/g0201_0300/s0287_find_the_duplicate_number/Solution.cs +++ b/src/main/csharp/g0201_0300/s0287_find_the_duplicate_number/Solution.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0287_find_the_duplicate_number { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers -// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) -// #2024_01_07_Time_257_ms_(30.11%)_Space_70.4_MB_(7.03%) +// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation +// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +// #2025_06_16_Time_1_ms_(100.00%)_Space_72.10_MB_(32.30%) public class Solution { public int FindDuplicate(int[] nums) { diff --git a/src/main/csharp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cs b/src/main/csharp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cs index 2cc633fc..49ece9d5 100644 --- a/src/main/csharp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cs +++ b/src/main/csharp/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.cs @@ -1,8 +1,8 @@ namespace LeetCodeNet.G0201_0300.S0295_find_median_from_data_stream { -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design -// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) -// #2024_01_11_Time_658_ms_(24.88%)_Space_144_MB_(5.64%) +// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2025_06_16_Time_191_ms_(41.28%)_Space_111.30_MB_(45.74%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cs b/src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cs index 4c2d9adb..45a892b4 100644 --- a/src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cs +++ b/src/main/csharp/g0201_0300/s0300_longest_increasing_subsequence/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0201_0300.S0300_longest_increasing_subsequence { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 -// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) -// #2024_01_07_Time_80_ms_(89.11%)_Space_41.9_MB_(36.71%) +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search +// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) +// #2025_06_16_Time_2_ms_(93.82%)_Space_43.33_MB_(52.97%) public class Solution { public int LengthOfLIS(int[] nums) { diff --git a/src/main/csharp/g0301_0400/s0322_coin_change/Solution.cs b/src/main/csharp/g0301_0400/s0322_coin_change/Solution.cs index 1f60692e..ae46bb0b 100644 --- a/src/main/csharp/g0301_0400/s0322_coin_change/Solution.cs +++ b/src/main/csharp/g0301_0400/s0322_coin_change/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G0301_0400.S0322_coin_change { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) -// #2024_01_07_Time_78_ms_(90.63%)_Space_44.2_MB_(33.38%) +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search +// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) +// #2025_06_16_Time_12_ms_(97.87%)_Space_45.88_MB_(62.94%) public class Solution { public int CoinChange(int[] coins, int amount) { diff --git a/src/main/csharp/g0301_0400/s0338_counting_bits/Solution.cs b/src/main/csharp/g0301_0400/s0338_counting_bits/Solution.cs index 4ea61fa0..1afb7bc2 100644 --- a/src/main/csharp/g0301_0400/s0338_counting_bits/Solution.cs +++ b/src/main/csharp/g0301_0400/s0338_counting_bits/Solution.cs @@ -1,7 +1,8 @@ namespace LeetCodeNet.G0301_0400.S0338_counting_bits { -// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_01_07_Time_67_ms_(98.82%)_Space_42.1_MB_(22.68%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2025_06_16_Time_0_ms_(100.00%)_Space_43.52_MB_(53.08%) public class Solution { public int[] CountBits(int num) { diff --git a/src/main/csharp/g0301_0400/s0347_top_k_frequent_elements/Solution.cs b/src/main/csharp/g0301_0400/s0347_top_k_frequent_elements/Solution.cs index ec77287d..ac3b2367 100644 --- a/src/main/csharp/g0301_0400/s0347_top_k_frequent_elements/Solution.cs +++ b/src/main/csharp/g0301_0400/s0347_top_k_frequent_elements/Solution.cs @@ -1,9 +1,8 @@ namespace LeetCodeNet.G0301_0400.S0347_top_k_frequent_elements { -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting -// #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort -// #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) -// #2024_01_07_Time_125_ms_(95.29%)_Space_50.6_MB_(12.11%) +// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting +// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Big_O_Time_O(n*log(n))_Space_O(k) #2025_06_16_Time_7_ms_(75.70%)_Space_52.02_MB_(18.24%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0301_0400/s0394_decode_string/Solution.cs b/src/main/csharp/g0301_0400/s0394_decode_string/Solution.cs index 6a0ddc45..90dfd4b6 100644 --- a/src/main/csharp/g0301_0400/s0394_decode_string/Solution.cs +++ b/src/main/csharp/g0301_0400/s0394_decode_string/Solution.cs @@ -1,7 +1,8 @@ namespace LeetCodeNet.G0301_0400.S0394_decode_string { -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_44_ms_(99.55%)_Space_38.2_MB_(26.91%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2025_06_16_Time_0_ms_(100.00%)_Space_39.97_MB_(63.08%) using System.Text; diff --git a/src/main/csharp/g0401_0500/s0416_partition_equal_subset_sum/Solution.cs b/src/main/csharp/g0401_0500/s0416_partition_equal_subset_sum/Solution.cs index 5aa66056..7b75ee50 100644 --- a/src/main/csharp/g0401_0500/s0416_partition_equal_subset_sum/Solution.cs +++ b/src/main/csharp/g0401_0500/s0416_partition_equal_subset_sum/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0401_0500.S0416_partition_equal_subset_sum { // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming -// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2024_01_05_Time_95_ms_(97.38%)_Space_42.9_MB_(84.72%) +// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_06_16_Time_22_ms_(82.19%)_Space_44.17_MB_(96.67%) public class Solution { public bool CanPartition(int[] nums) { diff --git a/src/main/csharp/g0401_0500/s0437_path_sum_iii/Solution.cs b/src/main/csharp/g0401_0500/s0437_path_sum_iii/Solution.cs index 29d20e56..b61a3b76 100644 --- a/src/main/csharp/g0401_0500/s0437_path_sum_iii/Solution.cs +++ b/src/main/csharp/g0401_0500/s0437_path_sum_iii/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0401_0500.S0437_path_sum_iii { -// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree -// #Big_O_Time_O(n)_Space_O(n) #2024_01_05_Time_76_ms_(97.16%)_Space_42.8_MB_(29.79%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2025_06_16_Time_10_ms_(66.33%)_Space_44.34_MB_(85.37%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cs b/src/main/csharp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cs index a06fedab..22dae49b 100644 --- a/src/main/csharp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cs +++ b/src/main/csharp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cs @@ -3,7 +3,7 @@ namespace LeetCodeNet.G0401_0500.S0438_find_all_anagrams_in_a_string { // #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window // #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12 // #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1) -// #2024_01_07_Time_103_ms_(97.89%)_Space_50.2_MB_(32.49%) +// #2025_06_16_Time_3_ms_(97.66%)_Space_50.66_MB_(96.88%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0401_0500/s0494_target_sum/Solution.cs b/src/main/csharp/g0401_0500/s0494_target_sum/Solution.cs index a2ec3d88..60ccc2f4 100644 --- a/src/main/csharp/g0401_0500/s0494_target_sum/Solution.cs +++ b/src/main/csharp/g0401_0500/s0494_target_sum/Solution.cs @@ -1,8 +1,7 @@ namespace LeetCodeNet.G0401_0500.S0494_target_sum { -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking -// #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) -// #2024_01_07_Time_62_ms_(99.32%)_Space_43.8_MB_(47.12%) +// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #2025_06_16_Time_6_ms_(85.88%)_Space_45.47_MB_(56.49%) using System; using System.Collections.Generic; diff --git a/src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree/Solution.cs b/src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree/Solution.cs index 120007f1..ef103f89 100644 --- a/src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree/Solution.cs +++ b/src/main/csharp/g0501_0600/s0543_diameter_of_binary_tree/Solution.cs @@ -2,7 +2,7 @@ namespace LeetCodeNet.G0501_0600.S0543_diameter_of_binary_tree { // #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree // #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) -// #2024_01_07_Time_74_ms_(84.67%)_Space_42.6_MB_(8.90%) +// #2025_06_16_Time_0_ms_(100.00%)_Space_46.36_MB_(46.34%) using LeetCodeNet.Com_github_leetcode; diff --git a/src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k/Solution.cs b/src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k/Solution.cs index 9df2445c..a4a09315 100644 --- a/src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k/Solution.cs +++ b/src/main/csharp/g0501_0600/s0560_subarray_sum_equals_k/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0501_0600.S0560_subarray_sum_equals_k { // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array -// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_135_ms_(46.56%)_Space_50.6_MB_(20.87%) +// #Big_O_Time_O(n)_Space_O(n) #2025_06_16_Time_12_ms_(90.27%)_Space_52.19_MB_(67.86%) using System.Collections.Generic; diff --git a/src/main/csharp/g0601_0700/s0647_palindromic_substrings/Solution.cs b/src/main/csharp/g0601_0700/s0647_palindromic_substrings/Solution.cs index f84600a9..a3a66fc1 100644 --- a/src/main/csharp/g0601_0700/s0647_palindromic_substrings/Solution.cs +++ b/src/main/csharp/g0601_0700/s0647_palindromic_substrings/Solution.cs @@ -1,7 +1,7 @@ namespace LeetCodeNet.G0601_0700.S0647_palindromic_substrings { -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) -// #2024_01_07_Time_48_ms_(92.55%)_Space_37.2_MB_(34.47%) +// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #2025_06_16_Time_10_ms_(72.48%)_Space_38.84_MB_(83.72%) public class Solution { private void Expand(char[] a, int l, int r, int[] res) { diff --git a/src/main/csharp/g0701_0800/s0739_daily_temperatures/Solution.cs b/src/main/csharp/g0701_0800/s0739_daily_temperatures/Solution.cs index d9cf5590..e72c50d4 100644 --- a/src/main/csharp/g0701_0800/s0739_daily_temperatures/Solution.cs +++ b/src/main/csharp/g0701_0800/s0739_daily_temperatures/Solution.cs @@ -1,7 +1,8 @@ namespace LeetCodeNet.G0701_0800.S0739_daily_temperatures { -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2024_01_07_Time_376_ms_(44.29%)_Space_71.9_MB_(21.96%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2025_06_16_Time_6_ms_(98.90%)_Space_66.59_MB_(99.02%) public class Solution { public int[] DailyTemperatures(int[] temperatures) { diff --git a/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs b/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs index 849b0d27..ad3ae408 100644 --- a/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs +++ b/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs @@ -1,8 +1,7 @@ namespace LeetCodeNet.G0701_0800.S0763_partition_labels { -// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers -// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) -// #2024_01_07_Time_82_ms_(98.72%)_Space_45.6_MB_(10.26%) +// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +// #Big_O_Time_O(n)_Space_O(1) #2025_06_16_Time_2_ms_(86.67%)_Space_46.51_MB_(87.11%) using System.Collections.Generic; diff --git a/src/main/csharp/g1101_1200/s1143_longest_common_subsequence/Solution.cs b/src/main/csharp/g1101_1200/s1143_longest_common_subsequence/Solution.cs index 440c1cef..7ad0f558 100644 --- a/src/main/csharp/g1101_1200/s1143_longest_common_subsequence/Solution.cs +++ b/src/main/csharp/g1101_1200/s1143_longest_common_subsequence/Solution.cs @@ -1,9 +1,9 @@ namespace LeetCodeNet.G1101_1200.S1143_longest_common_subsequence { -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) -// #2024_01_07_Time_59_ms_(90.45%)_Space_41.3_MB_(54.32%) +// #2025_06_16_Time_14_ms_(69.42%)_Space_43.41_MB_(84.62%) public class Solution { public int LongestCommonSubsequence(string text1, string text2) { diff --git a/src/main/dart/g0001_0100/s0001_two_sum/Solution.dart b/src/main/dart/g0001_0100/s0001_two_sum/Solution.dart index 3128eec5..792f2c32 100644 --- a/src/main/dart/g0001_0100/s0001_two_sum/Solution.dart +++ b/src/main/dart/g0001_0100/s0001_two_sum/Solution.dart @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) -// #AI_can_be_used_to_solve_the_task #2024_09_28_Time_305_ms_(99.57%)_Space_146.2_MB_(99.70%) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task +// #2024_09_28_Time_305_ms_(99.57%)_Space_146.2_MB_(99.70%) class Solution { List twoSum(List numbers, int target) { diff --git a/src/main/dart/g0001_0100/s0002_add_two_numbers/Solution.dart b/src/main/dart/g0001_0100/s0002_add_two_numbers/Solution.dart index 868d289e..e7bf5347 100644 --- a/src/main/dart/g0001_0100/s0002_add_two_numbers/Solution.dart +++ b/src/main/dart/g0001_0100/s0002_add_two_numbers/Solution.dart @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #AI_can_be_used_to_solve_the_task -// #2024_09_28_Time_386_ms_(97.18%)_Space_151.9_MB_(38.24%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2024_09_28_Time_386_ms_(97.18%)_Space_151.9_MB_(38.24%) /** * Definition for singly-linked list. diff --git a/src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.dart b/src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.dart index 2b7da219..afc8c584 100644 --- a/src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.dart +++ b/src/main/dart/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #2024_09_28_Time_336_ms_(99.68%)_Space_149.1_MB_(64.29%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2024_09_28_Time_336_ms_(99.68%)_Space_149.1_MB_(64.29%) class Solution { int lengthOfLongestSubstring(String s) { diff --git a/src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.dart b/src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.dart index 01063f05..03284e3f 100644 --- a/src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.dart +++ b/src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.dart @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) -// #2024_09_28_Time_393_ms_(100.00%)_Space_151.2_MB_(78.38%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2024_09_28_Time_393_ms_(100.00%)_Space_151.2_MB_(78.38%) import 'dart:math'; diff --git a/src/main/dart/g0001_0100/s0005_longest_palindromic_substring/Solution.dart b/src/main/dart/g0001_0100/s0005_longest_palindromic_substring/Solution.dart index 01b1ea3e..f21c1941 100644 --- a/src/main/dart/g0001_0100/s0005_longest_palindromic_substring/Solution.dart +++ b/src/main/dart/g0001_0100/s0005_longest_palindromic_substring/Solution.dart @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_09_28_Time_297_ms_(97.22%)_Space_146.7_MB_(92.59%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_09_28_Time_297_ms_(97.22%)_Space_146.7_MB_(92.59%) class Solution { String longestPalindrome(String s) { diff --git a/src/main/dart/g0001_0100/s0006_zigzag_conversion/Solution.dart b/src/main/dart/g0001_0100/s0006_zigzag_conversion/Solution.dart index c1eb0740..566bd31f 100644 --- a/src/main/dart/g0001_0100/s0006_zigzag_conversion/Solution.dart +++ b/src/main/dart/g0001_0100/s0006_zigzag_conversion/Solution.dart @@ -1,4 +1,5 @@ -// #Medium #String #2024_09_30_Time_374_ms_(94.79%)_Space_150.8_MB_(57.29%) +// #Medium #String #Top_Interview_150_Array/String +// #2024_09_30_Time_374_ms_(94.79%)_Space_150.8_MB_(57.29%) class Solution { String convert(String s, int numRows) { diff --git a/src/main/dart/g0001_0100/s0009_palindrome_number/Solution.dart b/src/main/dart/g0001_0100/s0009_palindrome_number/Solution.dart index 5ad46e84..3ab996fd 100644 --- a/src/main/dart/g0001_0100/s0009_palindrome_number/Solution.dart +++ b/src/main/dart/g0001_0100/s0009_palindrome_number/Solution.dart @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_09_30_Time_518_ms_(95.59%)_Space_149.5_MB_(93.56%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2024_09_30_Time_518_ms_(95.59%)_Space_149.5_MB_(93.56%) class Solution { bool isPalindrome(int x) { diff --git a/src/main/dart/g0001_0100/s0011_container_with_most_water/Solution.dart b/src/main/dart/g0001_0100/s0011_container_with_most_water/Solution.dart index 1ee8fba9..a4d6c50c 100644 --- a/src/main/dart/g0001_0100/s0011_container_with_most_water/Solution.dart +++ b/src/main/dart/g0001_0100/s0011_container_with_most_water/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_09_30_Time_337_ms_(96.77%)_Space_172.5_MB_(64.52%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_09_30_Time_337_ms_(96.77%)_Space_172.5_MB_(64.52%) import 'dart:math'; diff --git a/src/main/dart/g0001_0100/s0015_3sum/Solution.dart b/src/main/dart/g0001_0100/s0015_3sum/Solution.dart index 16bc961e..4d0a842d 100644 --- a/src/main/dart/g0001_0100/s0015_3sum/Solution.dart +++ b/src/main/dart/g0001_0100/s0015_3sum/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_09_30_Time_370_ms_(100.00%)_Space_158.2_MB_(82.14%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_09_30_Time_370_ms_(100.00%)_Space_158.2_MB_(82.14%) class Solution { List> threeSum(List nums) { diff --git a/src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.dart b/src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.dart index 366846f4..08c5edfe 100644 --- a/src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.dart +++ b/src/main/dart/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2024_09_30_Time_293_ms_(92.50%)_Space_148.3_MB_(56.25%) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2024_09_30_Time_293_ms_(92.50%)_Space_148.3_MB_(56.25%) class Solution { List letterCombinations(String digits) { diff --git a/src/main/dart/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.dart b/src/main/dart/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.dart index a7d3c3c9..0f34770d 100644 --- a/src/main/dart/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.dart +++ b/src/main/dart/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2024_09_30_Time_321_ms_(93.59%)_Space_149.9_MB_(42.31%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2024_09_30_Time_321_ms_(93.59%)_Space_149.9_MB_(42.31%) /** * Definition for singly-linked list. diff --git a/src/main/dart/g0001_0100/s0020_valid_parentheses/Solution.dart b/src/main/dart/g0001_0100/s0020_valid_parentheses/Solution.dart index a87e793b..bb83b9fd 100644 --- a/src/main/dart/g0001_0100/s0020_valid_parentheses/Solution.dart +++ b/src/main/dart/g0001_0100/s0020_valid_parentheses/Solution.dart @@ -1,6 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_09_30_Time_298_ms_(95.87%)_Space_149.5_MB_(44.13%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_09_30_Time_298_ms_(95.87%)_Space_149.5_MB_(44.13%) class Solution { bool isValid(String s) { diff --git a/src/main/dart/g0001_0100/s0021_merge_two_sorted_lists/Solution.dart b/src/main/dart/g0001_0100/s0021_merge_two_sorted_lists/Solution.dart index f4058eb9..61a1fd94 100644 --- a/src/main/dart/g0001_0100/s0021_merge_two_sorted_lists/Solution.dart +++ b/src/main/dart/g0001_0100/s0021_merge_two_sorted_lists/Solution.dart @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2024_10_01_Time_333_ms_(81.94%)_Space_150.6_MB_(46.30%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2024_10_01_Time_333_ms_(81.94%)_Space_150.6_MB_(46.30%) /** * Definition for singly-linked list. diff --git a/src/main/dart/g0001_0100/s0022_generate_parentheses/Solution.dart b/src/main/dart/g0001_0100/s0022_generate_parentheses/Solution.dart index da0d08dc..f3ce4967 100644 --- a/src/main/dart/g0001_0100/s0022_generate_parentheses/Solution.dart +++ b/src/main/dart/g0001_0100/s0022_generate_parentheses/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2024_10_01_Time_312_ms_(79.37%)_Space_150.6_MB_(25.40%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_10_01_Time_312_ms_(79.37%)_Space_150.6_MB_(25.40%) class Solution { List generateParenthesis(int n) { diff --git a/src/main/dart/g0001_0100/s0023_merge_k_sorted_lists/Solution.dart b/src/main/dart/g0001_0100/s0023_merge_k_sorted_lists/Solution.dart index 56a4f2a1..e224180e 100644 --- a/src/main/dart/g0001_0100/s0023_merge_k_sorted_lists/Solution.dart +++ b/src/main/dart/g0001_0100/s0023_merge_k_sorted_lists/Solution.dart @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) // #2024_10_01_Time_366_ms_(94.59%)_Space_155.9_MB_(35.14%) /** diff --git a/src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.dart b/src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.dart index 8b2d5f90..1c1138f8 100644 --- a/src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.dart +++ b/src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.dart @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) // #2024_10_01_Time_357_ms_(73.33%)_Space_153.5_MB_(6.67%) /** diff --git a/src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.dart b/src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.dart index ab877517..f1606699 100644 --- a/src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.dart +++ b/src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_10_01_Time_317_ms_(91.14%)_Space_153.9_MB_(7.60%) class Solution { diff --git a/src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.dart b/src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.dart index 97e589c7..bf2cec3b 100644 --- a/src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.dart +++ b/src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2024_10_01_Time_321_ms_(92.86%)_Space_150.3_MB_(48.57%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2024_10_01_Time_321_ms_(92.86%)_Space_150.3_MB_(48.57%) class Solution { List searchRange(List nums, int target) { diff --git a/src/main/dart/g0001_0100/s0035_search_insert_position/Solution.dart b/src/main/dart/g0001_0100/s0035_search_insert_position/Solution.dart index 0db27ae5..1a3a16d2 100644 --- a/src/main/dart/g0001_0100/s0035_search_insert_position/Solution.dart +++ b/src/main/dart/g0001_0100/s0035_search_insert_position/Solution.dart @@ -1,5 +1,5 @@ // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_10_01_Time_325_ms_(80.73%)_Space_147.9_MB_(80.00%) class Solution { diff --git a/src/main/dart/g0001_0100/s0039_combination_sum/Solution.dart b/src/main/dart/g0001_0100/s0039_combination_sum/Solution.dart index b74dfef8..f03abe94 100644 --- a/src/main/dart/g0001_0100/s0039_combination_sum/Solution.dart +++ b/src/main/dart/g0001_0100/s0039_combination_sum/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_10_04_Time_316_ms_(96.88%)_Space_150_MB_(62.50%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_10_04_Time_316_ms_(96.88%)_Space_150_MB_(62.50%) class Solution { List> combinationSum(List coins, int amount) { diff --git a/src/main/dart/g0001_0100/s0042_trapping_rain_water/Solution.dart b/src/main/dart/g0001_0100/s0042_trapping_rain_water/Solution.dart index 848a60a2..27e39ed5 100644 --- a/src/main/dart/g0001_0100/s0042_trapping_rain_water/Solution.dart +++ b/src/main/dart/g0001_0100/s0042_trapping_rain_water/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_04_Time_328_ms_(80.77%)_Space_153.5_MB_(17.31%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_04_Time_328_ms_(80.77%)_Space_153.5_MB_(17.31%) import 'dart:math'; diff --git a/src/main/dart/g0001_0100/s0045_jump_game_ii/Solution.dart b/src/main/dart/g0001_0100/s0045_jump_game_ii/Solution.dart index 3324b904..9e09307d 100644 --- a/src/main/dart/g0001_0100/s0045_jump_game_ii/Solution.dart +++ b/src/main/dart/g0001_0100/s0045_jump_game_ii/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_04_Time_335_ms_(81.58%)_Space_148.6_MB_(76.32%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_04_Time_335_ms_(81.58%)_Space_148.6_MB_(76.32%) import 'dart:math'; diff --git a/src/main/dart/g0001_0100/s0046_permutations/Solution.dart b/src/main/dart/g0001_0100/s0046_permutations/Solution.dart index ec746010..674e6431 100644 --- a/src/main/dart/g0001_0100/s0046_permutations/Solution.dart +++ b/src/main/dart/g0001_0100/s0046_permutations/Solution.dart @@ -1,6 +1,6 @@ // #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!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2024_10_04_Time_319_ms_(80.00%)_Space_146.8_MB_(92.00%) class Solution { diff --git a/src/main/dart/g0001_0100/s0048_rotate_image/Solution.dart b/src/main/dart/g0001_0100/s0048_rotate_image/Solution.dart index a8386c35..a116c1a5 100644 --- a/src/main/dart/g0001_0100/s0048_rotate_image/Solution.dart +++ b/src/main/dart/g0001_0100/s0048_rotate_image/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_04_Time_311_ms_(90.24%)_Space_151.1_MB_(19.51%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_10_04_Time_311_ms_(90.24%)_Space_151.1_MB_(19.51%) class Solution { void rotate(List> matrix) { diff --git a/src/main/dart/g0001_0100/s0049_group_anagrams/Solution.dart b/src/main/dart/g0001_0100/s0049_group_anagrams/Solution.dart index d7cc6733..6cc3f259 100644 --- a/src/main/dart/g0001_0100/s0049_group_anagrams/Solution.dart +++ b/src/main/dart/g0001_0100/s0049_group_anagrams/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_04_Time_376_ms_(92.86%)_Space_156.8_MB_(72.32%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_10_04_Time_376_ms_(92.86%)_Space_156.8_MB_(72.32%) class Solution { List> groupAnagrams(List strs) { diff --git a/src/main/dart/g0001_0100/s0053_maximum_subarray/Solution.dart b/src/main/dart/g0001_0100/s0053_maximum_subarray/Solution.dart index 92f8903a..13a32463 100644 --- a/src/main/dart/g0001_0100/s0053_maximum_subarray/Solution.dart +++ b/src/main/dart/g0001_0100/s0053_maximum_subarray/Solution.dart @@ -1,6 +1,6 @@ // #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) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) // #2024_10_04_Time_361_ms_(88.89%)_Space_182.4_MB_(7.41%) class Solution { diff --git a/src/main/dart/g0001_0100/s0055_jump_game/Solution.dart b/src/main/dart/g0001_0100/s0055_jump_game/Solution.dart index f2529fe8..0c1b1866 100644 --- a/src/main/dart/g0001_0100/s0055_jump_game/Solution.dart +++ b/src/main/dart/g0001_0100/s0055_jump_game/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_04_Time_331_ms_(97.53%)_Space_154.7_MB_(69.14%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_04_Time_331_ms_(97.53%)_Space_154.7_MB_(69.14%) import 'dart:math'; diff --git a/src/main/dart/g0001_0100/s0056_merge_intervals/Solution.dart b/src/main/dart/g0001_0100/s0056_merge_intervals/Solution.dart index 74430734..257e28e6 100644 --- a/src/main/dart/g0001_0100/s0056_merge_intervals/Solution.dart +++ b/src/main/dart/g0001_0100/s0056_merge_intervals/Solution.dart @@ -1,6 +1,7 @@ // #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) #2024_10_05_Time_376_ms_(100.00%)_Space_161.1_MB_(8.16%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_10_05_Time_376_ms_(100.00%)_Space_161.1_MB_(8.16%) class Solution { List> merge(List> intervals) { diff --git a/src/main/dart/g0001_0100/s0062_unique_paths/Solution.dart b/src/main/dart/g0001_0100/s0062_unique_paths/Solution.dart index 8dda3117..b5344674 100644 --- a/src/main/dart/g0001_0100/s0062_unique_paths/Solution.dart +++ b/src/main/dart/g0001_0100/s0062_unique_paths/Solution.dart @@ -1,7 +1,7 @@ // #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) -// #2024_10_05_Time_287_ms_(91.67%)_Space_155.1_MB_(8.33%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2024_10_05_Time_287_ms_(91.67%)_Space_155.1_MB_(8.33%) class Solution { int uniquePaths(int m, int n) { diff --git a/src/main/dart/g0001_0100/s0064_minimum_path_sum/Solution.dart b/src/main/dart/g0001_0100/s0064_minimum_path_sum/Solution.dart index 29399a72..54d35b25 100644 --- a/src/main/dart/g0001_0100/s0064_minimum_path_sum/Solution.dart +++ b/src/main/dart/g0001_0100/s0064_minimum_path_sum/Solution.dart @@ -1,6 +1,6 @@ // #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) -// #2024_10_05_Time_328_ms_(88.89%)_Space_147.4_MB_(100.00%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_10_05_Time_328_ms_(88.89%)_Space_147.4_MB_(100.00%) class Solution { int minPathSum(List> grid) { diff --git a/src/main/dart/g0001_0100/s0070_climbing_stairs/Solution.dart b/src/main/dart/g0001_0100/s0070_climbing_stairs/Solution.dart index 1621194d..09b5aa4f 100644 --- a/src/main/dart/g0001_0100/s0070_climbing_stairs/Solution.dart +++ b/src/main/dart/g0001_0100/s0070_climbing_stairs/Solution.dart @@ -1,7 +1,7 @@ // #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) -// #2024_10_05_Time_301_ms_(81.01%)_Space_152.5_MB_(5.06%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_10_05_Time_301_ms_(81.01%)_Space_152.5_MB_(5.06%) class Solution { int climbStairs(int n) { diff --git a/src/main/dart/g0001_0100/s0072_edit_distance/Solution.dart b/src/main/dart/g0001_0100/s0072_edit_distance/Solution.dart index 3b569544..1ec295dd 100644 --- a/src/main/dart/g0001_0100/s0072_edit_distance/Solution.dart +++ b/src/main/dart/g0001_0100/s0072_edit_distance/Solution.dart @@ -1,6 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2024_10_05_Time_333_ms_(100.00%)_Space_147.5_MB_(100.00%) class Solution { diff --git a/src/main/dart/g0001_0100/s0073_set_matrix_zeroes/Solution.dart b/src/main/dart/g0001_0100/s0073_set_matrix_zeroes/Solution.dart index af697ade..2d85f235 100644 --- a/src/main/dart/g0001_0100/s0073_set_matrix_zeroes/Solution.dart +++ b/src/main/dart/g0001_0100/s0073_set_matrix_zeroes/Solution.dart @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) // #2024_10_05_Time_350_ms_(91.30%)_Space_152.1_MB_(47.83%) class Solution { diff --git a/src/main/dart/g0001_0100/s0074_search_a_2d_matrix/Solution.dart b/src/main/dart/g0001_0100/s0074_search_a_2d_matrix/Solution.dart index 3caf7897..b92d728e 100644 --- a/src/main/dart/g0001_0100/s0074_search_a_2d_matrix/Solution.dart +++ b/src/main/dart/g0001_0100/s0074_search_a_2d_matrix/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2024_10_05_Time_321_ms_(90.28%)_Space_148.8_MB_(90.28%) class Solution { diff --git a/src/main/dart/g0001_0100/s0076_minimum_window_substring/Solution.dart b/src/main/dart/g0001_0100/s0076_minimum_window_substring/Solution.dart index 1b57b85d..c9edc8cc 100644 --- a/src/main/dart/g0001_0100/s0076_minimum_window_substring/Solution.dart +++ b/src/main/dart/g0001_0100/s0076_minimum_window_substring/Solution.dart @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2024_10_05_Time_337_ms_(92.86%)_Space_150.5_MB_(57.14%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_10_05_Time_337_ms_(92.86%)_Space_150.5_MB_(57.14%) class Solution { String minWindow(String s, String t) { diff --git a/src/main/dart/g0001_0100/s0079_word_search/Solution.dart b/src/main/dart/g0001_0100/s0079_word_search/Solution.dart index 97769252..ee3a816f 100644 --- a/src/main/dart/g0001_0100/s0079_word_search/Solution.dart +++ b/src/main/dart/g0001_0100/s0079_word_search/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2024_10_06_Time_523_ms_(88.46%)_Space_147.3_MB_(92.31%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_10_06_Time_523_ms_(88.46%)_Space_147.3_MB_(92.31%) class Solution { bool backtrace(List> board, List> visited, diff --git a/src/main/dart/g0001_0100/s0098_validate_binary_search_tree/Solution.dart b/src/main/dart/g0001_0100/s0098_validate_binary_search_tree/Solution.dart index 8cbbb463..6ac00988 100644 --- a/src/main/dart/g0001_0100/s0098_validate_binary_search_tree/Solution.dart +++ b/src/main/dart/g0001_0100/s0098_validate_binary_search_tree/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) // #2024_10_06_Time_326_ms_(84.09%)_Space_151.4_MB_(31.82%) /** diff --git a/src/main/dart/g0101_0200/s0101_symmetric_tree/Solution.dart b/src/main/dart/g0101_0200/s0101_symmetric_tree/Solution.dart index 7d3018b7..81f6b1b1 100644 --- a/src/main/dart/g0101_0200/s0101_symmetric_tree/Solution.dart +++ b/src/main/dart/g0101_0200/s0101_symmetric_tree/Solution.dart @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2024_10_06_Time_316_ms_(95.59%)_Space_146.4_MB_(98.53%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_10_06_Time_316_ms_(95.59%)_Space_146.4_MB_(98.53%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.dart b/src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.dart index 86d5e7b2..014259c5 100644 --- a/src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.dart +++ b/src/main/dart/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.dart @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2024_10_06_Time_329_ms_(87.50%)_Space_151.4_MB_(25.00%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_10_06_Time_329_ms_(87.50%)_Space_151.4_MB_(25.00%) import 'dart:collection'; diff --git a/src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.dart b/src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.dart index b8e3eb72..c809575e 100644 --- a/src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.dart +++ b/src/main/dart/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.dart @@ -1,7 +1,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2024_10_06_Time_319_ms_(91.67%)_Space_149.2_MB_(54.76%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_10_06_Time_319_ms_(91.67%)_Space_149.2_MB_(54.76%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.dart b/src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.dart index 30fd893b..5efb4f4a 100644 --- a/src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.dart +++ b/src/main/dart/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2024_10_06_Time_315_ms_(100.00%)_Space_152.3_MB_(81.82%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_10_06_Time_315_ms_(100.00%)_Space_152.3_MB_(81.82%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.dart b/src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.dart index 35a0f75d..3e416083 100644 --- a/src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.dart +++ b/src/main/dart/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.dart @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -// #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) // #2024_10_06_Time_316_ms_(100.00%)_Space_148.5_MB_(90.91%) /** diff --git a/src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.dart b/src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.dart index 9c2d9b5b..1fd007ad 100644 --- a/src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.dart +++ b/src/main/dart/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.dart @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2024_10_07_Time_374_ms_(89.33%)_Space_190.1_MB_(48.33%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_10_07_Time_374_ms_(89.33%)_Space_190.1_MB_(48.33%) import 'dart:math'; diff --git a/src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.dart b/src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.dart index 3e57167e..9989a40f 100644 --- a/src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.dart +++ b/src/main/dart/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.dart @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2024_10_07_Time_333_ms_(85.71%)_Space_150.9_MB_(42.86%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_10_07_Time_333_ms_(85.71%)_Space_150.9_MB_(42.86%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0101_0200/s0128_longest_consecutive_sequence/Solution.dart b/src/main/dart/g0101_0200/s0128_longest_consecutive_sequence/Solution.dart index ecb87fe8..0b4c284c 100644 --- a/src/main/dart/g0101_0200/s0128_longest_consecutive_sequence/Solution.dart +++ b/src/main/dart/g0101_0200/s0128_longest_consecutive_sequence/Solution.dart @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_10_07_Time_420_ms_(84.85%)_Space_163.6_MB_(90.91%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_10_07_Time_420_ms_(84.85%)_Space_163.6_MB_(90.91%) class Solution { int longestConsecutive(List nums) { diff --git a/src/main/dart/g0101_0200/s0136_single_number/Solution.dart b/src/main/dart/g0101_0200/s0136_single_number/Solution.dart index d5eccbac..102bf36d 100644 --- a/src/main/dart/g0101_0200/s0136_single_number/Solution.dart +++ b/src/main/dart/g0101_0200/s0136_single_number/Solution.dart @@ -1,5 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation // #Big_O_Time_O(N)_Space_O(1) #2024_10_07_Time_286_ms_(100.00%)_Space_149.6_MB_(74.55%) class Solution { diff --git a/src/main/dart/g0101_0200/s0139_word_break/Solution.dart b/src/main/dart/g0101_0200/s0139_word_break/Solution.dart index 8355146c..6d079e66 100644 --- a/src/main/dart/g0101_0200/s0139_word_break/Solution.dart +++ b/src/main/dart/g0101_0200/s0139_word_break/Solution.dart @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2024_10_07_Time_307_ms_(86.96%)_Space_148.9_MB_(56.52%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_10_07_Time_307_ms_(86.96%)_Space_148.9_MB_(56.52%) class Solution { bool wordBreak(String s, List wordDict) { diff --git a/src/main/dart/g0101_0200/s0146_lru_cache/LRUCache.dart b/src/main/dart/g0101_0200/s0146_lru_cache/LRUCache.dart index 06b2ff56..b4811d69 100644 --- a/src/main/dart/g0101_0200/s0146_lru_cache/LRUCache.dart +++ b/src/main/dart/g0101_0200/s0146_lru_cache/LRUCache.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2024_10_07_Time_640_ms_(81.25%)_Space_235.3_MB_(87.50%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_10_07_Time_640_ms_(81.25%)_Space_235.3_MB_(87.50%) class LRUCache { int length = 0; diff --git a/src/main/dart/g0101_0200/s0148_sort_list/Solution.dart b/src/main/dart/g0101_0200/s0148_sort_list/Solution.dart index f9ab0b4a..42216f96 100644 --- a/src/main/dart/g0101_0200/s0148_sort_list/Solution.dart +++ b/src/main/dart/g0101_0200/s0148_sort_list/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2024_10_07_Time_371_ms_(81.82%)_Space_165.6_MB_(90.91%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_10_07_Time_371_ms_(81.82%)_Space_165.6_MB_(90.91%) /** * Definition for singly-linked list. diff --git a/src/main/dart/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.dart b/src/main/dart/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.dart index b9b8baba..dea14a98 100644 --- a/src/main/dart/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.dart +++ b/src/main/dart/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2024_10_07_Time_313_ms_(92.98%)_Space_149.8_MB_(42.10%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_10_07_Time_313_ms_(92.98%)_Space_149.8_MB_(42.10%) class Solution { int findMinUtil(List nums, int l, int r) { diff --git a/src/main/dart/g0101_0200/s0155_min_stack/MinStack.dart b/src/main/dart/g0101_0200/s0155_min_stack/MinStack.dart index 22db0799..16d5bb02 100644 --- a/src/main/dart/g0101_0200/s0155_min_stack/MinStack.dart +++ b/src/main/dart/g0101_0200/s0155_min_stack/MinStack.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) // #2024_10_08_Time_382_ms_(95.65%)_Space_158.5_MB_(47.83%) // Node class to represent each element in the stack diff --git a/src/main/dart/g0101_0200/s0169_majority_element/Solution.dart b/src/main/dart/g0101_0200/s0169_majority_element/Solution.dart index a28744b8..fc98ea70 100644 --- a/src/main/dart/g0101_0200/s0169_majority_element/Solution.dart +++ b/src/main/dart/g0101_0200/s0169_majority_element/Solution.dart @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2024_10_08_Time_317_ms_(98.55%)_Space_156.5_MB_(11.11%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_08_Time_317_ms_(98.55%)_Space_156.5_MB_(11.11%) class Solution { int majorityElement(List arr) { diff --git a/src/main/dart/g0101_0200/s0189_rotate_array/Solution.dart b/src/main/dart/g0101_0200/s0189_rotate_array/Solution.dart index 0fde577f..8e7c8d2e 100644 --- a/src/main/dart/g0101_0200/s0189_rotate_array/Solution.dart +++ b/src/main/dart/g0101_0200/s0189_rotate_array/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2024_10_08_Time_343_ms_(93.58%)_Space_160.6_MB_(19.27%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_10_08_Time_343_ms_(93.58%)_Space_160.6_MB_(19.27%) class Solution { void reverse(List nums, int l, int r) { diff --git a/src/main/dart/g0101_0200/s0198_house_robber/Solution.dart b/src/main/dart/g0101_0200/s0198_house_robber/Solution.dart index 241be2e5..a416b0f9 100644 --- a/src/main/dart/g0101_0200/s0198_house_robber/Solution.dart +++ b/src/main/dart/g0101_0200/s0198_house_robber/Solution.dart @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2024_10_08_Time_306_ms_(77.50%)_Space_151.8_MB_(15.00%) +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_10_08_Time_306_ms_(77.50%)_Space_151.8_MB_(15.00%) class Solution { int rob(List nums) { diff --git a/src/main/dart/g0101_0200/s0200_number_of_islands/Solution.dart b/src/main/dart/g0101_0200/s0200_number_of_islands/Solution.dart index 4a3d4811..038bffd2 100644 --- a/src/main/dart/g0101_0200/s0200_number_of_islands/Solution.dart +++ b/src/main/dart/g0101_0200/s0200_number_of_islands/Solution.dart @@ -2,7 +2,8 @@ // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2024_10_08_Time_331_ms_(89.19%)_Space_152.8_MB_(72.97%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_10_08_Time_331_ms_(89.19%)_Space_152.8_MB_(72.97%) class Solution { int numIslands(List> grid) { diff --git a/src/main/dart/g0201_0300/s0206_reverse_linked_list/Solution.dart b/src/main/dart/g0201_0300/s0206_reverse_linked_list/Solution.dart index ee4edcf5..f4a47b51 100644 --- a/src/main/dart/g0201_0300/s0206_reverse_linked_list/Solution.dart +++ b/src/main/dart/g0201_0300/s0206_reverse_linked_list/Solution.dart @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_10_08_Time_311_ms_(90.21%)_Space_151.9_MB_(10.49%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_10_08_Time_311_ms_(90.21%)_Space_151.9_MB_(10.49%) /** * Definition for singly-linked list. diff --git a/src/main/dart/g0201_0300/s0207_course_schedule/Solution.dart b/src/main/dart/g0201_0300/s0207_course_schedule/Solution.dart index 3566e235..7052ccb9 100644 --- a/src/main/dart/g0201_0300/s0207_course_schedule/Solution.dart +++ b/src/main/dart/g0201_0300/s0207_course_schedule/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2024_10_08_Time_361_ms_(86.67%)_Space_154.1_MB_(26.67%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_10_08_Time_361_ms_(86.67%)_Space_154.1_MB_(26.67%) class Solution { static const int WHITE = 0; diff --git a/src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree/Trie.dart b/src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree/Trie.dart index 58c7fa0f..49169473 100644 --- a/src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree/Trie.dart +++ b/src/main/dart/g0201_0300/s0208_implement_trie_prefix_tree/Trie.dart @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2024_10_08_Time_408_ms_(93.55%)_Space_188.9_MB_(77.42%) diff --git a/src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.dart b/src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.dart index 09bbbc8b..f20cd1f4 100644 --- a/src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.dart +++ b/src/main/dart/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.dart @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap // #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_10_08_Time_381_ms_(94.12%)_Space_166.6_MB_(88.24%) class Solution { diff --git a/src/main/dart/g0201_0300/s0221_maximal_square/Solution.dart b/src/main/dart/g0201_0300/s0221_maximal_square/Solution.dart index e9d368d9..139de5db 100644 --- a/src/main/dart/g0201_0300/s0221_maximal_square/Solution.dart +++ b/src/main/dart/g0201_0300/s0221_maximal_square/Solution.dart @@ -1,5 +1,6 @@ // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 -// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_10_08_Time_367_ms_(72.73%)_Space_169.4_MB_(36.36%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_10_08_Time_367_ms_(72.73%)_Space_169.4_MB_(36.36%) import 'dart:math'; diff --git a/src/main/dart/g0201_0300/s0226_invert_binary_tree/Solution.dart b/src/main/dart/g0201_0300/s0226_invert_binary_tree/Solution.dart index bdfab7f3..4dc7226c 100644 --- a/src/main/dart/g0201_0300/s0226_invert_binary_tree/Solution.dart +++ b/src/main/dart/g0201_0300/s0226_invert_binary_tree/Solution.dart @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2024_10_09_Time_300_ms_(80.95%)_Space_148_MB_(67.86%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_10_09_Time_300_ms_(80.95%)_Space_148_MB_(67.86%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.dart b/src/main/dart/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.dart index 7cd7c7de..9f6869d1 100644 --- a/src/main/dart/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.dart +++ b/src/main/dart/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.dart @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree -// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) // #2024_10_09_Time_322_ms_(85.71%)_Space_152.8_MB_(10.71%) /** diff --git a/src/main/dart/g0201_0300/s0238_product_of_array_except_self/Solution.dart b/src/main/dart/g0201_0300/s0238_product_of_array_except_self/Solution.dart index 79d31788..a7b8eefd 100644 --- a/src/main/dart/g0201_0300/s0238_product_of_array_except_self/Solution.dart +++ b/src/main/dart/g0201_0300/s0238_product_of_array_except_self/Solution.dart @@ -1,4 +1,5 @@ -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String // #Big_O_Time_O(n^2)_Space_O(n) #2024_10_09_Time_346_ms_(99.16%)_Space_167_MB_(42.02%) class Solution { diff --git a/src/main/dart/g0201_0300/s0283_move_zeroes/Solution.dart b/src/main/dart/g0201_0300/s0283_move_zeroes/Solution.dart index a6344a9f..9dfb3bcf 100644 --- a/src/main/dart/g0201_0300/s0283_move_zeroes/Solution.dart +++ b/src/main/dart/g0201_0300/s0283_move_zeroes/Solution.dart @@ -1,6 +1,6 @@ -// #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) -// #2024_10_09_Time_344_ms_(93.12%)_Space_155.6_MB_(50.26%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2024_10_09_Time_344_ms_(93.12%)_Space_155.6_MB_(50.26%) class Solution { void moveZeroes(List nums) { diff --git a/src/main/dart/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.dart b/src/main/dart/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.dart index 4feb158d..53750873 100644 --- a/src/main/dart/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.dart +++ b/src/main/dart/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.dart @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream -// #Big_O_Time_O(n*log_n)_Space_O(n) #2024_10_09_Time_602_ms_(100.00%)_Space_228.5_MB_(62.50%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_10_09_Time_602_ms_(100.00%)_Space_228.5_MB_(62.50%) class MedianFinder { PriorityQueue small = PriorityQueue((a, b) =>b.compareTo(a)); diff --git a/src/main/dart/g0201_0300/s0300_longest_increasing_subsequence/Solution.dart b/src/main/dart/g0201_0300/s0300_longest_increasing_subsequence/Solution.dart index 0de8e77f..de8d951c 100644 --- a/src/main/dart/g0201_0300/s0300_longest_increasing_subsequence/Solution.dart +++ b/src/main/dart/g0201_0300/s0300_longest_increasing_subsequence/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search // #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) // #2024_10_09_Time_332_ms_(96.15%)_Space_147.1_MB_(100.00%) class Solution { diff --git a/src/main/dart/g0301_0400/s0322_coin_change/Solution.dart b/src/main/dart/g0301_0400/s0322_coin_change/Solution.dart index 1466c094..2da962af 100644 --- a/src/main/dart/g0301_0400/s0322_coin_change/Solution.dart +++ b/src/main/dart/g0301_0400/s0322_coin_change/Solution.dart @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) // #2024_10_09_Time_322_ms_(100.00%)_Space_151.2_MB_(58.82%) class Solution { diff --git a/src/main/dart/g0301_0400/s0338_counting_bits/Solution.dart b/src/main/dart/g0301_0400/s0338_counting_bits/Solution.dart index 152f7535..d9ed23cc 100644 --- a/src/main/dart/g0301_0400/s0338_counting_bits/Solution.dart +++ b/src/main/dart/g0301_0400/s0338_counting_bits/Solution.dart @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_10_11_Time_303_ms_(100.00%)_Space_151.6_MB_(25.81%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_10_11_Time_303_ms_(100.00%)_Space_151.6_MB_(25.81%) class Solution { List countBits(int num) { diff --git a/src/main/dart/g0301_0400/s0394_decode_string/Solution.dart b/src/main/dart/g0301_0400/s0394_decode_string/Solution.dart index eba2d31a..46745972 100644 --- a/src/main/dart/g0301_0400/s0394_decode_string/Solution.dart +++ b/src/main/dart/g0301_0400/s0394_decode_string/Solution.dart @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2024_10_12_Time_283_ms_(100.00%)_Space_148.4_MB_(43.75%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2024_10_12_Time_283_ms_(100.00%)_Space_148.4_MB_(43.75%) class Solution { int i = 0; diff --git a/src/main/dart/g0401_0500/s0437_path_sum_iii/Solution.dart b/src/main/dart/g0401_0500/s0437_path_sum_iii/Solution.dart index 50084d34..ea27e4fb 100644 --- a/src/main/dart/g0401_0500/s0437_path_sum_iii/Solution.dart +++ b/src/main/dart/g0401_0500/s0437_path_sum_iii/Solution.dart @@ -1,5 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2024_10_12_Time_357_ms_(100.00%)_Space_147.7_MB_(100.00%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2024_10_12_Time_357_ms_(100.00%)_Space_147.7_MB_(100.00%) /** * Definition for a binary tree node. diff --git a/src/main/dart/g0701_0800/s0739_daily_temperatures/Solution.dart b/src/main/dart/g0701_0800/s0739_daily_temperatures/Solution.dart index fe370c0c..347125f1 100644 --- a/src/main/dart/g0701_0800/s0739_daily_temperatures/Solution.dart +++ b/src/main/dart/g0701_0800/s0739_daily_temperatures/Solution.dart @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2024_10_12_Time_429_ms_(80.43%)_Space_189.2_MB_(54.35%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2024_10_12_Time_429_ms_(80.43%)_Space_189.2_MB_(54.35%) class Solution { List dailyTemperatures(List temperatures) { diff --git a/src/main/dart/g1101_1200/s1143_longest_common_subsequence/Solution.dart b/src/main/dart/g1101_1200/s1143_longest_common_subsequence/Solution.dart index 0b7fa044..6209e6ab 100644 --- a/src/main/dart/g1101_1200/s1143_longest_common_subsequence/Solution.dart +++ b/src/main/dart/g1101_1200/s1143_longest_common_subsequence/Solution.dart @@ -1,4 +1,4 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2024_10_12_Time_326_ms_(96.67%)_Space_168.1_MB_(86.67%) diff --git a/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex b/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex index 131e8603..353e84e2 100644 --- a/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex +++ b/src/main/elixir/g0001_0100/s0064_minimum_path_sum/Solution.ex @@ -1,22 +1,21 @@ # #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) -# #2025_01_22_Time_3_(100.00%)_Space_89.73_(100.00%) +# #2024_08_02_Time_285_ms_(100.00%)_Space_79.9_MB_(100.00%) defmodule Solution do - @spec min_path_sum(grid :: [[integer]]) :: integer - def min_path_sum(grid) do - grid_width = length(hd(grid)) # Determine the number of columns in the grid - traverse(grid, [0 | List.duplicate(:infinity, grid_width - 1)]) - end + @spec min_path_sum(grid :: [[integer]]) :: integer + def min_path_sum(grid) do + traverse(grid, [0 | List.duplicate(20000, 199)]) + end - defp traverse([], prev_row), do: Enum.at(prev_row, -1) - defp traverse([[first | row] | rows], [prev_row_head | prev_row]) do - prev_row = traverse_row(row, prev_row, [first + prev_row_head]) - traverse(rows, prev_row) - end + defp traverse([], prev_row), do: Enum.at(prev_row, -1) + defp traverse([[first | row] | rows], [prev_row_head | prev_row]) do + prev_row = traverse_row(row, prev_row, [first + prev_row_head]) + traverse(rows, prev_row) + end - defp traverse_row([], _prev_row, acc), do: Enum.reverse(acc) - defp traverse_row([head | tail], [top | prev_row], [prev | _rest] = acc) do - traverse_row(tail, prev_row, [head + min(prev, top) | acc]) - end + defp traverse_row([], _prev_row, acc), do: Enum.reverse(acc) + defp traverse_row([head | tail], [top | prev_row], [prev | _rest] = acc) do + traverse_row(tail, prev_row, [head + min(prev, top) | acc]) + end end diff --git a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java index 86acdf70..425a8ffc 100644 --- a/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java +++ b/src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java @@ -1,8 +1,8 @@ package g0001_0100.s0011_container_with_most_water; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%) public class Solution { public int maxArea(int[] height) { diff --git a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java index ec462f31..ab0971f2 100644 --- a/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java +++ b/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java @@ -1,8 +1,8 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) // #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%) import java.util.ArrayList; diff --git a/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java b/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java index 2db6a051..a074b442 100644 --- a/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java +++ b/src/main/java/g0001_0100/s0045_jump_game_ii/Solution.java @@ -8,7 +8,7 @@ public class Solution { private int getMax(int[] nums, int l, int r) { int max = -1; - int curr = -1; + int curr; for (int i = l; i <= r; i++) { curr = i + nums[i]; max = Math.max(max, curr); diff --git a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java index b459ef86..9e880253 100644 --- a/src/main/java/g0001_0100/s0062_unique_paths/Solution.java +++ b/src/main/java/g0001_0100/s0062_unique_paths/Solution.java @@ -1,9 +1,9 @@ package g0001_0100.s0062_unique_paths; // #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) -// #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%) public class Solution { public int uniquePaths(int m, int n) { diff --git a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java index 94fdde28..8e65757c 100644 --- a/src/main/java/g0001_0100/s0072_edit_distance/Solution.java +++ b/src/main/java/g0001_0100/s0072_edit_distance/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0072_edit_distance; -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%) diff --git a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java index 0a42a12a..7f905b51 100644 --- a/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java +++ b/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java @@ -1,7 +1,7 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) // #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%) diff --git a/src/main/java/g0101_0200/s0136_single_number/Solution.java b/src/main/java/g0101_0200/s0136_single_number/Solution.java index 2a9a3683..e6b2f514 100644 --- a/src/main/java/g0101_0200/s0136_single_number/Solution.java +++ b/src/main/java/g0101_0200/s0136_single_number/Solution.java @@ -1,9 +1,9 @@ package g0101_0200.s0136_single_number; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1) -// #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%) +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation +// #Big_O_Time_O(N)_Space_O(1) #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%) public class Solution { public int singleNumber(int[] nums) { diff --git a/src/main/java/g0101_0200/s0198_house_robber/Solution.java b/src/main/java/g0101_0200/s0198_house_robber/Solution.java index 2296f04e..7946f758 100644 --- a/src/main/java/g0101_0200/s0198_house_robber/Solution.java +++ b/src/main/java/g0101_0200/s0198_house_robber/Solution.java @@ -1,7 +1,7 @@ package g0101_0200.s0198_house_robber; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP // #Big_O_Time_O(n)_Space_O(n) #2024_11_15_Time_0_ms_(100.00%)_Space_40.7_MB_(77.55%) diff --git a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java index 8eb674d9..9e24c044 100644 --- a/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java +++ b/src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java @@ -1,9 +1,9 @@ package g0201_0300.s0206_reverse_linked_list; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%) import com_github_leetcode.ListNode; diff --git a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java index c40344b5..574fa6c1 100644 --- a/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java +++ b/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java @@ -1,7 +1,7 @@ package g0201_0300.s0208_implement_trie_prefix_tree; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2024_11_15_Time_32_ms_(95.05%)_Space_54.9_MB_(91.16%) diff --git a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java index f9034898..22df0290 100644 --- a/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java +++ b/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java @@ -1,9 +1,9 @@ package g0201_0300.s0215_kth_largest_element_in_an_array; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n)) -// #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%) +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%) import java.util.Arrays; diff --git a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java index 154b5f9c..32dd6075 100644 --- a/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java +++ b/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java @@ -1,8 +1,9 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree; // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General -// #Big_O_Time_O(n)_Space_O(n) #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%) import com_github_leetcode.TreeNode; diff --git a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java index c639a3c5..0ae177b0 100644 --- a/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java +++ b/src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java @@ -1,8 +1,8 @@ package g0201_0300.s0238_product_of_array_except_self; -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n) -// #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%) public class Solution { public int[] productExceptSelf(int[] nums) { diff --git a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java index 0f66fdb1..fc89319f 100644 --- a/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java +++ b/src/main/java/g0201_0300/s0283_move_zeroes/Solution.java @@ -1,8 +1,8 @@ package g0201_0300.s0283_move_zeroes; -// #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) -// #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%) public class Solution { public void moveZeroes(int[] nums) { diff --git a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java index 1c7d258e..1fcc7035 100644 --- a/src/main/java/g0301_0400/s0338_counting_bits/Solution.java +++ b/src/main/java/g0301_0400/s0338_counting_bits/Solution.java @@ -1,7 +1,8 @@ package g0301_0400.s0338_counting_bits; -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%) public class Solution { public int[] countBits(int num) { diff --git a/src/main/java/g0301_0400/s0394_decode_string/Solution.java b/src/main/java/g0301_0400/s0394_decode_string/Solution.java index ef0191a9..4a379020 100644 --- a/src/main/java/g0301_0400/s0394_decode_string/Solution.java +++ b/src/main/java/g0301_0400/s0394_decode_string/Solution.java @@ -1,7 +1,8 @@ package g0301_0400.s0394_decode_string; -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%) public class Solution { private int i = 0; diff --git a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java index 421cf21a..e2ae31d6 100644 --- a/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java +++ b/src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java @@ -1,7 +1,7 @@ package g0401_0500.s0437_path_sum_iii; -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%) import com_github_leetcode.TreeNode; import java.util.HashMap; diff --git a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java index 86c5856c..7660afb5 100644 --- a/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java +++ b/src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java @@ -1,7 +1,8 @@ package g0701_0800.s0739_daily_temperatures; -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%) @SuppressWarnings("java:S135") public class Solution { diff --git a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java index eef86afa..363f23b1 100644 --- a/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java +++ b/src/main/java/g1101_1200/s1143_longest_common_subsequence/Solution.java @@ -1,6 +1,6 @@ package g1101_1200.s1143_longest_common_subsequence; -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2024_11_17_Time_19_ms_(89.05%)_Space_50.9_MB_(33.70%) diff --git a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt index d3b39ab8..b74ba246 100644 --- a/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0011_container_with_most_water/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0011_container_with_most_water // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2023_07_03_Time_402_ms_(78.57%)_Space_52.1_MB_(77.51%) class Solution { fun maxArea(height: IntArray): Int { diff --git a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt index fecc2bd9..ac397e83 100644 --- a/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.kt @@ -1,8 +1,8 @@ package g0001_0100.s0017_letter_combinations_of_a_phone_number // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) // #2023_07_03_Time_155_ms_(95.24%)_Space_34.9_MB_(96.34%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt index d8bf82b3..decc1dee 100644 --- a/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.kt @@ -4,7 +4,7 @@ package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search // #Big_O_Time_O(log_n)_Space_O(1) #2023_07_05_Time_174_ms_(100.00%)_Space_37.8_MB_(71.70%) -class Solution constructor() { +class Solution { fun searchRange(nums: IntArray, target: Int): IntArray { val ans = IntArray(2) ans[0] = helper(nums, target, false) diff --git a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt index 0a1951c8..c8b29814 100644 --- a/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0062_unique_paths/Solution.kt @@ -1,9 +1,9 @@ package g0001_0100.s0062_unique_paths // #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) -// #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2023_07_10_Time_118_ms_(94.65%)_Space_33_MB_(81.62%) class Solution { fun uniquePaths(m: Int, n: Int): Int { diff --git a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt index 89da7954..c456d1a3 100644 --- a/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0072_edit_distance/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0072_edit_distance -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2023_07_10_Time_182_ms_(92.16%)_Space_36.2_MB_(98.04%) diff --git a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt index 60bd48b2..c820f59b 100644 --- a/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0104_maximum_depth_of_binary_tree // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) // #2023_07_11_Time_166_ms_(83.53%)_Space_36.5_MB_(86.11%) diff --git a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt index 31c03a1f..dbc909c3 100644 --- a/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0136_single_number/Solution.kt @@ -1,9 +1,9 @@ package g0101_0200.s0136_single_number // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1) -// #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation +// #Big_O_Time_O(N)_Space_O(1) #2022_09_03_Time_344_ms_(83.63%)_Space_47.6_MB_(82.58%) class Solution { fun singleNumber(nums: IntArray): Int { diff --git a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt index 3d30e4a4..df63a0e7 100644 --- a/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0198_house_robber/Solution.kt @@ -1,7 +1,7 @@ package g0101_0200.s0198_house_robber // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP // #Big_O_Time_O(n)_Space_O(n) #2022_09_08_Time_156_ms_(92.24%)_Space_34.1_MB_(61.64%) diff --git a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt index c4135e6e..53843930 100644 --- a/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0206_reverse_linked_list/Solution.kt @@ -1,9 +1,9 @@ package g0201_0300.s0206_reverse_linked_list // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2022_09_27_Time_279_ms_(45.78%)_Space_36.2_MB_(49.40%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt index 7b1951ff..66a9c572 100644 --- a/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt +++ b/src/main/kotlin/g0201_0300/s0208_implement_trie_prefix_tree/Trie.kt @@ -1,7 +1,7 @@ package g0201_0300.s0208_implement_trie_prefix_tree // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2022_09_10_Time_689_ms_(61.00%)_Space_87.9_MB_(36.00%) diff --git a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt index 659dccf5..afc7a88f 100644 --- a/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.kt @@ -1,9 +1,9 @@ package g0201_0300.s0215_kth_largest_element_in_an_array // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n)) -// #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_09_10_Time_839_ms_(34.43%)_Space_72.5_MB_(26.95%) class Solution { fun findKthLargest(nums: IntArray, k: Int): Int { diff --git a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt index 99698cb7..b104864c 100644 --- a/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.kt @@ -1,8 +1,9 @@ package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General -// #Big_O_Time_O(n)_Space_O(n) #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2022_09_10_Time_386_ms_(45.21%)_Space_43.9_MB_(81.65%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt index cc14941d..f4d01ea2 100644 --- a/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0238_product_of_array_except_self/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0238_product_of_array_except_self -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n) -// #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2022_09_10_Time_669_ms_(48.96%)_Space_69_MB_(86.94%) class Solution { fun productExceptSelf(nums: IntArray): IntArray { diff --git a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt index 5f6344c0..fe0fa122 100644 --- a/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt +++ b/src/main/kotlin/g0201_0300/s0283_move_zeroes/Solution.kt @@ -1,8 +1,8 @@ package g0201_0300.s0283_move_zeroes -// #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) -// #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2022_09_10_Time_516_ms_(79.07%)_Space_64.2_MB_(36.71%) class Solution { fun moveZeroes(nums: IntArray) { diff --git a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt index 1af44250..c0e3d42a 100644 --- a/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0338_counting_bits/Solution.kt @@ -1,7 +1,8 @@ package g0301_0400.s0338_counting_bits -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2022_09_27_Time_186_ms_(99.26%)_Space_38.8_MB_(89.71%) class Solution { fun countBits(num: Int): IntArray { diff --git a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt index eb26cd47..40d7859a 100644 --- a/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt +++ b/src/main/kotlin/g0301_0400/s0394_decode_string/Solution.kt @@ -1,7 +1,8 @@ package g0301_0400.s0394_decode_string -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2022_09_27_Time_224_ms_(64.86%)_Space_34.3_MB_(84.46%) class Solution { private var i = 0 diff --git a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt index 18a471b3..29c247a1 100644 --- a/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt +++ b/src/main/kotlin/g0401_0500/s0437_path_sum_iii/Solution.kt @@ -1,7 +1,7 @@ package g0401_0500.s0437_path_sum_iii -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2022_09_11_Time_403_ms_(54.12%)_Space_41.7_MB_(62.35%) import com_github_leetcode.TreeNode diff --git a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt index 89b91047..9b11266d 100644 --- a/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0739_daily_temperatures/Solution.kt @@ -1,7 +1,8 @@ package g0701_0800.s0739_daily_temperatures -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2022_09_13_Time_936_ms_(80.54%)_Space_79.5_MB_(63.09%) class Solution { fun dailyTemperatures(temperatures: IntArray): IntArray { diff --git a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt index d55d7294..325ff703 100644 --- a/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt +++ b/src/main/kotlin/g1101_1200/s1143_longest_common_subsequence/Solution.kt @@ -1,6 +1,6 @@ package g1101_1200.s1143_longest_common_subsequence -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2022_09_13_Time_307_ms_(38.36%)_Space_38.7_MB_(86.99%) diff --git a/src/main/php/g0001_0100/s0001_two_sum/Solution.php b/src/main/php/g0001_0100/s0001_two_sum/Solution.php index 00a19f35..c593f810 100644 --- a/src/main/php/g0001_0100/s0001_two_sum/Solution.php +++ b/src/main/php/g0001_0100/s0001_two_sum/Solution.php @@ -3,7 +3,8 @@ namespace leetcode\g0001_0100\s0001_two_sum; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task // #2023_11_29_Time_9_ms_(97.47%)_Space_19.8_MB_(77.40%) class Solution { diff --git a/src/main/php/g0001_0100/s0002_add_two_numbers/Solution.php b/src/main/php/g0001_0100/s0002_add_two_numbers/Solution.php index 8b41bbb3..0a509b74 100644 --- a/src/main/php/g0001_0100/s0002_add_two_numbers/Solution.php +++ b/src/main/php/g0001_0100/s0002_add_two_numbers/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2023_11_29_Time_13_ms_(73.83%)_Space_19.2_MB_(38.29%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2023_11_29_Time_13_ms_(73.83%)_Space_19.2_MB_(38.29%) use leetcode\com_github_leetcode\ListNode; diff --git a/src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.php b/src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.php index d10133e3..a5348731 100644 --- a/src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.php +++ b/src/main/php/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #2023_12_03_Time_4_ms_(99.33%)_Space_19.1_MB_(68.83%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2023_12_03_Time_4_ms_(99.33%)_Space_19.1_MB_(68.83%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.php b/src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.php index a625ebbe..14a92eaa 100644 --- a/src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.php +++ b/src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.php @@ -3,7 +3,8 @@ namespace leetcode\g0001_0100\s0004_median_of_two_sorted_arrays; // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_12_03_Time_23_ms_(88.34%)_Space_19.1_MB_(87.47%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2023_12_03_Time_23_ms_(88.34%)_Space_19.1_MB_(87.47%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0005_longest_palindromic_substring/Solution.php b/src/main/php/g0001_0100/s0005_longest_palindromic_substring/Solution.php index e036a2e4..fe4cfa28 100644 --- a/src/main/php/g0001_0100/s0005_longest_palindromic_substring/Solution.php +++ b/src/main/php/g0001_0100/s0005_longest_palindromic_substring/Solution.php @@ -4,8 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_12_03_Time_13_ms_(98.57%)_Space_19.4_MB_(12.54%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_12_03_Time_13_ms_(98.57%)_Space_19.4_MB_(12.54%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0006_zigzag_conversion/Solution.php b/src/main/php/g0001_0100/s0006_zigzag_conversion/Solution.php index d9cdbe70..823716bf 100644 --- a/src/main/php/g0001_0100/s0006_zigzag_conversion/Solution.php +++ b/src/main/php/g0001_0100/s0006_zigzag_conversion/Solution.php @@ -2,7 +2,8 @@ namespace leetcode\g0001_0100\s0006_zigzag_conversion; -// #Medium #String #2023_12_03_Time_12_ms_(80.63%)_Space_19.3_MB_(57.66%) +// #Medium #String #Top_Interview_150_Array/String +// #2023_12_03_Time_12_ms_(80.63%)_Space_19.3_MB_(57.66%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0009_palindrome_number/Solution.php b/src/main/php/g0001_0100/s0009_palindrome_number/Solution.php index bbd6daed..71ee74b2 100644 --- a/src/main/php/g0001_0100/s0009_palindrome_number/Solution.php +++ b/src/main/php/g0001_0100/s0009_palindrome_number/Solution.php @@ -2,7 +2,8 @@ namespace leetcode\g0001_0100\s0009_palindrome_number; -// #Easy #Math #Udemy_Integers #2023_12_03_Time_23_ms_(76.73%)_Space_19.4_MB_(5.93%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2023_12_03_Time_23_ms_(76.73%)_Space_19.4_MB_(5.93%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0010_regular_expression_matching/Solution.php b/src/main/php/g0001_0100/s0010_regular_expression_matching/Solution.php index 1509038c..182cd66c 100644 --- a/src/main/php/g0001_0100/s0010_regular_expression_matching/Solution.php +++ b/src/main/php/g0001_0100/s0010_regular_expression_matching/Solution.php @@ -2,9 +2,8 @@ namespace leetcode\g0001_0100\s0010_regular_expression_matching; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion -// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -// #2023_12_03_Time_10_ms_(64.52%)_Space_19.3_MB_(61.29%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_12_03_Time_10_ms_(64.52%)_Space_19.3_MB_(61.29%) class Solution { private $cache; diff --git a/src/main/php/g0001_0100/s0011_container_with_most_water/Solution.php b/src/main/php/g0001_0100/s0011_container_with_most_water/Solution.php index 9387fca4..9d53dcf3 100644 --- a/src/main/php/g0001_0100/s0011_container_with_most_water/Solution.php +++ b/src/main/php/g0001_0100/s0011_container_with_most_water/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0011_container_with_most_water; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2023_12_07_Time_177_ms_(88.58%)_Space_31.7_MB_(66.67%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2023_12_07_Time_177_ms_(88.58%)_Space_31.7_MB_(66.67%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0015_3sum/Solution.php b/src/main/php/g0001_0100/s0015_3sum/Solution.php index 17252170..1b915b47 100644 --- a/src/main/php/g0001_0100/s0015_3sum/Solution.php +++ b/src/main/php/g0001_0100/s0015_3sum/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_01_12_Time_243_ms_(81.45%)_Space_26.7_MB_(79.84%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_01_12_Time_243_ms_(81.45%)_Space_26.7_MB_(79.84%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.php b/src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.php index 3a67cb56..77dfcc0a 100644 --- a/src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.php +++ b/src/main/php/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.php @@ -3,8 +3,9 @@ namespace leetcode\g0001_0100\s0017_letter_combinations_of_a_phone_number; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2023_12_07_Time_5_ms_(60.19%)_Space_19.1_MB_(59.26%) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2023_12_07_Time_5_ms_(60.19%)_Space_19.1_MB_(59.26%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.php b/src/main/php/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.php index 9dc18068..cca5131e 100644 --- a/src/main/php/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.php +++ b/src/main/php/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0019_remove_nth_node_from_end_of_list; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2023_12_07_Time_4_ms_(81.93%)_Space_18.9_MB_(91.57%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2023_12_07_Time_4_ms_(81.93%)_Space_18.9_MB_(91.57%) use leetcode\com_github_leetcode\ListNode; diff --git a/src/main/php/g0001_0100/s0020_valid_parentheses/Solution.php b/src/main/php/g0001_0100/s0020_valid_parentheses/Solution.php index be86bf46..9fbb63f9 100644 --- a/src/main/php/g0001_0100/s0020_valid_parentheses/Solution.php +++ b/src/main/php/g0001_0100/s0020_valid_parentheses/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0020_valid_parentheses; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2023_12_07_Time_3_ms_(88.14%)_Space_19.1_MB_(76.99%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2023_12_07_Time_3_ms_(88.14%)_Space_19.1_MB_(76.99%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0021_merge_two_sorted_lists/Solution.php b/src/main/php/g0001_0100/s0021_merge_two_sorted_lists/Solution.php index 9542afb0..f2e5d912 100644 --- a/src/main/php/g0001_0100/s0021_merge_two_sorted_lists/Solution.php +++ b/src/main/php/g0001_0100/s0021_merge_two_sorted_lists/Solution.php @@ -4,8 +4,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2023_12_07_Time_3_ms_(90.57%)_Space_19.4_MB_(12.46%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2023_12_07_Time_3_ms_(90.57%)_Space_19.4_MB_(12.46%) use leetcode\com_github_leetcode\ListNode; diff --git a/src/main/php/g0001_0100/s0022_generate_parentheses/Solution.php b/src/main/php/g0001_0100/s0022_generate_parentheses/Solution.php index f8fe3a6b..254a57b3 100644 --- a/src/main/php/g0001_0100/s0022_generate_parentheses/Solution.php +++ b/src/main/php/g0001_0100/s0022_generate_parentheses/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2023_12_07_Time_4_ms_(83.67%)_Space_19.1_MB_(100.00%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2023_12_07_Time_4_ms_(83.67%)_Space_19.1_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0023_merge_k_sorted_lists/Solution.php b/src/main/php/g0001_0100/s0023_merge_k_sorted_lists/Solution.php index 092d4db4..dab1a39b 100644 --- a/src/main/php/g0001_0100/s0023_merge_k_sorted_lists/Solution.php +++ b/src/main/php/g0001_0100/s0023_merge_k_sorted_lists/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0023_merge_k_sorted_lists; // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) -// #2023_12_07_Time_19_ms_(84.54%)_Space_27.4_MB_(8.25%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2023_12_07_Time_19_ms_(84.54%)_Space_27.4_MB_(8.25%) use leetcode\com_github_leetcode\ListNode; diff --git a/src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.php b/src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.php index 8b385c52..f1acc9e7 100644 --- a/src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.php +++ b/src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.php @@ -3,7 +3,7 @@ namespace leetcode\g0001_0100\s0025_reverse_nodes_in_k_group; // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) // #2023_12_07_Time_3_ms_(100.00%)_Space_20.4_MB_(68.18%) use leetcode\com_github_leetcode\ListNode; diff --git a/src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.php b/src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.php index 7d2aad5f..8aa27c9e 100644 --- a/src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.php +++ b/src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.php @@ -4,7 +4,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2023_12_09_Time_7_ms_(83.17%)_Space_19.1_MB_(83.17%) class Solution { diff --git a/src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.php b/src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.php index 69b83812..d6cddd36 100644 --- a/src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.php +++ b/src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0034_find_first_and_last_position_of_element_in_sorted_array; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2023_12_09_Time_19_ms_(81.01%)_Space_23.5_MB_(22.78%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2023_12_09_Time_19_ms_(81.01%)_Space_23.5_MB_(22.78%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0035_search_insert_position/Solution.php b/src/main/php/g0001_0100/s0035_search_insert_position/Solution.php index 8c2ac5a6..d6881101 100644 --- a/src/main/php/g0001_0100/s0035_search_insert_position/Solution.php +++ b/src/main/php/g0001_0100/s0035_search_insert_position/Solution.php @@ -3,7 +3,7 @@ namespace leetcode\g0001_0100\s0035_search_insert_position; // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2023_12_09_Time_8_ms_(85.09%)_Space_19.7_MB_(64.77%) class Solution { diff --git a/src/main/php/g0001_0100/s0039_combination_sum/Solution.php b/src/main/php/g0001_0100/s0039_combination_sum/Solution.php index 55f658de..7793df83 100644 --- a/src/main/php/g0001_0100/s0039_combination_sum/Solution.php +++ b/src/main/php/g0001_0100/s0039_combination_sum/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_12_09_Time_11_ms_(87.10%)_Space_19.5_MB_(19.36%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2023_12_09_Time_11_ms_(87.10%)_Space_19.5_MB_(19.36%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0042_trapping_rain_water/Solution.php b/src/main/php/g0001_0100/s0042_trapping_rain_water/Solution.php index e8879c9e..bc15d5e2 100644 --- a/src/main/php/g0001_0100/s0042_trapping_rain_water/Solution.php +++ b/src/main/php/g0001_0100/s0042_trapping_rain_water/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_09_Time_29_ms_(69.15%)_Space_21.5_MB_(97.87%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_12_09_Time_29_ms_(69.15%)_Space_21.5_MB_(97.87%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0045_jump_game_ii/Solution.php b/src/main/php/g0001_0100/s0045_jump_game_ii/Solution.php index 25a01dfc..058ff5e0 100644 --- a/src/main/php/g0001_0100/s0045_jump_game_ii/Solution.php +++ b/src/main/php/g0001_0100/s0045_jump_game_ii/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_09_Time_31_ms_(63.46%)_Space_20.5_MB_(81.73%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_12_09_Time_31_ms_(63.46%)_Space_20.5_MB_(81.73%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0046_permutations/Solution.php b/src/main/php/g0001_0100/s0046_permutations/Solution.php index cddaddc4..7fd4e4c6 100644 --- a/src/main/php/g0001_0100/s0046_permutations/Solution.php +++ b/src/main/php/g0001_0100/s0046_permutations/Solution.php @@ -4,7 +4,7 @@ // #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!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2023_12_09_Time_4_ms_(92.42%)_Space_19.2_MB_(92.42%) class Solution { diff --git a/src/main/php/g0001_0100/s0048_rotate_image/Solution.php b/src/main/php/g0001_0100/s0048_rotate_image/Solution.php index 164fff2c..c8193759 100644 --- a/src/main/php/g0001_0100/s0048_rotate_image/Solution.php +++ b/src/main/php/g0001_0100/s0048_rotate_image/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_10_Time_4_ms_(81.58%)_Space_19.4_MB_(10.53%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2023_12_10_Time_4_ms_(81.58%)_Space_19.4_MB_(10.53%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0049_group_anagrams/Solution.php b/src/main/php/g0001_0100/s0049_group_anagrams/Solution.php index 30edd041..29b9b4d7 100644 --- a/src/main/php/g0001_0100/s0049_group_anagrams/Solution.php +++ b/src/main/php/g0001_0100/s0049_group_anagrams/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_10_Time_27_ms_(80.85%)_Space_25.8_MB_(27.66%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2023_12_10_Time_27_ms_(80.85%)_Space_25.8_MB_(27.66%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0053_maximum_subarray/Solution.php b/src/main/php/g0001_0100/s0053_maximum_subarray/Solution.php index 679ef0b5..03d28b86 100644 --- a/src/main/php/g0001_0100/s0053_maximum_subarray/Solution.php +++ b/src/main/php/g0001_0100/s0053_maximum_subarray/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0001_0100\s0053_maximum_subarray; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming +// #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) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) // #2023_12_10_Time_185_ms_(95.51%)_Space_31.8_MB_(91.01%) class Solution { diff --git a/src/main/php/g0001_0100/s0055_jump_game/Solution.php b/src/main/php/g0001_0100/s0055_jump_game/Solution.php index ea97dd37..05e839dd 100644 --- a/src/main/php/g0001_0100/s0055_jump_game/Solution.php +++ b/src/main/php/g0001_0100/s0055_jump_game/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_10_Time_129_ms_(74.56%)_Space_20.4_MB_(82.46%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_12_10_Time_129_ms_(74.56%)_Space_20.4_MB_(82.46%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0056_merge_intervals/Solution.php b/src/main/php/g0001_0100/s0056_merge_intervals/Solution.php index 87ac80c1..4c47482a 100644 --- a/src/main/php/g0001_0100/s0056_merge_intervals/Solution.php +++ b/src/main/php/g0001_0100/s0056_merge_intervals/Solution.php @@ -4,7 +4,8 @@ // #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) #2023_12_10_Time_48_ms_(80.00%)_Space_33.2_MB_(13.33%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2023_12_10_Time_48_ms_(80.00%)_Space_33.2_MB_(13.33%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0062_unique_paths/Solution.php b/src/main/php/g0001_0100/s0062_unique_paths/Solution.php index 6a0c1403..c4efcbf7 100644 --- a/src/main/php/g0001_0100/s0062_unique_paths/Solution.php +++ b/src/main/php/g0001_0100/s0062_unique_paths/Solution.php @@ -3,9 +3,9 @@ namespace leetcode\g0001_0100\s0062_unique_paths; // #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) -// #2023_12_10_Time_3_ms_(81.58%)_Space_19.3_MB_(15.79%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2023_12_10_Time_3_ms_(81.58%)_Space_19.3_MB_(15.79%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0064_minimum_path_sum/Solution.php b/src/main/php/g0001_0100/s0064_minimum_path_sum/Solution.php index 8aeae36b..85fa707d 100644 --- a/src/main/php/g0001_0100/s0064_minimum_path_sum/Solution.php +++ b/src/main/php/g0001_0100/s0064_minimum_path_sum/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0064_minimum_path_sum; // #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) -// #2023_12_10_Time_20_ms_(81.48%)_Space_22.4_MB_(62.96%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_12_10_Time_20_ms_(81.48%)_Space_22.4_MB_(62.96%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0070_climbing_stairs/Solution.php b/src/main/php/g0001_0100/s0070_climbing_stairs/Solution.php index 710947fb..e98fc3dc 100644 --- a/src/main/php/g0001_0100/s0070_climbing_stairs/Solution.php +++ b/src/main/php/g0001_0100/s0070_climbing_stairs/Solution.php @@ -4,8 +4,8 @@ // #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) -// #2023_12_10_Time_3_ms_(82.81%)_Space_19.1_MB_(38.54%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_12_10_Time_3_ms_(82.81%)_Space_19.1_MB_(38.54%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0072_edit_distance/Solution.php b/src/main/php/g0001_0100/s0072_edit_distance/Solution.php index d2be5e68..e9e4b32e 100644 --- a/src/main/php/g0001_0100/s0072_edit_distance/Solution.php +++ b/src/main/php/g0001_0100/s0072_edit_distance/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0001_0100\s0072_edit_distance; -// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2023_12_10_Time_29_ms_(75.00%)_Space_19.1_MB_(93.75%) class Solution { diff --git a/src/main/php/g0001_0100/s0073_set_matrix_zeroes/Solution.php b/src/main/php/g0001_0100/s0073_set_matrix_zeroes/Solution.php index d79b08d2..25473298 100644 --- a/src/main/php/g0001_0100/s0073_set_matrix_zeroes/Solution.php +++ b/src/main/php/g0001_0100/s0073_set_matrix_zeroes/Solution.php @@ -3,7 +3,7 @@ namespace leetcode\g0001_0100\s0073_set_matrix_zeroes; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) // #2023_12_10_Time_37_ms_(61.76%)_Space_23.4_MB_(44.12%) class Solution { diff --git a/src/main/php/g0001_0100/s0074_search_a_2d_matrix/Solution.php b/src/main/php/g0001_0100/s0074_search_a_2d_matrix/Solution.php index cbaf2496..7a14bcde 100644 --- a/src/main/php/g0001_0100/s0074_search_a_2d_matrix/Solution.php +++ b/src/main/php/g0001_0100/s0074_search_a_2d_matrix/Solution.php @@ -4,7 +4,7 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2023_12_10_Time_9_ms_(68.18%)_Space_19.8_MB_(51.82%) class Solution { diff --git a/src/main/php/g0001_0100/s0076_minimum_window_substring/Solution.php b/src/main/php/g0001_0100/s0076_minimum_window_substring/Solution.php index fd31c154..cafbff3e 100644 --- a/src/main/php/g0001_0100/s0076_minimum_window_substring/Solution.php +++ b/src/main/php/g0001_0100/s0076_minimum_window_substring/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0076_minimum_window_substring; // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2023_12_10_Time_21_ms_(100.00%)_Space_19.5_MB_(89.09%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2023_12_10_Time_21_ms_(100.00%)_Space_19.5_MB_(89.09%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0079_word_search/Solution.php b/src/main/php/g0001_0100/s0079_word_search/Solution.php index e01f3cb9..4c03ba94 100644 --- a/src/main/php/g0001_0100/s0079_word_search/Solution.php +++ b/src/main/php/g0001_0100/s0079_word_search/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0001_0100\s0079_word_search; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2023_12_10_Time_599_ms_(100.00%)_Space_19_MB_(79.49%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2023_12_10_Time_599_ms_(100.00%)_Space_19_MB_(79.49%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0096_unique_binary_search_trees/Solution.php b/src/main/php/g0001_0100/s0096_unique_binary_search_trees/Solution.php index 0e1d1e12..ce125087 100644 --- a/src/main/php/g0001_0100/s0096_unique_binary_search_trees/Solution.php +++ b/src/main/php/g0001_0100/s0096_unique_binary_search_trees/Solution.php @@ -2,8 +2,8 @@ namespace leetcode\g0001_0100\s0096_unique_binary_search_trees; -// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree -// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) // #2023_12_10_Time_0_ms_(100.00%)_Space_19.1_MB_(44.44%) class Solution { diff --git a/src/main/php/g0001_0100/s0098_validate_binary_search_tree/Solution.php b/src/main/php/g0001_0100/s0098_validate_binary_search_tree/Solution.php index c1356717..f1a0dd89 100644 --- a/src/main/php/g0001_0100/s0098_validate_binary_search_tree/Solution.php +++ b/src/main/php/g0001_0100/s0098_validate_binary_search_tree/Solution.php @@ -4,7 +4,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree // #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -// #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) // #2023_12_10_Time_10_ms_(70.97%)_Space_21.7_MB_(58.06%) /** diff --git a/src/main/php/g0101_0200/s0101_symmetric_tree/Solution.php b/src/main/php/g0101_0200/s0101_symmetric_tree/Solution.php index a8085627..59706007 100644 --- a/src/main/php/g0101_0200/s0101_symmetric_tree/Solution.php +++ b/src/main/php/g0101_0200/s0101_symmetric_tree/Solution.php @@ -4,7 +4,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2023_12_11_Time_6_ms_(76.40%)_Space_19.4_MB_(28.09%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2023_12_11_Time_6_ms_(76.40%)_Space_19.4_MB_(28.09%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.php b/src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.php index fff46264..9058c1d9 100644 --- a/src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.php +++ b/src/main/php/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.php @@ -4,7 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2023_12_11_Time_4_ms_(96.08%)_Space_20.9_MB_(50.98%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2023_12_11_Time_4_ms_(96.08%)_Space_20.9_MB_(50.98%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.php b/src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.php index 49e1e5cf..591411b0 100644 --- a/src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.php +++ b/src/main/php/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.php @@ -3,9 +3,10 @@ namespace leetcode\g0101_0200\s0104_maximum_depth_of_binary_tree; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2023_12_11_Time_9_ms_(63.06%)_Space_20.5_MB_(87.90%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2023_12_11_Time_9_ms_(63.06%)_Space_20.5_MB_(87.90%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.php b/src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.php index f7b2943d..3d4077e3 100644 --- a/src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.php +++ b/src/main/php/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0105_construct_binary_tree_from_preorder_and_inorder_traversal; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2023_12_11_Time_14_ms_(63.33%)_Space_21.1_MB_(93.33%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2023_12_11_Time_14_ms_(63.33%)_Space_21.1_MB_(93.33%) use leetcode\com_github_leetcode\TreeNode; diff --git a/src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.php b/src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.php index c2bef145..fc0c8353 100644 --- a/src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.php +++ b/src/main/php/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.php @@ -3,7 +3,7 @@ namespace leetcode\g0101_0200\s0114_flatten_binary_tree_to_linked_list; // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -// #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) // #2023_12_11_Time_3_ms_(100.00%)_Space_19.6_MB_(14.29%) /** diff --git a/src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.php b/src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.php index d59b248d..59819ab9 100644 --- a/src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.php +++ b/src/main/php/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.php @@ -4,7 +4,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2023_12_11_Time_282_ms_(43.99%)_Space_31.7_MB_(63.72%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2023_12_11_Time_282_ms_(43.99%)_Space_31.7_MB_(63.72%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.php b/src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.php index 687454f0..d0b14f79 100644 --- a/src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.php +++ b/src/main/php/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0124_binary_tree_maximum_path_sum; // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2023_12_11_Time_16_ms_(100.00%)_Space_25.2_MB_(60.00%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2023_12_11_Time_16_ms_(100.00%)_Space_25.2_MB_(60.00%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0101_0200/s0128_longest_consecutive_sequence/Solution.php b/src/main/php/g0101_0200/s0128_longest_consecutive_sequence/Solution.php index de226e12..e954930d 100644 --- a/src/main/php/g0101_0200/s0128_longest_consecutive_sequence/Solution.php +++ b/src/main/php/g0101_0200/s0128_longest_consecutive_sequence/Solution.php @@ -3,7 +3,8 @@ namespace leetcode\g0101_0200\s0128_longest_consecutive_sequence; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2023_12_11_Time_154_ms_(75.61%)_Space_32.6_MB_(37.80%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2023_12_11_Time_154_ms_(75.61%)_Space_32.6_MB_(37.80%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0136_single_number/Solution.php b/src/main/php/g0101_0200/s0136_single_number/Solution.php index 564173e8..b4f27687 100644 --- a/src/main/php/g0101_0200/s0136_single_number/Solution.php +++ b/src/main/php/g0101_0200/s0136_single_number/Solution.php @@ -3,7 +3,8 @@ namespace leetcode\g0101_0200\s0136_single_number; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation // #Big_O_Time_O(N)_Space_O(1) #2023_12_11_Time_33_ms_(80.08%)_Space_21.8_MB_(33.07%) class Solution { diff --git a/src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php b/src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php index ce70a393..d552c7bb 100644 --- a/src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php +++ b/src/main/php/g0101_0200/s0138_copy_list_with_random_pointer/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0138_copy_list_with_random_pointer; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -// #2023_12_17_Time_2300_ms_(60.00%)_Space_22.7_MB_(60.00%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2023_12_17_Time_2300_ms_(60.00%)_Space_22.7_MB_(60.00%) use leetcode\com_github_leetcode\random\Node; diff --git a/src/main/php/g0101_0200/s0139_word_break/Solution.php b/src/main/php/g0101_0200/s0139_word_break/Solution.php index ac0f6725..e48559ce 100644 --- a/src/main/php/g0101_0200/s0139_word_break/Solution.php +++ b/src/main/php/g0101_0200/s0139_word_break/Solution.php @@ -4,8 +4,8 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2023_12_14_Time_7_ms_(75.00%)_Space_19_MB_(84.38%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2023_12_14_Time_7_ms_(75.00%)_Space_19_MB_(84.38%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0141_linked_list_cycle/Solution.php b/src/main/php/g0101_0200/s0141_linked_list_cycle/Solution.php index 41470ea6..b330a1e2 100644 --- a/src/main/php/g0101_0200/s0141_linked_list_cycle/Solution.php +++ b/src/main/php/g0101_0200/s0141_linked_list_cycle/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0141_linked_list_cycle; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2023_12_16_Time_8_ms_(90.60%)_Space_22.7_MB_(47.65%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2023_12_16_Time_8_ms_(90.60%)_Space_22.7_MB_(47.65%) /** * Definition for a singly-linked list. diff --git a/src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php b/src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php index 9fe09910..7a104a47 100644 --- a/src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php +++ b/src/main/php/g0101_0200/s0146_lru_cache/LRUCache.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0146_lru_cache; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2023_12_16_Time_402_ms_(41.18%)_Space_141.8_MB_(23.53%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2023_12_16_Time_402_ms_(41.18%)_Space_141.8_MB_(23.53%) class LruCacheNode { public $key; diff --git a/src/main/php/g0101_0200/s0148_sort_list/Solution.php b/src/main/php/g0101_0200/s0148_sort_list/Solution.php index 2a0e00c4..ace5f77d 100644 --- a/src/main/php/g0101_0200/s0148_sort_list/Solution.php +++ b/src/main/php/g0101_0200/s0148_sort_list/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0148_sort_list; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2023_12_17_Time_63_ms_(97.30%)_Space_38.1_MB_(81.08%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2023_12_17_Time_63_ms_(97.30%)_Space_38.1_MB_(81.08%) /** * Definition for a singly-linked list. diff --git a/src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.php b/src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.php index b373dd97..f5153b39 100644 --- a/src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.php +++ b/src/main/php/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0153_find_minimum_in_rotated_sorted_array; // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2023_12_17_Time_9_ms_(73.47%)_Space_19.5_MB_(20.41%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2023_12_17_Time_9_ms_(73.47%)_Space_19.5_MB_(20.41%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0155_min_stack/MinStack.php b/src/main/php/g0101_0200/s0155_min_stack/MinStack.php index c22bae29..3e7e80a2 100644 --- a/src/main/php/g0101_0200/s0155_min_stack/MinStack.php +++ b/src/main/php/g0101_0200/s0155_min_stack/MinStack.php @@ -2,9 +2,9 @@ namespace leetcode\g0101_0200\s0155_min_stack; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) // #2023_12_17_Time_19_ms_(100.00%)_Space_25.9_MB_(33.33%) class Node { diff --git a/src/main/php/g0101_0200/s0169_majority_element/Solution.php b/src/main/php/g0101_0200/s0169_majority_element/Solution.php index 79d72553..d5bf3429 100644 --- a/src/main/php/g0101_0200/s0169_majority_element/Solution.php +++ b/src/main/php/g0101_0200/s0169_majority_element/Solution.php @@ -4,7 +4,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2023_12_21_Time_43_ms_(72.03%)_Space_23_MB_(100.00%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_12_21_Time_43_ms_(72.03%)_Space_23_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0189_rotate_array/Solution.php b/src/main/php/g0101_0200/s0189_rotate_array/Solution.php index c905267c..350a5610 100644 --- a/src/main/php/g0101_0200/s0189_rotate_array/Solution.php +++ b/src/main/php/g0101_0200/s0189_rotate_array/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0101_0200\s0189_rotate_array; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2023_12_21_Time_60_ms_(67.03%)_Space_27.9_MB_(100.00%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2023_12_21_Time_60_ms_(67.03%)_Space_27.9_MB_(100.00%) class Solution { private function reverse(&$nums, $l, $r) { diff --git a/src/main/php/g0101_0200/s0198_house_robber/Solution.php b/src/main/php/g0101_0200/s0198_house_robber/Solution.php index 0aca9876..137bbd14 100644 --- a/src/main/php/g0101_0200/s0198_house_robber/Solution.php +++ b/src/main/php/g0101_0200/s0198_house_robber/Solution.php @@ -3,9 +3,9 @@ namespace leetcode\g0101_0200\s0198_house_robber; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2023_12_21_Time_4_ms_(64.29%)_Space_19.8_MB_(9.52%) +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_12_21_Time_4_ms_(64.29%)_Space_19.8_MB_(9.52%) class Solution { /** diff --git a/src/main/php/g0101_0200/s0200_number_of_islands/Solution.php b/src/main/php/g0101_0200/s0200_number_of_islands/Solution.php index 2a3b34b7..fbef217e 100644 --- a/src/main/php/g0101_0200/s0200_number_of_islands/Solution.php +++ b/src/main/php/g0101_0200/s0200_number_of_islands/Solution.php @@ -6,7 +6,8 @@ // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2023_12_21_Time_97_ms_(82.05%)_Space_35.3_MB_(100.00%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2023_12_21_Time_97_ms_(82.05%)_Space_35.3_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0201_0300/s0206_reverse_linked_list/Solution.php b/src/main/php/g0201_0300/s0206_reverse_linked_list/Solution.php index aaae7ea8..0255fea9 100644 --- a/src/main/php/g0201_0300/s0206_reverse_linked_list/Solution.php +++ b/src/main/php/g0201_0300/s0206_reverse_linked_list/Solution.php @@ -3,9 +3,9 @@ namespace leetcode\g0201_0300\s0206_reverse_linked_list; // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2023_12_21_Time_0_ms_(100.00%)_Space_20.4_MB_(87.88%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2023_12_21_Time_0_ms_(100.00%)_Space_20.4_MB_(87.88%) /** * Definition for a singly-linked list. diff --git a/src/main/php/g0201_0300/s0207_course_schedule/Solution.php b/src/main/php/g0201_0300/s0207_course_schedule/Solution.php index a80ba98c..896a41a5 100644 --- a/src/main/php/g0201_0300/s0207_course_schedule/Solution.php +++ b/src/main/php/g0201_0300/s0207_course_schedule/Solution.php @@ -3,8 +3,8 @@ namespace leetcode\g0201_0300\s0207_course_schedule; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2023_12_21_Time_25_ms_(89.29%)_Space_22.3_MB_(100.00%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2023_12_21_Time_25_ms_(89.29%)_Space_22.3_MB_(100.00%) class Solution { const WHITE = 0; diff --git a/src/main/php/g0201_0300/s0208_implement_trie_prefix_tree/Trie.php b/src/main/php/g0201_0300/s0208_implement_trie_prefix_tree/Trie.php index cee676b8..487dc0a7 100644 --- a/src/main/php/g0201_0300/s0208_implement_trie_prefix_tree/Trie.php +++ b/src/main/php/g0201_0300/s0208_implement_trie_prefix_tree/Trie.php @@ -3,7 +3,7 @@ namespace leetcode\g0201_0300\s0208_implement_trie_prefix_tree; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2023_12_21_Time_83_ms_(46.67%)_Space_52.1_MB_(6.67%) diff --git a/src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.php b/src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.php index 538fe7a7..9117799d 100644 --- a/src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.php +++ b/src/main/php/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.php @@ -3,7 +3,8 @@ namespace leetcode\g0201_0300\s0215_kth_largest_element_in_an_array; // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap // #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2023_12_21_Time_222_ms_(49.15%)_Space_29.8_MB_(100.00%) class Solution { diff --git a/src/main/php/g0201_0300/s0221_maximal_square/Solution.php b/src/main/php/g0201_0300/s0221_maximal_square/Solution.php index 42388c1d..2ef97b1a 100644 --- a/src/main/php/g0201_0300/s0221_maximal_square/Solution.php +++ b/src/main/php/g0201_0300/s0221_maximal_square/Solution.php @@ -2,8 +2,8 @@ namespace leetcode\g0201_0300\s0221_maximal_square; -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) +// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) // #2023_12_21_Time_209_ms_(83.33%)_Space_40.6_MB_(100.00%) class Solution { diff --git a/src/main/php/g0201_0300/s0226_invert_binary_tree/Solution.php b/src/main/php/g0201_0300/s0226_invert_binary_tree/Solution.php index c1ba745f..aa07dad3 100644 --- a/src/main/php/g0201_0300/s0226_invert_binary_tree/Solution.php +++ b/src/main/php/g0201_0300/s0226_invert_binary_tree/Solution.php @@ -4,7 +4,8 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2023_12_21_Time_6_ms_(62.79%)_Space_19.6_MB_(13.18%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2023_12_21_Time_6_ms_(62.79%)_Space_19.6_MB_(13.18%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.php b/src/main/php/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.php index 2ca6eb66..c4ac29c5 100644 --- a/src/main/php/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.php +++ b/src/main/php/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.php @@ -2,9 +2,10 @@ namespace leetcode\g0201_0300\s0230_kth_smallest_element_in_a_bst; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -// #Big_O_Time_O(n)_Space_O(n) #2023_12_23_Time_11_ms_(75.00%)_Space_22_MB_(96.88%) +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #2023_12_23_Time_11_ms_(75.00%)_Space_22_MB_(96.88%) /** * Definition for a binary tree node. diff --git a/src/main/php/g0201_0300/s0234_palindrome_linked_list/Solution.php b/src/main/php/g0201_0300/s0234_palindrome_linked_list/Solution.php index 9c50b199..5cd303e4 100644 --- a/src/main/php/g0201_0300/s0234_palindrome_linked_list/Solution.php +++ b/src/main/php/g0201_0300/s0234_palindrome_linked_list/Solution.php @@ -2,8 +2,8 @@ namespace leetcode\g0201_0300\s0234_palindrome_linked_list; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List -// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion +// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) // #2023_12_23_Time_123_ms_(95.45%)_Space_50.6_MB_(75.00%) /** diff --git a/src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.php b/src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.php index cd67968f..2abea070 100644 --- a/src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.php +++ b/src/main/php/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.php @@ -2,8 +2,9 @@ namespace leetcode\g0201_0300\s0236_lowest_common_ancestor_of_a_binary_tree; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) // #2023_12_23_Time_14_ms_(85.71%)_Space_26.1_MB_(57.14%) /** diff --git a/src/main/php/g0201_0300/s0238_product_of_array_except_self/Solution.php b/src/main/php/g0201_0300/s0238_product_of_array_except_self/Solution.php index 412e697e..21e8ab54 100644 --- a/src/main/php/g0201_0300/s0238_product_of_array_except_self/Solution.php +++ b/src/main/php/g0201_0300/s0238_product_of_array_except_self/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0201_0300\s0238_product_of_array_except_self; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum -// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) -// #2023_12_23_Time_58_ms_(86.76%)_Space_29.8_MB_(100.00%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2023_12_23_Time_58_ms_(86.76%)_Space_29.8_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0201_0300/s0239_sliding_window_maximum/Solution.php b/src/main/php/g0201_0300/s0239_sliding_window_maximum/Solution.php index 63c60dce..402c7c23 100644 --- a/src/main/php/g0201_0300/s0239_sliding_window_maximum/Solution.php +++ b/src/main/php/g0201_0300/s0239_sliding_window_maximum/Solution.php @@ -2,8 +2,8 @@ namespace leetcode\g0201_0300\s0239_sliding_window_maximum; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue -// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) +// #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) // #2023_12_23_Time_518_ms_(100.00%)_Space_32.9_MB_(100.00%) class Solution { diff --git a/src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.php b/src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.php index d1f75da7..22464dee 100644 --- a/src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.php +++ b/src/main/php/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0201_0300\s0240_search_a_2d_matrix_ii; -// #Medium #Top_100_Liked_Questions #Top_Interview_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) #2023_12_23_Time_47_ms_(95.24%)_Space_23.3_MB_(100.00%) +// #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) +// #2023_12_23_Time_47_ms_(95.24%)_Space_23.3_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0201_0300/s0283_move_zeroes/Solution.php b/src/main/php/g0201_0300/s0283_move_zeroes/Solution.php index 3fe4bfa9..888b72d4 100644 --- a/src/main/php/g0201_0300/s0283_move_zeroes/Solution.php +++ b/src/main/php/g0201_0300/s0283_move_zeroes/Solution.php @@ -2,7 +2,7 @@ namespace leetcode\g0201_0300\s0283_move_zeroes; -// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers // #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays // #Big_O_Time_O(n)_Space_O(1) #2023_12_23_Time_42_ms_(88.34%)_Space_21.2_MB_(67.71%) diff --git a/src/main/php/g0201_0300/s0287_find_the_duplicate_number/Solution.php b/src/main/php/g0201_0300/s0287_find_the_duplicate_number/Solution.php index b72d4f91..f5f97d6b 100644 --- a/src/main/php/g0201_0300/s0287_find_the_duplicate_number/Solution.php +++ b/src/main/php/g0201_0300/s0287_find_the_duplicate_number/Solution.php @@ -2,8 +2,8 @@ namespace leetcode\g0201_0300\s0287_find_the_duplicate_number; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers -// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation +// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) // #2023_12_23_Time_174_ms_(76.92%)_Space_26.8_MB_(100.00%) class Solution { diff --git a/src/main/php/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.php b/src/main/php/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.php index f47d41bd..5f0b9e7f 100644 --- a/src/main/php/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.php +++ b/src/main/php/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.php @@ -2,8 +2,8 @@ namespace leetcode\g0201_0300\s0295_find_median_from_data_stream; -// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design -// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) +// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) // #2023_12_23_Time_332_ms_(75.00%)_Space_49.3_MB_(75.00%) class MedianFinder { diff --git a/src/main/php/g0201_0300/s0300_longest_increasing_subsequence/Solution.php b/src/main/php/g0201_0300/s0300_longest_increasing_subsequence/Solution.php index b48b5ed5..e8135785 100644 --- a/src/main/php/g0201_0300/s0300_longest_increasing_subsequence/Solution.php +++ b/src/main/php/g0201_0300/s0300_longest_increasing_subsequence/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0201_0300\s0300_longest_increasing_subsequence; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 -// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search +// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) // #2023_12_23_Time_24_ms_(90.91%)_Space_19.9_MB_(18.18%) class Solution { diff --git a/src/main/php/g0301_0400/s0322_coin_change/Solution.php b/src/main/php/g0301_0400/s0322_coin_change/Solution.php index 5e370db3..e759291c 100644 --- a/src/main/php/g0301_0400/s0322_coin_change/Solution.php +++ b/src/main/php/g0301_0400/s0322_coin_change/Solution.php @@ -2,9 +2,9 @@ namespace leetcode\g0301_0400\s0322_coin_change; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search +// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) // #2023_12_24_Time_185_ms_(96.30%)_Space_19.4_MB_(62.96%) class Solution { diff --git a/src/main/php/g0301_0400/s0338_counting_bits/Solution.php b/src/main/php/g0301_0400/s0338_counting_bits/Solution.php index 323c56ad..e084d480 100644 --- a/src/main/php/g0301_0400/s0338_counting_bits/Solution.php +++ b/src/main/php/g0301_0400/s0338_counting_bits/Solution.php @@ -2,8 +2,9 @@ namespace leetcode\g0301_0400\s0338_counting_bits; -// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2023_12_24_Time_13_ms_(97.92%)_Space_24.8_MB_(97.92%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2023_12_24_Time_13_ms_(97.92%)_Space_24.8_MB_(97.92%) class Solution { /** diff --git a/src/main/php/g0301_0400/s0347_top_k_frequent_elements/Solution.php b/src/main/php/g0301_0400/s0347_top_k_frequent_elements/Solution.php index 5a3ab9f0..a64de089 100644 --- a/src/main/php/g0301_0400/s0347_top_k_frequent_elements/Solution.php +++ b/src/main/php/g0301_0400/s0347_top_k_frequent_elements/Solution.php @@ -2,10 +2,9 @@ namespace leetcode\g0301_0400\s0347_top_k_frequent_elements; -// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting -// #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort -// #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) -// #2023_12_24_Time_23_ms_(84.85%)_Space_21.6_MB_(100.00%) +// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting +// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Big_O_Time_O(n*log(n))_Space_O(k) #2023_12_24_Time_23_ms_(84.85%)_Space_21.6_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0301_0400/s0394_decode_string/Solution.php b/src/main/php/g0301_0400/s0394_decode_string/Solution.php index 3840f157..37f6d274 100644 --- a/src/main/php/g0301_0400/s0394_decode_string/Solution.php +++ b/src/main/php/g0301_0400/s0394_decode_string/Solution.php @@ -2,8 +2,9 @@ namespace leetcode\g0301_0400\s0394_decode_string; -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2023_12_24_Time_3_ms_(77.78%)_Space_19.7_MB_(11.11%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2023_12_24_Time_3_ms_(77.78%)_Space_19.7_MB_(11.11%) class Solution { private $i = 0; diff --git a/src/main/php/g0401_0500/s0437_path_sum_iii/Solution.php b/src/main/php/g0401_0500/s0437_path_sum_iii/Solution.php index 6685d77f..8bbe9e8a 100644 --- a/src/main/php/g0401_0500/s0437_path_sum_iii/Solution.php +++ b/src/main/php/g0401_0500/s0437_path_sum_iii/Solution.php @@ -2,7 +2,7 @@ namespace leetcode\g0401_0500\s0437_path_sum_iii; -// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree // #Big_O_Time_O(n)_Space_O(n) #2023_12_24_Time_11_ms_(100.00%)_Space_20.7_MB_(12.50%) /** diff --git a/src/main/php/g0401_0500/s0494_target_sum/Solution.php b/src/main/php/g0401_0500/s0494_target_sum/Solution.php index 0e3bbcb0..dedb129f 100644 --- a/src/main/php/g0401_0500/s0494_target_sum/Solution.php +++ b/src/main/php/g0401_0500/s0494_target_sum/Solution.php @@ -2,8 +2,7 @@ namespace leetcode\g0401_0500\s0494_target_sum; -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking -// #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) // #2023_12_24_Time_27_ms_(75.00%)_Space_20.3_MB_(8.33%) class Solution { diff --git a/src/main/php/g0601_0700/s0647_palindromic_substrings/Solution.php b/src/main/php/g0601_0700/s0647_palindromic_substrings/Solution.php index 9c66b8a6..4f8e6275 100644 --- a/src/main/php/g0601_0700/s0647_palindromic_substrings/Solution.php +++ b/src/main/php/g0601_0700/s0647_palindromic_substrings/Solution.php @@ -2,7 +2,7 @@ namespace leetcode\g0601_0700\s0647_palindromic_substrings; -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) // #2023_12_24_Time_25_ms_(75.00%)_Space_19.6_MB_(50.00%) class Solution { diff --git a/src/main/php/g0701_0800/s0739_daily_temperatures/Solution.php b/src/main/php/g0701_0800/s0739_daily_temperatures/Solution.php index cc1ec3e0..2c26e097 100644 --- a/src/main/php/g0701_0800/s0739_daily_temperatures/Solution.php +++ b/src/main/php/g0701_0800/s0739_daily_temperatures/Solution.php @@ -2,8 +2,9 @@ namespace leetcode\g0701_0800\s0739_daily_temperatures; -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2023_12_24_Time_410_ms_(100.00%)_Space_29.9_MB_(100.00%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2023_12_24_Time_410_ms_(100.00%)_Space_29.9_MB_(100.00%) class Solution { /** diff --git a/src/main/php/g0701_0800/s0763_partition_labels/Solution.php b/src/main/php/g0701_0800/s0763_partition_labels/Solution.php index 0ca580d8..ee880e63 100644 --- a/src/main/php/g0701_0800/s0763_partition_labels/Solution.php +++ b/src/main/php/g0701_0800/s0763_partition_labels/Solution.php @@ -2,9 +2,8 @@ namespace leetcode\g0701_0800\s0763_partition_labels; -// #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers -// #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) -// #2023_12_24_Time_5_ms_(83.33%)_Space_19.5_MB_(50.00%) +// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +// #Big_O_Time_O(n)_Space_O(1) #2023_12_24_Time_5_ms_(83.33%)_Space_19.5_MB_(50.00%) class Solution { /** diff --git a/src/main/php/g1101_1200/s1143_longest_common_subsequence/Solution.php b/src/main/php/g1101_1200/s1143_longest_common_subsequence/Solution.php index 9764af4f..2d652e9c 100644 --- a/src/main/php/g1101_1200/s1143_longest_common_subsequence/Solution.php +++ b/src/main/php/g1101_1200/s1143_longest_common_subsequence/Solution.php @@ -2,7 +2,7 @@ namespace leetcode\g1101_1200\s1143_longest_common_subsequence; -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2023_12_24_Time_191_ms_(96.00%)_Space_35.5_MB_(100.00%) diff --git a/src/main/python/g0001_0100/s0001_two_sum/Solution.py b/src/main/python/g0001_0100/s0001_two_sum/Solution.py index f6843fbf..031d9ab5 100644 --- a/src/main/python/g0001_0100/s0001_two_sum/Solution.py +++ b/src/main/python/g0001_0100/s0001_two_sum/Solution.py @@ -1,5 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) +# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +# #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task # #2024_06_06_Time_62_ms_(53.52%)_Space_17.8_MB_(37.79%) class Solution: diff --git a/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py b/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py index f96ac8ba..19c09d1e 100644 --- a/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py +++ b/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion # #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -# #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_06_06_Time_47_ms_(90.77%)_Space_16.6_MB_(83.79%) +# #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +# #AI_can_be_used_to_solve_the_task #2024_06_06_Time_47_ms_(90.77%)_Space_16.6_MB_(83.79%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py b/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py index 05159e70..b7bd174f 100644 --- a/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py +++ b/src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window # #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -# #Big_O_Time_O(n)_Space_O(1) #2024_06_06_Time_45_ms_(93.32%)_Space_16.6_MB_(53.05%) +# #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +# #2024_06_06_Time_45_ms_(93.32%)_Space_16.6_MB_(53.05%) class Solution: def lengthOfLongestSubstring(self, s: str) -> int: diff --git a/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py b/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py index dabed05b..f26b1722 100644 --- a/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py +++ b/src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py @@ -1,5 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -# #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_06_03_Time_63_ms_(99.35%)_Space_16.9_MB_(31.27%) +# #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +# #AI_can_be_used_to_solve_the_task #2024_06_03_Time_63_ms_(99.35%)_Space_16.9_MB_(31.27%) class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: diff --git a/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py b/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py index b58972c7..95d6814c 100644 --- a/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py +++ b/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming # #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -# #2024_06_03_Time_78_ms_(97.43%)_Space_16.7_MB_(47.93%) +# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +# #Big_O_Time_O(n)_Space_O(n) #2024_06_03_Time_78_ms_(97.43%)_Space_16.7_MB_(47.93%) class Solution: def longestPalindrome(self, s: str) -> str: diff --git a/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py b/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py index e1f35a0e..cebe0c71 100644 --- a/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py +++ b/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py @@ -1,4 +1,5 @@ -# #Medium #String #2024_06_03_Time_41_ms_(94.82%)_Space_16.5_MB_(92.96%) +# #Medium #String #Top_Interview_150_Array/String +# #2024_06_03_Time_41_ms_(94.82%)_Space_16.5_MB_(92.96%) class Solution: def convert(self, s: str, numRows: int) -> str: diff --git a/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py b/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py index d4d2b9b4..6b1b0729 100644 --- a/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py +++ b/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py @@ -1,4 +1,5 @@ -# #Easy #Math #Udemy_Integers #2024_06_03_Time_43_ms_(91.99%)_Space_16.5_MB_(58.90%) +# #Easy #Math #Udemy_Integers #Top_Interview_150_Math +# #2024_06_03_Time_43_ms_(91.99%)_Space_16.5_MB_(58.90%) class Solution: def isPalindrome(self, x: int) -> bool: diff --git a/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py b/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py index 16972141..50ce1ce7 100644 --- a/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py +++ b/src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -# #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -# #2024_06_04_Time_488_ms_(91.81%)_Space_29.5_MB_(60.76%) +# #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +# #Big_O_Time_O(n)_Space_O(1) #2024_06_04_Time_488_ms_(91.81%)_Space_29.5_MB_(60.76%) class Solution: def maxArea(self, height: List[int]) -> int: diff --git a/src/main/python/g0001_0100/s0015_3sum/Solution.py b/src/main/python/g0001_0100/s0015_3sum/Solution.py index 02c8ccdf..65a83d2d 100644 --- a/src/main/python/g0001_0100/s0015_3sum/Solution.py +++ b/src/main/python/g0001_0100/s0015_3sum/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers # #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -# #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_06_04_Time_683_ms_(63.27%)_Space_20.8_MB_(49.61%) +# #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +# #2024_06_04_Time_683_ms_(63.27%)_Space_20.8_MB_(49.61%) class Solution: def threeSum(self, nums: List[int]) -> List[List[int]]: diff --git a/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py b/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py index ed080358..14a24b52 100644 --- a/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py +++ b/src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -# #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(4^n)_Space_O(n) #2024_06_04_Time_28_ms_(91.85%)_Space_16.5_MB_(84.41%) +# #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +# #2024_06_04_Time_28_ms_(91.85%)_Space_16.5_MB_(84.41%) class Solution: def letterCombinations(self, digits: str) -> List[str]: diff --git a/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py b/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py index 8028f639..4f569f03b 100644 --- a/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py +++ b/src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -# #2024_06_04_Time_21_ms_(99.70%)_Space_16.4_MB_(86.23%) +# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(L)_Space_O(L) #2024_06_04_Time_21_ms_(99.70%)_Space_16.4_MB_(86.23%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py b/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py index 717019b8..f2e29186 100644 --- a/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py +++ b/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py @@ -1,6 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -# #2024_06_04_Time_24_ms_(98.16%)_Space_16.5_MB_(67.83%) +# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +# #Big_O_Time_O(n)_Space_O(n) #2024_06_04_Time_24_ms_(98.16%)_Space_16.5_MB_(67.83%) class Solution: def isValid(self, s): diff --git a/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py b/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py index b187b064..609c2780 100644 --- a/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py +++ b/src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py @@ -1,7 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion # #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -# #2024_06_04_Time_31_ms_(92.02%)_Space_16.5_MB_(51.91%) +# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(m+n)_Space_O(m+n) #2024_06_04_Time_31_ms_(92.02%)_Space_16.5_MB_(51.91%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py b/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py index 185ce345..f2d0fef8 100644 --- a/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py +++ b/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming # #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(2^n)_Space_O(n) #2024_06_04_Time_32_ms_(86.75%)_Space_16.8_MB_(83.99%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +# #2024_06_04_Time_32_ms_(86.75%)_Space_16.8_MB_(83.99%) class Solution: def generateParenthesis(self, n: int) -> List[str]: diff --git a/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py b/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py index b0a32e78..6cbc23a1 100644 --- a/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py +++ b/src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py @@ -1,6 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -# #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) -# #2024_06_04_Time_61_ms_(98.91%)_Space_19.9_MB_(34.38%) +# #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +# #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_06_04_Time_61_ms_(98.91%)_Space_19.9_MB_(34.38%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py b/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py index 7ef64d0c..782919fc 100644 --- a/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py +++ b/src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -# #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +# #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) # #2024_06_04_Time_36_ms_(90.51%)_Space_17.3_MB_(94.94%) # Definition for singly-linked list. diff --git a/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py b/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py index a483e573..f2997084 100644 --- a/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py +++ b/src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -# #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +# #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) # #2024_06_08_Time_36_ms_(91.71%)_Space_16.8_MB_(98.65%) class Solution: diff --git a/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py b/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py index 433733e2..60b7245b 100644 --- a/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py +++ b/src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -# #2024_06_08_Time_64_ms_(97.49%)_Space_17.8_MB_(39.66%) +# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +# #Big_O_Time_O(log_n)_Space_O(1) #2024_06_08_Time_64_ms_(97.49%)_Space_17.8_MB_(39.66%) class Solution: def searchRange(self, nums: List[int], target: int) -> List[int]: diff --git a/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py b/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py index ceb4cc02..61912fef 100644 --- a/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py +++ b/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py @@ -1,5 +1,5 @@ # #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -# #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +# #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) # #2024_06_08_Time_41_ms_(94.38%)_Space_17.4_MB_(43.81%) class Solution: diff --git a/src/main/python/g0001_0100/s0039_combination_sum/Solution.py b/src/main/python/g0001_0100/s0039_combination_sum/Solution.py index 35bd696d..08450251 100644 --- a/src/main/python/g0001_0100/s0039_combination_sum/Solution.py +++ b/src/main/python/g0001_0100/s0039_combination_sum/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking # #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_06_08_Time_42_ms_(94.56%)_Space_16.5_MB_(78.21%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +# #2024_06_08_Time_42_ms_(94.56%)_Space_16.5_MB_(78.21%) class Solution: def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: diff --git a/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py b/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py index 9ea93242..50f64c14 100644 --- a/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py +++ b/src/main/python/g0001_0100/s0042_trapping_rain_water/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_93_ms_(87.70%)_Space_18.5_MB_(68.72%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_06_08_Time_93_ms_(87.70%)_Space_18.5_MB_(68.72%) class Solution: def trap(self, height: List[int]) -> int: diff --git a/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py b/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py index 5802ae6a..d0495537 100644 --- a/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py +++ b/src/main/python/g0001_0100/s0045_jump_game_ii/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_89_ms_(99.30%)_Space_17.7_MB_(41.04%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_06_08_Time_89_ms_(99.30%)_Space_17.7_MB_(41.04%) class Solution: def jump(self, nums: List[int]) -> int: diff --git a/src/main/python/g0001_0100/s0046_permutations/Solution.py b/src/main/python/g0001_0100/s0046_permutations/Solution.py index 86578d74..a27fbf70 100644 --- a/src/main/python/g0001_0100/s0046_permutations/Solution.py +++ b/src/main/python/g0001_0100/s0046_permutations/Solution.py @@ -1,6 +1,6 @@ # #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!) +# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) # #2024_06_08_Time_28_ms_(98.67%)_Space_16.6_MB_(93.71%) class Solution: diff --git a/src/main/python/g0001_0100/s0048_rotate_image/Solution.py b/src/main/python/g0001_0100/s0048_rotate_image/Solution.py index 36e96c35..f3cb5c31 100644 --- a/src/main/python/g0001_0100/s0048_rotate_image/Solution.py +++ b/src/main/python/g0001_0100/s0048_rotate_image/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_26_ms_(98.93%)_Space_16.5_MB_(91.88%) +# #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +# #2024_06_08_Time_26_ms_(98.93%)_Space_16.5_MB_(91.88%) class Solution: def rotate(self, matrix: List[List[int]]) -> None: diff --git a/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py b/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py index 877b0ddd..3e1c0441 100644 --- a/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py +++ b/src/main/python/g0001_0100/s0049_group_anagrams/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_79_ms_(93.60%)_Space_19.6_MB_(76.55%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +# #2024_06_08_Time_79_ms_(93.60%)_Space_19.6_MB_(76.55%) from collections import defaultdict diff --git a/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py b/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py index 82753107..ab8afa34 100644 --- a/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py +++ b/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py @@ -1,6 +1,6 @@ # #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) +# #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) # #2024_06_08_Time_501_ms_(83.84%)_Space_30.7_MB_(91.05%) class Solution: diff --git a/src/main/python/g0001_0100/s0055_jump_game/Solution.py b/src/main/python/g0001_0100/s0055_jump_game/Solution.py index e1bcc2e7..005937ec 100644 --- a/src/main/python/g0001_0100/s0055_jump_game/Solution.py +++ b/src/main/python/g0001_0100/s0055_jump_game/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_333_ms_(97.58%)_Space_17.8_MB_(82.03%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_06_08_Time_333_ms_(97.58%)_Space_17.8_MB_(82.03%) class Solution: def canJump(self, nums: List[int]) -> bool: diff --git a/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py b/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py index fb5d1e89..88f8e281 100644 --- a/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py +++ b/src/main/python/g0001_0100/s0056_merge_intervals/Solution.py @@ -1,6 +1,7 @@ # #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) #2024_06_08_Time_109_ms_(98.07%)_Space_20.5_MB_(84.05%) +# #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +# #2024_06_08_Time_109_ms_(98.07%)_Space_20.5_MB_(84.05%) class Solution: def merge(self, intervals: List[List[int]]) -> List[List[int]]: diff --git a/src/main/python/g0001_0100/s0062_unique_paths/Solution.py b/src/main/python/g0001_0100/s0062_unique_paths/Solution.py index 8990d2ea..098592e9 100644 --- a/src/main/python/g0001_0100/s0062_unique_paths/Solution.py +++ b/src/main/python/g0001_0100/s0062_unique_paths/Solution.py @@ -1,7 +1,7 @@ # #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) -# #2024_06_08_Time_24_ms_(98.19%)_Space_16.4_MB_(78.68%) +# #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2024_06_08_Time_24_ms_(98.19%)_Space_16.4_MB_(78.68%) class Solution: def uniquePaths(self, m: int, n: int) -> int: diff --git a/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py b/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py index 6ed00886..6702f55c 100644 --- a/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py +++ b/src/main/python/g0001_0100/s0064_minimum_path_sum/Solution.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_08_Time_72_ms_(97.25%)_Space_18.2_MB_(74.63%) +# #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_08_Time_72_ms_(97.25%)_Space_18.2_MB_(74.63%) class Solution: def minPathSum(self, grid: List[List[int]]) -> int: diff --git a/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py b/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py index 2969d1a9..04caa166 100644 --- a/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py +++ b/src/main/python/g0001_0100/s0070_climbing_stairs/Solution.py @@ -1,7 +1,7 @@ # #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) -# #2024_06_08_Time_29_ms_(87.37%)_Space_16.4_MB_(74.67%) +# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_29_ms_(87.37%)_Space_16.4_MB_(74.67%) class Solution: def climbStairs(self, n: int) -> int: diff --git a/src/main/python/g0001_0100/s0072_edit_distance/Solution.py b/src/main/python/g0001_0100/s0072_edit_distance/Solution.py index a81e3fec..defb4cf4 100644 --- a/src/main/python/g0001_0100/s0072_edit_distance/Solution.py +++ b/src/main/python/g0001_0100/s0072_edit_distance/Solution.py @@ -1,6 +1,6 @@ -# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -# #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +# #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) # #2024_06_08_Time_60_ms_(98.17%)_Space_18.5_MB_(81.62%) class Solution: diff --git a/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py b/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py index 5eaaa752..21a44408 100644 --- a/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py +++ b/src/main/python/g0001_0100/s0073_set_matrix_zeroes/Solution.py @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) # #2024_06_09_Time_93_ms_(94.48%)_Space_17.4_MB_(67.69%) class Solution: diff --git a/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py b/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py index caa6f2aa..11a10212 100644 --- a/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py +++ b/src/main/python/g0001_0100/s0074_search_a_2d_matrix/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) # #2024_06_09_Time_35_ms_(97.66%)_Space_17_MB_(69.27%) class Solution: diff --git a/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py b/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py index 06bf1304..05471e49 100644 --- a/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py +++ b/src/main/python/g0001_0100/s0076_minimum_window_substring/Solution.py @@ -1,6 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -# #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -# #2024_06_09_Time_92_ms_(92.59%)_Space_17.1_MB_(93.76%) +# #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +# #Big_O_Time_O(s.length())_Space_O(1) #2024_06_09_Time_92_ms_(92.59%)_Space_17.1_MB_(93.76%) class Solution: def minWindow(self, s: str, t: str) -> str: diff --git a/src/main/python/g0001_0100/s0079_word_search/Solution.py b/src/main/python/g0001_0100/s0079_word_search/Solution.py index eeb01970..615b75e9 100644 --- a/src/main/python/g0001_0100/s0079_word_search/Solution.py +++ b/src/main/python/g0001_0100/s0079_word_search/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -# #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -# #2024_06_09_Time_619_ms_(95.31%)_Space_16.6_MB_(20.49%) +# #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_06_09_Time_619_ms_(95.31%)_Space_16.6_MB_(20.49%) class Solution: def exist(self, board: List[List[str]], word: str) -> bool: @@ -45,4 +45,3 @@ def rec(i, j, k, visited): if elem == word[0] and rec(i, j, 1, {(i, j)}): return True return False - diff --git a/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py b/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py index 539633a5..4497ad1a 100644 --- a/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py +++ b/src/main/python/g0001_0100/s0098_validate_binary_search_tree/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree # #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -# #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +# #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) # #2024_06_09_Time_38_ms_(77.48%)_Space_18.3_MB_(75.64%) # Definition for a binary tree node. diff --git a/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py b/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py index 532c5ce9..d3a0e151 100644 --- a/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py +++ b/src/main/python/g0101_0200/s0101_symmetric_tree/Solution.py @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search # #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -# #Big_O_Time_O(N)_Space_O(log(N)) #2024_06_09_Time_35_ms_(71.46%)_Space_16.6_MB_(14.05%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +# #2024_06_09_Time_35_ms_(71.46%)_Space_16.6_MB_(14.05%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py b/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py index 8e4ae74d..8f31470c 100644 --- a/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py +++ b/src/main/python/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree # #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_31_ms_(95.63%)_Space_17.2_MB_(85.23%) +# #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +# #2024_06_09_Time_31_ms_(95.63%)_Space_17.2_MB_(85.23%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py b/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py index 5c9b8e4d..c9156042 100644 --- a/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py +++ b/src/main/python/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.py @@ -1,7 +1,8 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -# #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +# #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree # #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(N)_Space_O(H) #2024_06_09_Time_35_ms_(85.47%)_Space_17.6_MB_(77.94%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +# #2024_06_09_Time_35_ms_(85.47%)_Space_17.6_MB_(77.94%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py b/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py index 42b43dec..d1549d71 100644 --- a/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py +++ b/src/main/python/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -# #2024_06_09_Time_45_ms_(96.51%)_Space_18.1_MB_(90.27%) +# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_45_ms_(96.51%)_Space_18.1_MB_(90.27%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py b/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py index 461f1c29..9202dd55 100644 --- a/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py +++ b/src/main/python/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.py @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -# #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +# #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) # #2024_06_09_Time_24_ms_(99.54%)_Space_16.7_MB_(86.32%) # Definition for a binary tree node. diff --git a/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py b/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py index 1782e34a..1a1aa65b 100644 --- a/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py +++ b/src/main/python/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.py @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming # #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_666_ms_(98.09%)_Space_27.5_MB_(28.45%) +# #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +# #2024_06_09_Time_666_ms_(98.09%)_Space_27.5_MB_(28.45%) class Solution: def maxProfit(self, prices: List[int]) -> int: diff --git a/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py b/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py index 318a984c..214f9563 100644 --- a/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py +++ b/src/main/python/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.py @@ -1,6 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -# #2024_06_09_Time_57_ms_(86.71%)_Space_20.9_MB_(40.96%) +# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_57_ms_(86.71%)_Space_20.9_MB_(40.96%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py b/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py index e329a9e2..a3b0886e 100644 --- a/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py +++ b/src/main/python/g0101_0200/s0128_longest_consecutive_sequence/Solution.py @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -# #Big_O_Time_O(N_log_N)_Space_O(1) #2024_06_09_Time_338_ms_(82.56%)_Space_31.7_MB_(88.80%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +# #2024_06_09_Time_338_ms_(82.56%)_Space_31.7_MB_(88.80%) class Solution: def longestConsecutive(self, nums: List[int]) -> int: diff --git a/src/main/python/g0101_0200/s0136_single_number/Solution.py b/src/main/python/g0101_0200/s0136_single_number/Solution.py index 5e790fa1..0e99104e 100644 --- a/src/main/python/g0101_0200/s0136_single_number/Solution.py +++ b/src/main/python/g0101_0200/s0136_single_number/Solution.py @@ -1,5 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -# #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +# #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +# #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation # #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_98_ms_(96.80%)_Space_19_MB_(89.40%) class Solution: diff --git a/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py b/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py index 69017c53..37c444d2 100644 --- a/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py +++ b/src/main/python/g0101_0200/s0138_copy_list_with_random_pointer/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -# #2024_06_09_Time_36_ms_(72.10%)_Space_17.3_MB_(95.85%) +# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_36_ms_(72.10%)_Space_17.3_MB_(95.85%) """ # Definition for a Node. diff --git a/src/main/python/g0101_0200/s0139_word_break/Solution.py b/src/main/python/g0101_0200/s0139_word_break/Solution.py index e99360fc..d210e146 100644 --- a/src/main/python/g0101_0200/s0139_word_break/Solution.py +++ b/src/main/python/g0101_0200/s0139_word_break/Solution.py @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table # #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -# #2024_06_09_Time_41_ms_(50.55%)_Space_16.6_MB_(88.23%) +# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_06_09_Time_41_ms_(50.55%)_Space_16.6_MB_(88.23%) class Solution: def wordBreak(self, s: str, wordDict: List[str]) -> bool: diff --git a/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py b/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py index bf92f4ba..a27307fe 100644 --- a/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py +++ b/src/main/python/g0101_0200/s0141_linked_list_cycle/Solution.py @@ -1,6 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -# #2024_06_09_Time_49_ms_(30.79%)_Space_19.1_MB_(64.48%) +# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_49_ms_(30.79%)_Space_19.1_MB_(64.48%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py b/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py index fb15a8d8..54c78c0b 100644 --- a/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py +++ b/src/main/python/g0101_0200/s0146_lru_cache/LRUCache.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -# #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -# #2024_06_09_Time_539_ms_(82.07%)_Space_77.8_MB_(60.68%) +# #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(1)_Space_O(capacity) #2024_06_09_Time_539_ms_(82.07%)_Space_77.8_MB_(60.68%) class LRUCacheNode: def __init__(self, key, value): diff --git a/src/main/python/g0101_0200/s0148_sort_list/Solution.py b/src/main/python/g0101_0200/s0148_sort_list/Solution.py index 1664b9b5..0f0af7e6 100644 --- a/src/main/python/g0101_0200/s0148_sort_list/Solution.py +++ b/src/main/python/g0101_0200/s0148_sort_list/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -# #2024_06_09_Time_285_ms_(57.68%)_Space_32.2_MB_(98.97%) +# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +# #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_06_09_Time_285_ms_(57.68%)_Space_32.2_MB_(98.97%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py b/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py index 8f2a2835..3ef5b372 100644 --- a/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py +++ b/src/main/python/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -# #2024_06_09_Time_44_ms_(47.26%)_Space_16.7_MB_(93.20%) +# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +# #Big_O_Time_O(log_N)_Space_O(log_N) #2024_06_09_Time_44_ms_(47.26%)_Space_16.7_MB_(93.20%) class Solution: def findMinUtil(self, nums: List[int], l: int, r: int) -> int: diff --git a/src/main/python/g0101_0200/s0155_min_stack/MinStack.py b/src/main/python/g0101_0200/s0155_min_stack/MinStack.py index 7540c89c..9ee8ec9a 100644 --- a/src/main/python/g0101_0200/s0155_min_stack/MinStack.py +++ b/src/main/python/g0101_0200/s0155_min_stack/MinStack.py @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design # #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -# #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2024_06_09_Time_58_ms_(38.23%)_Space_21_MB_(7.40%) +# #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +# #2024_06_09_Time_58_ms_(38.23%)_Space_21_MB_(7.40%) class MinStack: class Node: diff --git a/src/main/python/g0101_0200/s0169_majority_element/Solution.py b/src/main/python/g0101_0200/s0169_majority_element/Solution.py index b2ec09ef..ddd029a1 100644 --- a/src/main/python/g0101_0200/s0169_majority_element/Solution.py +++ b/src/main/python/g0101_0200/s0169_majority_element/Solution.py @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting # #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -# #Big_O_Time_O(n)_Space_O(1) #2024_06_09_Time_170_ms_(59.75%)_Space_18_MB_(27.19%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_06_09_Time_170_ms_(59.75%)_Space_18_MB_(27.19%) class Solution: def majorityElement(self, nums: List[int]) -> int: diff --git a/src/main/python/g0101_0200/s0189_rotate_array/Solution.py b/src/main/python/g0101_0200/s0189_rotate_array/Solution.py index 0017669e..1922fcbe 100644 --- a/src/main/python/g0101_0200/s0189_rotate_array/Solution.py +++ b/src/main/python/g0101_0200/s0189_rotate_array/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -# #2024_06_09_Time_150_ms_(86.92%)_Space_28_MB_(28.67%) +# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +# #Big_O_Time_O(n)_Space_O(1) #2024_06_09_Time_150_ms_(86.92%)_Space_28_MB_(28.67%) class Solution: def rotate(self, nums: List[int], k: int) -> None: diff --git a/src/main/python/g0101_0200/s0198_house_robber/Solution.py b/src/main/python/g0101_0200/s0198_house_robber/Solution.py index 10b0196c..1ebbba64 100644 --- a/src/main/python/g0101_0200/s0198_house_robber/Solution.py +++ b/src/main/python/g0101_0200/s0198_house_robber/Solution.py @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -# #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -# #2024_06_09_Time_34_ms_(72.11%)_Space_16.5_MB_(81.74%) +# #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(n)_Space_O(n) #2024_06_09_Time_34_ms_(72.11%)_Space_16.5_MB_(81.74%) class Solution: def rob(self, nums: List[int]) -> int: diff --git a/src/main/python/g0101_0200/s0198_house_robber/readme.md b/src/main/python/g0101_0200/s0198_house_robber/readme.md index 4a93a57f..33ec39bd 100644 --- a/src/main/python/g0101_0200/s0198_house_robber/readme.md +++ b/src/main/python/g0101_0200/s0198_house_robber/readme.md @@ -31,4 +31,40 @@ Given an integer array `nums` representing the amount of money of each house, re **Constraints:** * `1 <= nums.length <= 100` -* `0 <= nums[i] <= 400` \ No newline at end of file +* `0 <= nums[i] <= 400` + +To solve the House Robber problem, we can utilize dynamic programming to find the maximum amount of money we can rob without alerting the police. Here's how we can approach this problem: + +1. **Initialize Variables**: + - Initialize two variables, `prev_max` and `curr_max`, to keep track of the maximum amount of money robbed from previous houses and the current house, respectively. + +2. **Iterate Through Houses**: + - Iterate through the array of house values `nums`. + +3. **Calculate Maximum Amount of Money Robbed**: + - For each house, update `curr_max` to the maximum value between the sum of the value of the current house and `prev_max`, and `prev_max`. + +4. **Return Result**: + - After iterating through all houses, return `curr_max`, which represents the maximum amount of money that can be robbed without alerting the police. + +Let's implement this approach: + +```python +class Solution: + def rob(self, nums: List[int]) -> int: + if not nums: + return 0 + if len(nums) == 1: + return nums[0] + + prev_max = curr_max = 0 + + for num in nums: + temp = curr_max + curr_max = max(prev_max + num, curr_max) + prev_max = temp + + return curr_max +``` + +This solution ensures that we calculate the maximum amount of money that can be robbed without alerting the police in linear time complexity O(n) and constant space complexity O(1), meeting the problem constraints. \ No newline at end of file diff --git a/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py b/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py index c1047cfb..7b2a42ae 100644 --- a/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py +++ b/src/main/python/g0101_0200/s0200_number_of_islands/Solution.py @@ -2,7 +2,8 @@ # #Breadth_First_Search #Matrix #Union_Find # #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search # #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -# #Big_O_Time_O(M*N)_Space_O(M*N) #2024_06_09_Time_224_ms_(88.18%)_Space_18.7_MB_(96.10%) +# #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +# #2024_06_09_Time_224_ms_(88.18%)_Space_18.7_MB_(96.10%) class Solution: def numIslands(self, grid: List[List[str]]) -> int: diff --git a/src/main/python/g0101_0200/s0200_number_of_islands/readme.md b/src/main/python/g0101_0200/s0200_number_of_islands/readme.md index 0c4292d5..3c5895da 100644 --- a/src/main/python/g0101_0200/s0200_number_of_islands/readme.md +++ b/src/main/python/g0101_0200/s0200_number_of_islands/readme.md @@ -37,4 +37,53 @@ An **island** is surrounded by water and is formed by connecting adjacent lands * `m == grid.length` * `n == grid[i].length` * `1 <= m, n <= 300` -* `grid[i][j]` is `'0'` or `'1'`. \ No newline at end of file +* `grid[i][j]` is `'0'` or `'1'`. + +To solve the Number of Islands problem, we can utilize Depth-First Search (DFS) to traverse the grid and identify the islands. Here's a step-by-step approach to solve this problem: + +1. **Define DFS Function**: + - Define a DFS function to traverse the grid recursively. + - This function will mark visited cells as `'0'` to avoid revisiting them. + - It will explore adjacent cells (up, down, left, right) and continue DFS traversal if the adjacent cell is land (`'1'`). + +2. **Iterate Through Grid**: + - Iterate through each cell in the grid. + +3. **Count Islands**: + - For each cell with land (`'1'`), call the DFS function to explore the island. + - Increment the count of islands by 1 after each DFS traversal. + +4. **Return Count**: + - After traversing the entire grid, return the count of islands. + +Let's implement this approach: + +```python +class Solution: + def numIslands(self, grid: List[List[str]]) -> int: + def dfs(grid, i, j): + if i < 0 or i >= len(grid) or j < 0 or j >= len(grid[0]) or grid[i][j] == '0': + return + grid[i][j] = '0' # Mark the current cell as visited + # Explore adjacent cells + dfs(grid, i+1, j) + dfs(grid, i-1, j) + dfs(grid, i, j+1) + dfs(grid, i, j-1) + + if not grid: + return 0 + + num_islands = 0 + rows, cols = len(grid), len(grid[0]) + + for i in range(rows): + for j in range(cols): + if grid[i][j] == '1': + num_islands += 1 + dfs(grid, i, j) + + return num_islands +``` + +This solution efficiently counts the number of islands in the given grid by performing DFS traversal on each unvisited land cell. It has a time complexity of O(M * N), where M is the number of rows and N is the number of columns in the grid. \ No newline at end of file diff --git a/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py b/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py index f21e55b0..1e7a80f6 100644 --- a/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py +++ b/src/main/python/g0201_0300/s0206_reverse_linked_list/Solution.py @@ -1,7 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -# #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -# #2024_06_09_Time_35_ms_(72.56%)_Space_17.6_MB_(68.68%) +# #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +# #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_35_ms_(72.56%)_Space_17.6_MB_(68.68%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0201_0300/s0206_reverse_linked_list/readme.md b/src/main/python/g0201_0300/s0206_reverse_linked_list/readme.md index a764d550..3c5ffa7d 100644 --- a/src/main/python/g0201_0300/s0206_reverse_linked_list/readme.md +++ b/src/main/python/g0201_0300/s0206_reverse_linked_list/readme.md @@ -31,4 +31,48 @@ Given the `head` of a singly linked list, reverse the list, and return _the reve * The number of nodes in the list is the range `[0, 5000]`. * `-5000 <= Node.val <= 5000` -**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both? \ No newline at end of file +**Follow up:** A linked list can be reversed either iteratively or recursively. Could you implement both? + +To solve the Reverse Linked List problem, we can either use an iterative approach or a recursive approach. Here are the steps for both approaches: + +### Iterative Approach: +1. **Initialize Pointers**: Initialize three pointers, `prev`, `curr`, and `next`. +2. **Iterate Through List**: Iterate through the list until `curr` is not `None`. + - Update `next` to `curr.next`. + - Reverse the `curr` node's pointer to point to `prev` instead of `next`. + - Move `prev` to `curr` and `curr` to `next`. +3. **Return Head**: Return `prev` as the new head of the reversed list. + +### Recursive Approach: +1. **Define Recursive Function**: Define a recursive function that takes a node as input. +2. **Base Case**: If the input node or its next node is `None`, return the node itself. +3. **Recursive Call**: Recursively call the function on the next node. +4. **Reverse Pointers**: Reverse the pointers of the current node and its next node. +5. **Return Head**: Return the new head of the reversed list. + +Let's implement both approaches: + +```python +class Solution: + def reverseListIterative(self, head: ListNode) -> ListNode: + prev, curr = None, head + while curr: + next_node = curr.next + curr.next = prev + prev = curr + curr = next_node + return prev + + def reverseListRecursive(self, head: ListNode) -> ListNode: + def reverse(node): + if not node or not node.next: + return node + new_head = reverse(node.next) + node.next.next = node + node.next = None + return new_head + + return reverse(head) +``` + +These solutions will efficiently reverse the linked list either iteratively or recursively, meeting the problem constraints. The time complexity for both approaches is O(n), where n is the number of nodes in the linked list. \ No newline at end of file diff --git a/src/main/python/g0201_0300/s0207_course_schedule/Solution.py b/src/main/python/g0201_0300/s0207_course_schedule/Solution.py index 91afb545..0fd6b068 100644 --- a/src/main/python/g0201_0300/s0207_course_schedule/Solution.py +++ b/src/main/python/g0201_0300/s0207_course_schedule/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -# #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -# #2024_06_09_Time_86_ms_(76.64%)_Space_18.4_MB_(48.61%) +# #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +# #Big_O_Time_O(N)_Space_O(N) #2024_06_09_Time_86_ms_(76.64%)_Space_18.4_MB_(48.61%) class Solution: WHITE = 0 diff --git a/src/main/python/g0201_0300/s0207_course_schedule/readme.md b/src/main/python/g0201_0300/s0207_course_schedule/readme.md index a7b1e9c7..6a6f82b3 100644 --- a/src/main/python/g0201_0300/s0207_course_schedule/readme.md +++ b/src/main/python/g0201_0300/s0207_course_schedule/readme.md @@ -30,4 +30,81 @@ Return `true` if you can finish all courses. Otherwise, return `false`. * `0 <= prerequisites.length <= 5000` * `prerequisites[i].length == 2` * 0 <= ai, bi < numCourses -* All the pairs prerequisites[i] are **unique**. \ No newline at end of file +* All the pairs prerequisites[i] are **unique**. + +To solve the Course Schedule problem, we can use a graph-based approach with topological sorting. We'll represent the courses and their prerequisites as a directed graph, and then perform a topological sort to determine if there exists any cycle in the graph. If there is a cycle, it means there is a dependency loop, and it won't be possible to complete all courses. + +### Steps: + +1. **Build the Graph**: + - Create an adjacency list to represent the directed graph. + - Iterate through the `prerequisites` array and add edges to the graph. + +2. **Perform Topological Sorting**: + - Implement a function for topological sorting, which can be done using Depth-First Search (DFS) or Breadth-First Search (BFS). + - In each approach, keep track of the visited nodes and the current path. + - If during DFS, we encounter a node that is already in the current path, it indicates a cycle, and we return False. + - If the sorting completes without finding a cycle, return True. + +3. **Check for Cycle**: + - If any node has a cycle in its path, return False. + +4. **Return Result**: + - If no cycle is found, return True, indicating it's possible to finish all courses. + +### Implementation: + +```python +from collections import defaultdict + +class Solution: + def canFinish(self, numCourses: int, prerequisites: List[List[int]]) -> bool: + # Build the graph + graph = defaultdict(list) + for course, prereq in prerequisites: + graph[course].append(prereq) + + # Function for topological sorting using DFS + def dfs(course, visited, path): + if course in path: + return False # Cycle detected + if visited[course]: + return True # Already visited + visited[course] = True + path.add(course) + for neighbor in graph[course]: + if not dfs(neighbor, visited, path): + return False + path.remove(course) + return True + + # Perform topological sorting for each course + for course in range(numCourses): + visited = [False] * numCourses + path = set() + if not dfs(course, visited, path): + return False + + return True +``` + +### Explanation: + +1. **Build the Graph**: + - We use a defaultdict to create an adjacency list representation of the directed graph. + - We iterate through the `prerequisites` array and add edges to the graph. + +2. **Perform Topological Sorting**: + - We implement a function `dfs` for topological sorting using Depth-First Search (DFS). + - We keep track of visited nodes and the current path to detect cycles. + - If we encounter a node that is already in the current path, it indicates a cycle, and we return False. + - Otherwise, if DFS completes without finding a cycle, we return True. + +3. **Check for Cycle**: + - We iterate through each course and perform topological sorting. + - If any node has a cycle in its path, we return False. + +4. **Return Result**: + - If no cycle is found, we return True, indicating it's possible to finish all courses. + +This solution has a time complexity of O(V + E), where V is the number of courses and E is the number of prerequisites. The space complexity is O(V + E) for storing the graph. \ No newline at end of file diff --git a/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py b/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py index f63438e4..b383678a 100644 --- a/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py +++ b/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/Trie.py @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -# #Level_2_Day_16_Design #Udemy_Trie_and_Heap +# #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie # #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) # #2024_06_09_Time_140_ms_(28.87%)_Space_33.8_MB_(16.61%) diff --git a/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/readme.md b/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/readme.md index 8121de31..35f2fbfc 100644 --- a/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/readme.md +++ b/src/main/python/g0201_0300/s0208_implement_trie_prefix_tree/readme.md @@ -33,4 +33,82 @@ Implement the Trie class: * `1 <= word.length, prefix.length <= 2000` * `word` and `prefix` consist only of lowercase English letters. -* At most 3 * 104 calls **in total** will be made to `insert`, `search`, and `startsWith`. \ No newline at end of file +* At most 3 * 104 calls **in total** will be made to `insert`, `search`, and `startsWith`. + +To solve the task, here are the steps for implementing the Trie (Prefix Tree) problem: + +1. **Define the TrieNode Class**: + - Define a class named `TrieNode` to represent each node in the trie. + - Each node will have a dictionary to store child nodes, indicating possible characters that can follow the current node. + - Additionally, each node will have a boolean flag to mark whether it represents the end of a word. + +2. **Initialize the Trie Class**: + - Implement the `__init__` method for the Trie class to initialize an empty trie with a root node. + +3. **Implement the Insert Method**: + - Implement the `insert` method to insert a word into the trie. + - Start from the root node and iterate through each character in the word. + - Check if the character exists as a child of the current node. If not, create a new node for it. + - Move to the child node and repeat the process for the next character. + - After processing all characters, mark the last node as the end of the word. + +4. **Implement the Search Method**: + - Implement the `search` method to check if a word exists in the trie. + - Start from the root node and iterate through each character in the word. + - If at any point, a character is not found as a child of the current node, return False. + - If all characters are found and the last node is marked as the end of a word, return True. + +5. **Implement the StartsWith Method**: + - Implement the `startsWith` method to check if there is any word in the trie that starts with a given prefix. + - Follow a similar process as the search method, but return True as soon as all characters of the prefix are found, regardless of whether it forms a complete word. + +6. **Return Results**: + - After implementing all methods, create an instance of the Trie class and perform the required operations according to the given input. + +Here's a Python implementation: + +```python +class TrieNode: + def __init__(self): + self.children = {} + self.is_end_of_word = False + +class Trie: + def __init__(self): + self.root = TrieNode() + + def insert(self, word: str) -> None: + node = self.root + for char in word: + if char not in node.children: + node.children[char] = TrieNode() + node = node.children[char] + node.is_end_of_word = True + + def search(self, word: str) -> bool: + node = self.root + for char in word: + if char not in node.children: + return False + node = node.children[char] + return node.is_end_of_word + + def startsWith(self, prefix: str) -> bool: + node = self.root + for char in prefix: + if char not in node.children: + return False + node = node.children[char] + return True + +# Example Usage +trie = Trie() +trie.insert("apple") +print(trie.search("apple")) # Output: True +print(trie.search("app")) # Output: False +print(trie.startsWith("app")) # Output: True +trie.insert("app") +print(trie.search("app")) # Output: True +``` + +This solution efficiently implements the Trie data structure and satisfies the requirements of the problem. \ No newline at end of file diff --git a/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py b/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py index 30092d03..126c9ec6 100644 --- a/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py +++ b/src/main/python/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.py @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -# #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +# #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +# #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap # #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_06_09_Time_446_ms_(79.92%)_Space_29.9_MB_(52.14%) class Solution: diff --git a/src/main/python/g0201_0300/s0221_maximal_square/Solution.py b/src/main/python/g0201_0300/s0221_maximal_square/Solution.py index 6c7f2d73..653f7519 100644 --- a/src/main/python/g0201_0300/s0221_maximal_square/Solution.py +++ b/src/main/python/g0201_0300/s0221_maximal_square/Solution.py @@ -1,5 +1,6 @@ # #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 -# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_09_Time_510_ms_(82.54%)_Space_19.3_MB_(68.21%) +# #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +# #2024_06_09_Time_510_ms_(82.54%)_Space_19.3_MB_(68.21%) class Solution: def maximalSquare(self, matrix: List[List[str]]) -> int: diff --git a/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py b/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py index be9fb28f..b8d5f0a2 100644 --- a/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py +++ b/src/main/python/g0201_0300/s0226_invert_binary_tree/Solution.py @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree # #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(n)_Space_O(n) #2024_06_09_Time_30_ms_(87.85%)_Space_16.5_MB_(77.12%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +# #2024_06_09_Time_30_ms_(87.85%)_Space_16.5_MB_(77.12%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py b/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py index 39d58e27..7929636a 100644 --- a/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py +++ b/src/main/python/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.py @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree -# #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +# #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +# #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) # #2024_06_09_Time_44_ms_(61.91%)_Space_19.4_MB_(88.66%) # Definition for a binary tree node. diff --git a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py index d2f5b526..307fc929 100644 --- a/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py +++ b/src/main/python/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.py @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -# #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +# #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) # #2024_06_09_Time_43_ms_(89.34%)_Space_21_MB_(44.04%) # Definition for a binary tree node. diff --git a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py index 6b247544..73c200e5 100644 --- a/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py +++ b/src/main/python/g0201_0300/s0238_product_of_array_except_self/Solution.py @@ -1,4 +1,5 @@ -# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays +# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +# #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String # #Big_O_Time_O(n^2)_Space_O(n) #2024_06_09_Time_241_ms_(99.65%)_Space_25.5_MB_(94.18%) class Solution: diff --git a/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py b/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py index ebac75e8..35719285 100644 --- a/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py +++ b/src/main/python/g0201_0300/s0283_move_zeroes/Solution.py @@ -1,6 +1,6 @@ -# #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) -# #2024_06_08_Time_113_ms_(97.70%)_Space_17.8_MB_(99.81%) +# #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +# #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +# #Big_O_Time_O(n)_Space_O(1) #2024_06_08_Time_113_ms_(97.70%)_Space_17.8_MB_(99.81%) class Solution: def moveZeroes(self, nums: List[int]) -> None: diff --git a/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py b/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py index f2b85fb2..2f74857a 100644 --- a/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py +++ b/src/main/python/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.py @@ -1,5 +1,6 @@ # #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream -# #Big_O_Time_O(n*log_n)_Space_O(n) #2024_06_08_Time_351_ms_(89.30%)_Space_38.5_MB_(42.35%) +# #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +# #2024_06_08_Time_351_ms_(89.30%)_Space_38.5_MB_(42.35%) import heapq diff --git a/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py b/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py index 5c354a0d..a6fac829 100644 --- a/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py +++ b/src/main/python/g0201_0300/s0300_longest_increasing_subsequence/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search # #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 -# #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +# #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) # #2024_06_08_Time_58_ms_(96.98%)_Space_16.9_MB_(78.92%) import bisect diff --git a/src/main/python/g0301_0400/s0322_coin_change/Solution.py b/src/main/python/g0301_0400/s0322_coin_change/Solution.py index b4655bea..9057c398 100644 --- a/src/main/python/g0301_0400/s0322_coin_change/Solution.py +++ b/src/main/python/g0301_0400/s0322_coin_change/Solution.py @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -# #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +# #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) # #2024_06_08_Time_488_ms_(96.38%)_Space_16.9_MB_(86.07%) class Solution: diff --git a/src/main/python/g0301_0400/s0338_counting_bits/Solution.py b/src/main/python/g0301_0400/s0338_counting_bits/Solution.py index 32040c45..5fc577ec 100644 --- a/src/main/python/g0301_0400/s0338_counting_bits/Solution.py +++ b/src/main/python/g0301_0400/s0338_counting_bits/Solution.py @@ -1,5 +1,6 @@ -# #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -# #Big_O_Time_O(num)_Space_O(num) #2024_06_08_Time_55_ms_(88.80%)_Space_23_MB_(95.35%) +# #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +# #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +# #2024_06_08_Time_55_ms_(88.80%)_Space_23_MB_(95.35%) class Solution: def countBits(self, num: int) -> List[int]: diff --git a/src/main/python/g0301_0400/s0394_decode_string/Solution.py b/src/main/python/g0301_0400/s0394_decode_string/Solution.py index 7980d11b..b11a67bd 100644 --- a/src/main/python/g0301_0400/s0394_decode_string/Solution.py +++ b/src/main/python/g0301_0400/s0394_decode_string/Solution.py @@ -1,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_28_ms_(91.14%)_Space_16.5_MB_(41.29%) +# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +# #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +# #2024_06_08_Time_28_ms_(91.14%)_Space_16.5_MB_(41.29%) class Solution: def __init__(self): diff --git a/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py b/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py index 265e46c0..8bb9b197 100644 --- a/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py +++ b/src/main/python/g0401_0500/s0437_path_sum_iii/Solution.py @@ -1,5 +1,5 @@ -# #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -# #2024_06_07_Time_264_ms_(30.25%)_Space_16.8_MB_(98.67%) +# #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +# #Big_O_Time_O(n)_Space_O(n) #2024_06_07_Time_264_ms_(30.25%)_Space_16.8_MB_(98.67%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py b/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py index a0059efb..9e17cae3 100644 --- a/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py +++ b/src/main/python/g0701_0800/s0739_daily_temperatures/Solution.py @@ -1,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -# #Big_O_Time_O(n)_Space_O(n) #2024_06_07_Time_864_ms_(87.84%)_Space_30.8_MB_(64.29%) +# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +# #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +# #2024_06_07_Time_864_ms_(87.84%)_Space_30.8_MB_(64.29%) class Solution: def dailyTemperatures(self, temperatures: List[int]) -> List[int]: diff --git a/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py b/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py index 60dcafa2..a67fd60c 100644 --- a/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py +++ b/src/main/python/g1101_1200/s1143_longest_common_subsequence/Solution.py @@ -1,4 +1,4 @@ -# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional # #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 # #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) # #2024_06_07_Time_452_ms_(81.00%)_Space_41.6_MB_(77.76%) diff --git a/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb b/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb index cbc93512..2b221100 100644 --- a/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb +++ b/src/main/ruby/g0001_0100/s0001_two_sum/solution.rb @@ -1,5 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) +# #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +# #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task # #2023_11_08_Time_57_ms_(89.38%)_Space_212.2_MB_(11.34%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb b/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb index 68f926ed..8427e36c 100644 --- a/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb +++ b/src/main/ruby/g0001_0100/s0002_add_two_numbers/solution.rb @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion # #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -# #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) -# #2023_11_11_Time_68_ms_(97.48%)_Space_211.1_MB_(55.38%) +# #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +# #AI_can_be_used_to_solve_the_task #2023_11_11_Time_68_ms_(97.48%)_Space_211.1_MB_(55.38%) require_relative '../../com_github_leetcode/list_node' diff --git a/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb b/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb index d4f35e2d..369b4bb7 100644 --- a/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb +++ b/src/main/ruby/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window # #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -# #Big_O_Time_O(n)_Space_O(1) #2023_11_12_Time_94_ms_(85.62%)_Space_211.3_MB_(45.32%) +# #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +# #2023_11_12_Time_94_ms_(85.62%)_Space_211.3_MB_(45.32%) # @param {String} s # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb b/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb index 743890c5..a8ccdea6 100644 --- a/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb +++ b/src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays/solution.rb @@ -1,5 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -# #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2023_11_12_Time_64_ms_(93.81%)_Space_212.7_MB_(57.89%) +# #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +# #AI_can_be_used_to_solve_the_task #2023_11_12_Time_64_ms_(93.81%)_Space_212.7_MB_(57.89%) # @param {Integer[]} nums1 # @param {Integer[]} nums2 diff --git a/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb b/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb index 8113f465..19b89014 100644 --- a/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb +++ b/src/main/ruby/g0001_0100/s0005_longest_palindromic_substring/solution.rb @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming # #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -# #2023_11_12_Time_117_ms_(98.63%)_Space_211_MB_(92.47%) +# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +# #Big_O_Time_O(n)_Space_O(n) #2023_11_12_Time_117_ms_(98.63%)_Space_211_MB_(92.47%) # @param {String} s # @return {String} diff --git a/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb b/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb index c6467659..8dbb1884 100644 --- a/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb +++ b/src/main/ruby/g0001_0100/s0006_zigzag_conversion/solution.rb @@ -1,4 +1,5 @@ -# #Medium #String #2023_11_14_Time_77_ms_(100.00%)_Space_211_MB_(89.81%) +# #Medium #String #Top_Interview_150_Array/String +# #2023_11_14_Time_77_ms_(100.00%)_Space_211_MB_(89.81%) # @param {String} s # @param {Integer} num_rows diff --git a/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb b/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb index c2889a67..9659579c 100644 --- a/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb +++ b/src/main/ruby/g0001_0100/s0009_palindrome_number/solution.rb @@ -1,4 +1,5 @@ -# #Easy #Math #Udemy_Integers #2023_11_14_Time_83_ms_(74.19%)_Space_211.1_MB_(43.29%) +# #Easy #Math #Udemy_Integers #Top_Interview_150_Math +# #2023_11_14_Time_83_ms_(74.19%)_Space_211.1_MB_(43.29%) # @param {Integer} x # @return {Boolean} diff --git a/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb b/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb index f6c1dff1..0dc9bd43 100644 --- a/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb +++ b/src/main/ruby/g0001_0100/s0010_regular_expression_matching/solution.rb @@ -1,6 +1,5 @@ -# #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion -# #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n) -# #2023_11_14_Time_66_ms_(94.44%)_Space_211_MB_(36.11%) +# #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +# #Big_O_Time_O(m*n)_Space_O(m*n) #2023_11_14_Time_66_ms_(94.44%)_Space_211_MB_(36.11%) # @param {String} s # @param {String} p diff --git a/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb b/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb index 8f9babd5..947b107c 100644 --- a/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb +++ b/src/main/ruby/g0001_0100/s0011_container_with_most_water/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -# #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -# #2023_11_17_Time_114_ms_(95.98%)_Space_217.5_MB_(71.21%) +# #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +# #Big_O_Time_O(n)_Space_O(1) #2023_11_17_Time_114_ms_(95.98%)_Space_217.5_MB_(71.21%) # @param {Integer[]} height # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0015_3sum/solution.rb b/src/main/ruby/g0001_0100/s0015_3sum/solution.rb index 4a9dcd13..3c3dce32 100644 --- a/src/main/ruby/g0001_0100/s0015_3sum/solution.rb +++ b/src/main/ruby/g0001_0100/s0015_3sum/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers # #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -# #Big_O_Time_O(n*log(n))_Space_O(n^2) #2023_11_17_Time_659_ms_(83.74%)_Space_214.1_MB_(59.36%) +# #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +# #2023_11_17_Time_659_ms_(83.74%)_Space_214.1_MB_(59.36%) # @param {Integer[]} nums # @return {Integer[][]} diff --git a/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb b/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb index 8e403101..c523b6a6 100644 --- a/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb +++ b/src/main/ruby/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -# #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(4^n)_Space_O(n) #2023_11_17_Time_49_ms_(93.94%)_Space_210.9_MB_(97.73%) +# #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +# #2023_11_17_Time_49_ms_(93.94%)_Space_210.9_MB_(97.73%) # @param {String} digits # @return {String[]} diff --git a/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb b/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb index aee2b8ea..0f994ec5 100644 --- a/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb +++ b/src/main/ruby/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -# #2023_11_17_Time_51_ms_(95.27%)_Space_211_MB_(50.00%) +# #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(L)_Space_O(L) #2023_11_17_Time_51_ms_(95.27%)_Space_211_MB_(50.00%) # Definition for singly-linked list. # class ListNode diff --git a/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb b/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb index b14335de..12368ec9 100644 --- a/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb +++ b/src/main/ruby/g0001_0100/s0020_valid_parentheses/solution.rb @@ -1,6 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -# #2023_11_17_Time_53_ms_(90.52%)_Space_211.2_MB_(35.11%) +# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +# #Big_O_Time_O(n)_Space_O(n) #2023_11_17_Time_53_ms_(90.52%)_Space_211.2_MB_(35.11%) # @param {String} s # @return {Boolean} diff --git a/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb b/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb index 9b7271e5..5b0133b6 100644 --- a/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb +++ b/src/main/ruby/g0001_0100/s0021_merge_two_sorted_lists/solution.rb @@ -1,7 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion # #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -# #2023_11_17_Time_66_ms_(59.01%)_Space_210.9_MB_(88.79%) +# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(m+n)_Space_O(m+n) #2023_11_17_Time_66_ms_(59.01%)_Space_210.9_MB_(88.79%) # Definition for singly-linked list. # class ListNode diff --git a/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb b/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb index 4f2ba417..18851958 100644 --- a/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb +++ b/src/main/ruby/g0001_0100/s0022_generate_parentheses/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming # #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(2^n)_Space_O(n) #2023_11_17_Time_43_ms_(100.00%)_Space_211.3_MB_(83.90%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +# #2023_11_17_Time_43_ms_(100.00%)_Space_211.3_MB_(83.90%) # @param {Integer} n # @return {String[]} diff --git a/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb b/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb index 694af025..24c5d318 100644 --- a/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb +++ b/src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists/solution.rb @@ -1,5 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -# #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) +# #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +# #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) # #2023_11_17_Time_76_ms_(87.95%)_Space_212.3_MB_(83.13%) # Definition for singly-linked list. diff --git a/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb b/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb index 0be3d369..deb5fb3c 100644 --- a/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb +++ b/src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group/solution.rb @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -# #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +# #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) # #2023_11_17_Time_62_ms_(91.67%)_Space_211.1_MB_(66.67%) # Definition for singly-linked list. diff --git a/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb b/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb index 39b6e82e..ac4f9eb0 100644 --- a/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb +++ b/src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -# #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +# #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) # #2023_11_19_Time_59_ms_(74.85%)_Space_211.3_MB_(12.57%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb b/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb index 3343a0ac..e994a5d1 100644 --- a/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb +++ b/src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -# #2023_11_19_Time_60_ms_(77.52%)_Space_211.7_MB_(22.94%) +# #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +# #Big_O_Time_O(log_n)_Space_O(1) #2023_11_19_Time_60_ms_(77.52%)_Space_211.7_MB_(22.94%) # @param {Integer[]} nums # @param {Integer} target diff --git a/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb b/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb index 487153ef..046f3120 100644 --- a/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb +++ b/src/main/ruby/g0001_0100/s0035_search_insert_position/solution.rb @@ -1,5 +1,5 @@ # #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -# #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +# #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) # #2023_11_19_Time_48_ms_(97.37%)_Space_211.2_MB_(92.98%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb b/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb index 18ce6b8e..e3947ff5 100644 --- a/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb +++ b/src/main/ruby/g0001_0100/s0039_combination_sum/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking # #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -# #Big_O_Time_O(2^n)_Space_O(n+2^n) #2023_11_19_Time_79_ms_(74.84%)_Space_211.2_MB_(48.43%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +# #2023_11_19_Time_79_ms_(74.84%)_Space_211.2_MB_(48.43%) # @param {Integer[]} candidates # @param {Integer} target diff --git a/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb b/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb index dd8f461a..e15b3b6f 100644 --- a/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb +++ b/src/main/ruby/g0001_0100/s0042_trapping_rain_water/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_19_Time_69_ms_(80.74%)_Space_212_MB_(57.04%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2023_11_19_Time_69_ms_(80.74%)_Space_212_MB_(57.04%) # @param {Integer[]} height # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb b/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb index f4508e39..7dc71a2f 100644 --- a/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb +++ b/src/main/ruby/g0001_0100/s0045_jump_game_ii/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_19_Time_68_ms_(75.23%)_Space_211.9_MB_(79.82%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2023_11_19_Time_68_ms_(75.23%)_Space_211.9_MB_(79.82%) # @param {Integer[]} nums # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0046_permutations/solution.rb b/src/main/ruby/g0001_0100/s0046_permutations/solution.rb index c45dfe9d..bb2ec954 100644 --- a/src/main/ruby/g0001_0100/s0046_permutations/solution.rb +++ b/src/main/ruby/g0001_0100/s0046_permutations/solution.rb @@ -1,6 +1,6 @@ # #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!) +# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) # #2023_11_19_Time_62_ms_(89.60%)_Space_211.1_MB_(64.00%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb b/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb index 175fafd6..4c9a3235 100644 --- a/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb +++ b/src/main/ruby/g0001_0100/s0048_rotate_image/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_21_Time_50_ms_(93.64%)_Space_211_MB_(87.27%) +# #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +# #2023_11_21_Time_50_ms_(93.64%)_Space_211_MB_(87.27%) # @param {Integer[][]} matrix # @return {Void} Do not return anything, modify matrix in-place instead. diff --git a/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb b/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb index 5342b0df..1dc3b179 100644 --- a/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb +++ b/src/main/ruby/g0001_0100/s0049_group_anagrams/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_21_Time_154_ms_(83.69%)_Space_216_MB_(66.43%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +# #2023_11_21_Time_154_ms_(83.69%)_Space_216_MB_(66.43%) # @param {String[]} strs # @return {String[][]} diff --git a/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb b/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb index d0939123..0b00f646 100644 --- a/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb +++ b/src/main/ruby/g0001_0100/s0053_maximum_subarray/solution.rb @@ -1,6 +1,6 @@ -# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming +# #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) +# #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) # #2023_11_21_Time_125_ms_(81.22%)_Space_218.9_MB_(87.31%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb b/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb index 1488703a..2f6414da 100644 --- a/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb +++ b/src/main/ruby/g0001_0100/s0055_jump_game/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_21_Time_88_ms_(95.88%)_Space_216_MB_(77.32%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2023_11_21_Time_88_ms_(95.88%)_Space_216_MB_(77.32%) # @param {Integer[]} nums # @return {Boolean} diff --git a/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb b/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb index f136a5ff..2daad823 100644 --- a/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb +++ b/src/main/ruby/g0001_0100/s0056_merge_intervals/solution.rb @@ -1,6 +1,7 @@ # #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) #2023_11_21_Time_103_ms_(74.70%)_Space_212.5_MB_(84.34%) +# #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +# #2023_11_21_Time_103_ms_(74.70%)_Space_212.5_MB_(84.34%) # @param {Integer[][]} intervals # @return {Integer[][]} diff --git a/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb b/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb index f67a9612..ca1cbec3 100644 --- a/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb +++ b/src/main/ruby/g0001_0100/s0062_unique_paths/solution.rb @@ -1,7 +1,7 @@ # #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) -# #2023_11_21_Time_50_ms_(91.92%)_Space_211.1_MB_(52.53%) +# #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2023_11_21_Time_50_ms_(91.92%)_Space_211.1_MB_(52.53%) # @param {Integer} m # @param {Integer} n diff --git a/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb b/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb index 6830ccbb..e625c654 100644 --- a/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb +++ b/src/main/ruby/g0001_0100/s0064_minimum_path_sum/solution.rb @@ -1,6 +1,6 @@ # #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) -# #2023_11_21_Time_78_ms_(52.50%)_Space_212.3_MB_(75.00%) +# #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +# #Big_O_Time_O(m*n)_Space_O(m*n) #2023_11_21_Time_78_ms_(52.50%)_Space_212.3_MB_(75.00%) # @param {Integer[][]} grid # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb b/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb index 83aeb28b..afefc560 100644 --- a/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb +++ b/src/main/ruby/g0001_0100/s0070_climbing_stairs/solution.rb @@ -1,7 +1,7 @@ # #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) -# #2023_11_21_Time_48_ms_(96.01%)_Space_211.1_MB_(19.60%) +# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(n)_Space_O(n) #2023_11_21_Time_48_ms_(96.01%)_Space_211.1_MB_(19.60%) # @param {Integer} n # @return {Integer} diff --git a/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb b/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb index ab442f13..370c25b9 100644 --- a/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb +++ b/src/main/ruby/g0001_0100/s0072_edit_distance/solution.rb @@ -1,6 +1,6 @@ -# #Hard #Top_100_Liked_Questions #String #Dynamic_Programming +# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional # #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -# #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +# #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) # #2023_11_21_Time_139_ms_(73.91%)_Space_211_MB_(100.00%) # @param {String} word1 diff --git a/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb b/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb index c29b724b..dbca45b3 100644 --- a/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb +++ b/src/main/ruby/g0001_0100/s0073_set_matrix_zeroes/solution.rb @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) # #2023_11_22_Time_59_ms_(100.00%)_Space_212.3_MB_(21.11%) # @param {Integer[][]} matrix diff --git a/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb b/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb index ef3d7905..78b10ad7 100644 --- a/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb +++ b/src/main/ruby/g0001_0100/s0074_search_a_2d_matrix/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array # #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -# #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) # #2023_11_22_Time_50_ms_(97.83%)_Space_210.9_MB_(97.83%) # @param {Integer[][]} matrix diff --git a/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb b/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb index 25e8fb09..00eed41a 100644 --- a/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb +++ b/src/main/ruby/g0001_0100/s0076_minimum_window_substring/solution.rb @@ -1,6 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -# #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -# #2023_11_22_Time_175_ms_(93.33%)_Space_211.5_MB_(88.89%) +# #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +# #Big_O_Time_O(s.length())_Space_O(1) #2023_11_22_Time_175_ms_(93.33%)_Space_211.5_MB_(88.89%) # @param {String} s # @param {String} t diff --git a/src/main/ruby/g0001_0100/s0079_word_search/solution.rb b/src/main/ruby/g0001_0100/s0079_word_search/solution.rb index 7cfb4177..aa2b5519 100644 --- a/src/main/ruby/g0001_0100/s0079_word_search/solution.rb +++ b/src/main/ruby/g0001_0100/s0079_word_search/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -# #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -# #2023_11_22_Time_56_ms_(100.00%)_Space_211_MB_(53.62%) +# #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2023_11_22_Time_56_ms_(100.00%)_Space_211_MB_(53.62%) # @param {Character[][]} board # @param {String} word diff --git a/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb b/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb index af001f3d..b74868bd 100644 --- a/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb +++ b/src/main/ruby/g0001_0100/s0096_unique_binary_search_trees/solution.rb @@ -1,5 +1,5 @@ -# #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree -# #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +# #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +# #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) # #2023_11_22_Time_57_ms_(61.54%)_Space_211_MB_(76.92%) # @param {Integer} n diff --git a/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb b/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb index 5c1ee8c7..a75dfed8 100644 --- a/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb +++ b/src/main/ruby/g0001_0100/s0098_validate_binary_search_tree/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree # #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree -# #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(log(N)) +# #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) # #2023_11_22_Time_68_ms_(70.23%)_Space_211.7_MB_(72.52%) require_relative '../../com_github_leetcode/tree_node' diff --git a/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb b/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb index bdba9817..321a4ba6 100644 --- a/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb +++ b/src/main/ruby/g0101_0200/s0101_symmetric_tree/solution.rb @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search # #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -# #Big_O_Time_O(N)_Space_O(log(N)) #2023_11_23_Time_58_ms_(91.34%)_Space_211.1_MB_(48.82%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +# #2023_11_23_Time_58_ms_(91.34%)_Space_211.1_MB_(48.82%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb b/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb index 6eaaed78..68dcf75c 100644 --- a/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb +++ b/src/main/ruby/g0101_0200/s0102_binary_tree_level_order_traversal/solution.rb @@ -1,6 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree # #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_66_ms_(76.43%)_Space_211.3_MB_(57.86%) +# #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +# #2023_11_23_Time_66_ms_(76.43%)_Space_211.3_MB_(57.86%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb b/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb index 25edfd76..91e55c86 100644 --- a/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb +++ b/src/main/ruby/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.rb @@ -1,7 +1,8 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -# #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +# #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree # #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(N)_Space_O(H) #2023_11_23_Time_55_ms_(96.72%)_Space_211.3_MB_(37.23%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +# #2023_11_23_Time_55_ms_(96.72%)_Space_211.3_MB_(37.23%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb b/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb index 16f6fad7..410bb691 100644 --- a/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb +++ b/src/main/ruby/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -# #2023_11_23_Time_71_ms_(91.78%)_Space_212_MB_(79.45%) +# #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_71_ms_(91.78%)_Space_212_MB_(79.45%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb b/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb index c6fabb07..571871af 100644 --- a/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb +++ b/src/main/ruby/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.rb @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List -# #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) +# #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) # #2023_11_23_Time_47_ms_(100.00%)_Space_211_MB_(69.23%) # Definition for a binary tree node. diff --git a/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb b/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb index 88cf39aa..f6a0fb38 100644 --- a/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb +++ b/src/main/ruby/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.rb @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming # #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -# #Big_O_Time_O(N)_Space_O(1) #2023_11_23_Time_147_ms_(80.21%)_Space_220.8_MB_(82.79%) +# #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +# #2023_11_23_Time_147_ms_(80.21%)_Space_220.8_MB_(82.79%) # @param {Integer[]} prices # @return {Integer} diff --git a/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb b/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb index f0279fb2..dc6e63b4 100644 --- a/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb +++ b/src/main/ruby/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.rb @@ -1,6 +1,6 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -# #2023_11_23_Time_71_ms_(98.00%)_Space_213.4_MB_(74.00%) +# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +# #Big_O_Time_O(N)_Space_O(N) #2023_11_23_Time_71_ms_(98.00%)_Space_213.4_MB_(74.00%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb b/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb index 20890167..4756bb56 100644 --- a/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb +++ b/src/main/ruby/g0101_0200/s0128_longest_consecutive_sequence/solution.rb @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -# #Big_O_Time_O(N_log_N)_Space_O(1) #2023_11_23_Time_135_ms_(91.36%)_Space_217.1_MB_(100.00%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +# #2023_11_23_Time_135_ms_(91.36%)_Space_217.1_MB_(100.00%) # @param {Integer[]} nums # @return {Integer} diff --git a/src/main/ruby/g0101_0200/s0136_single_number/solution.rb b/src/main/ruby/g0101_0200/s0136_single_number/solution.rb index adbda270..f903388d 100644 --- a/src/main/ruby/g0101_0200/s0136_single_number/solution.rb +++ b/src/main/ruby/g0101_0200/s0136_single_number/solution.rb @@ -1,5 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -# #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +# #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +# #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation # #Big_O_Time_O(N)_Space_O(1) #2023_11_23_Time_68_ms_(78.44%)_Space_212.3_MB_(66.51%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb b/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb index c7083406..8cbaf3ec 100644 --- a/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb +++ b/src/main/ruby/g0101_0200/s0138_copy_list_with_random_pointer/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List -# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(N) -# #2023_11_27_Time_65_ms_(69.84%)_Space_211.3_MB_(52.38%) +# #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(N)_Space_O(N) #2023_11_27_Time_65_ms_(69.84%)_Space_211.3_MB_(52.38%) require_relative '../../com_github_leetcode/random/node' diff --git a/src/main/ruby/g0101_0200/s0139_word_break/solution.rb b/src/main/ruby/g0101_0200/s0139_word_break/solution.rb index 84fdf12e..432975e8 100644 --- a/src/main/ruby/g0101_0200/s0139_word_break/solution.rb +++ b/src/main/ruby/g0101_0200/s0139_word_break/solution.rb @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table # #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -# #2023_11_27_Time_64_ms_(79.31%)_Space_211.2_MB_(22.41%) +# #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2023_11_27_Time_64_ms_(79.31%)_Space_211.2_MB_(22.41%) # @param {String} s # @param {String[]} word_dict diff --git a/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb b/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb index cfeb42ca..2ca673b2 100644 --- a/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb +++ b/src/main/ruby/g0101_0200/s0141_linked_list_cycle/solution.rb @@ -1,6 +1,6 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List -# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -# #2023_11_24_Time_58_ms_(97.65%)_Space_211.4_MB_(74.12%) +# #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(N)_Space_O(1) #2023_11_24_Time_58_ms_(97.65%)_Space_211.4_MB_(74.12%) # @param {ListNode} head # @return {Boolean} diff --git a/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb b/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb index 53099c9b..43bbbf3c 100644 --- a/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb +++ b/src/main/ruby/g0101_0200/s0146_lru_cache/lrucache.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -# #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -# #2023_11_24_Time_290_ms_(78.05%)_Space_253.1_MB_(69.92%) +# #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +# #Big_O_Time_O(1)_Space_O(capacity) #2023_11_24_Time_290_ms_(78.05%)_Space_253.1_MB_(69.92%) class LRUCache class LruCacheNode diff --git a/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb b/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb index 34f43b06..a8291210 100644 --- a/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb +++ b/src/main/ruby/g0101_0200/s0148_sort_list/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -# #2023_11_24_Time_188_ms_(84.21%)_Space_224_MB_(21.05%) +# #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +# #Big_O_Time_O(log(N))_Space_O(log(N)) #2023_11_24_Time_188_ms_(84.21%)_Space_224_MB_(21.05%) require_relative '../../com_github_leetcode/list_node' diff --git a/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb b/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb index 47d51339..6179e5a5 100644 --- a/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb +++ b/src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -# #2023_11_24_Time_58_ms_(78.74%)_Space_211.1_MB_(78.74%) +# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +# #Big_O_Time_O(log_N)_Space_O(log_N) #2023_11_24_Time_58_ms_(78.74%)_Space_211.1_MB_(78.74%) # @param {Integer[]} nums # @return {Integer} diff --git a/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb b/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb index 97da36e6..d2a21ed5 100644 --- a/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb +++ b/src/main/ruby/g0101_0200/s0155_min_stack/minstack.rb @@ -1,6 +1,7 @@ -# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design +# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design # #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -# #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2023_11_24_Time_76_ms_(79.40%)_Space_215.2_MB_(6.53%) +# #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +# #2023_11_24_Time_76_ms_(79.40%)_Space_215.2_MB_(6.53%) # @param {String} string # @return {String} diff --git a/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb b/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb index 5d534430..275ee011 100644 --- a/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb +++ b/src/main/ruby/g0101_0200/s0169_majority_element/solution.rb @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting # #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -# #Big_O_Time_O(n)_Space_O(1) #2023_11_24_Time_75_ms_(64.60%)_Space_212.5_MB_(31.42%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2023_11_24_Time_75_ms_(64.60%)_Space_212.5_MB_(31.42%) # @param {Integer[]} nums # @return {Integer} diff --git a/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb b/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb index 3e7aead6..5ffc80a7 100644 --- a/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb +++ b/src/main/ruby/g0101_0200/s0189_rotate_array/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -# #2023_11_24_Time_100_ms_(92.40%)_Space_218.6_MB_(81.37%) +# #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +# #Big_O_Time_O(n)_Space_O(1) #2023_11_24_Time_100_ms_(92.40%)_Space_218.6_MB_(81.37%) # @param {Integer[]} nums # @param {Integer} k diff --git a/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb b/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb index 21f34d5f..e85123cd 100644 --- a/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb +++ b/src/main/ruby/g0101_0200/s0198_house_robber/solution.rb @@ -1,7 +1,7 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -# #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -# #2023_11_25_Time_41_ms_(99.28%)_Space_210.9_MB_(86.23%) +# #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +# #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(n)_Space_O(n) #2023_11_25_Time_41_ms_(99.28%)_Space_210.9_MB_(86.23%) # @param {Integer[]} nums # @return {Integer} diff --git a/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb b/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb index c9fcb538..3dbaedfe 100644 --- a/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb +++ b/src/main/ruby/g0101_0200/s0200_number_of_islands/solution.rb @@ -2,7 +2,8 @@ # #Breadth_First_Search #Matrix #Union_Find # #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search # #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -# #Big_O_Time_O(M*N)_Space_O(M*N) #2023_11_25_Time_141_ms_(72.68%)_Space_219.4_MB_(87.43%) +# #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +# #2023_11_25_Time_141_ms_(72.68%)_Space_219.4_MB_(87.43%) # @param {Character[][]} grid # @return {Integer} diff --git a/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb b/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb index 1e4409a1..0e326a8f 100644 --- a/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb +++ b/src/main/ruby/g0201_0300/s0206_reverse_linked_list/solution.rb @@ -1,7 +1,7 @@ # #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -# #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -# #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -# #2023_11_25_Time_52_ms_(93.99%)_Space_211.1_MB_(64.56%) +# #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +# #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +# #Big_O_Time_O(N)_Space_O(1) #2023_11_25_Time_52_ms_(93.99%)_Space_211.1_MB_(64.56%) # Definition for singly-linked list. # class ListNode diff --git a/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb b/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb index 6ae896f1..92cba312 100644 --- a/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb +++ b/src/main/ruby/g0201_0300/s0207_course_schedule/solution.rb @@ -1,6 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -# #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -# #2023_11_25_Time_60_ms_(95.42%)_Space_212.4_MB_(26.72%) +# #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +# #Big_O_Time_O(N)_Space_O(N) #2023_11_25_Time_60_ms_(95.42%)_Space_212.4_MB_(26.72%) WHITE = 0 GRAY = 1 diff --git a/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb b/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb index 2a47b4c9..7ffdc848 100644 --- a/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb +++ b/src/main/ruby/g0201_0300/s0208_implement_trie_prefix_tree/trie.rb @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -# #Level_2_Day_16_Design #Udemy_Trie_and_Heap +# #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie # #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) # #2023_11_25_Time_167_ms_(69.81%)_Space_227_MB_(33.96%) diff --git a/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb b/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb index 998d38c0..10b75190 100644 --- a/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb +++ b/src/main/ruby/g0201_0300/s0215_kth_largest_element_in_an_array/solution.rb @@ -1,5 +1,6 @@ # #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -# #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +# #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +# #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap # #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2023_11_25_Time_123_ms_(93.55%)_Space_219.4_MB_(80.65%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb b/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb index a8732b75..5b426849 100644 --- a/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb +++ b/src/main/ruby/g0201_0300/s0221_maximal_square/solution.rb @@ -1,5 +1,5 @@ -# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -# #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) +# #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 +# #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) # #2023_11_25_Time_184_ms_(80.00%)_Space_221.3_MB_(70.00%) # @param {Character[][]} matrix diff --git a/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb b/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb index 6ee541c2..27685502 100644 --- a/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb +++ b/src/main/ruby/g0201_0300/s0226_invert_binary_tree/solution.rb @@ -1,6 +1,7 @@ # #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree # #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -# #Big_O_Time_O(n)_Space_O(n) #2023_11_25_Time_54_ms_(89.43%)_Space_210.9_MB_(84.58%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +# #2023_11_25_Time_54_ms_(89.43%)_Space_210.9_MB_(84.58%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb b/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb index c9668f3d..5973e3c5 100644 --- a/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb +++ b/src/main/ruby/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.rb @@ -1,6 +1,7 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -# #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree -# #Big_O_Time_O(n)_Space_O(n) #2023_11_25_Time_68_ms_(89.41%)_Space_212.6_MB_(57.65%) +# #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree +# #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +# #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +# #2023_11_25_Time_68_ms_(89.41%)_Space_212.6_MB_(57.65%) # Definition for a binary tree node. # class TreeNode diff --git a/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb b/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb index f760819a..273a8fbc 100644 --- a/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb +++ b/src/main/ruby/g0201_0300/s0234_palindrome_linked_list/solution.rb @@ -1,5 +1,5 @@ -# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List -# #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) +# #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion +# #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) # #2023_11_25_Time_297_ms_(78.26%)_Space_219.7_MB_(94.57%) require_relative '../../com_github_leetcode/list_node' diff --git a/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb b/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb index 810e7fc3..f69377b0 100644 --- a/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb +++ b/src/main/ruby/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.rb @@ -1,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree -# #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +# #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree +# #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) # #2023_11_26_Time_75_ms_(86.57%)_Space_213.7_MB_(77.61%) # Definition for a binary tree node. diff --git a/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb b/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb index 439b2d70..88256e2c 100644 --- a/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb +++ b/src/main/ruby/g0201_0300/s0238_product_of_array_except_self/solution.rb @@ -1,6 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum -# #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) -# #2023_11_26_Time_123_ms_(76.59%)_Space_219.2_MB_(46.83%) +# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +# #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +# #Big_O_Time_O(n^2)_Space_O(n) #2023_11_26_Time_123_ms_(76.59%)_Space_219.2_MB_(46.83%) # @param {Integer[]} nums # @return {Integer[]} diff --git a/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb b/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb index 1f932d10..b5917877 100644 --- a/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb +++ b/src/main/ruby/g0201_0300/s0239_sliding_window_maximum/solution.rb @@ -1,5 +1,5 @@ -# #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue -# #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k) +# #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) # #2023_11_26_Time_511_ms_(77.78%)_Space_238.5_MB_(66.67%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb b/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb index 7e110ed7..8a340ecb 100644 --- a/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb +++ b/src/main/ruby/g0201_0300/s0240_search_a_2d_matrix_ii/solution.rb @@ -1,6 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_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) #2023_11_26_Time_154_ms_(100.00%)_Space_214.9_MB_(37.50%) +# #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) +# #2023_11_26_Time_154_ms_(100.00%)_Space_214.9_MB_(37.50%) # @param {Integer[][]} matrix # @param {Integer} target diff --git a/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb b/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb index e6c923c6..9e3f91ef 100644 --- a/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb +++ b/src/main/ruby/g0201_0300/s0283_move_zeroes/solution.rb @@ -1,4 +1,4 @@ -# #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Two_Pointers +# #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers # #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays # #Big_O_Time_O(n)_Space_O(1) #2023_11_26_Time_95_ms_(78.01%)_Space_212.9_MB_(32.46%) diff --git a/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb b/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb index 8bfa94e3..cf0a5971 100644 --- a/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb +++ b/src/main/ruby/g0201_0300/s0287_find_the_duplicate_number/solution.rb @@ -1,5 +1,5 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers -# #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) +# #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation +# #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n) # #2023_11_26_Time_107_ms_(81.25%)_Space_222.8_MB_(31.25%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb b/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb index 21d65af0..79e2691b 100644 --- a/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb +++ b/src/main/ruby/g0201_0300/s0295_find_median_from_data_stream/medianfinder.rb @@ -1,5 +1,5 @@ -# #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design -# #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n) +# #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream +# #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) # #2023_11_26_Time_314_ms_(95.00%)_Space_229.3_MB_(70.00%) class MedianFinder diff --git a/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb b/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb index 270c4b0a..17498f86 100644 --- a/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb +++ b/src/main/ruby/g0201_0300/s0300_longest_increasing_subsequence/solution.rb @@ -1,6 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -# #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 -# #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search +# #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 +# #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) # #2023_11_26_Time_68_ms_(96.55%)_Space_211.5_MB_(31.03%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb b/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb index 679c63bc..6344050f 100644 --- a/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb +++ b/src/main/ruby/g0301_0400/s0322_coin_change/solution.rb @@ -1,6 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -# #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -# #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search +# #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 +# #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) # #2023_11_26_Time_655_ms_(84.96%)_Space_217.7_MB_(39.82%) # @param {Integer[]} coins diff --git a/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb b/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb index 560bd72d..8af3807e 100644 --- a/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb +++ b/src/main/ruby/g0301_0400/s0338_counting_bits/solution.rb @@ -1,5 +1,6 @@ -# #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -# #Big_O_Time_O(num)_Space_O(num) #2023_11_26_Time_90_ms_(96.34%)_Space_215.9_MB_(60.98%) +# #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +# #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +# #2023_11_26_Time_90_ms_(96.34%)_Space_215.9_MB_(60.98%) # @param {Integer} num # @return {Integer[]} diff --git a/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb b/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb index f91a150e..859958d9 100644 --- a/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb +++ b/src/main/ruby/g0301_0400/s0347_top_k_frequent_elements/solution.rb @@ -1,7 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting -# #Heap_Priority_Queue #Counting #Divide_and_Conquer #Quickselect #Bucket_Sort -# #Data_Structure_II_Day_20_Heap_Priority_Queue #Big_O_Time_O(n*log(n))_Space_O(k) -# #2023_11_27_Time_67_ms_(83.85%)_Space_212_MB_(84.54%) +# #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting +# #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue +# #Big_O_Time_O(n*log(n))_Space_O(k) #2023_11_27_Time_67_ms_(83.85%)_Space_212_MB_(84.54%) # @param {Integer[]} nums # @param {Integer} k diff --git a/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb b/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb index 93e7b616..40e7a844 100644 --- a/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb +++ b/src/main/ruby/g0301_0400/s0394_decode_string/solution.rb @@ -1,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -# #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_58_ms_(84.09%)_Space_211.1_MB_(40.91%) +# #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +# #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +# #2023_11_27_Time_58_ms_(84.09%)_Space_211.1_MB_(40.91%) # @param {String} s # @return {String} diff --git a/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb b/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb index f015455c..f8bd10f6 100644 --- a/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb +++ b/src/main/ruby/g0401_0500/s0437_path_sum_iii/solution.rb @@ -1,4 +1,4 @@ -# #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree +# #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree # #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_205_ms_(61.54%)_Space_226.5_MB_(53.85%) # Definition for a binary tree node. diff --git a/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb b/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb index 423a3672..8b2e2588 100644 --- a/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb +++ b/src/main/ruby/g0401_0500/s0494_target_sum/solution.rb @@ -1,5 +1,4 @@ -# #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking -# #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +# #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) # #2023_11_27_Time_149_ms_(76.92%)_Space_211.8_MB_(100.00%) # @param {Integer[]} nums diff --git a/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb b/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb index 9705e67e..57c3ec7a 100644 --- a/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb +++ b/src/main/ruby/g0601_0700/s0647_palindromic_substrings/solution.rb @@ -1,4 +1,4 @@ -# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +# #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) # #2023_11_27_Time_101_ms_(100.00%)_Space_211.2_MB_(28.57%) # @param {String} s diff --git a/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb b/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb index 92877d8a..2e06bf1f 100644 --- a/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb +++ b/src/main/ruby/g0701_0800/s0739_daily_temperatures/solution.rb @@ -1,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -# #Big_O_Time_O(n)_Space_O(n) #2023_11_27_Time_490_ms_(84.71%)_Space_233.3_MB_(18.82%) +# #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +# #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +# #2023_11_27_Time_490_ms_(84.71%)_Space_233.3_MB_(18.82%) # @param {Integer[]} temperatures # @return {Integer[]} diff --git a/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb b/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb index 9f705792..005c8af3 100644 --- a/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb +++ b/src/main/ruby/g0701_0800/s0763_partition_labels/solution.rb @@ -1,6 +1,5 @@ -# #Medium #Top_100_Liked_Questions #String #Hash_Table #Greedy #Two_Pointers -# #Data_Structure_II_Day_7_String #Big_O_Time_O(n)_Space_O(1) -# #2023_11_27_Time_62_ms_(100.00%)_Space_210.9_MB_(100.00%) +# #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +# #Big_O_Time_O(n)_Space_O(1) #2023_11_27_Time_62_ms_(100.00%)_Space_210.9_MB_(100.00%) # @param {String} s # @return {Integer[]} diff --git a/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb b/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb index 9988eb40..4f1ee768 100644 --- a/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb +++ b/src/main/ruby/g1101_1200/s1143_longest_common_subsequence/solution.rb @@ -1,4 +1,4 @@ -# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +# #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional # #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 # #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) # #2023_11_27_Time_828_ms_(75.00%)_Space_235.1_MB_(56.82%) diff --git a/src/main/rust/g0001_0100/s0001_two_sum/Solution.rs b/src/main/rust/g0001_0100/s0001_two_sum/Solution.rs index 36481975..8b966398 100644 --- a/src/main/rust/g0001_0100/s0001_two_sum/Solution.rs +++ b/src/main/rust/g0001_0100/s0001_two_sum/Solution.rs @@ -1,5 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table -// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Top_Interview_150_Hashmap +// #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task // #2024_08_24_Time_0_ms_(100.00%)_Space_2.4_MB_(23.16%) use std::collections::HashMap; diff --git a/src/main/rust/g0001_0100/s0002_add_two_numbers/Solution.rs b/src/main/rust/g0001_0100/s0002_add_two_numbers/Solution.rs index 9a724e7d..e5191d4f 100644 --- a/src/main/rust/g0001_0100/s0002_add_two_numbers/Solution.rs +++ b/src/main/rust/g0001_0100/s0002_add_two_numbers/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion // #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15 -// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2024_08_24_Time_0_ms_(100.00%)_Space_2.2_MB_(14.25%) +// #Top_Interview_150_Linked_List #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) +// #AI_can_be_used_to_solve_the_task #2024_08_24_Time_0_ms_(100.00%)_Space_2.2_MB_(14.25%) // Definition for singly-linked list. // #[derive(PartialEq, Eq, Clone, Debug)] diff --git a/src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.rs b/src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.rs index 851f3998..64386435 100644 --- a/src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.rs +++ b/src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window // #Algorithm_I_Day_6_Sliding_Window #Level_2_Day_14_Sliding_Window/Two_Pointer #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(1) #2024_08_24_Time_0_ms_(100.00%)_Space_2.3_MB_(28.72%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2024_08_24_Time_0_ms_(100.00%)_Space_2.3_MB_(28.72%) impl Solution { pub fn length_of_longest_substring(s: String) -> i32 { diff --git a/src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.rs b/src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.rs index 9bcc5341..d0b618e1 100644 --- a/src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.rs +++ b/src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.rs @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer -// #Big_O_Time_O(log(min(N,M)))_Space_O(1) #2024_08_24_Time_0_ms_(100.00%)_Space_2.2_MB_(39.80%) +// #Top_Interview_150_Binary_Search #Big_O_Time_O(log(min(N,M)))_Space_O(1) +// #AI_can_be_used_to_solve_the_task #2024_08_24_Time_0_ms_(100.00%)_Space_2.2_MB_(39.80%) impl Solution { pub fn find_median_sorted_arrays(nums1: Vec, nums2: Vec) -> f64 { diff --git a/src/main/rust/g0001_0100/s0005_longest_palindromic_substring/Solution.rs b/src/main/rust/g0001_0100/s0005_longest_palindromic_substring/Solution.rs index fabb56bd..2096bb66 100644 --- a/src/main/rust/g0001_0100/s0005_longest_palindromic_substring/Solution.rs +++ b/src/main/rust/g0001_0100/s0005_longest_palindromic_substring/Solution.rs @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Data_Structure_II_Day_9_String #Algorithm_II_Day_14_Dynamic_Programming -// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_08_24_Time_1_ms_(92.60%)_Space_2.2_MB_(20.49%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_08_24_Time_1_ms_(92.60%)_Space_2.2_MB_(20.49%) impl Solution { pub fn longest_palindrome(s: String) -> String { diff --git a/src/main/rust/g0001_0100/s0006_zigzag_conversion/Solution.rs b/src/main/rust/g0001_0100/s0006_zigzag_conversion/Solution.rs index f6d9ce6e..8c217035 100644 --- a/src/main/rust/g0001_0100/s0006_zigzag_conversion/Solution.rs +++ b/src/main/rust/g0001_0100/s0006_zigzag_conversion/Solution.rs @@ -1,4 +1,5 @@ -// #Medium #String #2024_09_04_Time_0_ms_(100.00%)_Space_2.1_MB_(94.72%) +// #Medium #String #Top_Interview_150_Array/String +// #2024_09_04_Time_0_ms_(100.00%)_Space_2.1_MB_(94.72%) impl Solution { pub fn convert(s: String, num_rows: i32) -> String { diff --git a/src/main/rust/g0001_0100/s0009_palindrome_number/Solution.rs b/src/main/rust/g0001_0100/s0009_palindrome_number/Solution.rs index 114d7ce1..a6e3b561 100644 --- a/src/main/rust/g0001_0100/s0009_palindrome_number/Solution.rs +++ b/src/main/rust/g0001_0100/s0009_palindrome_number/Solution.rs @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_09_04_Time_0_ms_(100.00%)_Space_2_MB_(83.29%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2024_09_04_Time_0_ms_(100.00%)_Space_2_MB_(83.29%) impl Solution { pub fn is_palindrome(x: i32) -> bool { diff --git a/src/main/rust/g0001_0100/s0011_container_with_most_water/Solution.rs b/src/main/rust/g0001_0100/s0011_container_with_most_water/Solution.rs index 9d3a1a69..61ab859d 100644 --- a/src/main/rust/g0001_0100/s0011_container_with_most_water/Solution.rs +++ b/src/main/rust/g0001_0100/s0011_container_with_most_water/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_09_04_Time_4_ms_(95.02%)_Space_2.9_MB_(95.02%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_09_04_Time_4_ms_(95.02%)_Space_2.9_MB_(95.02%) impl Solution { pub fn max_area(height: Vec) -> i32 { diff --git a/src/main/rust/g0001_0100/s0015_3sum/Solution.rs b/src/main/rust/g0001_0100/s0015_3sum/Solution.rs index f68cc6a1..339d2220 100644 --- a/src/main/rust/g0001_0100/s0015_3sum/Solution.rs +++ b/src/main/rust/g0001_0100/s0015_3sum/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers // #Data_Structure_II_Day_1_Array #Algorithm_II_Day_3_Two_Pointers #Udemy_Two_Pointers -// #Big_O_Time_O(n*log(n))_Space_O(n^2) #2024_09_04_Time_27_ms_(81.94%)_Space_4.1_MB_(55.03%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_09_04_Time_27_ms_(81.94%)_Space_4.1_MB_(55.03%) impl Solution { pub fn three_sum(nums: Vec) -> Vec> { diff --git a/src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rs b/src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rs index 93548254..0765d8be 100644 --- a/src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rs +++ b/src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(4^n)_Space_O(n) #2024_09_04_Time_0_ms_(100.00%)_Space_2.2_MB_(45.71%) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #2024_09_04_Time_0_ms_(100.00%)_Space_2.2_MB_(45.71%) impl Solution { pub fn letter_combinations(digits: String) -> Vec { diff --git a/src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.rs b/src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.rs index d1c16b80..e5cdd798 100644 --- a/src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.rs +++ b/src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Linked_List -// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Big_O_Time_O(L)_Space_O(L) -// #2024_09_04_Time_0_ms_(100.00%)_Space_2.1_MB_(58.02%) +// #Algorithm_I_Day_5_Two_Pointers #Level_2_Day_3_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(L)_Space_O(L) #2024_09_04_Time_0_ms_(100.00%)_Space_2.1_MB_(58.02%) // Definition for singly-linked list. // #[derive(PartialEq, Eq, Clone, Debug)] diff --git a/src/main/rust/g0001_0100/s0020_valid_parentheses/Solution.rs b/src/main/rust/g0001_0100/s0020_valid_parentheses/Solution.rs index 895c873e..0517883b 100644 --- a/src/main/rust/g0001_0100/s0020_valid_parentheses/Solution.rs +++ b/src/main/rust/g0001_0100/s0020_valid_parentheses/Solution.rs @@ -1,6 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Stack -// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) -// #2024_09_04_Time_0_ms_(100.00%)_Space_2.2_MB_(50.76%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_09_04_Time_0_ms_(100.00%)_Space_2.2_MB_(50.76%) impl Solution { pub fn is_valid(s: String) -> bool { diff --git a/src/main/rust/g0001_0100/s0021_merge_two_sorted_lists/Solution.rs b/src/main/rust/g0001_0100/s0021_merge_two_sorted_lists/Solution.rs index f1670971..23ac340b 100644 --- a/src/main/rust/g0001_0100/s0021_merge_two_sorted_lists/Solution.rs +++ b/src/main/rust/g0001_0100/s0021_merge_two_sorted_lists/Solution.rs @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion // #Data_Structure_I_Day_7_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(m+n)_Space_O(m+n) -// #2024_09_05_Time_0_ms_(100.00%)_Space_2.1_MB_(14.29%) +// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(m+n)_Space_O(m+n) #2024_09_05_Time_0_ms_(100.00%)_Space_2.1_MB_(14.29%) // Definition for singly-linked list. // #[derive(PartialEq, Eq, Clone, Debug)] diff --git a/src/main/rust/g0001_0100/s0022_generate_parentheses/Solution.rs b/src/main/rust/g0001_0100/s0022_generate_parentheses/Solution.rs index ea15c191..fc13ec80 100644 --- a/src/main/rust/g0001_0100/s0022_generate_parentheses/Solution.rs +++ b/src/main/rust/g0001_0100/s0022_generate_parentheses/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n) #2024_09_05_Time_1_ms_(83.92%)_Space_2.3_MB_(62.75%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_09_05_Time_1_ms_(83.92%)_Space_2.3_MB_(62.75%) impl Solution { pub fn generate_parenthesis(n: i32) -> Vec { diff --git a/src/main/rust/g0001_0100/s0023_merge_k_sorted_lists/Solution.rs b/src/main/rust/g0001_0100/s0023_merge_k_sorted_lists/Solution.rs index c55f0f20..2424a0c5 100644 --- a/src/main/rust/g0001_0100/s0023_merge_k_sorted_lists/Solution.rs +++ b/src/main/rust/g0001_0100/s0023_merge_k_sorted_lists/Solution.rs @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List -// #Divide_and_Conquer #Merge_Sort #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) -// #2024_09_05_Time_0_ms_(100.00%)_Space_3.2_MB_(74.80%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_09_05_Time_0_ms_(100.00%)_Space_3.2_MB_(74.80%) // Definition for singly-linked list. // #[derive(PartialEq, Eq, Clone, Debug)] diff --git a/src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.rs b/src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.rs index 64e30b5f..7ccd44df 100644 --- a/src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.rs +++ b/src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.rs @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Linked_List #Recursion #Data_Structure_II_Day_13_Linked_List -// #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) // #2024_09_05_Time_0_ms_(100.00%)_Space_2.3_MB_(100.00%) // Definition for singly-linked list. diff --git a/src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.rs b/src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.rs index cbe76710..b1ba45f5 100644 --- a/src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.rs +++ b/src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_11 #Level_2_Day_8_Binary_Search -// #Udemy_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_09_05_Time_0_ms_(100.00%)_Space_2.1_MB_(99.00%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.rs b/src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.rs index 88eb4383..a9afa0d0 100644 --- a/src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.rs +++ b/src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search -// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Big_O_Time_O(log_n)_Space_O(1) -// #2024_09_05_Time_0_ms_(100.00%)_Space_2.4_MB_(11.36%) +// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_5 #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_n)_Space_O(1) #2024_09_05_Time_0_ms_(100.00%)_Space_2.4_MB_(11.36%) impl Solution { pub fn search_range(nums: Vec, target: i32) -> Vec { diff --git a/src/main/rust/g0001_0100/s0035_search_insert_position/Solution.rs b/src/main/rust/g0001_0100/s0035_search_insert_position/Solution.rs index 9ebb9684..cb43b491 100644 --- a/src/main/rust/g0001_0100/s0035_search_insert_position/Solution.rs +++ b/src/main/rust/g0001_0100/s0035_search_insert_position/Solution.rs @@ -1,5 +1,5 @@ // #Easy #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_I_Day_1_Binary_Search -// #Binary_Search_I_Day_2 #Big_O_Time_O(log_n)_Space_O(1) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2024_09_05_Time_1_ms_(83.61%)_Space_2.1_MB_(70.02%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0039_combination_sum/Solution.rs b/src/main/rust/g0001_0100/s0039_combination_sum/Solution.rs index 9d6c05f6..6594c68c 100644 --- a/src/main/rust/g0001_0100/s0039_combination_sum/Solution.rs +++ b/src/main/rust/g0001_0100/s0039_combination_sum/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Array #Backtracking #Algorithm_II_Day_10_Recursion_Backtracking // #Level_2_Day_20_Brute_Force/Backtracking #Udemy_Backtracking/Recursion -// #Big_O_Time_O(2^n)_Space_O(n+2^n) #2024_09_06_Time_1_ms_(86.63%)_Space_2.2_MB_(19.77%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_09_06_Time_1_ms_(86.63%)_Space_2.2_MB_(19.77%) impl Solution { pub fn combination_sum(coins: Vec, amount: i32) -> Vec> { diff --git a/src/main/rust/g0001_0100/s0042_trapping_rain_water/Solution.rs b/src/main/rust/g0001_0100/s0042_trapping_rain_water/Solution.rs index 6023686a..662975f6 100644 --- a/src/main/rust/g0001_0100/s0042_trapping_rain_water/Solution.rs +++ b/src/main/rust/g0001_0100/s0042_trapping_rain_water/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(67.75%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(67.75%) impl Solution { pub fn trap(height: Vec) -> i32 { diff --git a/src/main/rust/g0001_0100/s0045_jump_game_ii/Solution.rs b/src/main/rust/g0001_0100/s0045_jump_game_ii/Solution.rs index 491471a6..5bfb88bf 100644 --- a/src/main/rust/g0001_0100/s0045_jump_game_ii/Solution.rs +++ b/src/main/rust/g0001_0100/s0045_jump_game_ii/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_06_Time_0_ms_(100.00%)_Space_2.1_MB_(95.65%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_09_06_Time_0_ms_(100.00%)_Space_2.1_MB_(95.65%) impl Solution { pub fn jump(nums: Vec) -> i32 { diff --git a/src/main/rust/g0001_0100/s0046_permutations/Solution.rs b/src/main/rust/g0001_0100/s0046_permutations/Solution.rs index 3cff6a2b..88df8368 100644 --- a/src/main/rust/g0001_0100/s0046_permutations/Solution.rs +++ b/src/main/rust/g0001_0100/s0046_permutations/Solution.rs @@ -1,6 +1,6 @@ // #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!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2024_09_06_Time_1_ms_(83.08%)_Space_2.1_MB_(76.15%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0048_rotate_image/Solution.rs b/src/main/rust/g0001_0100/s0048_rotate_image/Solution.rs index fca85adc..6b16adb2 100644 --- a/src/main/rust/g0001_0100/s0048_rotate_image/Solution.rs +++ b/src/main/rust/g0001_0100/s0048_rotate_image/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(50.90%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(50.90%) impl Solution { pub fn rotate(matrix: &mut Vec>) { diff --git a/src/main/rust/g0001_0100/s0049_group_anagrams/Solution.rs b/src/main/rust/g0001_0100/s0049_group_anagrams/Solution.rs index e833e0bc..b1450dc6 100644 --- a/src/main/rust/g0001_0100/s0049_group_anagrams/Solution.rs +++ b/src/main/rust/g0001_0100/s0049_group_anagrams/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_06_Time_0_ms_(100.00%)_Space_5.3_MB_(26.81%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_09_06_Time_0_ms_(100.00%)_Space_5.3_MB_(26.81%) use std::collections::HashMap; diff --git a/src/main/rust/g0001_0100/s0053_maximum_subarray/Solution.rs b/src/main/rust/g0001_0100/s0053_maximum_subarray/Solution.rs index 1e158bcd..9a82fb64 100644 --- a/src/main/rust/g0001_0100/s0053_maximum_subarray/Solution.rs +++ b/src/main/rust/g0001_0100/s0053_maximum_subarray/Solution.rs @@ -1,6 +1,6 @@ // #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) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) // #2024_09_06_Time_7_ms_(89.94%)_Space_3.3_MB_(6.92%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0055_jump_game/Solution.rs b/src/main/rust/g0001_0100/s0055_jump_game/Solution.rs index 0abc5745..6d644386 100644 --- a/src/main/rust/g0001_0100/s0055_jump_game/Solution.rs +++ b/src/main/rust/g0001_0100/s0055_jump_game/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(49.50%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_09_06_Time_0_ms_(100.00%)_Space_2.2_MB_(49.50%) impl Solution { pub fn can_jump(nums: Vec) -> bool { diff --git a/src/main/rust/g0001_0100/s0056_merge_intervals/Solution.rs b/src/main/rust/g0001_0100/s0056_merge_intervals/Solution.rs index 3804e88b..01568209 100644 --- a/src/main/rust/g0001_0100/s0056_merge_intervals/Solution.rs +++ b/src/main/rust/g0001_0100/s0056_merge_intervals/Solution.rs @@ -1,6 +1,7 @@ // #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) #2024_09_07_Time_3_ms_(90.96%)_Space_2.9_MB_(71.81%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_09_07_Time_3_ms_(90.96%)_Space_2.9_MB_(71.81%) impl Solution { pub fn merge(intervals: Vec>) -> Vec> { diff --git a/src/main/rust/g0001_0100/s0062_unique_paths/Solution.rs b/src/main/rust/g0001_0100/s0062_unique_paths/Solution.rs index 2a97161a..31d3f6b3 100644 --- a/src/main/rust/g0001_0100/s0062_unique_paths/Solution.rs +++ b/src/main/rust/g0001_0100/s0062_unique_paths/Solution.rs @@ -1,7 +1,7 @@ // #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) -// #2024_09_07_Time_0_ms_(100.00%)_Space_2.1_MB_(22.76%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2024_09_07_Time_0_ms_(100.00%)_Space_2.1_MB_(22.76%) impl Solution { pub fn unique_paths(m: i32, n: i32) -> i32 { diff --git a/src/main/rust/g0001_0100/s0064_minimum_path_sum/Solution.rs b/src/main/rust/g0001_0100/s0064_minimum_path_sum/Solution.rs index 3b89023c..98a17c22 100644 --- a/src/main/rust/g0001_0100/s0064_minimum_path_sum/Solution.rs +++ b/src/main/rust/g0001_0100/s0064_minimum_path_sum/Solution.rs @@ -1,6 +1,6 @@ // #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) -// #2024_09_07_Time_0_ms_(100.00%)_Space_2.5_MB_(20.18%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_09_07_Time_0_ms_(100.00%)_Space_2.5_MB_(20.18%) impl Solution { pub fn min_path_sum(grid: Vec>) -> i32 { diff --git a/src/main/rust/g0001_0100/s0070_climbing_stairs/Solution.rs b/src/main/rust/g0001_0100/s0070_climbing_stairs/Solution.rs index ee0dec9e..2fb11429 100644 --- a/src/main/rust/g0001_0100/s0070_climbing_stairs/Solution.rs +++ b/src/main/rust/g0001_0100/s0070_climbing_stairs/Solution.rs @@ -1,7 +1,7 @@ // #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) -// #2024_09_07_Time_0_ms_(100.00%)_Space_2.1_MB_(16.87%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_09_07_Time_0_ms_(100.00%)_Space_2.1_MB_(16.87%) impl Solution { pub fn climb_stairs(n: i32) -> i32 { diff --git a/src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs b/src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs index 2473a64e..f595dc79 100644 --- a/src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs +++ b/src/main/rust/g0001_0100/s0072_edit_distance/Solution.rs @@ -1,6 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2024_09_07_Time_0_ms_(100.00%)_Space_2.2_MB_(87.38%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0073_set_matrix_zeroes/Solution.rs b/src/main/rust/g0001_0100/s0073_set_matrix_zeroes/Solution.rs index 0f2f65be..d226a65d 100644 --- a/src/main/rust/g0001_0100/s0073_set_matrix_zeroes/Solution.rs +++ b/src/main/rust/g0001_0100/s0073_set_matrix_zeroes/Solution.rs @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) // #2024_09_07_Time_0_ms_(100.00%)_Space_2.4_MB_(39.22%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0074_search_a_2d_matrix/Solution.rs b/src/main/rust/g0001_0100/s0074_search_a_2d_matrix/Solution.rs index a1b6889f..b5951ea1 100644 --- a/src/main/rust/g0001_0100/s0074_search_a_2d_matrix/Solution.rs +++ b/src/main/rust/g0001_0100/s0074_search_a_2d_matrix/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array // #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search -// #Udemy_2D_Arrays/Matrix #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2024_09_07_Time_1_ms_(79.35%)_Space_2.3_MB_(12.90%) impl Solution { diff --git a/src/main/rust/g0001_0100/s0076_minimum_window_substring/Solution.rs b/src/main/rust/g0001_0100/s0076_minimum_window_substring/Solution.rs index 29b9b680..280fc96b 100644 --- a/src/main/rust/g0001_0100/s0076_minimum_window_substring/Solution.rs +++ b/src/main/rust/g0001_0100/s0076_minimum_window_substring/Solution.rs @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window -// #Level_2_Day_14_Sliding_Window/Two_Pointer #Big_O_Time_O(s.length())_Space_O(1) -// #2024_09_07_Time_0_ms_(100.00%)_Space_2.4_MB_(32.56%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_09_07_Time_0_ms_(100.00%)_Space_2.4_MB_(32.56%) impl Solution { pub fn min_window(s: String, t: String) -> String { diff --git a/src/main/rust/g0001_0100/s0079_word_search/Solution.rs b/src/main/rust/g0001_0100/s0079_word_search/Solution.rs index 3a6079e7..37b2beb5 100644 --- a/src/main/rust/g0001_0100/s0079_word_search/Solution.rs +++ b/src/main/rust/g0001_0100/s0079_word_search/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Big_O_Time_O(4^(m*n))_Space_O(m*n) -// #2024_09_08_Time_1_ms_(99.28%)_Space_2.1_MB_(93.53%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_09_08_Time_1_ms_(99.28%)_Space_2.1_MB_(93.53%) impl Solution { pub fn exist(mut board: Vec>, word: String) -> bool { diff --git a/src/main/rust/g0001_0100/s0098_validate_binary_search_tree/Solution.rs b/src/main/rust/g0001_0100/s0098_validate_binary_search_tree/Solution.rs index e30327db..cdc4d0d3 100644 --- a/src/main/rust/g0001_0100/s0098_validate_binary_search_tree/Solution.rs +++ b/src/main/rust/g0001_0100/s0098_validate_binary_search_tree/Solution.rs @@ -1,4 +1,7 @@ -// #Medium #String #Dynamic_Programming #2024_09_08_Time_1_ms_(77.46%)_Space_2.2_MB_(26.76%) +// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree +// #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_09_08_Time_1_ms_(77.46%)_Space_2.2_MB_(26.76%) impl Solution { pub fn is_interleave(s1: String, s2: String, s3: String) -> bool { diff --git a/src/main/rust/g0101_0200/s0101_symmetric_tree/Solution.rs b/src/main/rust/g0101_0200/s0101_symmetric_tree/Solution.rs index c61af572..a84ac5ae 100644 --- a/src/main/rust/g0101_0200/s0101_symmetric_tree/Solution.rs +++ b/src/main/rust/g0101_0200/s0101_symmetric_tree/Solution.rs @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search // #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree -// #Big_O_Time_O(N)_Space_O(log(N)) #2024_09_08_Time_0_ms_(100.00%)_Space_2.2_MB_(78.98%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_09_08_Time_0_ms_(100.00%)_Space_2.2_MB_(78.98%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.rs b/src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.rs index d64db1c1..b119aaa6 100644 --- a/src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.rs +++ b/src/main/rust/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree // #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(N) #2024_09_08_Time_1_ms_(80.61%)_Space_2.4_MB_(24.49%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_09_08_Time_1_ms_(80.61%)_Space_2.4_MB_(24.49%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rs b/src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rs index c8ef7243..619b9920 100644 --- a/src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rs +++ b/src/main/rust/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rs @@ -1,7 +1,8 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(N)_Space_O(H) #2024_09_08_Time_1_ms_(80.46%)_Space_2.7_MB_(50.19%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_09_08_Time_1_ms_(80.46%)_Space_2.7_MB_(50.19%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.rs b/src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.rs index dd08ba06..cdd09adc 100644 --- a/src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.rs +++ b/src/main/rust/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree -// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Big_O_Time_O(N)_Space_O(N) -// #2024_09_08_Time_2_ms_(84.72%)_Space_2.9_MB_(25.00%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_09_08_Time_2_ms_(84.72%)_Space_2.9_MB_(25.00%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.rs b/src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.rs index 958dc635..711c9be7 100644 --- a/src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.rs +++ b/src/main/rust/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.rs @@ -1,4 +1,5 @@ -// #Medium #Array #Hash_Table #Tree #Binary_Tree #Divide_and_Conquer +// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) // #2024_09_08_Time_0_ms_(100.00%)_Space_2.7_MB_(50.00%) // Definition for a binary tree node. diff --git a/src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.rs b/src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.rs index 77fede42..f36351d5 100644 --- a/src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.rs +++ b/src/main/rust/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.rs @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming // #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays -// #Big_O_Time_O(N)_Space_O(1) #2024_09_09_Time_3_ms_(98.62%)_Space_3_MB_(9.92%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_09_09_Time_3_ms_(98.62%)_Space_3_MB_(9.92%) impl Solution { diff --git a/src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.rs b/src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.rs index af16d577..8101c550 100644 --- a/src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.rs +++ b/src/main/rust/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.rs @@ -1,6 +1,6 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search -// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(N)_Space_O(N) -// #2024_09_09_Time_0_ms_(100.00%)_Space_4.3_MB_(90.79%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_09_09_Time_0_ms_(100.00%)_Space_4.3_MB_(90.79%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0101_0200/s0128_longest_consecutive_sequence/Solution.rs b/src/main/rust/g0101_0200/s0128_longest_consecutive_sequence/Solution.rs index 88ae0b91..cb2b2f0a 100644 --- a/src/main/rust/g0101_0200/s0128_longest_consecutive_sequence/Solution.rs +++ b/src/main/rust/g0101_0200/s0128_longest_consecutive_sequence/Solution.rs @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_09_09_Time_4_ms_(99.44%)_Space_3.4_MB_(62.78%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_09_09_Time_4_ms_(99.44%)_Space_3.4_MB_(62.78%) impl Solution { pub fn longest_consecutive(nums: Vec) -> i32 { diff --git a/src/main/rust/g0101_0200/s0136_single_number/Solution.rs b/src/main/rust/g0101_0200/s0136_single_number/Solution.rs index e50ad3d0..ec8213a9 100644 --- a/src/main/rust/g0101_0200/s0136_single_number/Solution.rs +++ b/src/main/rust/g0101_0200/s0136_single_number/Solution.rs @@ -1,5 +1,6 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation // #Big_O_Time_O(N)_Space_O(1) #2024_09_09_Time_0_ms_(100.00%)_Space_2.2_MB_(45.48%) impl Solution { diff --git a/src/main/rust/g0101_0200/s0139_word_break/Solution.rs b/src/main/rust/g0101_0200/s0139_word_break/Solution.rs index 6258884e..c1776843 100644 --- a/src/main/rust/g0101_0200/s0139_word_break/Solution.rs +++ b/src/main/rust/g0101_0200/s0139_word_break/Solution.rs @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table // #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming -// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Big_O_Time_O(M+max*N)_Space_O(M+N+max) -// #2024_09_09_Time_0_ms_(100.00%)_Space_2.2_MB_(77.19%) +// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_09_09_Time_0_ms_(100.00%)_Space_2.2_MB_(77.19%) impl Solution { pub fn word_break(s: String, word_dict: Vec) -> bool { diff --git a/src/main/rust/g0101_0200/s0146_lru_cache/LRUCache.rs b/src/main/rust/g0101_0200/s0146_lru_cache/LRUCache.rs index 2d89a3ed..0ec9b4a1 100644 --- a/src/main/rust/g0101_0200/s0146_lru_cache/LRUCache.rs +++ b/src/main/rust/g0101_0200/s0146_lru_cache/LRUCache.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List -// #Doubly_Linked_List #Udemy_Linked_List #Big_O_Time_O(1)_Space_O(capacity) -// #2024_09_09_Time_90_ms_(75.18%)_Space_104_MB_(9.93%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_09_09_Time_90_ms_(75.18%)_Space_104_MB_(9.93%) struct LRUCache { map: HashMap>>, diff --git a/src/main/rust/g0101_0200/s0148_sort_list/Solution.rs b/src/main/rust/g0101_0200/s0148_sort_list/Solution.rs index 58f6b2fc..0a5cc364 100644 --- a/src/main/rust/g0101_0200/s0148_sort_list/Solution.rs +++ b/src/main/rust/g0101_0200/s0148_sort_list/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List -// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Big_O_Time_O(log(N))_Space_O(log(N)) -// #2024_09_09_Time_21_ms_(81.82%)_Space_6.3_MB_(22.73%) +// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_09_09_Time_21_ms_(81.82%)_Space_6.3_MB_(22.73%) impl Solution { pub fn sort_list(mut head: Option>) -> Option> { diff --git a/src/main/rust/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.rs b/src/main/rust/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.rs index 65acbb88..463008d1 100644 --- a/src/main/rust/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.rs +++ b/src/main/rust/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search -// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Big_O_Time_O(log_N)_Space_O(log_N) -// #2024_09_09_Time_1_ms_(77.10%)_Space_2.1_MB_(96.95%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_09_09_Time_1_ms_(77.10%)_Space_2.1_MB_(96.95%) impl Solution { pub fn find_min(nums: Vec) -> i32 { diff --git a/src/main/rust/g0101_0200/s0155_min_stack/MinStack.rs b/src/main/rust/g0101_0200/s0155_min_stack/MinStack.rs index 8509cb1a..ab8855b0 100644 --- a/src/main/rust/g0101_0200/s0155_min_stack/MinStack.rs +++ b/src/main/rust/g0101_0200/s0155_min_stack/MinStack.rs @@ -1,6 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design // #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design -// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2024_09_10_Time_0_ms_(100.00%)_Space_5.9_MB_(71.62%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2024_09_10_Time_0_ms_(100.00%)_Space_5.9_MB_(71.62%) pub struct MinStack { current_node: Option>, diff --git a/src/main/rust/g0101_0200/s0169_majority_element/Solution.rs b/src/main/rust/g0101_0200/s0169_majority_element/Solution.rs index ee14b5a7..9259bf20 100644 --- a/src/main/rust/g0101_0200/s0169_majority_element/Solution.rs +++ b/src/main/rust/g0101_0200/s0169_majority_element/Solution.rs @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting // #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm -// #Big_O_Time_O(n)_Space_O(1) #2024_09_10_Time_1_ms_(82.64%)_Space_2.5_MB_(18.91%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_09_10_Time_1_ms_(82.64%)_Space_2.5_MB_(18.91%) impl Solution { pub fn majority_element(arr: Vec) -> i32 { diff --git a/src/main/rust/g0101_0200/s0189_rotate_array/Solution.rs b/src/main/rust/g0101_0200/s0189_rotate_array/Solution.rs index 7e2c4eb4..b9cf035e 100644 --- a/src/main/rust/g0101_0200/s0189_rotate_array/Solution.rs +++ b/src/main/rust/g0101_0200/s0189_rotate_array/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers -// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1) -// #2024_09_10_Time_3_ms_(96.69%)_Space_3.6_MB_(76.46%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_09_10_Time_3_ms_(96.69%)_Space_3.6_MB_(76.46%) impl Solution { pub fn rotate(nums: &mut Vec, k: i32) { diff --git a/src/main/rust/g0101_0200/s0198_house_robber/Solution.rs b/src/main/rust/g0101_0200/s0198_house_robber/Solution.rs index 6c844649..cd8f1423 100644 --- a/src/main/rust/g0101_0200/s0198_house_robber/Solution.rs +++ b/src/main/rust/g0101_0200/s0198_house_robber/Solution.rs @@ -1,7 +1,7 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2024_09_10_Time_0_ms_(100.00%)_Space_2.1_MB_(31.95%) +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_09_10_Time_0_ms_(100.00%)_Space_2.1_MB_(31.95%) impl Solution { pub fn rob(nums: Vec) -> i32 { diff --git a/src/main/rust/g0101_0200/s0200_number_of_islands/Solution.rs b/src/main/rust/g0101_0200/s0200_number_of_islands/Solution.rs index 5ae54e0c..63e7cd2b 100644 --- a/src/main/rust/g0101_0200/s0200_number_of_islands/Solution.rs +++ b/src/main/rust/g0101_0200/s0200_number_of_islands/Solution.rs @@ -2,7 +2,8 @@ // #Breadth_First_Search #Matrix #Union_Find // #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search // #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph -// #Big_O_Time_O(M*N)_Space_O(M*N) #2024_09_10_Time_7_ms_(86.79%)_Space_9.1_MB_(42.14%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_09_10_Time_7_ms_(86.79%)_Space_9.1_MB_(42.14%) impl Solution { pub fn num_islands(grid: Vec>) -> i32 { @@ -56,4 +57,3 @@ impl Solution { num_of_islands } } - diff --git a/src/main/rust/g0201_0300/s0206_reverse_linked_list/Solution.rs b/src/main/rust/g0201_0300/s0206_reverse_linked_list/Solution.rs index d71232a0..545820ab 100644 --- a/src/main/rust/g0201_0300/s0206_reverse_linked_list/Solution.rs +++ b/src/main/rust/g0201_0300/s0206_reverse_linked_list/Solution.rs @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2024_09_10_Time_0_ms_(100.00%)_Space_2.5_MB_(14.14%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_09_10_Time_0_ms_(100.00%)_Space_2.5_MB_(14.14%) // Definition for singly-linked list. // #[derive(PartialEq, Eq, Clone, Debug)] diff --git a/src/main/rust/g0201_0300/s0207_course_schedule/Solution.rs b/src/main/rust/g0201_0300/s0207_course_schedule/Solution.rs index af210a89..8f1d0768 100644 --- a/src/main/rust/g0201_0300/s0207_course_schedule/Solution.rs +++ b/src/main/rust/g0201_0300/s0207_course_schedule/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search -// #Breadth_First_Search #Graph #Topological_Sort #Big_O_Time_O(N)_Space_O(N) -// #2024_09_10_Time_0_ms_(100.00%)_Space_2.6_MB_(47.48%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_09_10_Time_0_ms_(100.00%)_Space_2.6_MB_(47.48%) impl Solution { const WHITE: i32 = 0; diff --git a/src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rs b/src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rs index 24160de7..7b12bc2a 100644 --- a/src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rs +++ b/src/main/rust/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rs @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2024_09_10_Time_13_ms_(90.59%)_Space_9_MB_(97.65%) diff --git a/src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rs b/src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rs index d6e19f68..f858d9c4 100644 --- a/src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rs +++ b/src/main/rust/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rs @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap // #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_09_10_Time_10_ms_(90.24%)_Space_3.2_MB_(22.76%) impl Solution { diff --git a/src/main/rust/g0201_0300/s0221_maximal_square/Solution.rs b/src/main/rust/g0201_0300/s0221_maximal_square/Solution.rs index 6e6b7fd6..5c7964c0 100644 --- a/src/main/rust/g0201_0300/s0221_maximal_square/Solution.rs +++ b/src/main/rust/g0201_0300/s0221_maximal_square/Solution.rs @@ -1,5 +1,6 @@ // #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16 -// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_09_10_Time_16_ms_(88.89%)_Space_9.3_MB_(81.48%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_09_10_Time_16_ms_(88.89%)_Space_9.3_MB_(81.48%) impl Solution { pub fn maximal_square(matrix: Vec>) -> i32 { diff --git a/src/main/rust/g0201_0300/s0226_invert_binary_tree/Solution.rs b/src/main/rust/g0201_0300/s0226_invert_binary_tree/Solution.rs index 4c1617e7..2a36d2d0 100644 --- a/src/main/rust/g0201_0300/s0226_invert_binary_tree/Solution.rs +++ b/src/main/rust/g0201_0300/s0226_invert_binary_tree/Solution.rs @@ -1,6 +1,7 @@ // #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree // #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue -// #Big_O_Time_O(n)_Space_O(n) #2024_09_11_Time_0_ms_(100.00%)_Space_2_MB_(77.66%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_09_11_Time_0_ms_(100.00%)_Space_2_MB_(77.66%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.rs b/src/main/rust/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.rs index 3126c33f..5d8d4c1c 100644 --- a/src/main/rust/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.rs +++ b/src/main/rust/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.rs @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree -// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) +// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree +// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) // #2024_09_11_Time_0_ms_(100.00%)_Space_3.1_MB_(15.07%) // Definition for a binary tree node. diff --git a/src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.rs b/src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.rs index a32904b9..b2fe1747 100644 --- a/src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.rs +++ b/src/main/rust/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.rs @@ -1,5 +1,6 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) // #2024_09_11_Time_0_ms_(100.00%)_Space_4.2_MB_(31.48%) // Definition for a binary tree node. diff --git a/src/main/rust/g0201_0300/s0238_product_of_array_except_self/Solution.rs b/src/main/rust/g0201_0300/s0238_product_of_array_except_self/Solution.rs index dff6ae60..33c84306 100644 --- a/src/main/rust/g0201_0300/s0238_product_of_array_except_self/Solution.rs +++ b/src/main/rust/g0201_0300/s0238_product_of_array_except_self/Solution.rs @@ -1,4 +1,5 @@ -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String // #Big_O_Time_O(n^2)_Space_O(n) #2024_09_11_Time_8_ms_(87.13%)_Space_3.2_MB_(89.17%) impl Solution { diff --git a/src/main/rust/g0201_0300/s0283_move_zeroes/Solution.rs b/src/main/rust/g0201_0300/s0283_move_zeroes/Solution.rs index 9b57b9b0..a7c1f9fb 100644 --- a/src/main/rust/g0201_0300/s0283_move_zeroes/Solution.rs +++ b/src/main/rust/g0201_0300/s0283_move_zeroes/Solution.rs @@ -1,6 +1,6 @@ -// #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) -// #2024_09_11_Time_0_ms_(100.00%)_Space_2.3_MB_(81.98%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2024_09_11_Time_0_ms_(100.00%)_Space_2.3_MB_(81.98%) impl Solution { pub fn move_zeroes(nums: &mut Vec) { diff --git a/src/main/rust/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.rs b/src/main/rust/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.rs index 0d7e8e0f..01421176 100644 --- a/src/main/rust/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.rs +++ b/src/main/rust/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.rs @@ -1,5 +1,6 @@ // #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream -// #Big_O_Time_O(n*log_n)_Space_O(n) #2024_09_11_Time_58_ms_(99.02%)_Space_23.2_MB_(84.31%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_09_11_Time_58_ms_(99.02%)_Space_23.2_MB_(84.31%) use std::collections::BinaryHeap; use std::cmp::Reverse; diff --git a/src/main/rust/g0201_0300/s0300_longest_increasing_subsequence/Solution.rs b/src/main/rust/g0201_0300/s0300_longest_increasing_subsequence/Solution.rs index 0a9ddd35..693ec276 100644 --- a/src/main/rust/g0201_0300/s0300_longest_increasing_subsequence/Solution.rs +++ b/src/main/rust/g0201_0300/s0300_longest_increasing_subsequence/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search // #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18 -// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n) +// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) // #2024_09_12_Time_0_ms_(100.00%)_Space_2.1_MB_(100.00%) impl Solution { diff --git a/src/main/rust/g0301_0400/s0322_coin_change/Solution.rs b/src/main/rust/g0301_0400/s0322_coin_change/Solution.rs index 53af2fac..0eddfade 100644 --- a/src/main/rust/g0301_0400/s0322_coin_change/Solution.rs +++ b/src/main/rust/g0301_0400/s0322_coin_change/Solution.rs @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20 -// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount) +// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) // #2024_09_12_Time_3_ms_(100.00%)_Space_2.2_MB_(69.95%) impl Solution { diff --git a/src/main/rust/g0301_0400/s0338_counting_bits/Solution.rs b/src/main/rust/g0301_0400/s0338_counting_bits/Solution.rs index 13255f11..184793d1 100644 --- a/src/main/rust/g0301_0400/s0338_counting_bits/Solution.rs +++ b/src/main/rust/g0301_0400/s0338_counting_bits/Solution.rs @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_09_12_Time_0_ms_(100.00%)_Space_2.6_MB_(15.06%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_09_12_Time_0_ms_(100.00%)_Space_2.6_MB_(15.06%) impl Solution { pub fn count_bits(num: i32) -> Vec { diff --git a/src/main/rust/g0301_0400/s0394_decode_string/Solution.rs b/src/main/rust/g0301_0400/s0394_decode_string/Solution.rs index 0fd6f80d..9e81b9dc 100644 --- a/src/main/rust/g0301_0400/s0394_decode_string/Solution.rs +++ b/src/main/rust/g0301_0400/s0394_decode_string/Solution.rs @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2024_09_12_Time_0_ms_(100.00%)_Space_2.1_MB_(24.04%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2024_09_12_Time_0_ms_(100.00%)_Space_2.1_MB_(24.04%) impl Solution { pub fn decode_string(s: String) -> String { diff --git a/src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs b/src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs index 200b9d34..fabc05db 100644 --- a/src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs +++ b/src/main/rust/g0401_0500/s0437_path_sum_iii/Solution.rs @@ -1,5 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2024_09_12_Time_0_ms_(100.00%)_Space_4.7_MB_(10.42%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2024_09_12_Time_0_ms_(100.00%)_Space_4.7_MB_(10.42%) // Definition for a binary tree node. // #[derive(Debug, PartialEq, Eq)] diff --git a/src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs b/src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs index b864e586..91bb5d15 100644 --- a/src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs +++ b/src/main/rust/g0701_0800/s0739_daily_temperatures/Solution.rs @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2024_09_13_Time_33_ms_(91.80%)_Space_3.4_MB_(99.45%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2024_09_13_Time_33_ms_(91.80%)_Space_3.4_MB_(99.45%) impl Solution { pub fn daily_temperatures(temperatures: Vec) -> Vec { diff --git a/src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs b/src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs index da976410..3fcb8f2c 100644 --- a/src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs +++ b/src/main/rust/g1101_1200/s1143_longest_common_subsequence/Solution.rs @@ -1,4 +1,4 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2024_09_13_Time_4_ms_(78.99%)_Space_5.8_MB_(55.07%) diff --git a/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts b/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts index eee9f4e6..ae37aeab 100644 --- a/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts +++ b/src/main/ts/g0001_0100/s0002_add_two_numbers/solution.ts @@ -5,7 +5,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts b/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts index dca9c4c4..29a6a7af 100644 --- a/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts +++ b/src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers -// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2025_03_22_Time_2_ms_(80.13%)_Space_65.63_MB_(10.65%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2025_03_22_Time_2_ms_(80.13%)_Space_65.63_MB_(10.65%) function maxArea(height: number[]): number { let maxArea = -1 diff --git a/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts b/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts index 32a7978a..7bf7035c 100644 --- a/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts +++ b/src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking -// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion -// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) +// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n) // #2025_03_22_Time_0_ms_(100.00%)_Space_56.27_MB_(8.55%) function letterCombinations(digits: string): string[] { diff --git a/src/main/ts/g0001_0100/s0023_merge_k_sorted_lists/solution.ts b/src/main/ts/g0001_0100/s0023_merge_k_sorted_lists/solution.ts index 13212d91..49e2d659 100644 --- a/src/main/ts/g0001_0100/s0023_merge_k_sorted_lists/solution.ts +++ b/src/main/ts/g0001_0100/s0023_merge_k_sorted_lists/solution.ts @@ -4,7 +4,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts b/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts index ca349e00..3723344f 100644 --- a/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts +++ b/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts @@ -6,15 +6,14 @@ */ function nextPermutation(nums: number[]): void { let swapperIndex: number | null = null - for (let ind = nums.length - 1; ind >= 0 && swapperIndex == null; ind--) { if (nums[ind] > nums[ind - 1]) { swapperIndex = ind - 1 } } - - if (swapperIndex == null) nums.sort((a, b) => a - b) - else { + if (swapperIndex == null) { + nums.sort((a, b) => a - b) + } else { nums.splice(swapperIndex + 1, nums.length, ...nums.slice(swapperIndex + 1, nums.length).sort((a, b) => a - b)) let indToBringForward = swapperIndex + 1 while (nums[indToBringForward] <= nums[swapperIndex]) ++indToBringForward diff --git a/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts b/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts index 11c348dc..49c99a2f 100644 --- a/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts +++ b/src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts @@ -9,7 +9,6 @@ function searchRange(nums: number[], target: number): number[] { //NOSONAR let left2 = left1 let right1 = nums.length - 1 let right2 = right1 - while (left1 <= right1 || left2 <= right2) { if (left1 <= right1) { let mid1 = Math.floor((left1 + right1) / 2) @@ -22,7 +21,6 @@ function searchRange(nums: number[], target: number): number[] { //NOSONAR right1 = mid1 - 1 } } - if (left2 <= right2) { let mid2 = Math.floor((left2 + right2) / 2) if (nums[mid2] == target) { diff --git a/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts b/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts index 0b8c1830..c518fdfb 100644 --- a/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts +++ b/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts @@ -6,7 +6,6 @@ function combinationSum(candidates: number[], target: number): number[][] { const result: number[][] = [] const path: number[] = [] - const comFunct = (index: number, sum: number) => { if (sum === target) { result.push([...path]) diff --git a/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts b/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts index 800e7105..ba92f55c 100644 --- a/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts +++ b/src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts @@ -13,8 +13,9 @@ function jump(nums: number[]): number { if (i === currentEnd) { minJump++ currentEnd = farthest - - if (currentEnd >= nums.length - 1) break + if (currentEnd >= nums.length - 1) { + break + } } } return minJump diff --git a/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts b/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts index 3d650eb7..6a301ddf 100644 --- a/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts +++ b/src/main/ts/g0001_0100/s0062_unique_paths/solution.ts @@ -1,7 +1,7 @@ // #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) -// #2025_03_23_Time_0_ms_(100.00%)_Space_55.15_MB_(43.54%) +// #Combinatorics #LeetCode_75_DP/Multidimensional #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) #2025_03_23_Time_0_ms_(100.00%)_Space_55.15_MB_(43.54%) function uniquePaths(m: number, n: number): number { let aboveRow = Array(n).fill(1) diff --git a/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts b/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts index c6110a2a..305252fe 100644 --- a/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts +++ b/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts @@ -4,9 +4,15 @@ // #Big_O_Time_O(n)_Space_O(n) #2025_03_23_Time_0_ms_(100.00%)_Space_56.23_MB_(5.15%) function climbStairs(n: number, memo: Record = {}): number { - if (n in memo) return memo[n] - if (n === 0) return 1 - if (n < 0) return 0 + if (n in memo) { + return memo[n] + } + if (n === 0) { + return 1 + } + if (n < 0) { + return 0 + } memo[n] = climbStairs(n - 1, memo) + climbStairs(n - 2, memo) return memo[n] } diff --git a/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts b/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts index d4d3d491..e6c74631 100644 --- a/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts +++ b/src/main/ts/g0001_0100/s0072_edit_distance/solution.ts @@ -1,4 +1,4 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) // #2025_03_23_Time_6_ms_(93.83%)_Space_61.09_MB_(45.68%) @@ -8,7 +8,9 @@ function minDistance(word1: string, word2: string): number { const l1 = word1.length const l2 = word2.length const dfs = (w1: number, w2: number): number => { - if (memo[w1][w2] != undefined) return memo[w1][w2] + if (memo[w1][w2] != undefined) { + return memo[w1][w2] + } if (w1 == l1 && w2 == l2) { memo[w1][w2] = 0 return 0 diff --git a/src/main/ts/g0001_0100/s0078_subsets/solution.ts b/src/main/ts/g0001_0100/s0078_subsets/solution.ts index 8e558971..5a9c3617 100644 --- a/src/main/ts/g0001_0100/s0078_subsets/solution.ts +++ b/src/main/ts/g0001_0100/s0078_subsets/solution.ts @@ -4,7 +4,9 @@ function subsets(nums: number[]): number[][] { const sets: number[][] = [[]] - for (const num of nums) sets.push(...sets.map((set) => [...set, num])) + for (const num of nums) { + sets.push(...sets.map((set) => [...set, num])) + } return sets } diff --git a/src/main/ts/g0001_0100/s0079_word_search/solution.ts b/src/main/ts/g0001_0100/s0079_word_search/solution.ts index f06c1a9d..e6f40c40 100644 --- a/src/main/ts/g0001_0100/s0079_word_search/solution.ts +++ b/src/main/ts/g0001_0100/s0079_word_search/solution.ts @@ -12,7 +12,6 @@ function exist(board: string[][], word: string): boolean { if (loop(marks, board, i, j, word, 0)) return true } } - return ret } @@ -31,28 +30,29 @@ function loop(marks: boolean[][], board: string[][], i: number, j: number, word: if (i < 0 || j < 0 || i >= board.length || j >= board[i].length || marks[i][j]) { return false } - if (board[i][j] !== word.charAt(index)) { return false } else if (index === word.length - 1) { return true } - marks[i][j] = true index++ - let r = loop(marks, board, i - 1, j, word, index) - if (r) return true - + if (r) { + return true + } r = loop(marks, board, i + 1, j, word, index) - if (r) return true - + if (r) { + return true + } r = loop(marks, board, i, j - 1, word, index) - if (r) return true - + if (r) { + return true + } r = loop(marks, board, i, j + 1, word, index) - if (r) return true - + if (r) { + return true + } marks[i][j] = false return false } diff --git a/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts b/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts index f0b4f6e2..7f888547 100644 --- a/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts +++ b/src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal/solution.ts @@ -4,7 +4,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number @@ -18,8 +18,12 @@ import { TreeNode } from '../../com_github_leetcode/treenode' * } */ function inorderTraversal(root: TreeNode | null): number[] { - if (!root) return [] - if (!root.val) return [] + if (!root) { + return [] + } + if (!root.val) { + return [] + } const result: number[] = [] function traverse(node: TreeNode, arr: number[]) { if (node.left) { diff --git a/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts b/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts index 13cca780..93a58d73 100644 --- a/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts +++ b/src/main/ts/g0001_0100/s0098_validate_binary_search_tree/solution.ts @@ -5,10 +5,29 @@ import { TreeNode } from '../../com_github_leetcode/treenode' +/** + * Definition for a binary tree node. + * class TreeNode { + * val: number + * left: TreeNode | null + * right: TreeNode | null + * constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) { + * this.val = (val===undefined ? 0 : val) + * this.left = (left===undefined ? null : left) + * this.right = (right===undefined ? null : right) + * } + * } + */ function dfs(node: TreeNode | null, lowerBound: number, upperBound: number): boolean { - if (!node) return true - if (node.val <= lowerBound) return false - if (node.val >= upperBound) return false + if (!node) { + return true + } + if (node.val <= lowerBound) { + return false + } + if (node.val >= upperBound) { + return false + } return dfs(node.left, lowerBound, node.val) && dfs(node.right, node.val, upperBound) } diff --git a/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts b/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts index 830ea3a8..ebb30654 100644 --- a/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts +++ b/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts @@ -5,7 +5,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number @@ -19,14 +19,20 @@ import { TreeNode } from '../../com_github_leetcode/treenode' * } */ function isSymmetric(root: TreeNode | null): boolean { - if (!root.left && !root.right) return true + if (!root.left && !root.right) { + return true + } const queue: [TreeNode, TreeNode][] = [[root.left, root.right]] while (queue.length > 0) { let qLen: number = queue.length while (qLen-- > 0) { const [leftNode, rightNode] = queue.shift() - if (!leftNode && !rightNode) continue - if (!leftNode || !rightNode || leftNode.val != rightNode.val) return false + if (!leftNode && !rightNode) { + continue + } + if (!leftNode || !rightNode || leftNode.val != rightNode.val) { + return false + } queue.push([leftNode.left, rightNode.right]) queue.push([leftNode.right, rightNode.left]) } diff --git a/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts b/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts index 1764202b..b9811582 100644 --- a/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts +++ b/src/main/ts/g0101_0200/s0102_binary_tree_level_order_traversal/solution.ts @@ -5,7 +5,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number @@ -19,7 +19,9 @@ import { TreeNode } from '../../com_github_leetcode/treenode' * } */ function levelOrder(root: TreeNode | null): number[][] { - if (root == null) return [] + if (root == null) { + return [] + } let queue = [root] let result = [] while (queue.length != 0) { @@ -28,8 +30,12 @@ function levelOrder(root: TreeNode | null): number[][] { while (length > 0) { let node = queue.shift() subResult.push(node.val) - if (node.left != null) queue.push(node.left) - if (node.right != null) queue.push(node.right) + if (node.left != null) { + queue.push(node.left) + } + if (node.right != null) { + queue.push(node.right) + } length-- } result.push(subResult) diff --git a/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts b/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts index 5a8f1585..7d59ff9e 100644 --- a/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts +++ b/src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts @@ -1,12 +1,12 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search -// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree +// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree // #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue // #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) // #2025_03_26_Time_0_ms_(100.00%)_Space_59.10_MB_(43.48%) import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts b/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts index 0c7ac6ad..c99fb0ec 100644 --- a/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts +++ b/src/main/ts/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.ts @@ -4,7 +4,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts b/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts index c33e52b7..5315d0e5 100644 --- a/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts +++ b/src/main/ts/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.ts @@ -4,7 +4,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts b/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts index eb6995de..887e1d21 100644 --- a/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts +++ b/src/main/ts/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.ts @@ -4,7 +4,7 @@ import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0101_0200/s0128_longest_consecutive_sequence/solution.ts b/src/main/ts/g0101_0200/s0128_longest_consecutive_sequence/solution.ts index 4519a5dd..6a786038 100644 --- a/src/main/ts/g0101_0200/s0128_longest_consecutive_sequence/solution.ts +++ b/src/main/ts/g0101_0200/s0128_longest_consecutive_sequence/solution.ts @@ -7,9 +7,9 @@ function longestConsecutive(nums: number[]): number { let maxLen = 0 for (let num of sset) { // check its start of the sequence - if (!sset.has(num-1)) { - let len = 0; - while (sset.has(num+len)) { + if (!sset.has(num - 1)) { + let len = 0 + while (sset.has(num + len)) { len += 1 } maxLen = Math.max(maxLen, len) diff --git a/src/main/ts/g0101_0200/s0136_single_number/solution.ts b/src/main/ts/g0101_0200/s0136_single_number/solution.ts index 6e15ea3a..886fb236 100644 --- a/src/main/ts/g0101_0200/s0136_single_number/solution.ts +++ b/src/main/ts/g0101_0200/s0136_single_number/solution.ts @@ -1,7 +1,7 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation -// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers -// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1) -// #2025_03_26_Time_1_ms_(78.27%)_Space_58.44_MB_(41.08%) +// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array +// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation +// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_1_ms_(78.27%)_Space_58.44_MB_(41.08%) function singleNumber(nums: number[]): number { let ans = 0 diff --git a/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts b/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts index 27c00597..0e9542ce 100644 --- a/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts +++ b/src/main/ts/g0101_0200/s0138_copy_list_with_random_pointer/solution.ts @@ -4,7 +4,7 @@ import { Node } from '../../com_github_leetcode/node' -/* +/** * Definition for Node. * class Node { * val: number diff --git a/src/main/ts/g0101_0200/s0139_word_break/solution.ts b/src/main/ts/g0101_0200/s0139_word_break/solution.ts index 67b914f6..9088d597 100644 --- a/src/main/ts/g0101_0200/s0139_word_break/solution.ts +++ b/src/main/ts/g0101_0200/s0139_word_break/solution.ts @@ -5,14 +5,18 @@ function wordBreak(s: string, wordDict: string[]): boolean { const dp: boolean[] = [] - for (let i = 0; i <= s.length; i++) dp.push(false) + for (let i = 0; i <= s.length; i++) { + dp.push(false) + } dp[s.length] = true for (let j = s.length - 1; j >= 0; j--) { for (const word of wordDict) { if (s.slice(j, j + word.length) === word && j + word.length <= s.length) { dp[j] = dp[j + word.length] } - if (dp[j]) break + if (dp[j]) { + break + } } } return dp[0] diff --git a/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts b/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts index 282483e9..f2d14590 100644 --- a/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts +++ b/src/main/ts/g0101_0200/s0141_linked_list_cycle/solution.ts @@ -4,7 +4,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number @@ -20,7 +20,9 @@ function hasCycle(head: ListNode | null): boolean { while (fast?.next) { head = head.next fast = fast.next.next - if (head === fast) return true + if (head === fast) { + return true + } } return false } diff --git a/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts b/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts index 76b39d2c..481a1b11 100644 --- a/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts +++ b/src/main/ts/g0101_0200/s0142_linked_list_cycle_ii/solution.ts @@ -4,7 +4,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number @@ -18,7 +18,9 @@ import { ListNode } from '../../com_github_leetcode/listnode' function detectCycle(head: ListNode | null): ListNode | null { const set = new Set() while (head) { - if (set.has(head)) return head + if (set.has(head)) { + return head + } set.add(head) head = head.next } diff --git a/src/main/ts/g0101_0200/s0148_sort_list/solution.ts b/src/main/ts/g0101_0200/s0148_sort_list/solution.ts index a2a5988c..75067693 100644 --- a/src/main/ts/g0101_0200/s0148_sort_list/solution.ts +++ b/src/main/ts/g0101_0200/s0148_sort_list/solution.ts @@ -4,7 +4,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number @@ -17,7 +17,9 @@ import { ListNode } from '../../com_github_leetcode/listnode' */ function sortList(head: ListNode | null): ListNode | null { - if (!head) return null + if (!head) { + return null + } let array = [] while (head) { array.push([head, head.val]) diff --git a/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts b/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts index 18faf5d3..632dcbc0 100644 --- a/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts +++ b/src/main/ts/g0101_0200/s0160_intersection_of_two_linked_lists/solution.ts @@ -4,7 +4,7 @@ import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0101_0200/s0198_house_robber/solution.ts b/src/main/ts/g0101_0200/s0198_house_robber/solution.ts index 5340eb81..11753e64 100644 --- a/src/main/ts/g0101_0200/s0198_house_robber/solution.ts +++ b/src/main/ts/g0101_0200/s0198_house_robber/solution.ts @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming -// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 +// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3 // #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP // #Big_O_Time_O(n)_Space_O(n) #2025_03_26_Time_0_ms_(100.00%)_Space_55.74_MB_(28.06%) diff --git a/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts b/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts index 5f0eb57e..12b2ca0f 100644 --- a/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts +++ b/src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts @@ -1,11 +1,11 @@ // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion -// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking -// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1) -// #2025_03_26_Time_0_ms_(100.00%)_Space_58.92_MB_(16.01%) +// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List +// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_0_ms_(100.00%)_Space_58.92_MB_(16.01%) import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts b/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts index 7ca00b46..1b23ff34 100644 --- a/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts +++ b/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts @@ -26,7 +26,6 @@ function hasCycle(adj: number[][], node: number, colors: number[]): boolean { if (colors[nei] === GRAY) { return true } - if (colors[nei] === WHITE && hasCycle(adj, nei, colors)) { return true } diff --git a/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts b/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts index 53a753ec..f490b911 100644 --- a/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts +++ b/src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie -// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie +// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie // #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) // #2025_03_26_Time_48_ms_(63.95%)_Space_81.97_MB_(12.22%) diff --git a/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts b/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts index 87fa9190..cb0d0ff4 100644 --- a/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts +++ b/src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts @@ -1,13 +1,13 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue -// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue -// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n)) -// #2025_03_26_Time_4_ms_(99.64%)_Space_66.28_MB_(62.13%) +// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue +// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap +// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_03_26_Time_4_ms_(99.64%)_Space_66.28_MB_(62.13%) function findKthLargest(nums: number[], k: number): number { const countingLen = 2e4 + 1 const counting = new Int32Array(countingLen) for (const num of nums) { - counting[num + 1e4]++; + counting[num + 1e4]++ } for (let i = countingLen - 1; i >= 0; i--) { k -= counting[i] diff --git a/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts b/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts index 4bb3fc17..bc18228f 100644 --- a/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts +++ b/src/main/ts/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.ts @@ -3,7 +3,7 @@ // #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n) // #2025_03_28_Time_0_ms_(100.00%)_Space_61.27_MB_(52.69%) -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts b/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts index b9e8004c..581f652a 100644 --- a/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts +++ b/src/main/ts/g0201_0300/s0234_palindrome_linked_list/solution.ts @@ -2,7 +2,7 @@ // #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1) // #2025_03_28_Time_3_ms_(92.85%)_Space_79.85_MB_(44.75%) -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts b/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts index 7a50797d..3acdf46d 100644 --- a/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts +++ b/src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts @@ -1,8 +1,9 @@ // #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree -// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General -// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_61_ms_(75.97%)_Space_65.98_MB_(36.62%) +// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2025_03_28_Time_61_ms_(75.97%)_Space_65.98_MB_(36.62%) -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number diff --git a/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts b/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts index 6ab8a94d..b91f58a1 100644 --- a/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts +++ b/src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts @@ -1,6 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n) -// #2025_03_28_Time_3_ms_(92.81%)_Space_70.08_MB_(42.74%) +// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String +// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n^2)_Space_O(n) #2025_03_28_Time_3_ms_(92.81%)_Space_70.08_MB_(42.74%) function productExceptSelf(nums: number[]): number[] { const n = nums.length diff --git a/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts b/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts index 774c180f..236324e3 100644 --- a/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts +++ b/src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts @@ -1,6 +1,6 @@ -// #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) -// #2025_03_28_Time_1_ms_(82.86%)_Space_62.16_MB_(10.71%) +// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers +// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays +// #Big_O_Time_O(n)_Space_O(1) #2025_03_28_Time_1_ms_(82.86%)_Space_62.16_MB_(10.71%) /* Do not return anything, modify nums in-place instead. diff --git a/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts b/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts index 29b4577a..dac0ca47 100644 --- a/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts +++ b/src/main/ts/g0301_0400/s0338_counting_bits/solution.ts @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2025_03_28_Time_1_ms_(89.22%)_Space_62.26_MB_(53.31%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2025_03_28_Time_1_ms_(89.22%)_Space_62.26_MB_(53.31%) function countBits(n: number): number[] { const bits: number[] = [0] diff --git a/src/main/ts/g0301_0400/s0394_decode_string/solution.ts b/src/main/ts/g0301_0400/s0394_decode_string/solution.ts index e031a641..812511ac 100644 --- a/src/main/ts/g0301_0400/s0394_decode_string/solution.ts +++ b/src/main/ts/g0301_0400/s0394_decode_string/solution.ts @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings -// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_0_ms_(100.00%)_Space_55.70_MB_(34.63%) +// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack +// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n) +// #2025_03_28_Time_0_ms_(100.00%)_Space_55.70_MB_(34.63%) function decodeString(s: string): string { let stack: string[] = [] diff --git a/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts b/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts index 77843eba..bfea432f 100644 --- a/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts +++ b/src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts @@ -1,5 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) -// #2025_03_28_Time_3_ms_(86.41%)_Space_61.43_MB_(43.21%) +// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree +// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_3_ms_(86.41%)_Space_61.43_MB_(43.21%) function pathSum(root: TreeNode | null, targetSum: number): number { let count = 0 diff --git a/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts b/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts index e1bbbccf..65fee878 100644 --- a/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts +++ b/src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts @@ -1,5 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6 -// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_18_ms_(80.57%)_Space_78.12_MB_(62.08%) +// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack +// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n) +// #2025_03_28_Time_18_ms_(80.57%)_Space_78.12_MB_(62.08%) function dailyTemperatures(temperatures: number[]): number[] { let stack: number[] = [] diff --git a/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts b/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts index bfdf6bf9..003fafd8 100644 --- a/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts +++ b/src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts @@ -1,4 +1,4 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming +// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional // #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19 // #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m) // #2025_03_28_Time_50_ms_(69.40%)_Space_85.72_MB_(16.94%)