diff --git a/README.md b/README.md index 1921a541..f1e3e74b 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ # LeetCode-in-All -[![Maven Central](https://img.shields.io/maven-central/v/com.github.javadev/leetcode-in-all?style=flat-square)](https://central.sonatype.com/artifact/com.github.javadev/leetcode-in-all/1.7) +[![Maven Central](https://img.shields.io/maven-central/v/com.github.javadev/leetcode-in-all?style=flat-square)](https://central.sonatype.com/artifact/com.github.javadev/leetcode-in-all/1.10) [![Java CI](https://github.com/javadev/LeetCode-in-All/actions/workflows/maven.yml/badge.svg)](https://github.com/javadev/LeetCode-in-All/actions/workflows/maven.yml) [![CodeQL](https://github.com/javadev/LeetCode-in-All/actions/workflows/codeql.yml/badge.svg)](https://github.com/javadev/LeetCode-in-All/actions/workflows/codeql.yml) [![MIT License](https://img.shields.io/badge/license-MIT-green.svg)](https://github.com/javadev/LeetCode-in-All/blob/main/LICENSE) @@ -10,11 +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) ## -* [Algorithm II](#algorithm-ii) -* [Binary Search I](#binary-search-i) -* [Binary Search II](#binary-search-ii) -* [Dynamic Programming I](#dynamic-programming-i) -* [Programming Skills I](#programming-skills-i) * [Programming Skills II](#programming-skills-ii) * [Graph Theory I](#graph-theory-i) * [SQL I](#sql-i) @@ -25,1680 +20,1685 @@ * [Data Structure I](#data-structure-i) * [Data Structure II](#data-structure-ii) * [Algorithm I](#algorithm-i) +* [Algorithm II](#algorithm-ii) +* [Binary Search I](#binary-search-i) +* [Binary Search II](#binary-search-ii) +* [Dynamic Programming I](#dynamic-programming-i) +* [Programming Skills I](#programming-skills-i) -### Algorithm II - -#### Day 1 Binary Search - -| | | | | | | -|-|-|-|-|-|-|- -| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 +### Programming Skills II -#### Day 2 Binary Search +#### Day 1 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 3 Two Pointers +#### Day 2 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 4 Two Pointers +#### Day 3 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 5 Sliding Window +#### Day 4 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 -#### Day 6 Breadth First Search Depth First Search +#### Day 5 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -#### Day 7 Breadth First Search Depth First Search +#### Day 6 | | | | | | | |-|-|-|-|-|-|- +| 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 8 Breadth First Search Depth First Search +#### Day 7 | | | | | | | |-|-|-|-|-|-|- +| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 -#### Day 9 Recursion Backtracking +#### Day 8 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 10 Recursion Backtracking +#### Day 9 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 11 Recursion Backtracking +#### Day 10 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Day 12 Dynamic Programming +#### Day 11 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 13 Dynamic Programming +#### Day 12 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 -#### Day 14 Dynamic Programming +#### Day 13 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 15 Dynamic Programming +#### Day 14 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 -#### Day 16 Dynamic Programming +#### Day 15 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 100.00 -#### Day 17 Dynamic Programming +#### Day 16 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 18 Dynamic Programming +#### Day 17 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +#### Day 18 | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 20 Others +#### Day 19 | | | | | | | |-|-|-|-|-|-|- -#### Day 21 Others +#### Day 20 | | | | | | | |-|-|-|-|-|-|- -### Binary Search I +### Graph Theory I -#### Day 1 +#### Day 1 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -#### Day 2 +#### Day 2 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- -| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 3 +#### Day 3 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- -#### Day 4 +#### Day 4 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- -#### Day 5 +#### Day 5 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- -| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 6 +#### Day 6 Matrix Related Problems | | | | | | | |-|-|-|-|-|-|- -#### Day 7 +#### Day 7 Standard Traversal | | | | | | | |-|-|-|-|-|-|- -#### Day 8 +#### Day 8 Standard Traversal | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -#### Day 9 +#### Day 9 Standard Traversal | | | | | | | |-|-|-|-|-|-|- -#### Day 10 +#### Day 10 Standard Traversal | | | | | | | |-|-|-|-|-|-|- -#### Day 11 +#### Day 11 Breadth First Search | | | | | | | |-|-|-|-|-|-|- -| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 12 +#### Day 12 Breadth First Search | | | | | | | |-|-|-|-|-|-|- -| 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 13 Graph Theory | | | | | | | |-|-|-|-|-|-|- -#### Day 2 +#### Day 14 Graph Theory | | | | | | | |-|-|-|-|-|-|- -#### Day 3 +### SQL I + +#### Day 1 Select | | | | | | | |-|-|-|-|-|-|- -| 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 2 Select and Order | | | | | | | |-|-|-|-|-|-|- -#### Day 5 +#### Day 3 String Processing Functions | | | | | | | |-|-|-|-|-|-|- -| 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 4 Union and Select | | | | | | | |-|-|-|-|-|-|- -#### Day 7 +#### Day 5 Union | | | | | | | |-|-|-|-|-|-|- -#### Day 8 +#### Day 6 Union | | | | | | | |-|-|-|-|-|-|- -| 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 7 Function | | | | | | | |-|-|-|-|-|-|- -#### Day 10 +#### Day 8 Function | | | | | | | |-|-|-|-|-|-|- -#### Day 11 +#### Day 9 Control of Flow | | | | | | | |-|-|-|-|-|-|- -#### Day 12 +#### Day 10 Where | | | | | | | |-|-|-|-|-|-|- -#### Day 13 +### Level 1 + +#### Day 1 Prefix Sum | | | | | | | |-|-|-|-|-|-|- -#### Day 14 +#### Day 2 String | | | | | | | |-|-|-|-|-|-|- -#### Day 15 +#### Day 3 Linked List | | | | | | | |-|-|-|-|-|-|- +| 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, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 -#### Day 16 +#### Day 4 Linked List | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 17 +#### Day 5 Greedy | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 18 +#### Day 6 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 19 +#### Day 7 Binary Search | | | | | | | |-|-|-|-|-|-|- -#### Day 20 +#### Day 8 Binary Search Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -### Dynamic Programming I - -#### Day 1 +#### Day 9 Graph/BFS/DFS | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -#### Day 2 +#### Day 10 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- | 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 -#### Day 3 +#### Day 11 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 4 +#### Day 12 Sliding Window/Two Pointer | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 -#### Day 5 +#### Day 13 Hashmap | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 +| 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 -#### Day 6 +#### Day 14 Stack | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 7 +#### Day 15 Heap | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 8 +### Level 2 + +#### Day 1 Implementation/Simulation | | | | | | | |-|-|-|-|-|-|- -#### Day 9 +#### Day 2 String | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Day 10 +#### Day 3 Linked List | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 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, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 -#### Day 11 +#### Day 4 Linked List | | | | | | | |-|-|-|-|-|-|- -| 0096 |Unique Binary Search Trees| [Java](src/main/java/g0001_0100/s0096_unique_binary_search_trees) [Kotlin](src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees) [TypeScript](src/main/ts/g0001_0100/s0096_unique_binary_search_trees) [Scala](src/main/scala/g0001_0100/s0096_unique_binary_search_trees) [Ruby](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees) [PHP](src/main/php/g0001_0100/s0096_unique_binary_search_trees) [C#](src/main/csharp/g0001_0100/s0096_unique_binary_search_trees) [Go](src/main/go/g0001_0100/s0096_unique_binary_search_trees) [Cpp](src/main/cpp/g0001_0100/s0096_unique_binary_search_trees) [Python](src/main/python/g0001_0100/s0096_unique_binary_search_trees) [Swift](src/main/swift/g0001_0100/s0096_unique_binary_search_trees) [Elixir](src/main/elixir/g0001_0100/s0096_unique_binary_search_trees) [Rust](src/main/rust/g0001_0100/s0096_unique_binary_search_trees) [Dart](src/main/dart/g0001_0100/s0096_unique_binary_search_trees) [C](src/main/c/g0001_0100/s0096_unique_binary_search_trees) [JavaScript](src/main/js/g0001_0100/s0096_unique_binary_search_trees) [Erlang](src/main/erlang/g0001_0100/s0096_unique_binary_search_trees) [Racket](src/main/racket/g0001_0100/s0096_unique_binary_search_trees)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 +| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/g0101_0200/s0148_sort_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 -#### Day 12 +#### Day 5 Greedy | | | | | | | |-|-|-|-|-|-|- -#### Day 13 +#### Day 6 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 14 +#### Day 7 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 2 | 100.00 -#### Day 15 +#### Day 8 Binary Search | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 +| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 16 +#### Day 9 Binary Search Tree | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -#### Day 17 +#### Day 10 Graph/BFS/DFS | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 18 +#### Day 11 Graph/BFS/DFS | | | | | | | |-|-|-|-|-|-|- -| 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 19 +#### Day 12 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 20 +#### Day 13 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(n\*sums)_Space_O(n\*sums) | 5 | 99.88 +| 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 -#### Day 21 +#### Day 14 Sliding Window/Two Pointer | | | | | | | |-|-|-|-|-|-|- +| 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 +| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/g0001_0100/s0076_minimum_window_substring)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 -### Programming Skills I - -#### Day 1 Basic Data Type +#### Day 15 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 2 Operator +#### Day 16 Design | | | | | | | |-|-|-|-|-|-|- +| 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, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 -#### Day 3 Conditional Statements +#### Day 17 Interval | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 4 Loop +#### Day 18 Stack | | | | | | | |-|-|-|-|-|-|- -#### Day 5 Function +#### Day 19 Union Find | | | | | | | |-|-|-|-|-|-|- -#### Day 6 Array +#### Day 20 Brute Force/Backtracking | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 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 -#### Day 7 Array +### Udemy + +#### Udemy Integers | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(log10(x))_Space_O(1) | 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, Big_O_Time_O(log10(x))_Space_O(1) | 4 | 100.00 -#### Day 8 String +#### Udemy Strings | | | | | | | |-|-|-|-|-|-|- +| 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, 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 -#### Day 9 String +#### Udemy Binary Search | | | | | | | |-|-|-|-|-|-|- +| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 +| 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 -#### Day 10 Linked List and Tree +#### Udemy Arrays | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, 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, 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 -#### Day 11 Containers and Libraries +#### Udemy Two Pointers | | | | | | | |-|-|-|-|-|-|- +| 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 +| 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 -#### Day 12 Class and Object +#### Udemy Famous Algorithm | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 +| 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 -### Programming Skills II - -#### Day 1 +#### Udemy Sorting Algorithms | | | | | | | |-|-|-|-|-|-|- -#### Day 2 +#### Udemy 2D Arrays/Matrix | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 +| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_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, Big_O_Time_O(m\*n)_Space_O(1) | 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 3 +#### Udemy Linked List | | | | | | | |-|-|-|-|-|-|- +| 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 +| 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, 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 +| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 +| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 +| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/g0101_0200/s0146_lru_cache)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 -#### Day 4 +#### Udemy Tree Stack Queue | | | | | | | |-|-|-|-|-|-|- +| 0094 |Binary Tree Inorder Traversal| [Java](src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal) [Kotlin](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal) [TypeScript](src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal) [Scala](src/main/scala/g0001_0100/s0094_binary_tree_inorder_traversal) [Ruby](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal) [PHP](src/main/php/g0001_0100/s0094_binary_tree_inorder_traversal) [C#](src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal) [Go](src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal) [Cpp](src/main/cpp/g0001_0100/s0094_binary_tree_inorder_traversal) [Python](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal) [Swift](src/main/swift/g0001_0100/s0094_binary_tree_inorder_traversal) [Elixir](src/main/elixir/g0001_0100/s0094_binary_tree_inorder_traversal) [Rust](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal) [Dart](src/main/dart/g0001_0100/s0094_binary_tree_inorder_traversal) [C](src/main/c/g0001_0100/s0094_binary_tree_inorder_traversal) [JavaScript](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal) [Erlang](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal) [Racket](src/main/racket/g0001_0100/s0094_binary_tree_inorder_traversal)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 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, 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, 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, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 -#### Day 5 +#### 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, LeetCode_75_Trie, Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N) | 32 | 95.05 -#### Day 6 +#### Udemy Graph | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -#### Day 7 +#### Udemy Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_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, 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, 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, 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 -#### Day 8 +#### Udemy Backtracking/Recursion | | | | | | | |-|-|-|-|-|-|- +| 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, 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 -#### Day 9 +#### 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, LeetCode_75_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 2 | 96.37 -#### Day 10 +#### Udemy Design | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 11 +### Top Interview 150 + +#### Top Interview 150 Array/String | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 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 +| 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, 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, Big_O_Time_O(n)_Space_O(n) | 2 | 99.71 -#### Day 12 +#### Top Interview 150 Two Pointers | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 +| 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 -#### Day 13 +#### Top Interview 150 Sliding Window | | | | | | | |-|-|-|-|-|-|- +| 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 +| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/g0001_0100/s0076_minimum_window_substring)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 -#### Day 14 +#### Top Interview 150 Matrix | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 +| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_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, Big_O_Time_O(m\*n)_Space_O(1) | 0 | 100.00 -#### Day 15 +#### Top Interview 150 Hashmap | | | | | | | |-|-|-|-|-|-|- -| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 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 +| 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 +| 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, Big_O_Time_O(N_log_N)_Space_O(1) | 14 | 98.89 -#### Day 16 +#### Top Interview 150 Intervals | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 17 +#### Top Interview 150 Stack | | | | | | | |-|-|-|-|-|-|- +| 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 +| 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 -#### Day 18 +#### Top Interview 150 Linked List | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 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 +| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 +| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 +| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 +| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/g0101_0200/s0146_lru_cache)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 -#### Day 19 +#### Top Interview 150 Binary Tree General | | | | | | | |-|-|-|-|-|-|- +| 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, LeetCode_75_Binary_Tree/DFS, Big_O_Time_O(n)_Space_O(n) | 6 | 100.00 -#### Day 20 +#### Top Interview 150 Binary Tree BFS | | | | | | | |-|-|-|-|-|-|- +| 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 -### Graph Theory I +#### Top Interview 150 Binary Search Tree -#### Day 1 Matrix Related Problems +| | | | | | | +|-|-|-|-|-|-|- +| 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, 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 + +#### Top Interview 150 Graph General | | | | | | | |-|-|-|-|-|-|- | 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 +| 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, Big_O_Time_O(N)_Space_O(N) | 3 | 99.99 -#### Day 2 Matrix Related Problems +#### Top Interview 150 Graph BFS | | | | | | | |-|-|-|-|-|-|- -#### Day 3 Matrix Related Problems +#### Top Interview 150 Trie | | | | | | | |-|-|-|-|-|-|- +| 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 4 Matrix Related Problems +#### 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, 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 +| 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 -#### Day 5 Matrix Related Problems +#### Top Interview 150 Divide and Conquer | | | | | | | |-|-|-|-|-|-|- +| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/g0101_0200/s0148_sort_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 +| 0023 |Merge k Sorted Lists| [Java](src/main/java/g0001_0100/s0023_merge_k_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0023_merge_k_sorted_lists) [Scala](src/main/scala/g0001_0100/s0023_merge_k_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists) [PHP](src/main/php/g0001_0100/s0023_merge_k_sorted_lists) [C#](src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists) [Go](src/main/go/g0001_0100/s0023_merge_k_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists) [Python](src/main/python/g0001_0100/s0023_merge_k_sorted_lists) [Swift](src/main/swift/g0001_0100/s0023_merge_k_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists) [Rust](src/main/rust/g0001_0100/s0023_merge_k_sorted_lists) [Dart](src/main/dart/g0001_0100/s0023_merge_k_sorted_lists) [C](src/main/c/g0001_0100/s0023_merge_k_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0023_merge_k_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0023_merge_k_sorted_lists) [Racket](src/main/racket/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)) | 1 | 99.86 -#### Day 6 Matrix Related Problems +#### Top Interview 150 Kadane's Algorithm | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 -#### Day 7 Standard Traversal +#### Top Interview 150 Binary Search | | | | | | | |-|-|-|-|-|-|- +| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 +| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 +| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 +| 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 +| 0004 |Median of Two Sorted Arrays| [Java](src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays) [Kotlin](src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays) [TypeScript](src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays) [Scala](src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays) [Ruby](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays) [PHP](src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays) [C#](src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays) [Go](src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays) [Cpp](src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays) [Python](src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays) [Swift](src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays) [Elixir](src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays) [Rust](src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays) [Dart](src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays) [C](src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays) [JavaScript](src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays) [Erlang](src/main/erlang/g0001_0100/s0004_median_of_two_sorted_arrays) [Racket](src/main/racket/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), AI_can_be_used_to_solve_the_task | 1 | 100.00 -#### Day 8 Standard Traversal +#### Top Interview 150 Heap | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 9 Standard Traversal +#### 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, LeetCode_75_Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 -#### Day 10 Standard Traversal +#### Top Interview 150 Math | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(log10(x))_Space_O(1) | 4 | 100.00 -#### Day 11 Breadth First Search +#### Top Interview 150 1D DP | | | | | | | |-|-|-|-|-|-|- +| 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, 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 -#### Day 12 Breadth First Search +#### Top Interview 150 Multidimensional DP | | | | | | | |-|-|-|-|-|-|- +| 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, 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 -#### Day 13 Graph Theory +### Data Structure I + +#### Day 1 Array | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 -#### Day 14 Graph Theory +#### Day 2 Array | | | | | | | |-|-|-|-|-|-|- +| 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 -### SQL I - -#### Day 1 Select +#### Day 3 Array | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 2 Select and Order +#### Day 4 Array | | | | | | | |-|-|-|-|-|-|- -#### Day 3 String Processing Functions +#### Day 5 Array | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -#### Day 4 Union and Select +#### Day 6 String | | | | | | | |-|-|-|-|-|-|- -#### Day 5 Union +#### Day 7 Linked List | | | | | | | |-|-|-|-|-|-|- +| 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 +| 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 -#### Day 6 Union +#### Day 8 Linked List | | | | | | | |-|-|-|-|-|-|- +| 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 7 Function +#### Day 9 Stack Queue | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 8 Function +#### Day 10 Tree | | | | | | | |-|-|-|-|-|-|- +| 0094 |Binary Tree Inorder Traversal| [Java](src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal) [Kotlin](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal) [TypeScript](src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal) [Scala](src/main/scala/g0001_0100/s0094_binary_tree_inorder_traversal) [Ruby](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal) [PHP](src/main/php/g0001_0100/s0094_binary_tree_inorder_traversal) [C#](src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal) [Go](src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal) [Cpp](src/main/cpp/g0001_0100/s0094_binary_tree_inorder_traversal) [Python](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal) [Swift](src/main/swift/g0001_0100/s0094_binary_tree_inorder_traversal) [Elixir](src/main/elixir/g0001_0100/s0094_binary_tree_inorder_traversal) [Rust](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal) [Dart](src/main/dart/g0001_0100/s0094_binary_tree_inorder_traversal) [C](src/main/c/g0001_0100/s0094_binary_tree_inorder_traversal) [JavaScript](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal) [Erlang](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal) [Racket](src/main/racket/g0001_0100/s0094_binary_tree_inorder_traversal)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -#### Day 9 Control of Flow +#### Day 11 Tree | | | | | | | |-|-|-|-|-|-|- +| 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, 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 10 Where +#### Day 12 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -### Level 1 - -#### Day 1 Prefix Sum +#### Day 13 Tree | | | | | | | |-|-|-|-|-|-|- -#### Day 2 String +#### Day 14 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 3 Linked List +### Data Structure II + +#### Day 1 Array | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 4 Linked List +#### Day 2 Array | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 5 Greedy +#### Day 3 Array | | | | | | | |-|-|-|-|-|-|- -| 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 +| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 -#### Day 6 Tree +#### Day 4 Array | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 7 Binary Search +#### Day 5 Array | | | | | | | |-|-|-|-|-|-|- +| 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 8 Binary Search Tree +#### Day 6 String | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 9 Graph/BFS/DFS +#### Day 7 String | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 +| 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 | Top_100_Liked_Questions, String, Hash_Table, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 2 | 100.00 -#### Day 10 Dynamic Programming +#### Day 8 String | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 11 Dynamic Programming +#### Day 9 String | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 12 Sliding Window/Two Pointer +#### Day 10 Linked List | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 +| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 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 -#### Day 13 Hashmap +#### Day 11 Linked List | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 14 Stack +#### Day 12 Linked List | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 15 Heap +#### Day 13 Linked List | | | | | | | |-|-|-|-|-|-|- +| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 -### Level 2 - -#### Day 1 Implementation/Simulation +#### Day 14 Stack Queue | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 2 String +#### Day 15 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 3 Linked List +#### Day 16 Tree | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 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, Big_O_Time_O(n)_Space_O(1) | 4 | 84.46 -#### Day 4 Linked List +#### Day 17 Tree | | | | | | | |-|-|-|-|-|-|- -| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/g0101_0200/s0148_sort_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 +| 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, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -#### Day 5 Greedy +#### Day 18 Tree | | | | | | | |-|-|-|-|-|-|- +| 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 6 Tree +#### Day 19 Graph | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 7 Tree +#### Day 20 Heap Priority Queue | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 8 Binary Search +#### Day 21 Heap Priority Queue | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 9 Binary Search Tree +### Algorithm I + +#### Day 1 Binary Search | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 +| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Day 10 Graph/BFS/DFS +#### Day 2 Two Pointers | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 11 Graph/BFS/DFS +#### Day 3 Two Pointers | | | | | | | |-|-|-|-|-|-|- +| 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 12 Dynamic Programming +#### Day 4 Two Pointers | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +#### Day 5 Two Pointers | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n\*sums)_Space_O(n\*sums) | 5 | 99.88 -| 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 +| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 -#### Day 14 Sliding Window/Two Pointer +#### Day 6 Sliding Window | | | | | | | |-|-|-|-|-|-|- | 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 -| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/g0001_0100/s0076_minimum_window_substring)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 -#### Day 15 Tree +#### Day 7 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 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 16 Design +#### Day 8 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 17 Interval +#### Day 9 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 18 Stack +#### Day 10 Recursion Backtracking | | | | | | | |-|-|-|-|-|-|- +| 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, LeetCode_75_LinkedList, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00 -#### Day 19 Union Find +#### Day 11 Recursion Backtracking | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 20 Brute Force/Backtracking +#### Day 12 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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, LeetCode_75_DP/1D, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -#### Udemy Integers +#### Day 13 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 -| 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 -#### Udemy Strings +#### Day 14 Bit Manipulation | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 -#### Udemy Binary Search +### Algorithm II + +#### Day 1 Binary Search | | | | | | | |-|-|-|-|-|-|- +| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 | 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -| 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 +| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -#### Udemy Arrays +#### Day 2 Binary Search | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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 +| 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 -#### Udemy Two Pointers +#### Day 3 Two Pointers | | | | | | | |-|-|-|-|-|-|- -| 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 | 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 -#### Udemy Famous Algorithm +#### Day 4 Two Pointers | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 -| 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 +| 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 -#### Udemy Sorting Algorithms +#### Day 5 Sliding Window | | | | | | | |-|-|-|-|-|-|- +| 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, Big_O_Time_O(n+m)_Space_O(1) | 3 | 99.83 -#### Udemy 2D Arrays/Matrix +#### Day 6 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_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, Big_O_Time_O(m\*n)_Space_O(1) | 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 +| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -#### Udemy Linked List +#### Day 7 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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 -| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 -| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 -| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/g0101_0200/s0146_lru_cache)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 -#### Udemy Tree Stack Queue +#### Day 8 Breadth First Search Depth First Search | | | | | | | |-|-|-|-|-|-|- -| 0094 |Binary Tree Inorder Traversal| [Java](src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal) [Kotlin](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal) [TypeScript](src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal) [Scala](src/main/scala/g0001_0100/s0094_binary_tree_inorder_traversal) [Ruby](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal) [PHP](src/main/php/g0001_0100/s0094_binary_tree_inorder_traversal) [C#](src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal) [Go](src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal) [Cpp](src/main/cpp/g0001_0100/s0094_binary_tree_inorder_traversal) [Python](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal) [Swift](src/main/swift/g0001_0100/s0094_binary_tree_inorder_traversal) [Elixir](src/main/elixir/g0001_0100/s0094_binary_tree_inorder_traversal) [Rust](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal) [Dart](src/main/dart/g0001_0100/s0094_binary_tree_inorder_traversal) [C](src/main/c/g0001_0100/s0094_binary_tree_inorder_traversal) [JavaScript](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal) [Erlang](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal) [Racket](src/main/racket/g0001_0100/s0094_binary_tree_inorder_traversal)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 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, 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 -| 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 -#### Udemy Trie and Heap +#### Day 9 Recursion Backtracking | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Udemy Graph +#### Day 10 Recursion Backtracking | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 +| 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 -#### Udemy Dynamic Programming +#### Day 11 Recursion Backtracking | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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 +| 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 -#### Udemy Backtracking/Recursion +#### Day 12 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 -#### Udemy Bit Manipulation +#### Day 13 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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, LeetCode_75_DP/Multidimensional, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00 -#### Udemy Design +#### Day 14 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 - -### Top Interview 150 +| 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 -#### Top Interview 150 Array/String +#### Day 15 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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 -| 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 +| 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 -#### Top Interview 150 Two Pointers +#### Day 16 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 -#### Top Interview 150 Sliding Window +#### Day 17 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 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 -| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/g0001_0100/s0076_minimum_window_substring)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 +| 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 -#### Top Interview 150 Matrix +#### Day 18 Dynamic Programming | | | | | | | |-|-|-|-|-|-|- -| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_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, 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, 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 -#### Top Interview 150 Hashmap +#### Day 19 Bit Manipulation | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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, Big_O_Time_O(N_log_N)_Space_O(1) | 14 | 98.89 -#### Top Interview 150 Intervals +#### Day 20 Others | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Top Interview 150 Stack +#### Day 21 Others | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Top Interview 150 Linked List +### Binary Search I + +#### Day 1 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 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 -| 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, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00 -| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 -| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 -| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/g0101_0200/s0146_lru_cache)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 -#### Top Interview 150 Binary Tree General +#### Day 2 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Top Interview 150 Binary Tree BFS +#### Day 3 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Top Interview 150 Binary Search Tree +#### Day 4 | | | | | | | |-|-|-|-|-|-|- -| 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, 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 -#### Top Interview 150 Graph General +#### Day 5 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(M\*N)_Space_O(M\*N) | 3 | 87.24 -| 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, Big_O_Time_O(N)_Space_O(N) | 3 | 97.58 +| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -#### Top Interview 150 Graph BFS +#### Day 6 | | | | | | | |-|-|-|-|-|-|- -#### Top Interview 150 Trie +#### Day 7 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Top Interview 150 Backtracking +#### Day 8 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -| 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 +| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -#### Top Interview 150 Divide and Conquer +#### Day 9 | | | | | | | |-|-|-|-|-|-|- -| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/g0101_0200/s0148_sort_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Sorting, Two_Pointers, Linked_List, Divide_and_Conquer, Merge_Sort, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 -| 0023 |Merge k Sorted Lists| [Java](src/main/java/g0001_0100/s0023_merge_k_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0023_merge_k_sorted_lists) [Scala](src/main/scala/g0001_0100/s0023_merge_k_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists) [PHP](src/main/php/g0001_0100/s0023_merge_k_sorted_lists) [C#](src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists) [Go](src/main/go/g0001_0100/s0023_merge_k_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists) [Python](src/main/python/g0001_0100/s0023_merge_k_sorted_lists) [Swift](src/main/swift/g0001_0100/s0023_merge_k_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists) [Rust](src/main/rust/g0001_0100/s0023_merge_k_sorted_lists) [Dart](src/main/dart/g0001_0100/s0023_merge_k_sorted_lists) [C](src/main/c/g0001_0100/s0023_merge_k_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0023_merge_k_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0023_merge_k_sorted_lists) [Racket](src/main/racket/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)) | 1 | 99.86 -#### Top Interview 150 Kadane's Algorithm +#### Day 10 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 -#### Top Interview 150 Binary Search +#### Day 11 | | | | | | | |-|-|-|-|-|-|- -| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 | 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 -| 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 -| 0004 |Median of Two Sorted Arrays| [Java](src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays) [Kotlin](src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays) [TypeScript](src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays) [Scala](src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays) [Ruby](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays) [PHP](src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays) [C#](src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays) [Go](src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays) [Cpp](src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays) [Python](src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays) [Swift](src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays) [Elixir](src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays) [Rust](src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays) [Dart](src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays) [C](src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays) [JavaScript](src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays) [Erlang](src/main/erlang/g0001_0100/s0004_median_of_two_sorted_arrays) [Racket](src/main/racket/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), AI_can_be_used_to_solve_the_task | 1 | 100.00 -#### Top Interview 150 Heap +#### Day 12 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 -#### Top Interview 150 Bit Manipulation +### Binary Search II + +#### Day 1 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Top Interview 150 Math +#### Day 2 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Top Interview 150 1D DP +#### Day 3 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Top Interview 150 Multidimensional DP +#### Day 4 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Day 1 Array +#### Day 5 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 +| 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 2 Array +#### Day 6 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 3 Array +#### Day 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 -#### Day 4 Array +#### 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 5 Array +#### Day 9 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00 -#### Day 6 String +#### Day 10 | | | | | | | |-|-|-|-|-|-|- -#### Day 7 Linked List +#### Day 11 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Day 8 Linked List +#### Day 12 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 9 Stack Queue +#### Day 13 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 10 Tree +#### Day 14 | | | | | | | |-|-|-|-|-|-|- -| 0094 |Binary Tree Inorder Traversal| [Java](src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal) [Kotlin](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal) [TypeScript](src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal) [Scala](src/main/scala/g0001_0100/s0094_binary_tree_inorder_traversal) [Ruby](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal) [PHP](src/main/php/g0001_0100/s0094_binary_tree_inorder_traversal) [C#](src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal) [Go](src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal) [Cpp](src/main/cpp/g0001_0100/s0094_binary_tree_inorder_traversal) [Python](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal) [Swift](src/main/swift/g0001_0100/s0094_binary_tree_inorder_traversal) [Elixir](src/main/elixir/g0001_0100/s0094_binary_tree_inorder_traversal) [Rust](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal) [Dart](src/main/dart/g0001_0100/s0094_binary_tree_inorder_traversal) [C](src/main/c/g0001_0100/s0094_binary_tree_inorder_traversal) [JavaScript](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal) [Erlang](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal) [Racket](src/main/racket/g0001_0100/s0094_binary_tree_inorder_traversal)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00 -#### Day 11 Tree +#### Day 15 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +#### Day 16 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 13 Tree +#### Day 17 | | | | | | | |-|-|-|-|-|-|- -#### Day 14 Tree +#### Day 18 | | | | | | | |-|-|-|-|-|-|- -| 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 - -### Data Structure II -#### Day 1 Array +#### Day 19 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 -#### Day 2 Array +#### Day 20 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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, Big_O_Time_O(n_log_n)_Space_O(n) | 7 | 98.37 -#### Day 3 Array +### Dynamic Programming I + +#### Day 1 | | | | | | | |-|-|-|-|-|-|- -| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/g0001_0100/s0048_rotate_image)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_Space_O(1) | 0 | 100.00 -#### Day 4 Array +#### Day 2 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 5 Array +#### Day 3 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 6 String +#### Day 4 | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 7 String +#### Day 5 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(1) | 2 | 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 -#### Day 8 String +#### Day 6 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 9 String +#### Day 7 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 -#### Day 10 Linked List +#### Day 8 | | | | | | | |-|-|-|-|-|-|- -| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/g0001_0100/s0002_add_two_numbers)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 1 | 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 -#### Day 11 Linked List +#### Day 9 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 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 -#### Day 12 Linked List +#### Day 10 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 13 Linked List +#### Day 11 | | | | | | | |-|-|-|-|-|-|- -| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/g0001_0100/s0025_reverse_nodes_in_k_group)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 +| 0096 |Unique Binary Search Trees| [Java](src/main/java/g0001_0100/s0096_unique_binary_search_trees) [Kotlin](src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees) [TypeScript](src/main/ts/g0001_0100/s0096_unique_binary_search_trees) [Scala](src/main/scala/g0001_0100/s0096_unique_binary_search_trees) [Ruby](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees) [PHP](src/main/php/g0001_0100/s0096_unique_binary_search_trees) [C#](src/main/csharp/g0001_0100/s0096_unique_binary_search_trees) [Go](src/main/go/g0001_0100/s0096_unique_binary_search_trees) [Cpp](src/main/cpp/g0001_0100/s0096_unique_binary_search_trees) [Python](src/main/python/g0001_0100/s0096_unique_binary_search_trees) [Swift](src/main/swift/g0001_0100/s0096_unique_binary_search_trees) [Elixir](src/main/elixir/g0001_0100/s0096_unique_binary_search_trees) [Rust](src/main/rust/g0001_0100/s0096_unique_binary_search_trees) [Dart](src/main/dart/g0001_0100/s0096_unique_binary_search_trees) [C](src/main/c/g0001_0100/s0096_unique_binary_search_trees) [JavaScript](src/main/js/g0001_0100/s0096_unique_binary_search_trees) [Erlang](src/main/erlang/g0001_0100/s0096_unique_binary_search_trees) [Racket](src/main/racket/g0001_0100/s0096_unique_binary_search_trees)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -#### Day 14 Stack Queue +#### Day 12 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 15 Tree +#### Day 13 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 16 Tree +#### Day 14 | | | | | | | |-|-|-|-|-|-|- -#### Day 17 Tree +#### Day 15 | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(n)_Space_O(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 18 Tree +#### Day 16 | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 +| 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 -#### Day 19 Graph +#### Day 17 | | | | | | | |-|-|-|-|-|-|- +| 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 -#### Day 20 Heap Priority Queue +#### Day 18 | | | | | | | |-|-|-|-|-|-|- -| 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 -| 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 +| 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 21 Heap Priority Queue +#### Day 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 -### Algorithm I - -#### Day 1 Binary Search +#### Day 20 | | | | | | | |-|-|-|-|-|-|- -| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 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 2 Two Pointers +#### Day 21 | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 3 Two Pointers +### Programming Skills I + +#### Day 1 Basic Data Type | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 4 Two Pointers +#### Day 2 Operator | | | | | | | |-|-|-|-|-|-|- -#### Day 5 Two Pointers +#### Day 3 Conditional Statements | | | | | | | |-|-|-|-|-|-|- -| 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, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00 -#### Day 6 Sliding Window +#### Day 4 Loop | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 7 Breadth First Search Depth First Search +#### Day 5 Function | | | | | | | |-|-|-|-|-|-|- -#### Day 8 Breadth First Search Depth First Search +#### Day 6 Array | | | | | | | |-|-|-|-|-|-|- +| 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 9 Breadth First Search Depth First Search +#### Day 7 Array | | | | | | | |-|-|-|-|-|-|- -#### Day 10 Recursion Backtracking +#### Day 8 String | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 11 Recursion Backtracking +#### Day 9 String | | | | | | | |-|-|-|-|-|-|- -| 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 -#### Day 12 Dynamic Programming +#### Day 10 Linked List and Tree | | | | | | | |-|-|-|-|-|-|- -| 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 +| 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 13 Bit Manipulation +#### Day 11 Containers and Libraries | | | | | | | |-|-|-|-|-|-|- -#### Day 14 Bit Manipulation +#### Day 12 Class and Object | | | | | | | |-|-|-|-|-|-|- -| 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 ## 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 -| 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 +| 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 | Top_100_Liked_Questions, 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, 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 | Top_100_Liked_Questions, 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 -| 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, 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, 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, Big_O_Time_O(n\*log_n)_Space_O(n) | 83 | 99.56 +| 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, 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, 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, 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, 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, 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, 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, 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, Big_O_Time_O(N)_Space_O(N) | 3 | 97.58 -| 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 -| 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, 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, 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, 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89 +| 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, 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, 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, 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 -| 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, 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) | 4 | 96.54 -| 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, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 +| 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, Data_Structure_II_Day_14_Stack_Queue, Programming_Skills_II_Day_18, Level_2_Day_16_Design, Udemy_Design, Top_Interview_150_Stack, Big_O_Time_O(1)_Space_O(N) | 4 | 96.54 +| 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, Algorithm_II_Day_2_Binary_Search, Binary_Search_I_Day_12, Udemy_Binary_Search, Top_Interview_150_Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00 | 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, Dynamic_Programming_I_Day_6, Level_2_Day_13_Dynamic_Programming, Udemy_Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 92.74 -| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/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)) | 9 | 93.90 -| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/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) | 40 | 98.20 +| 0148 |Sort List| [Java](src/main/java/g0101_0200/s0148_sort_list) [Kotlin](src/main/kotlin/g0101_0200/s0148_sort_list) [TypeScript](src/main/ts/g0101_0200/s0148_sort_list) [Scala](src/main/scala/g0101_0200/s0148_sort_list) [Ruby](src/main/ruby/g0101_0200/s0148_sort_list) [PHP](src/main/php/g0101_0200/s0148_sort_list) [C#](src/main/csharp/g0101_0200/s0148_sort_list) [Go](src/main/go/g0101_0200/s0148_sort_list) [Cpp](src/main/cpp/g0101_0200/s0148_sort_list) [Python](src/main/python/g0101_0200/s0148_sort_list) [Swift](src/main/swift/g0101_0200/s0148_sort_list) [Elixir](src/main/elixir/g0101_0200/s0148_sort_list) [Rust](src/main/rust/g0101_0200/s0148_sort_list) [Dart](src/main/dart/g0101_0200/s0148_sort_list) [C](src/main/c/g0101_0200/s0148_sort_list) [JavaScript](src/main/js/g0101_0200/s0148_sort_list) [Erlang](src/main/erlang/g0101_0200/s0148_sort_list) [Racket](src/main/racket/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, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(log(N))_Space_O(log(N)) | 9 | 93.90 +| 0146 |LRU Cache| [Java](src/main/java/g0101_0200/s0146_lru_cache) [Kotlin](src/main/kotlin/g0101_0200/s0146_lru_cache) [TypeScript](src/main/ts/g0101_0200/s0146_lru_cache) [Scala](src/main/scala/g0101_0200/s0146_lru_cache) [Ruby](src/main/ruby/g0101_0200/s0146_lru_cache) [PHP](src/main/php/g0101_0200/s0146_lru_cache) [C#](src/main/csharp/g0101_0200/s0146_lru_cache) [Go](src/main/go/g0101_0200/s0146_lru_cache) [Cpp](src/main/cpp/g0101_0200/s0146_lru_cache) [Python](src/main/python/g0101_0200/s0146_lru_cache) [Swift](src/main/swift/g0101_0200/s0146_lru_cache) [Elixir](src/main/elixir/g0101_0200/s0146_lru_cache) [Rust](src/main/rust/g0101_0200/s0146_lru_cache) [Dart](src/main/dart/g0101_0200/s0146_lru_cache) [C](src/main/c/g0101_0200/s0146_lru_cache) [JavaScript](src/main/js/g0101_0200/s0146_lru_cache) [Erlang](src/main/erlang/g0101_0200/s0146_lru_cache) [Racket](src/main/racket/g0101_0200/s0146_lru_cache)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Udemy_Linked_List, Top_Interview_150_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 40 | 98.20 | 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, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_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, Data_Structure_I_Day_7_Linked_List, Udemy_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, 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, 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, Big_O_Time_O(N)_Space_O(1) | 1 | 99.86 +| 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00 +| 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, 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 | 0096 |Unique Binary Search Trees| [Java](src/main/java/g0001_0100/s0096_unique_binary_search_trees) [Kotlin](src/main/kotlin/g0001_0100/s0096_unique_binary_search_trees) [TypeScript](src/main/ts/g0001_0100/s0096_unique_binary_search_trees) [Scala](src/main/scala/g0001_0100/s0096_unique_binary_search_trees) [Ruby](src/main/ruby/g0001_0100/s0096_unique_binary_search_trees) [PHP](src/main/php/g0001_0100/s0096_unique_binary_search_trees) [C#](src/main/csharp/g0001_0100/s0096_unique_binary_search_trees) [Go](src/main/go/g0001_0100/s0096_unique_binary_search_trees) [Cpp](src/main/cpp/g0001_0100/s0096_unique_binary_search_trees) [Python](src/main/python/g0001_0100/s0096_unique_binary_search_trees) [Swift](src/main/swift/g0001_0100/s0096_unique_binary_search_trees) [Elixir](src/main/elixir/g0001_0100/s0096_unique_binary_search_trees) [Rust](src/main/rust/g0001_0100/s0096_unique_binary_search_trees) [Dart](src/main/dart/g0001_0100/s0096_unique_binary_search_trees) [C](src/main/c/g0001_0100/s0096_unique_binary_search_trees) [JavaScript](src/main/js/g0001_0100/s0096_unique_binary_search_trees) [Erlang](src/main/erlang/g0001_0100/s0096_unique_binary_search_trees) [Racket](src/main/racket/g0001_0100/s0096_unique_binary_search_trees)| Medium | Dynamic_Programming, Math, Tree, Binary_Tree, Binary_Search_Tree, Dynamic_Programming_I_Day_11, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 0094 |Binary Tree Inorder Traversal| [Java](src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal) [Kotlin](src/main/kotlin/g0001_0100/s0094_binary_tree_inorder_traversal) [TypeScript](src/main/ts/g0001_0100/s0094_binary_tree_inorder_traversal) [Scala](src/main/scala/g0001_0100/s0094_binary_tree_inorder_traversal) [Ruby](src/main/ruby/g0001_0100/s0094_binary_tree_inorder_traversal) [PHP](src/main/php/g0001_0100/s0094_binary_tree_inorder_traversal) [C#](src/main/csharp/g0001_0100/s0094_binary_tree_inorder_traversal) [Go](src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal) [Cpp](src/main/cpp/g0001_0100/s0094_binary_tree_inorder_traversal) [Python](src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal) [Swift](src/main/swift/g0001_0100/s0094_binary_tree_inorder_traversal) [Elixir](src/main/elixir/g0001_0100/s0094_binary_tree_inorder_traversal) [Rust](src/main/rust/g0001_0100/s0094_binary_tree_inorder_traversal) [Dart](src/main/dart/g0001_0100/s0094_binary_tree_inorder_traversal) [C](src/main/c/g0001_0100/s0094_binary_tree_inorder_traversal) [JavaScript](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal) [Erlang](src/main/erlang/g0001_0100/s0094_binary_tree_inorder_traversal) [Racket](src/main/racket/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) | 0 | 100.00 | 0084 |Largest Rectangle in Histogram| [Java](src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram) [Kotlin](src/main/kotlin/g0001_0100/s0084_largest_rectangle_in_histogram) [TypeScript](src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram) [Scala](src/main/scala/g0001_0100/s0084_largest_rectangle_in_histogram) [Ruby](src/main/ruby/g0001_0100/s0084_largest_rectangle_in_histogram) [PHP](src/main/php/g0001_0100/s0084_largest_rectangle_in_histogram) [C#](src/main/csharp/g0001_0100/s0084_largest_rectangle_in_histogram) [Go](src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram) [Cpp](src/main/cpp/g0001_0100/s0084_largest_rectangle_in_histogram) [Python](src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram) [Swift](src/main/swift/g0001_0100/s0084_largest_rectangle_in_histogram) [Elixir](src/main/elixir/g0001_0100/s0084_largest_rectangle_in_histogram) [Rust](src/main/rust/g0001_0100/s0084_largest_rectangle_in_histogram) [Dart](src/main/dart/g0001_0100/s0084_largest_rectangle_in_histogram) [C](src/main/c/g0001_0100/s0084_largest_rectangle_in_histogram) [JavaScript](src/main/js/g0001_0100/s0084_largest_rectangle_in_histogram) [Erlang](src/main/erlang/g0001_0100/s0084_largest_rectangle_in_histogram) [Racket](src/main/racket/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) | 9 | 93.28 -| 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, Algorithm_II_Day_11_Recursion_Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 64 | 98.51 +| 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, Algorithm_II_Day_11_Recursion_Backtracking, Top_Interview_150_Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 64 | 98.51 | 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, Algorithm_II_Day_9_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 0 | 100.00 -| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/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) | 2 | 99.83 +| 0076 |Minimum Window Substring| [Java](src/main/java/g0001_0100/s0076_minimum_window_substring) [Kotlin](src/main/kotlin/g0001_0100/s0076_minimum_window_substring) [TypeScript](src/main/ts/g0001_0100/s0076_minimum_window_substring) [Scala](src/main/scala/g0001_0100/s0076_minimum_window_substring) [Ruby](src/main/ruby/g0001_0100/s0076_minimum_window_substring) [PHP](src/main/php/g0001_0100/s0076_minimum_window_substring) [C#](src/main/csharp/g0001_0100/s0076_minimum_window_substring) [Go](src/main/go/g0001_0100/s0076_minimum_window_substring) [Cpp](src/main/cpp/g0001_0100/s0076_minimum_window_substring) [Python](src/main/python/g0001_0100/s0076_minimum_window_substring) [Swift](src/main/swift/g0001_0100/s0076_minimum_window_substring) [Elixir](src/main/elixir/g0001_0100/s0076_minimum_window_substring) [Rust](src/main/rust/g0001_0100/s0076_minimum_window_substring) [Dart](src/main/dart/g0001_0100/s0076_minimum_window_substring) [C](src/main/c/g0001_0100/s0076_minimum_window_substring) [JavaScript](src/main/js/g0001_0100/s0076_minimum_window_substring) [Erlang](src/main/erlang/g0001_0100/s0076_minimum_window_substring) [Racket](src/main/racket/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, Top_Interview_150_Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83 | 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, 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, 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, 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, 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, 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 -| 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, 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, 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, Big_O_Time_O(n)_Space_O(1) | 1 | 99.32 +| 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, 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, 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 | 0051 |N-Queens| [Java](src/main/java/g0001_0100/s0051_n_queens) [Kotlin](src/main/kotlin/g0001_0100/s0051_n_queens) [TypeScript](src/main/ts/g0001_0100/s0051_n_queens) [Scala](src/main/scala/g0001_0100/s0051_n_queens) [Ruby](src/main/ruby/g0001_0100/s0051_n_queens) [PHP](src/main/php/g0001_0100/s0051_n_queens) [C#](src/main/csharp/g0001_0100/s0051_n_queens) [Go](src/main/go/g0001_0100/s0051_n_queens) [Cpp](src/main/cpp/g0001_0100/s0051_n_queens) [Python](src/main/python/g0001_0100/s0051_n_queens) [Swift](src/main/swift/g0001_0100/s0051_n_queens) [Elixir](src/main/elixir/g0001_0100/s0051_n_queens) [Rust](src/main/rust/g0001_0100/s0051_n_queens) [Dart](src/main/dart/g0001_0100/s0051_n_queens) [C](src/main/c/g0001_0100/s0051_n_queens) [JavaScript](src/main/js/g0001_0100/s0051_n_queens) [Erlang](src/main/erlang/g0001_0100/s0051_n_queens) [Racket](src/main/racket/g0001_0100/s0051_n_queens)| Hard | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(N!)_Space_O(N) | 1 | 99.77 -| 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, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 6 | 97.61 -| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/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) | 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, 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!) | 1 | 94.08 -| 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, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -| 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, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 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, Data_Structure_II_Day_8_String, Programming_Skills_II_Day_11, Udemy_Strings, Top_Interview_150_Hashmap, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 6 | 97.61 +| 0048 |Rotate Image| [Java](src/main/java/g0001_0100/s0048_rotate_image) [Kotlin](src/main/kotlin/g0001_0100/s0048_rotate_image) [TypeScript](src/main/ts/g0001_0100/s0048_rotate_image) [Scala](src/main/scala/g0001_0100/s0048_rotate_image) [Ruby](src/main/ruby/g0001_0100/s0048_rotate_image) [PHP](src/main/php/g0001_0100/s0048_rotate_image) [C#](src/main/csharp/g0001_0100/s0048_rotate_image) [Go](src/main/go/g0001_0100/s0048_rotate_image) [Cpp](src/main/cpp/g0001_0100/s0048_rotate_image) [Python](src/main/python/g0001_0100/s0048_rotate_image) [Swift](src/main/swift/g0001_0100/s0048_rotate_image) [Elixir](src/main/elixir/g0001_0100/s0048_rotate_image) [Rust](src/main/rust/g0001_0100/s0048_rotate_image) [Dart](src/main/dart/g0001_0100/s0048_rotate_image) [C](src/main/c/g0001_0100/s0048_rotate_image) [JavaScript](src/main/js/g0001_0100/s0048_rotate_image) [Erlang](src/main/erlang/g0001_0100/s0048_rotate_image) [Racket](src/main/racket/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, Top_Interview_150_Matrix, Big_O_Time_O(n^2)_Space_O(1) | 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, Algorithm_I_Day_11_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08 +| 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, Algorithm_II_Day_13_Dynamic_Programming, Dynamic_Programming_I_Day_4, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 +| 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, Dynamic_Programming_I_Day_9, Udemy_Two_Pointers, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 | 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, Udemy_Arrays, Big_O_Time_O(n)_Space_O(n) | 1 | 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, 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) | 1 | 99.99 -| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/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) | 0 | 100.00 -| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/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) | 0 | 100.00 -| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/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) | 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, Algorithm_II_Day_10_Recursion_Backtracking, Level_2_Day_20_Brute_Force/Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99 +| 0035 |Search Insert Position| [Java](src/main/java/g0001_0100/s0035_search_insert_position) [Kotlin](src/main/kotlin/g0001_0100/s0035_search_insert_position) [TypeScript](src/main/ts/g0001_0100/s0035_search_insert_position) [Scala](src/main/scala/g0001_0100/s0035_search_insert_position) [Ruby](src/main/ruby/g0001_0100/s0035_search_insert_position) [PHP](src/main/php/g0001_0100/s0035_search_insert_position) [C#](src/main/csharp/g0001_0100/s0035_search_insert_position) [Go](src/main/go/g0001_0100/s0035_search_insert_position) [Cpp](src/main/cpp/g0001_0100/s0035_search_insert_position) [Python](src/main/python/g0001_0100/s0035_search_insert_position) [Swift](src/main/swift/g0001_0100/s0035_search_insert_position) [Elixir](src/main/elixir/g0001_0100/s0035_search_insert_position) [Rust](src/main/rust/g0001_0100/s0035_search_insert_position) [Dart](src/main/dart/g0001_0100/s0035_search_insert_position) [C](src/main/c/g0001_0100/s0035_search_insert_position) [JavaScript](src/main/js/g0001_0100/s0035_search_insert_position) [Erlang](src/main/erlang/g0001_0100/s0035_search_insert_position) [Racket](src/main/racket/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, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 +| 0034 |Find First and Last Position of Element in Sorted Array| [Java](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Scala](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [PHP](src/main/php/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C#](src/main/csharp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Go](src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Python](src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Swift](src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Rust](src/main/rust/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Dart](src/main/dart/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [C](src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [JavaScript](src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array) [Racket](src/main/racket/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, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 +| 0033 |Search in Rotated Sorted Array| [Java](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array) [Kotlin](src/main/kotlin/g0001_0100/s0033_search_in_rotated_sorted_array) [TypeScript](src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array) [Scala](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array) [Ruby](src/main/ruby/g0001_0100/s0033_search_in_rotated_sorted_array) [PHP](src/main/php/g0001_0100/s0033_search_in_rotated_sorted_array) [C#](src/main/csharp/g0001_0100/s0033_search_in_rotated_sorted_array) [Go](src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array) [Cpp](src/main/cpp/g0001_0100/s0033_search_in_rotated_sorted_array) [Python](src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array) [Swift](src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array) [Elixir](src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array) [Rust](src/main/rust/g0001_0100/s0033_search_in_rotated_sorted_array) [Dart](src/main/dart/g0001_0100/s0033_search_in_rotated_sorted_array) [C](src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array) [JavaScript](src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array) [Erlang](src/main/erlang/g0001_0100/s0033_search_in_rotated_sorted_array) [Racket](src/main/racket/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, Top_Interview_150_Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00 | 0032 |Longest Valid Parentheses| [Java](src/main/java/g0001_0100/s0032_longest_valid_parentheses) [Kotlin](src/main/kotlin/g0001_0100/s0032_longest_valid_parentheses) [TypeScript](src/main/ts/g0001_0100/s0032_longest_valid_parentheses) [Scala](src/main/scala/g0001_0100/s0032_longest_valid_parentheses) [Ruby](src/main/ruby/g0001_0100/s0032_longest_valid_parentheses) [PHP](src/main/php/g0001_0100/s0032_longest_valid_parentheses) [C#](src/main/csharp/g0001_0100/s0032_longest_valid_parentheses) [Go](src/main/go/g0001_0100/s0032_longest_valid_parentheses) [Cpp](src/main/cpp/g0001_0100/s0032_longest_valid_parentheses) [Python](src/main/python/g0001_0100/s0032_longest_valid_parentheses) [Swift](src/main/swift/g0001_0100/s0032_longest_valid_parentheses) [Elixir](src/main/elixir/g0001_0100/s0032_longest_valid_parentheses) [Rust](src/main/rust/g0001_0100/s0032_longest_valid_parentheses) [Dart](src/main/dart/g0001_0100/s0032_longest_valid_parentheses) [C](src/main/c/g0001_0100/s0032_longest_valid_parentheses) [JavaScript](src/main/js/g0001_0100/s0032_longest_valid_parentheses) [Erlang](src/main/erlang/g0001_0100/s0032_longest_valid_parentheses) [Racket](src/main/racket/g0001_0100/s0032_longest_valid_parentheses)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Stack, Big_O_Time_O(n)_Space_O(1) | 1 | 99.74 | 0031 |Next Permutation| [Java](src/main/java/g0001_0100/s0031_next_permutation) [Kotlin](src/main/kotlin/g0001_0100/s0031_next_permutation) [TypeScript](src/main/ts/g0001_0100/s0031_next_permutation) [Scala](src/main/scala/g0001_0100/s0031_next_permutation) [Ruby](src/main/ruby/g0001_0100/s0031_next_permutation) [PHP](src/main/php/g0001_0100/s0031_next_permutation) [C#](src/main/csharp/g0001_0100/s0031_next_permutation) [Go](src/main/go/g0001_0100/s0031_next_permutation) [Cpp](src/main/cpp/g0001_0100/s0031_next_permutation) [Python](src/main/python/g0001_0100/s0031_next_permutation) [Swift](src/main/swift/g0001_0100/s0031_next_permutation) [Elixir](src/main/elixir/g0001_0100/s0031_next_permutation) [Rust](src/main/rust/g0001_0100/s0031_next_permutation) [Dart](src/main/dart/g0001_0100/s0031_next_permutation) [C](src/main/c/g0001_0100/s0031_next_permutation) [JavaScript](src/main/js/g0001_0100/s0031_next_permutation) [Erlang](src/main/erlang/g0001_0100/s0031_next_permutation) [Racket](src/main/racket/g0001_0100/s0031_next_permutation)| Medium | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/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) | 0 | 100.00 +| 0025 |Reverse Nodes in k-Group| [Java](src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group) [Kotlin](src/main/kotlin/g0001_0100/s0025_reverse_nodes_in_k_group) [TypeScript](src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group) [Scala](src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group) [Ruby](src/main/ruby/g0001_0100/s0025_reverse_nodes_in_k_group) [PHP](src/main/php/g0001_0100/s0025_reverse_nodes_in_k_group) [C#](src/main/csharp/g0001_0100/s0025_reverse_nodes_in_k_group) [Go](src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group) [Cpp](src/main/cpp/g0001_0100/s0025_reverse_nodes_in_k_group) [Python](src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group) [Swift](src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group) [Elixir](src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group) [Rust](src/main/rust/g0001_0100/s0025_reverse_nodes_in_k_group) [Dart](src/main/dart/g0001_0100/s0025_reverse_nodes_in_k_group) [C](src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group) [JavaScript](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group) [Erlang](src/main/erlang/g0001_0100/s0025_reverse_nodes_in_k_group) [Racket](src/main/racket/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, Top_Interview_150_Linked_List, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00 | 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, Data_Structure_II_Day_12_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00 -| 0023 |Merge k Sorted Lists| [Java](src/main/java/g0001_0100/s0023_merge_k_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0023_merge_k_sorted_lists) [Scala](src/main/scala/g0001_0100/s0023_merge_k_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists) [PHP](src/main/php/g0001_0100/s0023_merge_k_sorted_lists) [C#](src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists) [Go](src/main/go/g0001_0100/s0023_merge_k_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists) [Python](src/main/python/g0001_0100/s0023_merge_k_sorted_lists) [Swift](src/main/swift/g0001_0100/s0023_merge_k_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists) [Rust](src/main/rust/g0001_0100/s0023_merge_k_sorted_lists) [Dart](src/main/dart/g0001_0100/s0023_merge_k_sorted_lists) [C](src/main/c/g0001_0100/s0023_merge_k_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0023_merge_k_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0023_merge_k_sorted_lists) [Racket](src/main/racket/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)) | 1 | 99.86 -| 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, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(2^n)_Space_O(n) | 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, 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) | 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, 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, 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, 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, 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, Big_O_Time_O(n)_Space_O(1) | 3 | 96.01 +| 0023 |Merge k Sorted Lists| [Java](src/main/java/g0001_0100/s0023_merge_k_sorted_lists) [Kotlin](src/main/kotlin/g0001_0100/s0023_merge_k_sorted_lists) [TypeScript](src/main/ts/g0001_0100/s0023_merge_k_sorted_lists) [Scala](src/main/scala/g0001_0100/s0023_merge_k_sorted_lists) [Ruby](src/main/ruby/g0001_0100/s0023_merge_k_sorted_lists) [PHP](src/main/php/g0001_0100/s0023_merge_k_sorted_lists) [C#](src/main/csharp/g0001_0100/s0023_merge_k_sorted_lists) [Go](src/main/go/g0001_0100/s0023_merge_k_sorted_lists) [Cpp](src/main/cpp/g0001_0100/s0023_merge_k_sorted_lists) [Python](src/main/python/g0001_0100/s0023_merge_k_sorted_lists) [Swift](src/main/swift/g0001_0100/s0023_merge_k_sorted_lists) [Elixir](src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists) [Rust](src/main/rust/g0001_0100/s0023_merge_k_sorted_lists) [Dart](src/main/dart/g0001_0100/s0023_merge_k_sorted_lists) [C](src/main/c/g0001_0100/s0023_merge_k_sorted_lists) [JavaScript](src/main/js/g0001_0100/s0023_merge_k_sorted_lists) [Erlang](src/main/erlang/g0001_0100/s0023_merge_k_sorted_lists) [Racket](src/main/racket/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, Top_Interview_150_Divide_and_Conquer, Big_O_Time_O(k\*n\*log(k))_Space_O(log(k)) | 1 | 99.86 +| 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, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Top_Interview_150_Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 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, 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, 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, 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 | 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 -| 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, Udemy_Integers | 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 -| 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, 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) | 7 | 97.82 -| 0004 |Median of Two Sorted Arrays| [Java](src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays) [Kotlin](src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays) [TypeScript](src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays) [Scala](src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays) [Ruby](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays) [PHP](src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays) [C#](src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays) [Go](src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays) [Cpp](src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays) [Python](src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays) [Swift](src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays) [Elixir](src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays) [Rust](src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays) [Dart](src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays) [C](src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays) [JavaScript](src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays) [Erlang](src/main/erlang/g0001_0100/s0004_median_of_two_sorted_arrays) [Racket](src/main/racket/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), AI_can_be_used_to_solve_the_task | 1 | 100.00 -| 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, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 -| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/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)), AI_can_be_used_to_solve_the_task | 1 | 100.00 -| 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, 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 | 2 | 98.90 +| 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, Big_O_Time_O(log10(x))_Space_O(1) | 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, Big_O_Time_O(n)_Space_O(n) | 1 | 100.00 +| 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, Udemy_Integers, Big_O_Time_O(log10(x))_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, Top_Interview_150_Array/String, Big_O_Time_O(n)_Space_O(n) | 2 | 99.71 +| 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, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Top_Interview_150_Multidimensional_DP, Big_O_Time_O(n)_Space_O(n) | 7 | 97.82 +| 0004 |Median of Two Sorted Arrays| [Java](src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays) [Kotlin](src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays) [TypeScript](src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays) [Scala](src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays) [Ruby](src/main/ruby/g0001_0100/s0004_median_of_two_sorted_arrays) [PHP](src/main/php/g0001_0100/s0004_median_of_two_sorted_arrays) [C#](src/main/csharp/g0001_0100/s0004_median_of_two_sorted_arrays) [Go](src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays) [Cpp](src/main/cpp/g0001_0100/s0004_median_of_two_sorted_arrays) [Python](src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays) [Swift](src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays) [Elixir](src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays) [Rust](src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays) [Dart](src/main/dart/g0001_0100/s0004_median_of_two_sorted_arrays) [C](src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays) [JavaScript](src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays) [Erlang](src/main/erlang/g0001_0100/s0004_median_of_two_sorted_arrays) [Racket](src/main/racket/g0001_0100/s0004_median_of_two_sorted_arrays)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Top_Interview_150_Binary_Search, Big_O_Time_O(log(min(N,M)))_Space_O(1), AI_can_be_used_to_solve_the_task | 1 | 100.00 +| 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, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Top_Interview_150_Sliding_Window, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59 +| 0002 |Add Two Numbers| [Java](src/main/java/g0001_0100/s0002_add_two_numbers) [Kotlin](src/main/kotlin/g0001_0100/s0002_add_two_numbers) [TypeScript](src/main/ts/g0001_0100/s0002_add_two_numbers) [Scala](src/main/scala/g0001_0100/s0002_add_two_numbers) [Ruby](src/main/ruby/g0001_0100/s0002_add_two_numbers) [PHP](src/main/php/g0001_0100/s0002_add_two_numbers) [C#](src/main/csharp/g0001_0100/s0002_add_two_numbers) [Go](src/main/go/g0001_0100/s0002_add_two_numbers) [Cpp](src/main/cpp/g0001_0100/s0002_add_two_numbers) [Python](src/main/python/g0001_0100/s0002_add_two_numbers) [Swift](src/main/swift/g0001_0100/s0002_add_two_numbers) [Elixir](src/main/elixir/g0001_0100/s0002_add_two_numbers) [Rust](src/main/rust/g0001_0100/s0002_add_two_numbers) [Dart](src/main/dart/g0001_0100/s0002_add_two_numbers) [C](src/main/c/g0001_0100/s0002_add_two_numbers) [JavaScript](src/main/js/g0001_0100/s0002_add_two_numbers) [Erlang](src/main/erlang/g0001_0100/s0002_add_two_numbers) [Racket](src/main/racket/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, 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 | 1 | 100.00 +| 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, 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 | 2 | 98.90 ## Contributing Your ideas/fixes/algorithms are more than welcome! diff --git a/pom.xml b/pom.xml index 76080aae..0d4da378 100644 --- a/pom.xml +++ b/pom.xml @@ -5,12 +5,13 @@ com.github.javadev leetcode-in-all jar - 1.8 + 1.11 leetcode-in-all 104 LeetCode algorithm problem solutions https://github.com/javadev/LeetCode-in-All + javadev Valentyn Kolesnikov @@ -70,7 +71,7 @@ org.codehaus.mojo build-helper-maven-plugin - 3.6.0 + 3.6.1 add-source @@ -118,7 +119,7 @@ org.apache.maven.plugins maven-javadoc-plugin - 3.11.2 + 3.11.3 attach-sources @@ -135,7 +136,7 @@ org.apache.maven.plugins maven-gpg-plugin - 3.2.7 + 3.2.8 sign-artifacts @@ -146,6 +147,36 @@ + + org.apache.maven.plugins + maven-antrun-plugin + 3.1.0 + + + generate-checksums + verify + + + + + + + + + + + + + + + + + + run + + + + diff --git a/src/main/c/g0001_0100/s0001_two_sum/Solution.c b/src/main/c/g0001_0100/s0001_two_sum/Solution.c index bf4fadea..374de520 100644 --- a/src/main/c/g0001_0100/s0001_two_sum/Solution.c +++ b/src/main/c/g0001_0100/s0001_two_sum/Solution.c @@ -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_10_16_Time_2_ms_(99.56%)_Space_8.6_MB_(40.96%) +// #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_10_16_Time_2_ms_(99.56%)_Space_8.6_MB_(40.96%) /** * Note: The returned array must be malloced, assume caller calls free(). diff --git a/src/main/c/g0001_0100/s0002_add_two_numbers/Solution.c b/src/main/c/g0001_0100/s0002_add_two_numbers/Solution.c index 07e05e81..cbde5e3c 100644 --- a/src/main/c/g0001_0100/s0002_add_two_numbers/Solution.c +++ b/src/main/c/g0001_0100/s0002_add_two_numbers/Solution.c @@ -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_10_16_Time_12_ms_(70.50%)_Space_12.6_MB_(56.73%) +// #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_10_16_Time_12_ms_(70.50%)_Space_12.6_MB_(56.73%) /** * Definition for singly-linked list. diff --git a/src/main/c/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.c b/src/main/c/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.c index 766fcf47..9b531518 100644 --- a/src/main/c/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.c +++ b/src/main/c/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.c @@ -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_10_20_Time_15_ms_(29.93%)_Space_9.7_MB_(47.88%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2024_10_20_Time_15_ms_(29.93%)_Space_9.7_MB_(47.88%) #include #include diff --git a/src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.c b/src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.c index 596b188c..d63c22f2 100644 --- a/src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.c +++ b/src/main/c/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.c @@ -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_10_20_Time_0_ms_(100.00%)_Space_11.1_MB_(60.94%) +// #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_10_20_Time_0_ms_(100.00%)_Space_11.1_MB_(60.94%) #include #include diff --git a/src/main/c/g0001_0100/s0005_longest_palindromic_substring/Solution.c b/src/main/c/g0001_0100/s0005_longest_palindromic_substring/Solution.c index 32800c67..6b6bda58 100644 --- a/src/main/c/g0001_0100/s0005_longest_palindromic_substring/Solution.c +++ b/src/main/c/g0001_0100/s0005_longest_palindromic_substring/Solution.c @@ -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_10_20_Time_2_ms_(97.74%)_Space_9.4_MB_(14.91%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_10_20_Time_2_ms_(97.74%)_Space_9.4_MB_(14.91%) #include #include diff --git a/src/main/c/g0001_0100/s0006_zigzag_conversion/Solution.c b/src/main/c/g0001_0100/s0006_zigzag_conversion/Solution.c index a3be3f7d..2e9dbd1a 100644 --- a/src/main/c/g0001_0100/s0006_zigzag_conversion/Solution.c +++ b/src/main/c/g0001_0100/s0006_zigzag_conversion/Solution.c @@ -1,4 +1,5 @@ -// #Medium #String #2024_10_28_Time_0_ms_(100.00%)_Space_8.6_MB_(83.33%) +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) +// #2024_10_28_Time_0_ms_(100.00%)_Space_8.6_MB_(83.33%) #include #include diff --git a/src/main/c/g0001_0100/s0007_reverse_integer/Solution.c b/src/main/c/g0001_0100/s0007_reverse_integer/Solution.c index a389d9f6..bfe43d1f 100644 --- a/src/main/c/g0001_0100/s0007_reverse_integer/Solution.c +++ b/src/main/c/g0001_0100/s0007_reverse_integer/Solution.c @@ -1,4 +1,4 @@ -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2024_10_28_Time_0_ms_(100.00%)_Space_8.3_MB_(93.52%) int reverse(int x) { diff --git a/src/main/c/g0001_0100/s0008_string_to_integer_atoi/Solution.c b/src/main/c/g0001_0100/s0008_string_to_integer_atoi/Solution.c index 55df9d72..60ae0e8e 100644 --- a/src/main/c/g0001_0100/s0008_string_to_integer_atoi/Solution.c +++ b/src/main/c/g0001_0100/s0008_string_to_integer_atoi/Solution.c @@ -1,4 +1,5 @@ -// #Medium #Top_Interview_Questions #String #2024_10_28_Time_0_ms_(100.00%)_Space_8.5_MB_(69.69%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2024_10_28_Time_0_ms_(100.00%)_Space_8.5_MB_(69.69%) #include #include diff --git a/src/main/c/g0001_0100/s0009_palindrome_number/Solution.c b/src/main/c/g0001_0100/s0009_palindrome_number/Solution.c index 2126d703..8b81268a 100644 --- a/src/main/c/g0001_0100/s0009_palindrome_number/Solution.c +++ b/src/main/c/g0001_0100/s0009_palindrome_number/Solution.c @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_10_28_Time_0_ms_(100.00%)_Space_8_MB_(63.90%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) +// #2024_10_28_Time_0_ms_(100.00%)_Space_8_MB_(63.90%) #include #include diff --git a/src/main/c/g0001_0100/s0011_container_with_most_water/Solution.c b/src/main/c/g0001_0100/s0011_container_with_most_water/Solution.c index 24e07e43..71205666 100644 --- a/src/main/c/g0001_0100/s0011_container_with_most_water/Solution.c +++ b/src/main/c/g0001_0100/s0011_container_with_most_water/Solution.c @@ -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_10_28_Time_0_ms_(100.00%)_Space_13.9_MB_(58.08%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_10_28_Time_0_ms_(100.00%)_Space_13.9_MB_(58.08%) #include diff --git a/src/main/c/g0001_0100/s0015_3sum/Solution.c b/src/main/c/g0001_0100/s0015_3sum/Solution.c index bcd4e754..df41b921 100644 --- a/src/main/c/g0001_0100/s0015_3sum/Solution.c +++ b/src/main/c/g0001_0100/s0015_3sum/Solution.c @@ -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_10_28_Time_47_ms_(87.75%)_Space_41.5_MB_(64.78%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_10_28_Time_47_ms_(87.75%)_Space_41.5_MB_(64.78%) /** * Return an array of arrays of size *returnSize. diff --git a/src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.c b/src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.c index 66fcdb4e..09749412 100644 --- a/src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.c +++ b/src/main/c/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.c @@ -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_10_28_Time_0_ms_(100.00%)_Space_8.3_MB_(50.21%) +// #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_10_28_Time_0_ms_(100.00%)_Space_8.3_MB_(50.21%) /** * Note: The returned array must be malloced, assume caller calls free(). diff --git a/src/main/c/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.c b/src/main/c/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.c index 716003e7..e8d3a5cc 100644 --- a/src/main/c/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.c +++ b/src/main/c/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.c @@ -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_10_28_Time_0_ms_(100.00%)_Space_9.4_MB_(39.50%) +// #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_10_28_Time_0_ms_(100.00%)_Space_9.4_MB_(39.50%) #include #include diff --git a/src/main/c/g0001_0100/s0020_valid_parentheses/Solution.c b/src/main/c/g0001_0100/s0020_valid_parentheses/Solution.c index 1c3dbe8e..e0ea7d4c 100644 --- a/src/main/c/g0001_0100/s0020_valid_parentheses/Solution.c +++ b/src/main/c/g0001_0100/s0020_valid_parentheses/Solution.c @@ -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_10_28_Time_0_ms_(100.00%)_Space_7.8_MB_(78.50%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_10_28_Time_0_ms_(100.00%)_Space_7.8_MB_(78.50%) #include #include diff --git a/src/main/c/g0001_0100/s0021_merge_two_sorted_lists/Solution.c b/src/main/c/g0001_0100/s0021_merge_two_sorted_lists/Solution.c index 8e1624d7..3d20fc4c 100644 --- a/src/main/c/g0001_0100/s0021_merge_two_sorted_lists/Solution.c +++ b/src/main/c/g0001_0100/s0021_merge_two_sorted_lists/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_10.7_MB_(26.00%) +// #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_29_Time_0_ms_(100.00%)_Space_10.7_MB_(26.00%) /** * Definition for singly-linked list. diff --git a/src/main/c/g0001_0100/s0022_generate_parentheses/Solution.c b/src/main/c/g0001_0100/s0022_generate_parentheses/Solution.c index 64a3501a..b9b5401f 100644 --- a/src/main/c/g0001_0100/s0022_generate_parentheses/Solution.c +++ b/src/main/c/g0001_0100/s0022_generate_parentheses/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_9.2_MB_(78.89%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_10_29_Time_0_ms_(100.00%)_Space_9.2_MB_(78.89%) /** * Note: The returned array must be malloced, assume caller calls free(). diff --git a/src/main/c/g0001_0100/s0023_merge_k_sorted_lists/Solution.c b/src/main/c/g0001_0100/s0023_merge_k_sorted_lists/Solution.c index 9d19146c..cfb43c67 100644 --- a/src/main/c/g0001_0100/s0023_merge_k_sorted_lists/Solution.c +++ b/src/main/c/g0001_0100/s0023_merge_k_sorted_lists/Solution.c @@ -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_10_29_Time_0_ms_(100.00%)_Space_13.8_MB_(64.94%) +// #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_29_Time_0_ms_(100.00%)_Space_13.8_MB_(64.94%) #include #include diff --git a/src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.c b/src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.c index 634a896f..3b3f0350 100644 --- a/src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.c +++ b/src/main/c/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_11.6_MB_(10.40%) #include diff --git a/src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.c b/src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.c index eb151134..eac66803 100644 --- a/src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.c +++ b/src/main/c/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_8.4_MB_(20.29%) #include diff --git a/src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.c b/src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.c index da073904..e10a8fbb 100644 --- a/src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.c +++ b/src/main/c/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_10_MB_(11.22%) +// #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_29_Time_0_ms_(100.00%)_Space_10_MB_(11.22%) #include diff --git a/src/main/c/g0001_0100/s0035_search_insert_position/Solution.c b/src/main/c/g0001_0100/s0035_search_insert_position/Solution.c index f6f0eda5..6213c17a 100644 --- a/src/main/c/g0001_0100/s0035_search_insert_position/Solution.c +++ b/src/main/c/g0001_0100/s0035_search_insert_position/Solution.c @@ -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_29_Time_0_ms_(100.00%)_Space_8.4_MB_(17.62%) #include diff --git a/src/main/c/g0001_0100/s0039_combination_sum/Solution.c b/src/main/c/g0001_0100/s0039_combination_sum/Solution.c index 7272c453..1ec0add0 100644 --- a/src/main/c/g0001_0100/s0039_combination_sum/Solution.c +++ b/src/main/c/g0001_0100/s0039_combination_sum/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_21.3_MB_(5.26%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_10_30_Time_0_ms_(100.00%)_Space_21.3_MB_(5.26%) #include #include diff --git a/src/main/c/g0001_0100/s0042_trapping_rain_water/Solution.c b/src/main/c/g0001_0100/s0042_trapping_rain_water/Solution.c index ebebb27c..1cb181b4 100644 --- a/src/main/c/g0001_0100/s0042_trapping_rain_water/Solution.c +++ b/src/main/c/g0001_0100/s0042_trapping_rain_water/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_9.6_MB_(64.92%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_30_Time_0_ms_(100.00%)_Space_9.6_MB_(64.92%) #include diff --git a/src/main/c/g0001_0100/s0045_jump_game_ii/Solution.c b/src/main/c/g0001_0100/s0045_jump_game_ii/Solution.c index fca82fe7..b9bf87b4 100644 --- a/src/main/c/g0001_0100/s0045_jump_game_ii/Solution.c +++ b/src/main/c/g0001_0100/s0045_jump_game_ii/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_8.7_MB_(93.45%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_30_Time_0_ms_(100.00%)_Space_8.7_MB_(93.45%) #include diff --git a/src/main/c/g0001_0100/s0046_permutations/Solution.c b/src/main/c/g0001_0100/s0046_permutations/Solution.c index b7340340..6ee9177d 100644 --- a/src/main/c/g0001_0100/s0046_permutations/Solution.c +++ b/src/main/c/g0001_0100/s0046_permutations/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_12.2_MB_(7.95%) #include diff --git a/src/main/c/g0001_0100/s0048_rotate_image/Solution.c b/src/main/c/g0001_0100/s0048_rotate_image/Solution.c index 5eaa8fdb..cb4d57fc 100644 --- a/src/main/c/g0001_0100/s0048_rotate_image/Solution.c +++ b/src/main/c/g0001_0100/s0048_rotate_image/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_10.2_MB_(38.96%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_10_30_Time_0_ms_(100.00%)_Space_10.2_MB_(38.96%) #include diff --git a/src/main/c/g0001_0100/s0049_group_anagrams/Solution.c b/src/main/c/g0001_0100/s0049_group_anagrams/Solution.c index c40d89cc..bf3abdb5 100644 --- a/src/main/c/g0001_0100/s0049_group_anagrams/Solution.c +++ b/src/main/c/g0001_0100/s0049_group_anagrams/Solution.c @@ -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_30_Time_3_ms_(100.00%)_Space_17.8_MB_(93.04%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_10_30_Time_3_ms_(100.00%)_Space_17.8_MB_(93.04%) /** diff --git a/src/main/c/g0001_0100/s0053_maximum_subarray/Solution.c b/src/main/c/g0001_0100/s0053_maximum_subarray/Solution.c index 436cc462..f2048f9f 100644 --- a/src/main/c/g0001_0100/s0053_maximum_subarray/Solution.c +++ b/src/main/c/g0001_0100/s0053_maximum_subarray/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_14.4_MB_(89.88%) #include diff --git a/src/main/c/g0001_0100/s0055_jump_game/Solution.c b/src/main/c/g0001_0100/s0055_jump_game/Solution.c index 6bee206d..e32ea54b 100644 --- a/src/main/c/g0001_0100/s0055_jump_game/Solution.c +++ b/src/main/c/g0001_0100/s0055_jump_game/Solution.c @@ -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_30_Time_0_ms_(100.00%)_Space_10.7_MB_(25.17%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_10_30_Time_0_ms_(100.00%)_Space_10.7_MB_(25.17%) #include #include diff --git a/src/main/c/g0001_0100/s0056_merge_intervals/Solution.c b/src/main/c/g0001_0100/s0056_merge_intervals/Solution.c index 167d8c5f..54f99e2c 100644 --- a/src/main/c/g0001_0100/s0056_merge_intervals/Solution.c +++ b/src/main/c/g0001_0100/s0056_merge_intervals/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_17.9_MB_(68.75%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_11_01_Time_0_ms_(100.00%)_Space_17.9_MB_(68.75%) #include #include diff --git a/src/main/c/g0001_0100/s0062_unique_paths/Solution.c b/src/main/c/g0001_0100/s0062_unique_paths/Solution.c index 9f12d033..7daa900f 100644 --- a/src/main/c/g0001_0100/s0062_unique_paths/Solution.c +++ b/src/main/c/g0001_0100/s0062_unique_paths/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_7.9_MB_(23.82%) +// #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_01_Time_0_ms_(100.00%)_Space_7.9_MB_(23.82%) #include #include diff --git a/src/main/c/g0001_0100/s0064_minimum_path_sum/Solution.c b/src/main/c/g0001_0100/s0064_minimum_path_sum/Solution.c index bd988456..526d0049 100644 --- a/src/main/c/g0001_0100/s0064_minimum_path_sum/Solution.c +++ b/src/main/c/g0001_0100/s0064_minimum_path_sum/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_11.1_MB_(9.24%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_11_01_Time_0_ms_(100.00%)_Space_11.1_MB_(9.24%) #include #include diff --git a/src/main/c/g0001_0100/s0070_climbing_stairs/Solution.c b/src/main/c/g0001_0100/s0070_climbing_stairs/Solution.c index f43fe1c7..5829e0bb 100644 --- a/src/main/c/g0001_0100/s0070_climbing_stairs/Solution.c +++ b/src/main/c/g0001_0100/s0070_climbing_stairs/Solution.c @@ -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_11_01_Time_1_ms_(100.00%)_Space_8.1_MB_(17.90%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_11_01_Time_1_ms_(100.00%)_Space_8.1_MB_(17.90%) #include #include diff --git a/src/main/c/g0001_0100/s0072_edit_distance/Solution.c b/src/main/c/g0001_0100/s0072_edit_distance/Solution.c index 65ce8576..6660d816 100644 --- a/src/main/c/g0001_0100/s0072_edit_distance/Solution.c +++ b/src/main/c/g0001_0100/s0072_edit_distance/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_8.4_MB_(97.63%) #include diff --git a/src/main/c/g0001_0100/s0073_set_matrix_zeroes/Solution.c b/src/main/c/g0001_0100/s0073_set_matrix_zeroes/Solution.c index a3f02220..9e0e6b54 100644 --- a/src/main/c/g0001_0100/s0073_set_matrix_zeroes/Solution.c +++ b/src/main/c/g0001_0100/s0073_set_matrix_zeroes/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_16.5_MB_(12.48%) #include diff --git a/src/main/c/g0001_0100/s0074_search_a_2d_matrix/Solution.c b/src/main/c/g0001_0100/s0074_search_a_2d_matrix/Solution.c index ce6d5250..3f8a43ac 100644 --- a/src/main/c/g0001_0100/s0074_search_a_2d_matrix/Solution.c +++ b/src/main/c/g0001_0100/s0074_search_a_2d_matrix/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_9_MB_(18.47%) #include diff --git a/src/main/c/g0001_0100/s0076_minimum_window_substring/Solution.c b/src/main/c/g0001_0100/s0076_minimum_window_substring/Solution.c index 42b5066d..50a49a17 100644 --- a/src/main/c/g0001_0100/s0076_minimum_window_substring/Solution.c +++ b/src/main/c/g0001_0100/s0076_minimum_window_substring/Solution.c @@ -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_11_01_Time_0_ms_(100.00%)_Space_10.2_MB_(9.21%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_11_01_Time_0_ms_(100.00%)_Space_10.2_MB_(9.21%) #include #include diff --git a/src/main/c/g0001_0100/s0079_word_search/Solution.c b/src/main/c/g0001_0100/s0079_word_search/Solution.c index 964377a0..5f31a60a 100644 --- a/src/main/c/g0001_0100/s0079_word_search/Solution.c +++ b/src/main/c/g0001_0100/s0079_word_search/Solution.c @@ -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_11_02_Time_121_ms_(92.31%)_Space_7.9_MB_(54.94%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_11_02_Time_121_ms_(92.31%)_Space_7.9_MB_(54.94%) bool dfsb(char **board, int mrow, int mcol, char *word, int crow, int ccol) { // This means we are done with search diff --git a/src/main/c/g0001_0100/s0098_validate_binary_search_tree/Solution.c b/src/main/c/g0001_0100/s0098_validate_binary_search_tree/Solution.c index d6075a48..f56164b3 100644 --- a/src/main/c/g0001_0100/s0098_validate_binary_search_tree/Solution.c +++ b/src/main/c/g0001_0100/s0098_validate_binary_search_tree/Solution.c @@ -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_11_02_Time_0_ms_(100.00%)_Space_11.9_MB_(57.64%) #include diff --git a/src/main/c/g0101_0200/s0101_symmetric_tree/Solution.c b/src/main/c/g0101_0200/s0101_symmetric_tree/Solution.c index e9b2f827..ecf5811a 100644 --- a/src/main/c/g0101_0200/s0101_symmetric_tree/Solution.c +++ b/src/main/c/g0101_0200/s0101_symmetric_tree/Solution.c @@ -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_11_02_Time_0_ms_(100.00%)_Space_9.9_MB_(97.31%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_11_02_Time_0_ms_(100.00%)_Space_9.9_MB_(97.31%) #include #include diff --git a/src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.c b/src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.c index 54ba12e2..84c17626 100644 --- a/src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.c +++ b/src/main/c/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.c @@ -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_11_02_Time_0_ms_(100.00%)_Space_12.8_MB_(78.13%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_11_02_Time_0_ms_(100.00%)_Space_12.8_MB_(78.13%) /** * Definition for a binary tree node. diff --git a/src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.c b/src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.c index 17dce462..bfc243d6 100644 --- a/src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.c +++ b/src/main/c/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.c @@ -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_11_02_Time_0_ms_(100.00%)_Space_11.1_MB_(72.74%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_11_02_Time_0_ms_(100.00%)_Space_11.1_MB_(72.74%) /** * Definition for a binary tree node. diff --git a/src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.c b/src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.c index 95f94bbf..f2e36d72 100644 --- a/src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.c +++ b/src/main/c/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.c @@ -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_11_02_Time_3_ms_(95.24%)_Space_14_MB_(86.50%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_11_02_Time_3_ms_(95.24%)_Space_14_MB_(86.50%) /** * Definition for a binary tree node. diff --git a/src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.c b/src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.c index 40676107..9568648e 100644 --- a/src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.c +++ b/src/main/c/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.c @@ -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_11_02_Time_0_ms_(100.00%)_Space_11.3_MB_(25.98%) /** diff --git a/src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.c b/src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.c index 4c7f6878..6b13d8ae 100644 --- a/src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.c +++ b/src/main/c/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.c @@ -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_11_03_Time_0_ms_(100.00%)_Space_15.1_MB_(71.35%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_11_03_Time_0_ms_(100.00%)_Space_15.1_MB_(71.35%) #include diff --git a/src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.c b/src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.c index ab0a76ce..1a123f9e 100644 --- a/src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.c +++ b/src/main/c/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.c @@ -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_11_03_Time_0_ms_(100.00%)_Space_16.8_MB_(63.02%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_11_03_Time_0_ms_(100.00%)_Space_16.8_MB_(63.02%) #include #include diff --git a/src/main/c/g0101_0200/s0128_longest_consecutive_sequence/Solution.c b/src/main/c/g0101_0200/s0128_longest_consecutive_sequence/Solution.c index 1dcd3bff..91735a69 100644 --- a/src/main/c/g0101_0200/s0128_longest_consecutive_sequence/Solution.c +++ b/src/main/c/g0101_0200/s0128_longest_consecutive_sequence/Solution.c @@ -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_11_03_Time_19_ms_(89.29%)_Space_15.8_MB_(58.07%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_11_03_Time_19_ms_(89.29%)_Space_15.8_MB_(58.07%) #include #include diff --git a/src/main/c/g0101_0200/s0131_palindrome_partitioning/Solution.c b/src/main/c/g0101_0200/s0131_palindrome_partitioning/Solution.c index e5a64ea6..ae325336 100644 --- a/src/main/c/g0101_0200/s0131_palindrome_partitioning/Solution.c +++ b/src/main/c/g0101_0200/s0131_palindrome_partitioning/Solution.c @@ -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_11_03_Time_19_ms_(89.29%)_Space_15.8_MB_(58.07%) +// #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_11_03_Time_19_ms_(89.29%)_Space_15.8_MB_(58.07%) /** * Return an array of arrays of size *returnSize. diff --git a/src/main/c/g0101_0200/s0136_single_number/Solution.c b/src/main/c/g0101_0200/s0136_single_number/Solution.c index 6b3b3ab5..f387da31 100644 --- a/src/main/c/g0101_0200/s0136_single_number/Solution.c +++ b/src/main/c/g0101_0200/s0136_single_number/Solution.c @@ -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_11_03_Time_0_ms_(100.00%)_Space_9.3_MB_(58.59%) #include diff --git a/src/main/c/g0101_0200/s0138_copy_list_with_random_pointer/Solution.c b/src/main/c/g0101_0200/s0138_copy_list_with_random_pointer/Solution.c index f0532f9c..e0ac0101 100644 --- a/src/main/c/g0101_0200/s0138_copy_list_with_random_pointer/Solution.c +++ b/src/main/c/g0101_0200/s0138_copy_list_with_random_pointer/Solution.c @@ -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_11_03_Time_4_ms_(91.18%)_Space_14.2_MB_(54.40%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2024_11_03_Time_4_ms_(91.18%)_Space_14.2_MB_(54.40%) #include diff --git a/src/main/c/g0101_0200/s0139_word_break/Solution.c b/src/main/c/g0101_0200/s0139_word_break/Solution.c index a97561b3..ceec1de4 100644 --- a/src/main/c/g0101_0200/s0139_word_break/Solution.c +++ b/src/main/c/g0101_0200/s0139_word_break/Solution.c @@ -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_11_03_Time_0_ms_(100.00%)_Space_8.3_MB_(26.03%) +// #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_11_03_Time_0_ms_(100.00%)_Space_8.3_MB_(26.03%) bool wordBreak(char* s, char** wordDict, int wordDictSize) { bool dp[strlen(s)+1]; diff --git a/src/main/c/g0101_0200/s0141_linked_list_cycle/Solution.c b/src/main/c/g0101_0200/s0141_linked_list_cycle/Solution.c index 95021dfb..44043868 100644 --- a/src/main/c/g0101_0200/s0141_linked_list_cycle/Solution.c +++ b/src/main/c/g0101_0200/s0141_linked_list_cycle/Solution.c @@ -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_11_03_Time_6_ms_(92.85%)_Space_11.3_MB_(13.22%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_11_03_Time_6_ms_(92.85%)_Space_11.3_MB_(13.22%) /** * Definition for singly-linked list. diff --git a/src/main/c/g0101_0200/s0146_lru_cache/LRUCache.c b/src/main/c/g0101_0200/s0146_lru_cache/LRUCache.c index 7fbfa95f..9b69e393 100644 --- a/src/main/c/g0101_0200/s0146_lru_cache/LRUCache.c +++ b/src/main/c/g0101_0200/s0146_lru_cache/LRUCache.c @@ -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_11_03_Time_37_ms_(91.67%)_Space_114.8_MB_(43.55%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_11_03_Time_37_ms_(91.67%)_Space_114.8_MB_(43.55%) // Define a node in the doubly linked list typedef struct LRUNode { diff --git a/src/main/c/g0101_0200/s0148_sort_list/Solution.c b/src/main/c/g0101_0200/s0148_sort_list/Solution.c index 25a99bfa..890634d2 100644 --- a/src/main/c/g0101_0200/s0148_sort_list/Solution.c +++ b/src/main/c/g0101_0200/s0148_sort_list/Solution.c @@ -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_11_05_Time_3_ms_(100.00%)_Space_24.9_MB_(54.16%) +// #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_11_05_Time_3_ms_(100.00%)_Space_24.9_MB_(54.16%) #include #include diff --git a/src/main/c/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.c b/src/main/c/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.c index 4e2fbc95..241e88bb 100644 --- a/src/main/c/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.c +++ b/src/main/c/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_8.1_MB_(92.83%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_11_05_Time_0_ms_(100.00%)_Space_8.1_MB_(92.83%) #include diff --git a/src/main/c/g0101_0200/s0155_min_stack/MinStack.c b/src/main/c/g0101_0200/s0155_min_stack/MinStack.c index bfca2c60..524d2e44 100644 --- a/src/main/c/g0101_0200/s0155_min_stack/MinStack.c +++ b/src/main/c/g0101_0200/s0155_min_stack/MinStack.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_18.9_MB_(17.82%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2024_11_05_Time_0_ms_(100.00%)_Space_18.9_MB_(17.82%) #include #include diff --git a/src/main/c/g0101_0200/s0169_majority_element/Solution.c b/src/main/c/g0101_0200/s0169_majority_element/Solution.c index 4ff96d19..9bf80463 100644 --- a/src/main/c/g0101_0200/s0169_majority_element/Solution.c +++ b/src/main/c/g0101_0200/s0169_majority_element/Solution.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_10.3_MB_(31.00%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_11_05_Time_0_ms_(100.00%)_Space_10.3_MB_(31.00%) #include diff --git a/src/main/c/g0101_0200/s0189_rotate_array/Solution.c b/src/main/c/g0101_0200/s0189_rotate_array/Solution.c index 8d724b24..b9f385a0 100644 --- a/src/main/c/g0101_0200/s0189_rotate_array/Solution.c +++ b/src/main/c/g0101_0200/s0189_rotate_array/Solution.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_26.6_MB_(36.20%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_11_05_Time_0_ms_(100.00%)_Space_26.6_MB_(36.20%) #include diff --git a/src/main/c/g0101_0200/s0198_house_robber/Solution.c b/src/main/c/g0101_0200/s0198_house_robber/Solution.c index 695b4bf4..27ec1028 100644 --- a/src/main/c/g0101_0200/s0198_house_robber/Solution.c +++ b/src/main/c/g0101_0200/s0198_house_robber/Solution.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_8.3_MB_(7.79%) +// #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_05_Time_0_ms_(100.00%)_Space_8.3_MB_(7.79%) #include diff --git a/src/main/c/g0101_0200/s0200_number_of_islands/Solution.c b/src/main/c/g0101_0200/s0200_number_of_islands/Solution.c index 0ad469f2..3f3774ed 100644 --- a/src/main/c/g0101_0200/s0200_number_of_islands/Solution.c +++ b/src/main/c/g0101_0200/s0200_number_of_islands/Solution.c @@ -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_11_05_Time_14_ms_(96.18%)_Space_11.7_MB_(59.93%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_11_05_Time_14_ms_(96.18%)_Space_11.7_MB_(59.93%) void DFS(int row, int col, int m, int n, char** grid) { if (row < 0 || row >= m || col < 0 || col >= n || grid[row][col] == '0') { diff --git a/src/main/c/g0201_0300/s0206_reverse_linked_list/Solution.c b/src/main/c/g0201_0300/s0206_reverse_linked_list/Solution.c index 7197b924..fb1d994d 100644 --- a/src/main/c/g0201_0300/s0206_reverse_linked_list/Solution.c +++ b/src/main/c/g0201_0300/s0206_reverse_linked_list/Solution.c @@ -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_11_05_Time_0_ms_(100.00%)_Space_10.6_MB_(53.47%) +// #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_05_Time_0_ms_(100.00%)_Space_10.6_MB_(53.47%) #include #include diff --git a/src/main/c/g0201_0300/s0207_course_schedule/Solution.c b/src/main/c/g0201_0300/s0207_course_schedule/Solution.c index 2ac2b555..b3650693 100644 --- a/src/main/c/g0201_0300/s0207_course_schedule/Solution.c +++ b/src/main/c/g0201_0300/s0207_course_schedule/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_11.5_MB_(87.84%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_11_06_Time_0_ms_(100.00%)_Space_11.5_MB_(87.84%) typedef struct node { int V; diff --git a/src/main/c/g0201_0300/s0208_implement_trie_prefix_tree/Trie.c b/src/main/c/g0201_0300/s0208_implement_trie_prefix_tree/Trie.c index 492aa117..c2d0c81a 100644 --- a/src/main/c/g0201_0300/s0208_implement_trie_prefix_tree/Trie.c +++ b/src/main/c/g0201_0300/s0208_implement_trie_prefix_tree/Trie.c @@ -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_11_06_Time_7_ms_(100.00%)_Space_43.8_MB_(15.88%) diff --git a/src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.c b/src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.c index be963369..f60a06bb 100644 --- a/src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.c +++ b/src/main/c/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_14_MB_(67.54%) #include diff --git a/src/main/c/g0201_0300/s0221_maximal_square/Solution.c b/src/main/c/g0201_0300/s0221_maximal_square/Solution.c index 41782da4..1bb34194 100644 --- a/src/main/c/g0201_0300/s0221_maximal_square/Solution.c +++ b/src/main/c/g0201_0300/s0221_maximal_square/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_16.6_MB_(8.16%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_11_06_Time_0_ms_(100.00%)_Space_16.6_MB_(8.16%) #include #include diff --git a/src/main/c/g0201_0300/s0226_invert_binary_tree/Solution.c b/src/main/c/g0201_0300/s0226_invert_binary_tree/Solution.c index cd2f1373..4d786f9a 100644 --- a/src/main/c/g0201_0300/s0226_invert_binary_tree/Solution.c +++ b/src/main/c/g0201_0300/s0226_invert_binary_tree/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_8.4_MB_(85.55%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_11_06_Time_0_ms_(100.00%)_Space_8.4_MB_(85.55%) /** * Definition for a binary tree node. diff --git a/src/main/c/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.c b/src/main/c/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.c index 38749081..82d3055e 100644 --- a/src/main/c/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.c +++ b/src/main/c/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_13.6_MB_(59.19%) /** diff --git a/src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.c b/src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.c index 1a097d3a..aee8b5b8 100644 --- a/src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.c +++ b/src/main/c/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.c @@ -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_11_06_Time_15_ms_(90.08%)_Space_21.1_MB_(76.15%) /** diff --git a/src/main/c/g0201_0300/s0238_product_of_array_except_self/Solution.c b/src/main/c/g0201_0300/s0238_product_of_array_except_self/Solution.c index b861a6ce..92df36fa 100644 --- a/src/main/c/g0201_0300/s0238_product_of_array_except_self/Solution.c +++ b/src/main/c/g0201_0300/s0238_product_of_array_except_self/Solution.c @@ -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_11_06_Time_0_ms_(100.00%)_Space_30.1_MB_(83.93%) #include diff --git a/src/main/c/g0201_0300/s0283_move_zeroes/Solution.c b/src/main/c/g0201_0300/s0283_move_zeroes/Solution.c index 89308ea4..78f49d0a 100644 --- a/src/main/c/g0201_0300/s0283_move_zeroes/Solution.c +++ b/src/main/c/g0201_0300/s0283_move_zeroes/Solution.c @@ -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_11_07_Time_0_ms_(100.00%)_Space_19.5_MB_(47.88%) +// #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_07_Time_0_ms_(100.00%)_Space_19.5_MB_(47.88%) #include diff --git a/src/main/c/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.c b/src/main/c/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.c index bcb017a2..f2baa7d9 100644 --- a/src/main/c/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.c +++ b/src/main/c/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.c @@ -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_11_07_Time_28_ms_(100.00%)_Space_85.9_MB_(78.95%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_11_07_Time_28_ms_(100.00%)_Space_85.9_MB_(78.95%) #include #include diff --git a/src/main/c/g0201_0300/s0300_longest_increasing_subsequence/Solution.c b/src/main/c/g0201_0300/s0300_longest_increasing_subsequence/Solution.c index 114d2bdb..f5c9e9e5 100644 --- a/src/main/c/g0201_0300/s0300_longest_increasing_subsequence/Solution.c +++ b/src/main/c/g0201_0300/s0300_longest_increasing_subsequence/Solution.c @@ -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_11_07_Time_0_ms_(100.00%)_Space_8.4_MB_(29.59%) #include diff --git a/src/main/c/g0301_0400/s0322_coin_change/Solution.c b/src/main/c/g0301_0400/s0322_coin_change/Solution.c index 4b09d281..77cfa6eb 100644 --- a/src/main/c/g0301_0400/s0322_coin_change/Solution.c +++ b/src/main/c/g0301_0400/s0322_coin_change/Solution.c @@ -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_11_07_Time_22_ms_(87.50%)_Space_12.3_MB_(23.00%) #include diff --git a/src/main/c/g0301_0400/s0338_counting_bits/Solution.c b/src/main/c/g0301_0400/s0338_counting_bits/Solution.c index 6127925c..10e6b23f 100644 --- a/src/main/c/g0301_0400/s0338_counting_bits/Solution.c +++ b/src/main/c/g0301_0400/s0338_counting_bits/Solution.c @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_11_07_Time_0_ms_(100.00%)_Space_15_MB_(36.75%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_11_07_Time_0_ms_(100.00%)_Space_15_MB_(36.75%) #include #include diff --git a/src/main/c/g0301_0400/s0394_decode_string/Solution.c b/src/main/c/g0301_0400/s0394_decode_string/Solution.c index e2f7ab14..5e2009db 100644 --- a/src/main/c/g0301_0400/s0394_decode_string/Solution.c +++ b/src/main/c/g0301_0400/s0394_decode_string/Solution.c @@ -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_11_07_Time_0_ms_(100.00%)_Space_9.1_MB_(21.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_07_Time_0_ms_(100.00%)_Space_9.1_MB_(21.38%) #include #include diff --git a/src/main/c/g0401_0500/s0437_path_sum_iii/Solution.c b/src/main/c/g0401_0500/s0437_path_sum_iii/Solution.c index 221c3155..6a4b5890 100644 --- a/src/main/c/g0401_0500/s0437_path_sum_iii/Solution.c +++ b/src/main/c/g0401_0500/s0437_path_sum_iii/Solution.c @@ -1,4 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #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_08_Time_6_ms_(96.00%)_Space_11.6_MB_(88.00%) /** diff --git a/src/main/c/g0701_0800/s0739_daily_temperatures/Solution.c b/src/main/c/g0701_0800/s0739_daily_temperatures/Solution.c index 3ac50a7d..ffd4d07c 100644 --- a/src/main/c/g0701_0800/s0739_daily_temperatures/Solution.c +++ b/src/main/c/g0701_0800/s0739_daily_temperatures/Solution.c @@ -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_11_08_Time_3_ms_(98.31%)_Space_68.5_MB_(94.81%) +// #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_08_Time_3_ms_(98.31%)_Space_68.5_MB_(94.81%) #include #include diff --git a/src/main/c/g0701_0800/s0763_partition_labels/Solution.c b/src/main/c/g0701_0800/s0763_partition_labels/Solution.c index c276a9ef..86f61934 100644 --- a/src/main/c/g0701_0800/s0763_partition_labels/Solution.c +++ b/src/main/c/g0701_0800/s0763_partition_labels/Solution.c @@ -1,5 +1,6 @@ -// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String -// #Big_O_Time_O(n)_Space_O(1) #2024_11_08_Time_0_ms_(100.00%)_Space_9.1_MB_(17.39%) +// #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_11_08_Time_0_ms_(100.00%)_Space_9.1_MB_(17.39%) #include #include diff --git a/src/main/c/g1101_1200/s1143_longest_common_subsequence/Solution.c b/src/main/c/g1101_1200/s1143_longest_common_subsequence/Solution.c index 40ac15e0..38a24400 100644 --- a/src/main/c/g1101_1200/s1143_longest_common_subsequence/Solution.c +++ b/src/main/c/g1101_1200/s1143_longest_common_subsequence/Solution.c @@ -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_11_08_Time_21_ms_(84.72%)_Space_12.2_MB_(58.02%) 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/s0142_linked_list_cycle_ii/Solution.cpp b/src/main/cpp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cpp index 718cf889..3b69c41f 100644 --- a/src/main/cpp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0142_linked_list_cycle_ii/Solution.cpp @@ -2,6 +2,16 @@ // #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_05_27_Time_9_ms_(47.48%)_Space_10.2_MB_(18.65%) +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ class Solution { public: ListNode* detectCycle(ListNode* head) { 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..cf4520bd 100644 --- a/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp +++ b/src/main/cpp/g0101_0200/s0148_sort_list/Solution.cpp @@ -1,7 +1,17 @@ // #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%) +/** + * Definition for singly-linked list. + * struct ListNode { + * int val; + * ListNode *next; + * ListNode() : val(0), next(nullptr) {} + * ListNode(int x) : val(x), next(nullptr) {} + * ListNode(int x, ListNode *next) : val(x), next(next) {} + * }; + */ class Solution { public: ListNode* sortList(ListNode* head) { 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..45bac3c8 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 #Big_O_Time_O(n)_Space_O(n) +// #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..84fcc72c 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%) +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) +// #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..d39d5192 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,7 @@ 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 #Big_O_Time_O(n)_Space_O(n) +// #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..2977303a 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 #Big_O_Time_O(log10(x))_Space_O(1) +// #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..5688696a 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,8 @@ 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 #Top_100_Liked_Questions #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..21107751 100644 --- a/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs +++ b/src/main/csharp/g0701_0800/s0763_partition_labels/Solution.cs @@ -2,7 +2,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%) +// #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/s0001_two_sum/Solution.ex b/src/main/elixir/g0001_0100/s0001_two_sum/Solution.ex index 39cb0b79..2060bb44 100644 --- a/src/main/elixir/g0001_0100/s0001_two_sum/Solution.ex +++ b/src/main/elixir/g0001_0100/s0001_two_sum/Solution.ex @@ -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_07_06_Time_261_ms_(94.89%)_Space_77.3_MB_(46.59%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex b/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex index ad4d7760..4964288c 100644 --- a/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex +++ b/src/main/elixir/g0001_0100/s0002_add_two_numbers/Solution.ex @@ -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_07_06_Time_353_ms_(88.68%)_Space_72.6_MB_(9.43%) +# #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_07_06_Time_353_ms_(88.68%)_Space_72.6_MB_(9.43%) # Definition for singly-linked list. # diff --git a/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex b/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex index 9b0108dd..ecb69d37 100644 --- a/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex +++ b/src/main/elixir/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.ex @@ -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_07_06_Time_356_ms_(93.33%)_Space_84.7_MB_(8.89%) +# #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +# #2024_07_06_Time_356_ms_(93.33%)_Space_84.7_MB_(8.89%) defmodule Solution do @spec length_of_longest_substring(s :: String.t()) :: integer diff --git a/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex b/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex index f9a4de7b..2577342b 100644 --- a/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex +++ b/src/main/elixir/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.ex @@ -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_07_06_Time_474_ms_(86.21%)_Space_75.1_MB_(55.17%) +# #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_07_06_Time_474_ms_(86.21%)_Space_75.1_MB_(55.17%) defmodule Solution do @spec find_median_sorted_arrays(nums1 :: [integer], nums2 :: [integer]) :: float diff --git a/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex b/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex index e29de2bc..5aff1d3c 100644 --- a/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex +++ b/src/main/elixir/g0001_0100/s0005_longest_palindromic_substring/Solution.ex @@ -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_07_06_Time_337_ms_(100.00%)_Space_72.9_MB_(85.71%) +# #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +# #Big_O_Time_O(n)_Space_O(n) #2024_07_06_Time_337_ms_(100.00%)_Space_72.9_MB_(85.71%) defmodule Solution do @spec longest_palindrome(s :: String.t()) :: String.t() diff --git a/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex b/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex index dd4c3663..4d6e27da 100644 --- a/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex +++ b/src/main/elixir/g0001_0100/s0006_zigzag_conversion/Solution.ex @@ -1,4 +1,5 @@ -# #Medium #String #2024_07_31_Time_421_ms_(100.00%)_Space_73.2_MB_(100.00%) +# #Medium #String #Top_Interview_150_Array/String +# #2024_07_31_Time_421_ms_(100.00%)_Space_73.2_MB_(100.00%) defmodule Solution do @spec convert(s :: String.t, num_rows :: integer) :: String.t diff --git a/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex b/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex index 2df04441..ed639924 100644 --- a/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex +++ b/src/main/elixir/g0001_0100/s0009_palindrome_number/Solution.ex @@ -1,4 +1,5 @@ -# #Easy #Math #Udemy_Integers #2024_07_31_Time_1007_ms_(87.50%)_Space_72_MB_(33.93%) +# #Easy #Math #Udemy_Integers #Top_Interview_150_Math +# #2024_07_31_Time_1007_ms_(87.50%)_Space_72_MB_(33.93%) defmodule Solution do @spec is_palindrome(x :: integer) :: boolean diff --git a/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex b/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex index f54d04b8..d8fdd125 100644 --- a/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex +++ b/src/main/elixir/g0001_0100/s0011_container_with_most_water/Solution.ex @@ -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_07_31_Time_620_ms_(93.33%)_Space_137.1_MB_(6.67%) +# #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +# #Big_O_Time_O(n)_Space_O(1) #2024_07_31_Time_620_ms_(93.33%)_Space_137.1_MB_(6.67%) defmodule Solution do @spec max_area(height :: [integer]) :: integer diff --git a/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex b/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex index 8253120b..d2d7dd65 100644 --- a/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex +++ b/src/main/elixir/g0001_0100/s0015_3sum/Solution.ex @@ -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_07_31_Time_717_ms_(100.00%)_Space_78.5_MB_(100.00%) +# #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +# #2024_07_31_Time_717_ms_(100.00%)_Space_78.5_MB_(100.00%) defmodule Solution do @spec three_sum(nums :: [integer]) :: [[integer]] diff --git a/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex b/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex index 072059f2..3debee64 100644 --- a/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex +++ b/src/main/elixir/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.ex @@ -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_07_31_Time_279_ms_(100.00%)_Space_72_MB_(100.00%) +# #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_07_31_Time_279_ms_(100.00%)_Space_72_MB_(100.00%) defmodule Solution do @t9 (Enum.chunk_every(?a..?o, 3) ++ [~c"pqrs", ~c"tuv", ~c"wxyz"]) diff --git a/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex b/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex index ede578eb..f20c3b01 100644 --- a/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex +++ b/src/main/elixir/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.ex @@ -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_07_31_Time_275_ms_(100.00%)_Space_72_MB_(33.33%) +# #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_07_31_Time_275_ms_(100.00%)_Space_72_MB_(33.33%) # Definition for singly-linked list. # diff --git a/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex b/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex index 17e605dc..0d368cee 100644 --- a/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex +++ b/src/main/elixir/g0001_0100/s0020_valid_parentheses/Solution.ex @@ -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_07_31_Time_252_ms_(81.48%)_Space_71.9_MB_(77.78%) +# #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +# #Big_O_Time_O(n)_Space_O(n) #2024_07_31_Time_252_ms_(81.48%)_Space_71.9_MB_(77.78%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex b/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex index 49f4a96c..1f2dd11e 100644 --- a/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex +++ b/src/main/elixir/g0001_0100/s0021_merge_two_sorted_lists/Solution.ex @@ -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_07_31_Time_261_ms_(85.00%)_Space_71.9_MB_(40.00%) +# #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_07_31_Time_261_ms_(85.00%)_Space_71.9_MB_(40.00%) # Definition for singly-linked list. # diff --git a/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex b/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex index 32ab9efe..a77bf11d 100644 --- a/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex +++ b/src/main/elixir/g0001_0100/s0022_generate_parentheses/Solution.ex @@ -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_07_31_Time_229_ms_(100.00%)_Space_71.5_MB_(100.00%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +# #2024_07_31_Time_229_ms_(100.00%)_Space_71.5_MB_(100.00%) defmodule Solution do @spec generate_parenthesis(n :: integer) :: [String.t()] diff --git a/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex b/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex index aa5f8b5d..a5180e06 100644 --- a/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex +++ b/src/main/elixir/g0001_0100/s0023_merge_k_sorted_lists/Solution.ex @@ -1,5 +1,6 @@ -# #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) +# #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Heap_Priority_Queue #Linked_List +# #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +# #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) # #2024_07_31_Time_215_ms_(100.00%)_Space_72.1_MB_(33.33%) # Definition for singly-linked list. diff --git a/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex b/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex index 49387562..5d067cc4 100644 --- a/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex +++ b/src/main/elixir/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.ex @@ -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_07_31_Time_237_ms_(100.00%)_Space_74.4_MB_(50.00%) # Definition for singly-linked list. diff --git a/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex b/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex index a7db578f..081a328c 100644 --- a/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex +++ b/src/main/elixir/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.ex @@ -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_08_02_Time_292_ms_(100.00%)_Space_73.4_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex b/src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex index 41e35f46..77ce55ca 100644 --- a/src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex +++ b/src/main/elixir/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.ex @@ -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_08_02_Time_1249_ms_(100.00%)_Space_110.3_MB_(100.00%) +# #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_08_02_Time_1249_ms_(100.00%)_Space_110.3_MB_(100.00%) defmodule Solution do @spec search_range(nums :: [integer], target :: integer) :: [integer] diff --git a/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex b/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex index 483729cb..a7fe27c9 100644 --- a/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex +++ b/src/main/elixir/g0001_0100/s0035_search_insert_position/Solution.ex @@ -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_08_02_Time_228_ms_(100.00%)_Space_76.9_MB_(40.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex b/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex index 6a06cf20..e235cc0a 100644 --- a/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex +++ b/src/main/elixir/g0001_0100/s0039_combination_sum/Solution.ex @@ -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_08_02_Time_264_ms_(100.00%)_Space_71.9_MB_(66.67%) +# #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +# #2024_08_02_Time_264_ms_(100.00%)_Space_71.9_MB_(66.67%) defmodule Solution do @spec combination_sum(candidates :: [integer], target :: integer) :: [[integer]] diff --git a/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex b/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex index 94eee840..9055bbe1 100644 --- a/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex +++ b/src/main/elixir/g0001_0100/s0042_trapping_rain_water/Solution.ex @@ -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_08_02_Time_280_ms_(100.00%)_Space_84.3_MB_(100.00%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_08_02_Time_280_ms_(100.00%)_Space_84.3_MB_(100.00%) defmodule Solution do @spec trap(h :: [integer]) :: integer diff --git a/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex b/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex index 8c1840fe..81ced267 100644 --- a/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex +++ b/src/main/elixir/g0001_0100/s0045_jump_game_ii/Solution.ex @@ -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_08_02_Time_299_ms_(100.00%)_Space_79.2_MB_(33.33%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_08_02_Time_299_ms_(100.00%)_Space_79.2_MB_(33.33%) defmodule Solution do @spec jump(nums :: [integer]) :: integer diff --git a/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex b/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex index 254db707..ab316388 100644 --- a/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex +++ b/src/main/elixir/g0001_0100/s0046_permutations/Solution.ex @@ -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_08_02_Time_225_ms_(100.00%)_Space_71.8_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex b/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex index 533113a9..619ac97c 100644 --- a/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex +++ b/src/main/elixir/g0001_0100/s0049_group_anagrams/Solution.ex @@ -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_08_02_Time_339_ms_(66.67%)_Space_88_MB_(66.67%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +# #2024_08_02_Time_339_ms_(66.67%)_Space_88_MB_(66.67%) defmodule Solution do @spec group_anagrams(strs :: [String.t]) :: [[String.t]] diff --git a/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex b/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex index df585874..540aac2c 100644 --- a/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex +++ b/src/main/elixir/g0001_0100/s0053_maximum_subarray/Solution.ex @@ -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_08_02_Time_920_ms_(100.00%)_Space_157.5_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex b/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex index 0109eaf0..55920aa9 100644 --- a/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex +++ b/src/main/elixir/g0001_0100/s0055_jump_game/Solution.ex @@ -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_08_02_Time_437_ms_(100.00%)_Space_89.3_MB_(69.23%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_08_02_Time_437_ms_(100.00%)_Space_89.3_MB_(69.23%) defmodule Solution do @spec can_jump(nums :: [integer]) :: boolean diff --git a/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex b/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex index 85d6ad6e..e8acbb1d 100644 --- a/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex +++ b/src/main/elixir/g0001_0100/s0056_merge_intervals/Solution.ex @@ -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_08_02_Time_305_ms_(100.00%)_Space_80.6_MB_(100.00%) +# #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +# #2024_08_02_Time_305_ms_(100.00%)_Space_80.6_MB_(100.00%) defmodule Solution do @spec merge(intervals :: [[integer]]) :: [[integer]] diff --git a/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex b/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex index e87dcb3d..620db19c 100644 --- a/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex +++ b/src/main/elixir/g0001_0100/s0062_unique_paths/Solution.ex @@ -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_08_02_Time_233_ms_(100.00%)_Space_71.9_MB_(66.67%) +# #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_08_02_Time_233_ms_(100.00%)_Space_71.9_MB_(66.67%) defmodule Solution do @spec unique_paths(m :: integer, n :: integer) :: integer 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..05964a17 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,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) -# #2025_01_22_Time_3_(100.00%)_Space_89.73_(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) #2025_01_22_Time_3_ms_(100.00%)_Space_89.73_MB_(100.00%) defmodule Solution do @spec min_path_sum(grid :: [[integer]]) :: integer diff --git a/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex b/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex index 84ca1696..86160d1c 100644 --- a/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex +++ b/src/main/elixir/g0001_0100/s0070_climbing_stairs/Solution.ex @@ -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_08_02_Time_255_ms_(100.00%)_Space_71.6_MB_(100.00%) +# #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +# #Big_O_Time_O(n)_Space_O(n) #2024_08_02_Time_255_ms_(100.00%)_Space_71.6_MB_(100.00%) defmodule Solution do @spec climb_stairs(n :: integer) :: integer diff --git a/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex b/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex index 57ff4c76..8978c9c5 100644 --- a/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex +++ b/src/main/elixir/g0001_0100/s0072_edit_distance/Solution.ex @@ -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_08_02_Time_675_ms_(100.00%)_Space_164.7_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex b/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex index f21e3b97..e6232388 100644 --- a/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex +++ b/src/main/elixir/g0001_0100/s0074_search_a_2d_matrix/Solution.ex @@ -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_08_02_Time_253_ms_(100.00%)_Space_74_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex b/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex index cc5c0954..0e2de810 100644 --- a/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex +++ b/src/main/elixir/g0001_0100/s0079_word_search/Solution.ex @@ -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_08_03_Time_1312_ms_(100.00%)_Space_71.1_MB_(100.00%) +# #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +# #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_08_03_Time_1312_ms_(100.00%)_Space_71.1_MB_(100.00%) defmodule Solution do @spec exist(board :: [[char]], word :: String.t) :: boolean diff --git a/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex b/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex index 8468a68d..af0422da 100644 --- a/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex +++ b/src/main/elixir/g0001_0100/s0098_validate_binary_search_tree/Solution.ex @@ -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_08_03_Time_239_ms_(100.00%)_Space_82.9_MB_(33.33%) # Definition for a binary tree node. diff --git a/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex b/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex index 9338ae32..b98278c6 100644 --- a/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex +++ b/src/main/elixir/g0101_0200/s0101_symmetric_tree/Solution.ex @@ -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_08_03_Time_255_ms_(60.00%)_Space_72.3_MB_(100.00%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +# #2024_08_03_Time_255_ms_(60.00%)_Space_72.3_MB_(100.00%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex b/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex index 85fb733c..d68bbe48 100644 --- a/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex +++ b/src/main/elixir/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.ex @@ -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_08_03_Time_252_ms_(100.00%)_Space_74.9_MB_(33.33%) +# #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +# #2024_08_03_Time_252_ms_(100.00%)_Space_74.9_MB_(33.33%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex b/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex index ed9b57a4..bd6016e0 100644 --- a/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex +++ b/src/main/elixir/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.ex @@ -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_08_03_Time_254_ms_(100.00%)_Space_77.8_MB_(50.00%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +# #2024_08_03_Time_254_ms_(100.00%)_Space_77.8_MB_(50.00%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex b/src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex index ba9bc369..1940cd82 100644 --- a/src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex +++ b/src/main/elixir/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.ex @@ -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_08_03_Time_385_ms_(100.00%)_Space_75.6_MB_(50.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_08_03_Time_385_ms_(100.00%)_Space_75.6_MB_(50.00%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex b/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex index d930618e..80cbb458 100644 --- a/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex +++ b/src/main/elixir/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.ex @@ -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_08_03_Time_797_ms_(30.00%)_Space_131.8_MB_(30.00%) +# #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +# #2024_08_03_Time_797_ms_(30.00%)_Space_131.8_MB_(30.00%) defmodule Solution do @spec max_profit(prices :: [integer]) :: integer diff --git a/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex b/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex index a3fe6be4..49b79850 100644 --- a/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex +++ b/src/main/elixir/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.ex @@ -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_08_03_Time_291_ms_(100.00%)_Space_97.2_MB_(100.00%) +# #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +# #Big_O_Time_O(N)_Space_O(N) #2024_08_03_Time_291_ms_(100.00%)_Space_97.2_MB_(100.00%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex b/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex index d0d9ffd6..75ff2f67 100644 --- a/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex +++ b/src/main/elixir/g0101_0200/s0128_longest_consecutive_sequence/Solution.ex @@ -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_08_03_Time_669_ms_(100.00%)_Space_208.6_MB_(85.71%) +# #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +# #2024_08_03_Time_669_ms_(100.00%)_Space_208.6_MB_(85.71%) defmodule Solution do @spec longest_consecutive(nums :: [integer]) :: integer diff --git a/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex b/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex index edd3ea30..763bfbe7 100644 --- a/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex +++ b/src/main/elixir/g0101_0200/s0136_single_number/Solution.ex @@ -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_08_03_Time_295_ms_(100.00%)_Space_84.9_MB_(85.71%) defmodule Solution do diff --git a/src/main/elixir/g0101_0200/s0139_word_break/Solution.ex b/src/main/elixir/g0101_0200/s0139_word_break/Solution.ex index 1c7b01b8..ee81748b 100644 --- a/src/main/elixir/g0101_0200/s0139_word_break/Solution.ex +++ b/src/main/elixir/g0101_0200/s0139_word_break/Solution.ex @@ -1,6 +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) +# #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_08_03_Time_263_ms_(100.00%)_Space_72.1_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0101_0200/s0148_sort_list/Solution.ex b/src/main/elixir/g0101_0200/s0148_sort_list/Solution.ex index abfd9de1..cb0bd924 100644 --- a/src/main/elixir/g0101_0200/s0148_sort_list/Solution.ex +++ b/src/main/elixir/g0101_0200/s0148_sort_list/Solution.ex @@ -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_08_03_Time_489_ms_(100.00%)_Space_113.6_MB_(100.00%) +# #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_08_03_Time_489_ms_(100.00%)_Space_113.6_MB_(100.00%) # Definition for singly-linked list. # diff --git a/src/main/elixir/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.ex b/src/main/elixir/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.ex index 035c6874..4c050b61 100644 --- a/src/main/elixir/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.ex +++ b/src/main/elixir/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.ex @@ -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_08_03_Time_991_ms_(100.00%)_Space_76.1_MB_(100.00%) +# #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +# #Big_O_Time_O(log_N)_Space_O(log_N) #2024_08_03_Time_991_ms_(100.00%)_Space_76.1_MB_(100.00%) defmodule Solution do @spec find_min(nums :: [integer]) :: integer diff --git a/src/main/elixir/g0101_0200/s0155_min_stack/MinStack.ex b/src/main/elixir/g0101_0200/s0155_min_stack/MinStack.ex index 6c173eea..66a919f5 100644 --- a/src/main/elixir/g0101_0200/s0155_min_stack/MinStack.ex +++ b/src/main/elixir/g0101_0200/s0155_min_stack/MinStack.ex @@ -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_08_03_Time_385_ms_(100.00%)_Space_89.9_MB_(100.00%) defmodule MinStack do diff --git a/src/main/elixir/g0101_0200/s0169_majority_element/Solution.ex b/src/main/elixir/g0101_0200/s0169_majority_element/Solution.ex index aaafbb9b..3357990b 100644 --- a/src/main/elixir/g0101_0200/s0169_majority_element/Solution.ex +++ b/src/main/elixir/g0101_0200/s0169_majority_element/Solution.ex @@ -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_08_03_Time_278_ms_(100.00%)_Space_89.8_MB_(61.54%) +# #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +# #2024_08_03_Time_278_ms_(100.00%)_Space_89.8_MB_(61.54%) defmodule Solution do @spec majority_element(nums :: [integer]) :: integer diff --git a/src/main/elixir/g0101_0200/s0198_house_robber/Solution.ex b/src/main/elixir/g0101_0200/s0198_house_robber/Solution.ex index 63e3c4d9..c8b819db 100644 --- a/src/main/elixir/g0101_0200/s0198_house_robber/Solution.ex +++ b/src/main/elixir/g0101_0200/s0198_house_robber/Solution.ex @@ -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_08_03_Time_249_ms_(100.00%)_Space_72.1_MB_(100.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_08_03_Time_249_ms_(100.00%)_Space_72.1_MB_(100.00%) defmodule Solution do @spec rob(nums :: [integer]) :: integer diff --git a/src/main/elixir/g0101_0200/s0200_number_of_islands/Solution.ex b/src/main/elixir/g0101_0200/s0200_number_of_islands/Solution.ex index 14e92c8c..2756565f 100644 --- a/src/main/elixir/g0101_0200/s0200_number_of_islands/Solution.ex +++ b/src/main/elixir/g0101_0200/s0200_number_of_islands/Solution.ex @@ -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_08_03_Time_463_ms_(100.00%)_Space_133.1_MB_(100.00%) +# #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +# #2024_08_03_Time_463_ms_(100.00%)_Space_133.1_MB_(100.00%) defmodule Solution do @spec num_islands(grid :: [[char]]) :: integer diff --git a/src/main/elixir/g0201_0300/s0206_reverse_linked_list/Solution.ex b/src/main/elixir/g0201_0300/s0206_reverse_linked_list/Solution.ex index 97f81cd1..259b2607 100644 --- a/src/main/elixir/g0201_0300/s0206_reverse_linked_list/Solution.ex +++ b/src/main/elixir/g0201_0300/s0206_reverse_linked_list/Solution.ex @@ -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_08_03_Time_278_ms_(100.00%)_Space_73.4_MB_(100.00%) +# #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_08_03_Time_278_ms_(100.00%)_Space_73.4_MB_(100.00%) # Definition for singly-linked list. # diff --git a/src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree/Trie.ex b/src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree/Trie.ex index b463be4b..72fc7052 100644 --- a/src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree/Trie.ex +++ b/src/main/elixir/g0201_0300/s0208_implement_trie_prefix_tree/Trie.ex @@ -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_08_03_Time_724_ms_(100.00%)_Space_108.6_MB_(100.00%) diff --git a/src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.ex b/src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.ex index 645132e2..2ca42179 100644 --- a/src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.ex +++ b/src/main/elixir/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.ex @@ -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_08_03_Time_1341_ms_(100.00%)_Space_152.4_MB_(100.00%) diff --git a/src/main/elixir/g0201_0300/s0226_invert_binary_tree/Solution.ex b/src/main/elixir/g0201_0300/s0226_invert_binary_tree/Solution.ex index c113f873..1d53f32c 100644 --- a/src/main/elixir/g0201_0300/s0226_invert_binary_tree/Solution.ex +++ b/src/main/elixir/g0201_0300/s0226_invert_binary_tree/Solution.ex @@ -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_08_03_Time_233_ms_(100.00%)_Space_72.2_MB_(50.00%) +# #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +# #2024_08_03_Time_233_ms_(100.00%)_Space_72.2_MB_(50.00%) defmodule Solution do @spec invert_tree(root :: TreeNode.t | nil) :: TreeNode.t | nil diff --git a/src/main/elixir/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.ex b/src/main/elixir/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.ex index 444d5d19..1983609c 100644 --- a/src/main/elixir/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.ex +++ b/src/main/elixir/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.ex @@ -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_08_03_Time_286_ms_(66.67%)_Space_86.4_MB_(100.00%) # Definition for a binary tree node. diff --git a/src/main/elixir/g0201_0300/s0238_product_of_array_except_self/Solution.ex b/src/main/elixir/g0201_0300/s0238_product_of_array_except_self/Solution.ex index a03a630b..faea6083 100644 --- a/src/main/elixir/g0201_0300/s0238_product_of_array_except_self/Solution.ex +++ b/src/main/elixir/g0201_0300/s0238_product_of_array_except_self/Solution.ex @@ -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_08_03_Time_362_ms_(85.71%)_Space_121.8_MB_(14.29%) defmodule Solution do diff --git a/src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence/Solution.ex b/src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence/Solution.ex index 70a043a4..f607719f 100644 --- a/src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence/Solution.ex +++ b/src/main/elixir/g0201_0300/s0300_longest_increasing_subsequence/Solution.ex @@ -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_08_04_Time_259_ms_(100.00%)_Space_75.5_MB_(66.67%) defmodule Solution do diff --git a/src/main/elixir/g0301_0400/s0322_coin_change/Solution.ex b/src/main/elixir/g0301_0400/s0322_coin_change/Solution.ex index c9fd94ef..8720a9c9 100644 --- a/src/main/elixir/g0301_0400/s0322_coin_change/Solution.ex +++ b/src/main/elixir/g0301_0400/s0322_coin_change/Solution.ex @@ -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_08_04_Time_1402_ms_(100.00%)_Space_75.3_MB_(100.00%) defmodule Solution do diff --git a/src/main/elixir/g0301_0400/s0338_counting_bits/Solution.ex b/src/main/elixir/g0301_0400/s0338_counting_bits/Solution.ex index 92799a9c..f6f67c9d 100644 --- a/src/main/elixir/g0301_0400/s0338_counting_bits/Solution.ex +++ b/src/main/elixir/g0301_0400/s0338_counting_bits/Solution.ex @@ -1,5 +1,6 @@ -# #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -# #Big_O_Time_O(num)_Space_O(num) #2024_08_04_Time_330_ms_(100.00%)_Space_93.2_MB_(100.00%) +# #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +# #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +# #2024_08_04_Time_330_ms_(100.00%)_Space_93.2_MB_(100.00%) defmodule Solution do @spec count_bits(n :: integer) :: [integer] diff --git a/src/main/elixir/g0301_0400/s0394_decode_string/Solution.ex b/src/main/elixir/g0301_0400/s0394_decode_string/Solution.ex index 0a94ce71..6eda460b 100644 --- a/src/main/elixir/g0301_0400/s0394_decode_string/Solution.ex +++ b/src/main/elixir/g0301_0400/s0394_decode_string/Solution.ex @@ -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_08_04_Time_268_ms_(100.00%)_Space_71.4_MB_(100.00%) +# #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_08_04_Time_268_ms_(100.00%)_Space_71.4_MB_(100.00%) defmodule Solution do @spec decode_string(s :: String.t()) :: String.t() diff --git a/src/main/elixir/g0401_0500/s0437_path_sum_iii/Solution.ex b/src/main/elixir/g0401_0500/s0437_path_sum_iii/Solution.ex index cfaae164..b38fabd9 100644 --- a/src/main/elixir/g0401_0500/s0437_path_sum_iii/Solution.ex +++ b/src/main/elixir/g0401_0500/s0437_path_sum_iii/Solution.ex @@ -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_08_04_Time_336_ms_(100.00%)_Space_110.5_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_08_04_Time_336_ms_(100.00%)_Space_110.5_MB_(100.00%) # Definition for a binary tree node. # diff --git a/src/main/elixir/g0701_0800/s0739_daily_temperatures/Solution.ex b/src/main/elixir/g0701_0800/s0739_daily_temperatures/Solution.ex index 59fca278..1424fd2c 100644 --- a/src/main/elixir/g0701_0800/s0739_daily_temperatures/Solution.ex +++ b/src/main/elixir/g0701_0800/s0739_daily_temperatures/Solution.ex @@ -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_08_04_Time_955_ms_(100.00%)_Space_143.4_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) +# #2024_08_04_Time_955_ms_(100.00%)_Space_143.4_MB_(100.00%) defmodule Solution do @spec daily_temperatures(temp :: [integer]) :: [integer] diff --git a/src/main/elixir/g1101_1200/s1143_longest_common_subsequence/Solution.ex b/src/main/elixir/g1101_1200/s1143_longest_common_subsequence/Solution.ex index 89c61b50..50469858 100644 --- a/src/main/elixir/g1101_1200/s1143_longest_common_subsequence/Solution.ex +++ b/src/main/elixir/g1101_1200/s1143_longest_common_subsequence/Solution.ex @@ -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_08_04_Time_722_ms_(100.00%)_Space_326.9_MB_(100.00%) diff --git a/src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl b/src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl index cf551172..553d50da 100644 --- a/src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl +++ b/src/main/erlang/g0001_0100/s0011_container_with_most_water/Solution.erl @@ -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_01_09_Time_13_ms_(100.00%)_Space_123.05_MB_(100.00%) +% #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +% #Big_O_Time_O(n)_Space_O(1) #2025_01_09_Time_13_ms_(100.00%)_Space_123.05_MB_(100.00%) -spec max_area([integer()]) -> integer(). max_area(Height) -> diff --git a/src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl b/src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl index e4a2d88d..58a6cb9e 100644 --- a/src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl +++ b/src/main/erlang/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.erl @@ -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_01_12_Time_0_ms_(100.00%)_Space_58.43_MB_(_%) -spec letter_combinations(Digits :: unicode:unicode_binary()) -> [unicode:unicode_binary()]. diff --git a/src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl b/src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl index e8cc0c3d..bddaca02 100644 --- a/src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl +++ b/src/main/erlang/g0001_0100/s0062_unique_paths/Solution.erl @@ -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_01_13_Time_0_ms_(100.00%)_Space_58.34_MB_(100.00%) +% #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_01_13_Time_0_ms_(100.00%)_Space_58.34_MB_(100.00%) -spec unique_paths(M :: integer(), N :: integer()) -> integer(). unique_paths(M, N) -> diff --git a/src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl b/src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl index b7b0eb54..1d02b84b 100644 --- a/src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl +++ b/src/main/erlang/g0001_0100/s0072_edit_distance/Solution.erl @@ -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_01_13_Time_251_ms_(100.00%)_Space_122.91_MB_(100.00%) diff --git a/src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl b/src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl index fd486050..86d08423 100644 --- a/src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl +++ b/src/main/erlang/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.erl @@ -1,5 +1,5 @@ % #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_01_15_Time_0_ms_(100.00%)_Space_67.90_MB_(50.00%) diff --git a/src/main/erlang/g0101_0200/s0136_single_number/Solution.erl b/src/main/erlang/g0101_0200/s0136_single_number/Solution.erl index eef61339..6a621944 100644 --- a/src/main/erlang/g0101_0200/s0136_single_number/Solution.erl +++ b/src/main/erlang/g0101_0200/s0136_single_number/Solution.erl @@ -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_01_16_Time_0_ms_(100.00%)_Space_72.99_MB_(100.00%) +% #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_01_16_Time_0_ms_(100.00%)_Space_72.99_MB_(100.00%) -spec single_number(Nums :: [integer()]) -> integer(). single_number(Nums) -> diff --git a/src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl b/src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl index 41d760a8..da6cc721 100644 --- a/src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl +++ b/src/main/erlang/g0101_0200/s0198_house_robber/Solution.erl @@ -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_01_18_Time_0_ms_(100.00%)_Space_58.88_MB_(100.00%) diff --git a/src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl b/src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl index 8e8ffa63..f5ba05e4 100644 --- a/src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl +++ b/src/main/erlang/g0201_0300/s0206_reverse_linked_list/Solution.erl @@ -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) -% #2025_01_18_Time_0_ms_(100.00%)_Space_64.38_MB_(100.00%) +% #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_01_18_Time_0_ms_(100.00%)_Space_64.38_MB_(100.00%) %% Definition for singly-linked list. %% diff --git a/src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl b/src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl index 2a977c70..5e884ee1 100644 --- a/src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl +++ b/src/main/erlang/g0201_0300/s0208_implement_trie_prefix_tree/Trie.erl @@ -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_01_19_Time_85_ms_(100.00%)_Space_99.16_MB_(100.00%) diff --git a/src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl b/src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl index 997c3fb0..39bd29c1 100644 --- a/src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl +++ b/src/main/erlang/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.erl @@ -1,6 +1,7 @@ % #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)) +% #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_01_19_Time_803_ms_(100.00%)_Space_147.74_MB_(100.00%) -spec find_kth_largest(Nums :: [integer()], K :: integer()) -> integer(). diff --git a/src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl b/src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl index 0e0b3c29..d90cf176 100644 --- a/src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl +++ b/src/main/erlang/g0201_0300/s0238_product_of_array_except_self/Solution.erl @@ -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_01_19_Time_22_ms_(100.00%)_Space_112.22_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) #2025_01_19_Time_22_ms_(100.00%)_Space_112.22_MB_(100.00%) -spec product_except_self(Nums :: [integer()]) -> [integer()]. product_except_self(Nums) -> diff --git a/src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl b/src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl index afaa848a..75490488 100644 --- a/src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl +++ b/src/main/erlang/g0301_0400/s0338_counting_bits/Solution.erl @@ -1,5 +1,6 @@ -% #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -% #Big_O_Time_O(num)_Space_O(num) #2025_01_20_Time_38_ms_(100.00%)_Space_77.22_MB_(100.00%) +% #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +% #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +% #2025_01_20_Time_38_ms_(100.00%)_Space_77.22_MB_(100.00%) -spec count_bits(N :: integer()) -> [integer()]. count_bits(N) -> diff --git a/src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl b/src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl index c90f8d16..a173e503 100644 --- a/src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl +++ b/src/main/erlang/g0301_0400/s0394_decode_string/Solution.erl @@ -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_01_20_Time_0_ms_(100.00%)_Space_58.58_MB_(100.00%) +% #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_01_20_Time_0_ms_(100.00%)_Space_58.58_MB_(100.00%) -spec decode_string(S :: unicode:unicode_binary()) -> unicode:unicode_binary(). decode_string(S) -> diff --git a/src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl b/src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl index c1a2d659..60bda4f0 100644 --- a/src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl +++ b/src/main/erlang/g0401_0500/s0437_path_sum_iii/Solution.erl @@ -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_01_22_Time_45_ms_(100.00%)_Space_104.65_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) #2025_01_22_Time_45_ms_(100.00%)_Space_104.65_MB_(100.00%) %% Definition for a binary tree node. %% diff --git a/src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl b/src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl index 30ee5bb0..56ed008a 100644 --- a/src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl +++ b/src/main/erlang/g0701_0800/s0739_daily_temperatures/Solution.erl @@ -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_01_12_Time_94_ms_(100.00%)_Space_125.36_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) +% #2025_01_12_Time_94_ms_(100.00%)_Space_125.36_MB_(100.00%) -spec daily_temperatures([integer()]) -> [integer()]. daily_temperatures(Temp) -> diff --git a/src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl b/src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl index 250bdb11..40107d97 100644 --- a/src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl +++ b/src/main/erlang/g1101_1200/s1143_longest_common_subsequence/Solution.erl @@ -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_01_22_Time_2600_ms_(100.00%)_Space_412.75_MB_(100.00%) diff --git a/src/main/go/g0001_0100/s0001_two_sum/readme.md b/src/main/go/g0001_0100/s0001_two_sum/readme.md index c4ae4e51..d51bd707 100644 --- a/src/main/go/g0001_0100/s0001_two_sum/readme.md +++ b/src/main/go/g0001_0100/s0001_two_sum/readme.md @@ -35,4 +35,4 @@ You can return the answer in any order. * -109 <= target <= 109 * **Only one valid answer exists.** -**Follow-up:** Can you come up with an algorithm that is less than O(n2) time complexity? +**Follow-up:** Can you come up with an algorithm that is less than O(n2) time complexity? \ No newline at end of file diff --git a/src/main/go/g0001_0100/s0001_two_sum/solution.go b/src/main/go/g0001_0100/s0001_two_sum/solution.go index 2ea7f639..3e8d770b 100644 --- a/src/main/go/g0001_0100/s0001_two_sum/solution.go +++ b/src/main/go/g0001_0100/s0001_two_sum/solution.go @@ -1,8 +1,9 @@ package 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) -// #2024_01_28_Time_3_ms_(93.85%)_Space_4.2_MB_(58.64%) +// #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_04_27_Time_0_ms_(100.00%)_Space_5.85_MB_(61.87%) func twoSum(nums []int, target int) []int { indexMap := make(map[int]int) diff --git a/src/main/go/g0001_0100/s0002_add_two_numbers/solution.go b/src/main/go/g0001_0100/s0002_add_two_numbers/solution.go index 983095e5..8a4a769b 100644 --- a/src/main/go/g0001_0100/s0002_add_two_numbers/solution.go +++ b/src/main/go/g0001_0100/s0002_add_two_numbers/solution.go @@ -2,7 +2,8 @@ package 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)) #2024_03_05_Time_4_ms_(84.60%)_Space_4.4_MB_(47.97%) +// #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_04_27_Time_0_ms_(100.00%)_Space_6.17_MB_(92.78%) type ListNode struct { Val int @@ -20,7 +21,6 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { dummyHead := &ListNode{} p, q, curr := l1, l2, dummyHead carry := 0 - for p != nil || q != nil { x, y := 0, 0 if p != nil { @@ -31,16 +31,13 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { y = q.Val q = q.Next } - sum := carry + x + y carry = sum / 10 curr.Next = &ListNode{Val: sum % 10} curr = curr.Next } - if carry > 0 { curr.Next = &ListNode{Val: carry} } - return dummyHead.Next } diff --git a/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md b/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md index 39678094..f0c114dd 100644 --- a/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md +++ b/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/readme.md @@ -2,7 +2,7 @@ Medium -Given a string `s`, find the length of the **longest** **substring** without repeating characters. +Given a string `s`, find the length of the **longest** **substring** without duplicate characters. **Example 1:** diff --git a/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.go b/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.go index e407884f..5ba2d154 100644 --- a/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.go +++ b/src/main/go/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.go @@ -2,7 +2,8 @@ package s0003_longest_substring_without_repeating_characters // #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_03_05_Time_0_ms_(100.00%)_Space_2.5_MB_(98.66%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.45_MB_(94.51%) func lengthOfLongestSubstring(s string) int { lastIndices := make([]int, 256) diff --git a/src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays/solution.go b/src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays/solution.go index ed0924c4..4703adc1 100644 --- a/src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays/solution.go +++ b/src/main/go/g0001_0100/s0004_median_of_two_sorted_arrays/solution.go @@ -1,26 +1,22 @@ package 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) #2024_03_05_Time_9_ms_(72.04%)_Space_4.8_MB_(67.69%) +// #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_04_27_Time_0_ms_(100.00%)_Space_6.51_MB_(81.58%) func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { if len(nums1) > len(nums2) { nums1, nums2 = nums2, nums1 } - x, y := len(nums1), len(nums2) low, high := 0, x - for low <= high { partitionX := (low + high) / 2 partitionY := (x+y+1)/2 - partitionX - maxLeftX := getIntValue(nums1, partitionX-1) minRightX := getIntValue(nums1, partitionX) - maxLeftY := getIntValue(nums2, partitionY-1) minRightY := getIntValue(nums2, partitionY) - if maxLeftX <= minRightY && maxLeftY <= minRightX { if (x+y)%2 == 0 { return float64(max(maxLeftX, maxLeftY)+min(minRightX, minRightY)) / 2 @@ -33,7 +29,6 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { low = partitionX + 1 } } - return 0.0 } diff --git a/src/main/go/g0001_0100/s0005_longest_palindromic_substring/solution.go b/src/main/go/g0001_0100/s0005_longest_palindromic_substring/solution.go index a6c095bf..930db9e5 100644 --- a/src/main/go/g0001_0100/s0005_longest_palindromic_substring/solution.go +++ b/src/main/go/g0001_0100/s0005_longest_palindromic_substring/solution.go @@ -2,8 +2,8 @@ package 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) -// #2024_03_05_Time_0_ms_(100.00%)_Space_3.8_MB_(32.56%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_04_27_Time_0_ms_(100.00%)_Space_5.76_MB_(29.62%) func longestPalindrome(s string) string { newStr := make([]byte, len(s)*2+1) @@ -15,7 +15,6 @@ func longestPalindrome(s string) string { dp := make([]int, len(newStr)) friendCenter, friendRadius := 0, 0 lpsCenter, lpsRadius := 0, 0 - for i := 0; i < len(newStr); i++ { if friendCenter+friendRadius > i { dp[i] = min(dp[2*friendCenter-i], (friendCenter+friendRadius)-i) diff --git a/src/main/go/g0001_0100/s0006_zigzag_conversion/solution.go b/src/main/go/g0001_0100/s0006_zigzag_conversion/solution.go index b7860ced..ea69c935 100644 --- a/src/main/go/g0001_0100/s0006_zigzag_conversion/solution.go +++ b/src/main/go/g0001_0100/s0006_zigzag_conversion/solution.go @@ -1,6 +1,7 @@ package s0006_zigzag_conversion -// #Medium #String #2024_03_05_Time_0_ms_(100.00%)_Space_4_MB_(86.83%) +// #Medium #String #Top_Interview_150_Array/String +// #2025_04_27_Time_0_ms_(100.00%)_Space_5.75_MB_(95.79%) func convert(s string, numRows int) string { topJump := (numRows-2)*2 + 2 diff --git a/src/main/go/g0001_0100/s0007_reverse_integer/solution.go b/src/main/go/g0001_0100/s0007_reverse_integer/solution.go index ee5fbc22..f354578c 100644 --- a/src/main/go/g0001_0100/s0007_reverse_integer/solution.go +++ b/src/main/go/g0001_0100/s0007_reverse_integer/solution.go @@ -1,7 +1,7 @@ package s0007_reverse_integer // #Medium #Top_Interview_Questions #Math #Udemy_Integers -// #2024_03_07_Time_0_ms_(100.00%)_Space_2.2_MB_(46.99%) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.03_MB_(24.37%) import "math" diff --git a/src/main/go/g0001_0100/s0008_string_to_integer_atoi/solution.go b/src/main/go/g0001_0100/s0008_string_to_integer_atoi/solution.go index 99f0da80..be4df2da 100644 --- a/src/main/go/g0001_0100/s0008_string_to_integer_atoi/solution.go +++ b/src/main/go/g0001_0100/s0008_string_to_integer_atoi/solution.go @@ -1,6 +1,6 @@ package s0008_string_to_integer_atoi -// #Medium #Top_Interview_Questions #String #2024_03_07_Time_0_ms_(100.00%)_Space_2.3_MB_(27.02%) +// #Medium #Top_Interview_Questions #String #2025_04_27_Time_0_ms_(100.00%)_Space_4.07_MB_(99.22%) import ( "math" diff --git a/src/main/go/g0001_0100/s0009_palindrome_number/solution.go b/src/main/go/g0001_0100/s0009_palindrome_number/solution.go index fd714539..edd02915 100644 --- a/src/main/go/g0001_0100/s0009_palindrome_number/solution.go +++ b/src/main/go/g0001_0100/s0009_palindrome_number/solution.go @@ -1,6 +1,7 @@ package s0009_palindrome_number -// #Easy #Math #Udemy_Integers #2024_03_07_Time_0_ms_(100.00%)_Space_4.3_MB_(99.46%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2025_04_27_Time_0_ms_(100.00%)_Space_5.96_MB_(99.06%) func isPalindrome(x int) bool { if x < 10 { diff --git a/src/main/go/g0001_0100/s0010_regular_expression_matching/solution.go b/src/main/go/g0001_0100/s0010_regular_expression_matching/solution.go index 110d80c2..c120455e 100644 --- a/src/main/go/g0001_0100/s0010_regular_expression_matching/solution.go +++ b/src/main/go/g0001_0100/s0010_regular_expression_matching/solution.go @@ -1,8 +1,7 @@ package 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) -// #2024_03_07_Time_0_ms_(100.00%)_Space_2.3_MB_(36.02%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_04_27_Time_0_ms_(100.00%)_Space_4.20_MB_(84.42%) func isMatch(s string, p string) bool { m, n := len(s), len(p) diff --git a/src/main/go/g0001_0100/s0011_container_with_most_water/solution.go b/src/main/go/g0001_0100/s0011_container_with_most_water/solution.go index 7032779c..946311bd 100644 --- a/src/main/go/g0001_0100/s0011_container_with_most_water/solution.go +++ b/src/main/go/g0001_0100/s0011_container_with_most_water/solution.go @@ -1,26 +1,23 @@ package 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_03_07_Time_60_ms_(94.99%)_Space_8.3_MB_(24.10%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2025_04_27_Time_0_ms_(100.00%)_Space_9.30_MB_(86.74%) func maxArea(height []int) int { l, r := 0, len(height)-1 maxArea := 0 - for l < r { area := min(height[l], height[r]) * (r - l) if area > maxArea { maxArea = area } - if height[l] < height[r] { l++ } else { r-- } } - return maxArea } diff --git a/src/main/go/g0001_0100/s0015_3sum/solution.go b/src/main/go/g0001_0100/s0015_3sum/solution.go index 6ad0964f..f6bbbf06 100644 --- a/src/main/go/g0001_0100/s0015_3sum/solution.go +++ b/src/main/go/g0001_0100/s0015_3sum/solution.go @@ -2,7 +2,8 @@ package 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) #2024_03_07_Time_37_ms_(90.03%)_Space_7.9_MB_(46.68%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2025_04_27_Time_12_ms_(99.83%)_Space_9.72_MB_(48.62%) import "sort" diff --git a/src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.go b/src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.go index 0e6fdcff..66e7d4ca 100644 --- a/src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.go +++ b/src/main/go/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.go @@ -1,8 +1,9 @@ package 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) #2024_03_07_Time_0_ms_(100.00%)_Space_2.1_MB_(87.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_04_27_Time_0_ms_(100.00%)_Space_3.96_MB_(93.28%) func letterCombinations(digits string) []string { if len(digits) == 0 { @@ -20,7 +21,6 @@ func findCombinations(start int, nums string, letters []string, curr *string, an *ans = append(*ans, *curr) return } - for i := start; i < len(nums); i++ { n := int(nums[i] - '0') for j := 0; j < len(letters[n]); j++ { diff --git a/src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go b/src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go index ed71cc76..5fd6b951 100644 --- a/src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go +++ b/src/main/go/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.go @@ -1,8 +1,8 @@ package 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) -// #2024_03_07_Time_0_ms_(100.00%)_Space_2.2_MB_(19.66%) +// #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_04_27_Time_0_ms_(100.00%)_Space_4.16_MB_(48.09%) type ListNode struct { Val int diff --git a/src/main/go/g0001_0100/s0020_valid_parentheses/solution.go b/src/main/go/g0001_0100/s0020_valid_parentheses/solution.go index 77578e65..ab32e0ae 100644 --- a/src/main/go/g0001_0100/s0020_valid_parentheses/solution.go +++ b/src/main/go/g0001_0100/s0020_valid_parentheses/solution.go @@ -1,8 +1,8 @@ package 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) -// #2024_03_07_Time_1_ms_(74.95%)_Space_2_MB_(68.19%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2025_04_27_Time_0_ms_(100.00%)_Space_4.27_MB_(35.78%) func isValid(s string) bool { stack := make([]rune, 0) @@ -27,6 +27,5 @@ func isValid(s string) bool { stack = stack[:len(stack)-1] } } - return len(stack) == 0 } diff --git a/src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go b/src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go index 7985d1f7..f3b758f7 100644 --- a/src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go +++ b/src/main/go/g0001_0100/s0021_merge_two_sorted_lists/solution.go @@ -2,8 +2,8 @@ package 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) -// #2024_03_07_Time_0_ms_(100.00%)_Space_2.5_MB_(95.02%) +// #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_04_27_Time_0_ms_(100.00%)_Space_4.48_MB_(40.41%) type ListNode struct { Val int @@ -19,7 +19,6 @@ type ListNode struct { */ func mergeTwoLists(list1 *ListNode, list2 *ListNode) *ListNode { var sortedListNode, tail *ListNode = &ListNode{}, &ListNode{} - // Start sortedListNode and tail node at the same position tail = sortedListNode for list1 != nil && list2 != nil { @@ -33,14 +32,11 @@ func mergeTwoLists(list1 *ListNode, list2 *ListNode) *ListNode { // Progress the tail further tail = tail.Next } - if list1 != nil { tail.Next = list1 } - if list2 != nil { tail.Next = list2 } - return sortedListNode.Next } diff --git a/src/main/go/g0001_0100/s0022_generate_parentheses/solution.go b/src/main/go/g0001_0100/s0022_generate_parentheses/solution.go index ff65fc00..2123c23e 100644 --- a/src/main/go/g0001_0100/s0022_generate_parentheses/solution.go +++ b/src/main/go/g0001_0100/s0022_generate_parentheses/solution.go @@ -2,7 +2,8 @@ package 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) #2024_03_08_Time_2_ms_(75.02%)_Space_2.8_MB_(72.29%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.66_MB_(78.73%) func generateParenthesis(n int) []string { result := []string{} @@ -15,7 +16,6 @@ func generate(s string, start, close, n int, result *[]string) { *result = append(*result, s) return } - if start < n { generate(s+"(", start+1, close, n, result) } diff --git a/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/readme.md b/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/readme.md index db931cc3..e507daeb 100644 --- a/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/readme.md +++ b/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/readme.md @@ -12,25 +12,25 @@ _Merge all the linked-lists into one sorted linked-list and return it._ **Output:** [1,1,2,3,4,4,5,6] -**Explanation:** The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6 +**Explanation:** The linked-lists are: [ 1->4->5, 1->3->4, 2->6 ] merging them into one sorted list: 1->1->2->3->4->4->5->6 **Example 2:** **Input:** lists = [] -**Output:** [] +**Output:** [] **Example 3:** **Input:** lists = [[]] -**Output:** [] +**Output:** [] **Constraints:** * `k == lists.length` -* `0 <= k <= 10^4` +* 0 <= k <= 104 * `0 <= lists[i].length <= 500` -* `-10^4 <= lists[i][j] <= 10^4` +* -104 <= lists[i][j] <= 104 * `lists[i]` is sorted in **ascending order**. -* The sum of `lists[i].length` won't exceed `10^4`. \ No newline at end of file +* The sum of `lists[i].length` will not exceed 104. \ No newline at end of file diff --git a/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/solution.go b/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/solution.go index 766c91ee..6205523c 100644 --- a/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/solution.go +++ b/src/main/go/g0001_0100/s0023_merge_k_sorted_lists/solution.go @@ -1,10 +1,10 @@ package s0023_merge_k_sorted_lists -import "container/heap" - // #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_03_08_Time_3_ms_(96.74%)_Space_5.5_MB_(25.28%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2025_04_27_Time_0_ms_(100.00%)_Space_7.12_MB_(27.34%) + +import "container/heap" type ListNode struct { Val int diff --git a/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/readme.md b/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/readme.md index 85922fcd..e065a07a 100644 --- a/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/readme.md +++ b/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/readme.md @@ -6,12 +6,14 @@ Given a linked list, swap every two adjacent nodes and return its head. You must **Example 1:** -![](https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg) - **Input:** head = [1,2,3,4] **Output:** [2,1,4,3] +**Explanation:** + +![](https://assets.leetcode.com/uploads/2020/10/03/swap_ex1.jpg) + **Example 2:** **Input:** head = [] @@ -24,6 +26,12 @@ Given a linked list, swap every two adjacent nodes and return its head. You must **Output:** [1] +**Example 4:** + +**Input:** head = [1,2,3] + +**Output:** [2,1,3] + **Constraints:** * The number of nodes in the list is in the range `[0, 100]`. diff --git a/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/solution.go b/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/solution.go index 3e2743cd..006a1976 100644 --- a/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/solution.go +++ b/src/main/go/g0001_0100/s0024_swap_nodes_in_pairs/solution.go @@ -2,7 +2,7 @@ package 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) -// #2024_03_08_Time_0_ms_(100.00%)_Space_2.1_MB_(95.56%) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.08_MB_(35.81%) type ListNode struct { Val int diff --git a/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md b/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md index 6a98d1ed..85c1581d 100644 --- a/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md +++ b/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/readme.md @@ -2,9 +2,9 @@ Hard -Given a linked list, reverse the nodes of a linked list _k_ at a time and return its modified list. +Given the `head` of a linked list, reverse the nodes of the list `k` at a time, and return _the modified list_. -_k_ is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of _k_ then left-out nodes, in the end, should remain as it is. +`k` is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of `k` then left-out nodes, in the end, should remain as it is. You may not alter the values in the list's nodes, only nodes themselves may be changed. @@ -14,7 +14,7 @@ You may not alter the values in the list's nodes, only nodes themselves may be c **Input:** head = [1,2,3,4,5], k = 2 -**Output:** [2,1,4,3,5] +**Output:** [2,1,4,3,5] **Example 2:** @@ -22,25 +22,12 @@ You may not alter the values in the list's nodes, only nodes themselves may be c **Input:** head = [1,2,3,4,5], k = 3 -**Output:** [3,2,1,4,5] - -**Example 3:** - -**Input:** head = [1,2,3,4,5], k = 1 - -**Output:** [1,2,3,4,5] - -**Example 4:** - -**Input:** head = [1], k = 1 - -**Output:** [1] +**Output:** [3,2,1,4,5] **Constraints:** -* The number of nodes in the list is in the range `sz`. -* `1 <= sz <= 5000` +* The number of nodes in the list is `n`. +* `1 <= k <= n <= 5000` * `0 <= Node.val <= 1000` -* `1 <= k <= sz` -**Follow-up:** Can you solve the problem in O(1) extra memory space? \ No newline at end of file +**Follow-up:** Can you solve the problem in `O(1)` extra memory space? \ No newline at end of file diff --git a/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go b/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go index b9f5a742..2001a574 100644 --- a/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go +++ b/src/main/go/g0001_0100/s0025_reverse_nodes_in_k_group/solution.go @@ -1,8 +1,8 @@ package 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) -// #2024_03_08_Time_0_ms_(100.00%)_Space_3.6_MB_(72.87%) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #2025_04_27_Time_0_ms_(100.00%)_Space_5.54_MB_(20.53%) type ListNode struct { Val int diff --git a/src/main/go/g0001_0100/s0031_next_permutation/readme.md b/src/main/go/g0001_0100/s0031_next_permutation/readme.md index a3c40941..d375dfd9 100644 --- a/src/main/go/g0001_0100/s0031_next_permutation/readme.md +++ b/src/main/go/g0001_0100/s0031_next_permutation/readme.md @@ -20,19 +20,19 @@ The replacement must be **[in place](http://en.wikipedia.org/wiki/In-place_algor **Input:** nums = [1,2,3] -**Output:** [1,3,2] +**Output:** [1,3,2] **Example 2:** **Input:** nums = [3,2,1] -**Output:** [1,2,3] +**Output:** [1,2,3] **Example 3:** **Input:** nums = [1,1,5] -**Output:** [1,5,1] +**Output:** [1,5,1] **Constraints:** diff --git a/src/main/go/g0001_0100/s0031_next_permutation/solution.go b/src/main/go/g0001_0100/s0031_next_permutation/solution.go index 4d8b2a0e..a1129b75 100644 --- a/src/main/go/g0001_0100/s0031_next_permutation/solution.go +++ b/src/main/go/g0001_0100/s0031_next_permutation/solution.go @@ -1,7 +1,7 @@ package s0031_next_permutation // #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2024_03_08_Time_0_ms_(100.00%)_Space_2.4_MB_(7.18%) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.32_MB_(34.39%) func nextPermutation(nums []int) { if nums == nil || len(nums) <= 1 { diff --git a/src/main/go/g0001_0100/s0032_longest_valid_parentheses/readme.md b/src/main/go/g0001_0100/s0032_longest_valid_parentheses/readme.md index dfddb136..ef219b09 100644 --- a/src/main/go/g0001_0100/s0032_longest_valid_parentheses/readme.md +++ b/src/main/go/g0001_0100/s0032_longest_valid_parentheses/readme.md @@ -2,7 +2,7 @@ Hard -Given a string containing just the characters `'('` and `')'`, find the length of the longest valid (well-formed) parentheses substring. +Given a string containing just the characters `'('` and `')'`, return _the length of the longest valid (well-formed) parentheses_ **substring**. **Example 1:** @@ -10,7 +10,7 @@ Given a string containing just the characters `'('` and `')'`, find the length o **Output:** 2 -**Explanation:** The longest valid parentheses substring is "()". +**Explanation:** The longest valid parentheses substring is "()". **Example 2:** @@ -18,13 +18,13 @@ Given a string containing just the characters `'('` and `')'`, find the length o **Output:** 4 -**Explanation:** The longest valid parentheses substring is "()()". +**Explanation:** The longest valid parentheses substring is "()()". **Example 3:** **Input:** s = "" -**Output:** 0 +**Output:** 0 **Constraints:** diff --git a/src/main/go/g0001_0100/s0032_longest_valid_parentheses/solution.go b/src/main/go/g0001_0100/s0032_longest_valid_parentheses/solution.go index 07a99eb7..41a7808a 100644 --- a/src/main/go/g0001_0100/s0032_longest_valid_parentheses/solution.go +++ b/src/main/go/g0001_0100/s0032_longest_valid_parentheses/solution.go @@ -1,7 +1,7 @@ package s0032_longest_valid_parentheses // #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1) -// #2024_03_11_Time_0_ms_(100.00%)_Space_2.3_MB_(100.00%) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.28_MB_(96.40%) func longestValidParentheses(s string) int { max := 0 diff --git a/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/readme.md b/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/readme.md index 62aa8ba6..ebfff914 100644 --- a/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/readme.md +++ b/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/readme.md @@ -14,19 +14,19 @@ You must write an algorithm with `O(log n)` runtime complexity. **Input:** nums = [4,5,6,7,0,1,2], target = 0 -**Output:** 4 +**Output:** 4 **Example 2:** **Input:** nums = [4,5,6,7,0,1,2], target = 3 -**Output:** -1 +**Output:** -1 **Example 3:** **Input:** nums = [1], target = 0 -**Output:** -1 +**Output:** -1 **Constraints:** diff --git a/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/solution.go b/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/solution.go index 1093e216..f1c06b6a 100644 --- a/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/solution.go +++ b/src/main/go/g0001_0100/s0033_search_in_rotated_sorted_array/solution.go @@ -2,8 +2,8 @@ package 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) -// #2024_03_11_Time_0_ms_(100.00%)_Space_2.6_MB_(41.41%) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.51_MB_(4.93%) func search(nums []int, target int) int { var mid, lo, hi int diff --git a/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/readme.md b/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/readme.md index 3ccb1529..7c04eb2e 100644 --- a/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/readme.md +++ b/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/readme.md @@ -12,19 +12,19 @@ You must write an algorithm with `O(log n)` runtime complexity. **Input:** nums = [5,7,7,8,8,10], target = 8 -**Output:** [3,4] +**Output:** [3,4] **Example 2:** **Input:** nums = [5,7,7,8,8,10], target = 6 -**Output:** [-1,-1] +**Output:** [-1,-1] **Example 3:** **Input:** nums = [], target = 0 -**Output:** [-1,-1] +**Output:** [-1,-1] **Constraints:** diff --git a/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.go b/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.go index 208abc93..6f632004 100644 --- a/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.go +++ b/src/main/go/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.go @@ -1,8 +1,8 @@ package 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_03_11_Time_3_ms_(93.06%)_Space_4.5_MB_(100.00%) +// #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_04_27_Time_0_ms_(100.00%)_Space_6.47_MB_(30.77%) func searchRange(nums []int, target int) []int { ans := make([]int, 2) diff --git a/src/main/go/g0001_0100/s0035_search_insert_position/readme.md b/src/main/go/g0001_0100/s0035_search_insert_position/readme.md index c273f320..79f9ab2c 100644 --- a/src/main/go/g0001_0100/s0035_search_insert_position/readme.md +++ b/src/main/go/g0001_0100/s0035_search_insert_position/readme.md @@ -10,31 +10,19 @@ You must write an algorithm with `O(log n)` runtime complexity. **Input:** nums = [1,3,5,6], target = 5 -**Output:** 2 +**Output:** 2 **Example 2:** **Input:** nums = [1,3,5,6], target = 2 -**Output:** 1 +**Output:** 1 **Example 3:** **Input:** nums = [1,3,5,6], target = 7 -**Output:** 4 - -**Example 4:** - -**Input:** nums = [1,3,5,6], target = 0 - -**Output:** 0 - -**Example 5:** - -**Input:** nums = [1], target = 0 - -**Output:** 0 +**Output:** 4 **Constraints:** diff --git a/src/main/go/g0001_0100/s0035_search_insert_position/solution.go b/src/main/go/g0001_0100/s0035_search_insert_position/solution.go index 571e2c1f..a95fa82e 100644 --- a/src/main/go/g0001_0100/s0035_search_insert_position/solution.go +++ b/src/main/go/g0001_0100/s0035_search_insert_position/solution.go @@ -1,8 +1,8 @@ package 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_03_11_Time_0_ms_(100.00%)_Space_2.9_MB_(91.84%) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.96_MB_(3.02%) func searchInsert(nums []int, target int) int { lo, hi := 0, len(nums)-1 diff --git a/src/main/go/g0001_0100/s0039_combination_sum/readme.md b/src/main/go/g0001_0100/s0039_combination_sum/readme.md index 3c1934f5..c4c86961 100644 --- a/src/main/go/g0001_0100/s0039_combination_sum/readme.md +++ b/src/main/go/g0001_0100/s0039_combination_sum/readme.md @@ -6,7 +6,7 @@ Given an array of **distinct** integers `candidates` and a target integer `targe The **same** number may be chosen from `candidates` an **unlimited number of times**. Two combinations are unique if the frequency of at least one of the chosen numbers is different. -It is **guaranteed** that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input. +The test cases are generated such that the number of unique combinations that sum up to `target` is less than `150` combinations for the given input. **Example 1:** @@ -14,28 +14,23 @@ It is **guaranteed** that the number of unique combinations that sum up to `targ **Output:** [[2,2,3],[7]] -**Explanation:** -2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times. - -7 is a candidate, and 7 = 7. - -These are the only two combinations. +**Explanation:** 2 and 3 are candidates, and 2 + 2 + 3 = 7. Note that 2 can be used multiple times. 7 is a candidate, and 7 = 7. These are the only two combinations. **Example 2:** **Input:** candidates = [2,3,5], target = 8 -**Output:** [[2,2,2,2],[2,3,3],[3,5]] +**Output:** [[2,2,2,2],[2,3,3],[3,5]] **Example 3:** **Input:** candidates = [2], target = 1 -**Output:** [] +**Output:** [] **Constraints:** * `1 <= candidates.length <= 30` -* `1 <= candidates[i] <= 200` +* `2 <= candidates[i] <= 40` * All elements of `candidates` are **distinct**. -* `1 <= target <= 500` \ No newline at end of file +* `1 <= target <= 40` \ No newline at end of file diff --git a/src/main/go/g0001_0100/s0039_combination_sum/solution.go b/src/main/go/g0001_0100/s0039_combination_sum/solution.go index 36ecd7aa..f6cbbf23 100644 --- a/src/main/go/g0001_0100/s0039_combination_sum/solution.go +++ b/src/main/go/g0001_0100/s0039_combination_sum/solution.go @@ -2,7 +2,8 @@ package 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) #2024_03_11_Time_0_ms_(100.00%)_Space_3_MB_(71.24%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2025_04_27_Time_0_ms_(100.00%)_Space_4.97_MB_(71.50%) func combinationSum(coins []int, amount int) [][]int { var ans [][]int diff --git a/src/main/go/g0001_0100/s0041_first_missing_positive/readme.md b/src/main/go/g0001_0100/s0041_first_missing_positive/readme.md index 040b8c56..c786c05c 100644 --- a/src/main/go/g0001_0100/s0041_first_missing_positive/readme.md +++ b/src/main/go/g0001_0100/s0041_first_missing_positive/readme.md @@ -2,9 +2,9 @@ Hard -Given an unsorted integer array `nums`, return the smallest missing positive integer. +Given an unsorted integer array `nums`. Return the _smallest positive integer_ that is _not present_ in `nums`. -You must implement an algorithm that runs in `O(n)` time and uses constant extra space. +You must implement an algorithm that runs in `O(n)` time and uses `O(1)` auxiliary space. **Example 1:** @@ -12,7 +12,7 @@ You must implement an algorithm that runs in `O(n)` time and uses constant extra **Output:** 3 -**Explanation:** The numbers in the range [1,2] are all in the array. +**Explanation:** The numbers in the range [1,2] are all in the array. **Example 2:** @@ -20,7 +20,7 @@ You must implement an algorithm that runs in `O(n)` time and uses constant extra **Output:** 2 -**Explanation:** 1 is in the array but 2 is missing. +**Explanation:** 1 is in the array but 2 is missing. **Example 3:** @@ -28,7 +28,7 @@ You must implement an algorithm that runs in `O(n)` time and uses constant extra **Output:** 1 -**Explanation:** The smallest positive integer 1 is missing. +**Explanation:** The smallest positive integer 1 is missing. **Constraints:** diff --git a/src/main/go/g0001_0100/s0041_first_missing_positive/solution.go b/src/main/go/g0001_0100/s0041_first_missing_positive/solution.go index 7a80a0ce..6bb3e48e 100644 --- a/src/main/go/g0001_0100/s0041_first_missing_positive/solution.go +++ b/src/main/go/g0001_0100/s0041_first_missing_positive/solution.go @@ -1,7 +1,7 @@ package 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_03_12_Time_39_ms_(92.34%)_Space_7.8_MB_(79.50%) +// #Big_O_Time_O(n)_Space_O(n) #2025_05_03_Time_0_ms_(100.00%)_Space_9.49_MB_(95.52%) func firstMissingPositive(nums []int) int { for i := 0; i < len(nums); i++ { @@ -9,7 +9,6 @@ func firstMissingPositive(nums []int) int { nums[i] = 0 } } - for i := 0; i < len(nums); i++ { val := abs(nums[i]) if val > 0 && val <= len(nums) { @@ -17,19 +16,16 @@ func firstMissingPositive(nums []int) int { nums[val-1] = nums[val-1] * -1 continue } - if nums[val-1] == 0 { nums[val-1] = -1 * (len(nums) + 1) } } } - for i := 1; i <= len(nums); i++ { if nums[i-1] >= 0 { return i } } - return len(nums) + 1 } @@ -37,6 +33,5 @@ func abs(n int) int { if n >= 0 { return n } - return n * -1 } diff --git a/src/main/go/g0001_0100/s0042_trapping_rain_water/solution.go b/src/main/go/g0001_0100/s0042_trapping_rain_water/solution.go index b9dd716f..393dc095 100644 --- a/src/main/go/g0001_0100/s0042_trapping_rain_water/solution.go +++ b/src/main/go/g0001_0100/s0042_trapping_rain_water/solution.go @@ -2,24 +2,25 @@ package 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) #2024_03_12_Time_3_ms_(99.42%)_Space_5.4_MB_(97.01%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_05_03_Time_0_ms_(100.00%)_Space_7.85_MB_(82.53%) func trap(height []int) int { if height == nil { return 0 } l, r := 0, len(height)-1 - max_left, max_right := height[l], height[r] + maxLeft, maxRight := height[l], height[r] res := 0 for l < r { - if max_left < max_right { + if maxLeft < maxRight { l++ - max_left = max(max_left, height[l]) - res += max_left - height[l] + maxLeft = max(maxLeft, height[l]) + res += maxLeft - height[l] } else { r-- - max_right = max(max_right, height[r]) - res += max_right - height[r] + maxRight = max(maxRight, height[r]) + res += maxRight - height[r] } } return res diff --git a/src/main/go/g0001_0100/s0045_jump_game_ii/readme.md b/src/main/go/g0001_0100/s0045_jump_game_ii/readme.md index e5a76a78..7c5c906f 100644 --- a/src/main/go/g0001_0100/s0045_jump_game_ii/readme.md +++ b/src/main/go/g0001_0100/s0045_jump_game_ii/readme.md @@ -2,13 +2,14 @@ Medium -Given an array of non-negative integers `nums`, you are initially positioned at the first index of the array. +You are given a **0-indexed** array of integers `nums` of length `n`. You are initially positioned at `nums[0]`. -Each element in the array represents your maximum jump length at that position. +Each element `nums[i]` represents the maximum length of a forward jump from index `i`. In other words, if you are at `nums[i]`, you can jump to any `nums[i + j]` where: -Your goal is to reach the last index in the minimum number of jumps. +* `0 <= j <= nums[i]` and +* `i + j < n` -You can assume that you can always reach the last index. +Return _the minimum number of jumps to reach_ `nums[n - 1]`. The test cases are generated such that you can reach `nums[n - 1]`. **Example 1:** @@ -16,15 +17,16 @@ You can assume that you can always reach the last index. **Output:** 2 -**Explanation:** The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index. +**Explanation:** The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index. **Example 2:** **Input:** nums = [2,3,0,1,4] -**Output:** 2 +**Output:** 2 **Constraints:** * 1 <= nums.length <= 104 -* `0 <= nums[i] <= 1000` \ No newline at end of file +* `0 <= nums[i] <= 1000` +* It's guaranteed that you can reach `nums[n - 1]`. \ No newline at end of file diff --git a/src/main/go/g0001_0100/s0045_jump_game_ii/solution.go b/src/main/go/g0001_0100/s0045_jump_game_ii/solution.go index d9aa79c9..da25186a 100644 --- a/src/main/go/g0001_0100/s0045_jump_game_ii/solution.go +++ b/src/main/go/g0001_0100/s0045_jump_game_ii/solution.go @@ -2,7 +2,8 @@ package 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_03_12_Time_6_ms_(96.98%)_Space_6.3_MB_(34.53%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_05_03_Time_0_ms_(100.00%)_Space_7.78_MB_(85.74%) func jump(nums []int) int { length := 0 diff --git a/src/main/go/g0001_0100/s0046_permutations/readme.md b/src/main/go/g0001_0100/s0046_permutations/readme.md index fdeabb6d..f66dc4f2 100644 --- a/src/main/go/g0001_0100/s0046_permutations/readme.md +++ b/src/main/go/g0001_0100/s0046_permutations/readme.md @@ -2,25 +2,25 @@ Medium -Given an array `nums` of distinct integers, return _all the possible permutations_. You can return the answer in **any order**. +Given an array `nums` of distinct integers, return all the possible permutations. You can return the answer in **any order**. **Example 1:** **Input:** nums = [1,2,3] -**Output:** [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] +**Output:** [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] **Example 2:** **Input:** nums = [0,1] -**Output:** [[0,1],[1,0]] +**Output:** [[0,1],[1,0]] **Example 3:** **Input:** nums = [1] -**Output:** [[1]] +**Output:** [[1]] **Constraints:** diff --git a/src/main/go/g0001_0100/s0046_permutations/solution.go b/src/main/go/g0001_0100/s0046_permutations/solution.go index 1ff5fb31..b8f957b3 100644 --- a/src/main/go/g0001_0100/s0046_permutations/solution.go +++ b/src/main/go/g0001_0100/s0046_permutations/solution.go @@ -2,8 +2,8 @@ package 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_03_12_Time_0_ms_(100.00%)_Space_2.7_MB_(51.79%) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) +// #2025_05_03_Time_0_ms_(100.00%)_Space_4.59_MB_(85.96%) func permute(nums []int) [][]int { if len(nums) == 0 { diff --git a/src/main/go/g0001_0100/s0048_rotate_image/solution.go b/src/main/go/g0001_0100/s0048_rotate_image/solution.go index 79dc2f10..1aab5caf 100644 --- a/src/main/go/g0001_0100/s0048_rotate_image/solution.go +++ b/src/main/go/g0001_0100/s0048_rotate_image/solution.go @@ -2,7 +2,8 @@ package 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_03_12_Time_0_ms_(100.00%)_Space_2.3_MB_(75.46%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2025_05_03_Time_0_ms_(100.00%)_Space_4.06_MB_(97.99%) func rotate(matrix [][]int) { n := len(matrix) diff --git a/src/main/go/g0001_0100/s0049_group_anagrams/solution.go b/src/main/go/g0001_0100/s0049_group_anagrams/solution.go index 48e1145d..0186bbe5 100644 --- a/src/main/go/g0001_0100/s0049_group_anagrams/solution.go +++ b/src/main/go/g0001_0100/s0049_group_anagrams/solution.go @@ -2,7 +2,8 @@ package 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_03_13_Time_16_ms_(85.07%)_Space_7.2_MB_(85.47%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2025_05_05_Time_4_ms_(96.55%)_Space_10.20_MB_(30.85%) func groupAnagrams(strings []string) [][]string { stringsByPattern := make(map[[26]byte][]string) diff --git a/src/main/go/g0001_0100/s0051_n_queens/solution.go b/src/main/go/g0001_0100/s0051_n_queens/solution.go index 4bfbc1fc..1ab99f18 100644 --- a/src/main/go/g0001_0100/s0051_n_queens/solution.go +++ b/src/main/go/g0001_0100/s0051_n_queens/solution.go @@ -1,7 +1,7 @@ package s0051_n_queens // #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N) -// #2024_03_13_Time_0_ms_(100.00%)_Space_3.3_MB_(61.83%) +// #2025_05_05_Time_0_ms_(100.00%)_Space_5.23_MB_(62.71%) func solveNQueens(n int) [][]string { pos := make([]bool, n+2*n-1+2*n-1) diff --git a/src/main/go/g0001_0100/s0053_maximum_subarray/solution.go b/src/main/go/g0001_0100/s0053_maximum_subarray/solution.go index 4ebe76e6..3efedbe3 100644 --- a/src/main/go/g0001_0100/s0053_maximum_subarray/solution.go +++ b/src/main/go/g0001_0100/s0053_maximum_subarray/solution.go @@ -1,9 +1,9 @@ package 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_03_13_Time_79_ms_(87.63%)_Space_7.8_MB_(92.56%) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) +// #2025_05_05_Time_0_ms_(100.00%)_Space_10.37_MB_(42.73%) func maxSubArray(nums []int) int { sum, max := nums[0], nums[0] diff --git a/src/main/go/g0001_0100/s0055_jump_game/solution.go b/src/main/go/g0001_0100/s0055_jump_game/solution.go index 1ef3821c..fcc20b27 100644 --- a/src/main/go/g0001_0100/s0055_jump_game/solution.go +++ b/src/main/go/g0001_0100/s0055_jump_game/solution.go @@ -2,7 +2,8 @@ package 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_03_13_Time_48_ms_(71.95%)_Space_6.7_MB_(99.94%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_05_05_Time_0_ms_(100.00%)_Space_8.96_MB_(66.09%) func canJump(nums []int) bool { if len(nums) == 1 { diff --git a/src/main/go/g0001_0100/s0056_merge_intervals/solution.go b/src/main/go/g0001_0100/s0056_merge_intervals/solution.go index 62f9428b..20ed9442 100644 --- a/src/main/go/g0001_0100/s0056_merge_intervals/solution.go +++ b/src/main/go/g0001_0100/s0056_merge_intervals/solution.go @@ -2,7 +2,8 @@ package 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_03_13_Time_12_ms_(90.65%)_Space_6.3_MB_(74.98%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2025_05_05_Time_0_ms_(100.00%)_Space_8.61_MB_(25.59%) import "sort" diff --git a/src/main/go/g0001_0100/s0062_unique_paths/solution.go b/src/main/go/g0001_0100/s0062_unique_paths/solution.go index 827ceead..a45aaeda 100644 --- a/src/main/go/g0001_0100/s0062_unique_paths/solution.go +++ b/src/main/go/g0001_0100/s0062_unique_paths/solution.go @@ -1,9 +1,9 @@ package 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_03_14_Time_0_ms_(100.00%)_Space_2.2_MB_(26.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) #2025_05_05_Time_0_ms_(100.00%)_Space_4.06_MB_(55.42%) func uniquePaths(m int, n int) int { dp := make([][]int, m) diff --git a/src/main/go/g0001_0100/s0064_minimum_path_sum/solution.go b/src/main/go/g0001_0100/s0064_minimum_path_sum/solution.go index 939c09f5..3a22c67c 100644 --- a/src/main/go/g0001_0100/s0064_minimum_path_sum/solution.go +++ b/src/main/go/g0001_0100/s0064_minimum_path_sum/solution.go @@ -1,8 +1,8 @@ package 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_03_14_Time_0_ms_(100.00%)_Space_4.1_MB_(24.44%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_05_05_Time_0_ms_(100.00%)_Space_7.68_MB_(48.53%) func minPathSum(grid [][]int) int { if len(grid) == 1 && len(grid[0]) == 1 { diff --git a/src/main/go/g0001_0100/s0070_climbing_stairs/solution.go b/src/main/go/g0001_0100/s0070_climbing_stairs/solution.go index a9ac842b..5a43da15 100644 --- a/src/main/go/g0001_0100/s0070_climbing_stairs/solution.go +++ b/src/main/go/g0001_0100/s0070_climbing_stairs/solution.go @@ -2,8 +2,8 @@ package 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_03_14_Time_0_ms_(100.00%)_Space_2_MB_(50.58%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_05_05_Time_0_ms_(100.00%)_Space_3.88_MB_(81.88%) func climbStairs(n int) int { f := make([]int, n+1) diff --git a/src/main/go/g0001_0100/s0072_edit_distance/solution.go b/src/main/go/g0001_0100/s0072_edit_distance/solution.go index 43cc915f..2ec07af0 100644 --- a/src/main/go/g0001_0100/s0072_edit_distance/solution.go +++ b/src/main/go/g0001_0100/s0072_edit_distance/solution.go @@ -1,9 +1,9 @@ package 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_03_14_Time_0_ms_(100.00%)_Space_2.6_MB_(97.61%) +// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) +// #2025_05_05_Time_0_ms_(100.00%)_Space_4.46_MB_(99.07%) func minDistance(word1 string, word2 string) int { n1 := len(word1) diff --git a/src/main/go/g0001_0100/s0073_set_matrix_zeroes/solution.go b/src/main/go/g0001_0100/s0073_set_matrix_zeroes/solution.go index 42c9278c..e090bd3b 100644 --- a/src/main/go/g0001_0100/s0073_set_matrix_zeroes/solution.go +++ b/src/main/go/g0001_0100/s0073_set_matrix_zeroes/solution.go @@ -1,8 +1,8 @@ package 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_03_14_Time_8_ms_(83.64%)_Space_5.9_MB_(75.58%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #2025_05_05_Time_0_ms_(100.00%)_Space_7.88_MB_(57.66%) func setZeroes(matrix [][]int) { m := len(matrix) diff --git a/src/main/go/g0001_0100/s0074_search_a_2d_matrix/solution.go b/src/main/go/g0001_0100/s0074_search_a_2d_matrix/solution.go index 07ffe778..d77ef881 100644 --- a/src/main/go/g0001_0100/s0074_search_a_2d_matrix/solution.go +++ b/src/main/go/g0001_0100/s0074_search_a_2d_matrix/solution.go @@ -2,8 +2,8 @@ package 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_03_15_Time_0_ms_(100.00%)_Space_2.6_MB_(75.18%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #2025_05_05_Time_0_ms_(100.00%)_Space_4.45_MB_(46.12%) func searchMatrix(matrix [][]int, target int) bool { endRow := len(matrix) diff --git a/src/main/go/g0001_0100/s0075_sort_colors/solution.go b/src/main/go/g0001_0100/s0075_sort_colors/solution.go index 94941f83..2182a0f2 100644 --- a/src/main/go/g0001_0100/s0075_sort_colors/solution.go +++ b/src/main/go/g0001_0100/s0075_sort_colors/solution.go @@ -2,7 +2,7 @@ package 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_03_15_Time_1_ms_(76.26%)_Space_2.1_MB_(8.79%) +// #2025_05_06_Time_0_ms_(100.00%)_Space_4.17_MB_(11.59%) func sortColors(nums []int) { zeroes := 0 diff --git a/src/main/go/g0001_0100/s0076_minimum_window_substring/solution.go b/src/main/go/g0001_0100/s0076_minimum_window_substring/solution.go index 3cc9be0a..4e0c99d4 100644 --- a/src/main/go/g0001_0100/s0076_minimum_window_substring/solution.go +++ b/src/main/go/g0001_0100/s0076_minimum_window_substring/solution.go @@ -1,8 +1,8 @@ package 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_03_15_Time_0_ms_(100.00%)_Space_3_MB_(66.67%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2025_05_06_Time_0_ms_(100.00%)_Space_5.22_MB_(52.57%) import "math" diff --git a/src/main/go/g0001_0100/s0078_subsets/solution.go b/src/main/go/g0001_0100/s0078_subsets/solution.go index 70de62dd..52331c75 100644 --- a/src/main/go/g0001_0100/s0078_subsets/solution.go +++ b/src/main/go/g0001_0100/s0078_subsets/solution.go @@ -2,7 +2,7 @@ package 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_03_15_Time_1_ms_(80.53%)_Space_2.4_MB_(60.25%) +// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_05_06_Time_0_ms_(100.00%)_Space_4.31_MB_(21.64%) func subsets(nums []int) [][]int { var res [][]int diff --git a/src/main/go/g0001_0100/s0079_word_search/solution.go b/src/main/go/g0001_0100/s0079_word_search/solution.go index fa050c0c..4678e35f 100644 --- a/src/main/go/g0001_0100/s0079_word_search/solution.go +++ b/src/main/go/g0001_0100/s0079_word_search/solution.go @@ -1,8 +1,8 @@ package 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_03_15_Time_103_ms_(79.70%)_Space_2_MB_(58.16%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_05_06_Time_99_ms_(79.91%)_Space_4.02_MB_(88.63%) func exist(board [][]byte, word string) bool { var run func(i, j, k int) bool diff --git a/src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram/solution.go b/src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram/solution.go index e93881a1..9f405f9a 100644 --- a/src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram/solution.go +++ b/src/main/go/g0001_0100/s0084_largest_rectangle_in_histogram/solution.go @@ -1,9 +1,9 @@ package s0084_largest_rectangle_in_histogram -import "math" - // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack -// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_03_15_Time_95_ms_(77.81%)_Space_7.8_MB_(91.91%) +// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_05_06_Time_2_ms_(94.16%)_Space_10.14_MB_(81.09%) + +import "math" func largestRectangleArea(heights []int) int { return largestArea(heights, 0, len(heights)) diff --git a/src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go b/src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go index 1381051b..0c708c6f 100644 --- a/src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go +++ b/src/main/go/g0001_0100/s0094_binary_tree_inorder_traversal/solution.go @@ -2,7 +2,7 @@ package 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_03_15_Time_0_ms_(100.00%)_Space_2.3_MB_(82.78%) +// #2025_05_06_Time_0_ms_(100.00%)_Space_4.12_MB_(29.86%) type TreeNode struct { Val int diff --git a/src/main/go/g0001_0100/s0096_unique_binary_search_trees/solution.go b/src/main/go/g0001_0100/s0096_unique_binary_search_trees/solution.go index 2db0bc45..0a35bbd5 100644 --- a/src/main/go/g0001_0100/s0096_unique_binary_search_trees/solution.go +++ b/src/main/go/g0001_0100/s0096_unique_binary_search_trees/solution.go @@ -1,8 +1,8 @@ package 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_03_15_Time_0_ms_(100.00%)_Space_2.1_MB_(46.95%) +// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +// #2025_05_06_Time_0_ms_(100.00%)_Space_3.85_MB_(79.74%) func numTrees(n int) int { result := 1 diff --git a/src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go b/src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go index daa419a1..02171fd9 100644 --- a/src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go +++ b/src/main/go/g0001_0100/s0098_validate_binary_search_tree/solution.go @@ -2,8 +2,8 @@ package 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_03_15_Time_6_ms_(55.36%)_Space_5.4_MB_(59.64%) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_05_06_Time_0_ms_(100.00%)_Space_7.21_MB_(46.50%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0101_symmetric_tree/solution.go b/src/main/go/g0101_0200/s0101_symmetric_tree/solution.go index c072519b..79ee1647 100644 --- a/src/main/go/g0101_0200/s0101_symmetric_tree/solution.go +++ b/src/main/go/g0101_0200/s0101_symmetric_tree/solution.go @@ -2,7 +2,8 @@ package 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_03_15_Time_0_ms_(100.00%)_Space_3_MB_(8.89%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_05_06_Time_0_ms_(100.00%)_Space_4.79_MB_(79.66%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go b/src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go index 65d9a7fe..93095bc8 100644 --- a/src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go +++ b/src/main/go/g0101_0200/s0102_binary_tree_level_order_traversal/solution.go @@ -2,7 +2,8 @@ package 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_03_19_Time_3_ms_(70.81%)_Space_3.8_MB_(31.96%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2025_05_06_Time_0_ms_(100.00%)_Space_5.45_MB_(96.04%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go b/src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go index 1c25f5f1..883051d6 100644 --- a/src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go +++ b/src/main/go/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.go @@ -1,9 +1,10 @@ package 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_03_19_Time_0_ms_(100.00%)_Space_4.6_MB_(19.81%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2025_05_06_Time_0_ms_(100.00%)_Space_6.36_MB_(51.89%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go b/src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go index 25b4e6f2..b8b62f86 100644 --- a/src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go +++ b/src/main/go/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.go @@ -1,8 +1,8 @@ package 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_03_19_Time_0_ms_(100.00%)_Space_4.4_MB_(16.83%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_05_06_Time_0_ms_(100.00%)_Space_6.11_MB_(20.43%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go b/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go index 4f3b6fef..eff05d3e 100644 --- a/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go +++ b/src/main/go/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.go @@ -1,8 +1,8 @@ package 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_03_19_Time_0_ms_(100.00%)_Space_3.1_MB_(5.75%) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) +// #2025_05_07_Time_0_ms_(100.00%)_Space_4.88_MB_(66.49%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go b/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go index 3e2553ba..5194affd 100644 --- a/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go +++ b/src/main/go/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.go @@ -2,7 +2,8 @@ package 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_03_19_Time_76_ms_(99.34%)_Space_7.4_MB_(98.91%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2025_05_07_Time_0_ms_(100.00%)_Space_9.74_MB_(72.19%) func maxProfit(prices []int) int { maxProfit := 0 diff --git a/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go b/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go index c33a4bfd..b1a99ef6 100644 --- a/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go +++ b/src/main/go/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.go @@ -1,8 +1,8 @@ package 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_03_19_Time_10_ms_(89.68%)_Space_7.8_MB_(94.84%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_05_07_Time_0_ms_(100.00%)_Space_10.08_MB_(59.76%) type TreeNode struct { Val int diff --git a/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go b/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go index c7bbdc6c..cba1d4a5 100644 --- a/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go +++ b/src/main/go/g0101_0200/s0128_longest_consecutive_sequence/solution.go @@ -1,9 +1,10 @@ package s0128_longest_consecutive_sequence -import "sort" - // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2024_03_19_Time_54_ms_(99.84%)_Space_8.9_MB_(93.24%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2025_05_07_Time_4_ms_(99.84%)_Space_10.05_MB_(99.24%) + +import "sort" func longestConsecutive(nums []int) int { if len(nums) == 0 { diff --git a/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go b/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go index 397650b7..c6454719 100644 --- a/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go +++ b/src/main/go/g0101_0200/s0131_palindrome_partitioning/solution.go @@ -2,7 +2,7 @@ package 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_03_19_Time_221_ms_(97.16%)_Space_19.1_MB_(89.91%) +// #2025_05_07_Time_18_ms_(92.42%)_Space_27.26_MB_(16.97%) func partition(s string) [][]string { var res [][]string diff --git a/src/main/go/g0101_0200/s0136_single_number/solution.go b/src/main/go/g0101_0200/s0136_single_number/solution.go index 08597538..1ce86ae7 100644 --- a/src/main/go/g0101_0200/s0136_single_number/solution.go +++ b/src/main/go/g0101_0200/s0136_single_number/solution.go @@ -1,8 +1,9 @@ package 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_03_19_Time_8_ms_(95.49%)_Space_6.1_MB_(77.03%) +// #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_05_07_Time_0_ms_(100.00%)_Space_7.82_MB_(83.54%) func singleNumber(nums []int) int { res := nums[0] diff --git a/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go b/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go index 2c156693..c5aae65a 100644 --- a/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go +++ b/src/main/go/g0101_0200/s0138_copy_list_with_random_pointer/solution.go @@ -1,8 +1,8 @@ package 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_03_19_Time_2_ms_(70.11%)_Space_3.6_MB_(96.36%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2025_05_07_Time_0_ms_(100.00%)_Space_5.44_MB_(28.63%) type Node struct { Val int diff --git a/src/main/go/g0101_0200/s0139_word_break/solution.go b/src/main/go/g0101_0200/s0139_word_break/solution.go index 98f1ae82..d865ef8e 100644 --- a/src/main/go/g0101_0200/s0139_word_break/solution.go +++ b/src/main/go/g0101_0200/s0139_word_break/solution.go @@ -2,8 +2,8 @@ package 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_03_20_Time_0_ms_(100.00%)_Space_2.4_MB_(16.32%) +// #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_05_07_Time_0_ms_(100.00%)_Space_4.24_MB_(37.18%) func wordBreak(s string, wordDict []string) bool { if len(wordDict) == 0 { diff --git a/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go b/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go index 6860859f..4c1e57df 100644 --- a/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go +++ b/src/main/go/g0101_0200/s0141_linked_list_cycle/solution.go @@ -1,8 +1,8 @@ package 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_03_20_Time_7_ms_(69.12%)_Space_4.6_MB_(82.42%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2025_05_07_Time_4_ms_(76.55%)_Space_6.23_MB_(51.42%) type ListNode struct { Val int diff --git a/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go b/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go index 96b17446..caba4bc4 100644 --- a/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go +++ b/src/main/go/g0101_0200/s0142_linked_list_cycle_ii/solution.go @@ -2,7 +2,7 @@ package 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_03_20_Time_5_ms_(69.02%)_Space_3.8_MB_(98.54%) +// #Big_O_Time_O(N)_Space_O(1) #2025_05_07_Time_0_ms_(100.00%)_Space_6.80_MB_(18.18%) type ListNode struct { Val int @@ -17,26 +17,13 @@ type ListNode struct { * } */ func detectCycle(head *ListNode) *ListNode { - if head == nil || head.Next == nil { - return nil - } - slow := head - fast := head - for fast != nil && fast.Next != nil { - fast = fast.Next.Next - slow = slow.Next - // intersected inside the loop. - if slow == fast { - break + m := map[*ListNode]bool{} + for head != nil { + if m[head] == true { + return head } + m[head] = true + head = head.Next } - if fast == nil || fast.Next == nil { - return nil - } - slow = head - for slow != fast { - slow = slow.Next - fast = fast.Next - } - return slow + return nil } diff --git a/src/main/go/g0101_0200/s0146_lru_cache/lrucache.go b/src/main/go/g0101_0200/s0146_lru_cache/lrucache.go index 7c1db3eb..c32166a6 100644 --- a/src/main/go/g0101_0200/s0146_lru_cache/lrucache.go +++ b/src/main/go/g0101_0200/s0146_lru_cache/lrucache.go @@ -1,8 +1,8 @@ package 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_03_21_Time_421_ms_(93.60%)_Space_69_MB_(91.02%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2025_05_08_Time_75_ms_(84.31%)_Space_72.81_MB_(71.88%) import "container/list" diff --git a/src/main/go/g0101_0200/s0148_sort_list/solution.go b/src/main/go/g0101_0200/s0148_sort_list/solution.go index 93a157e6..401d99bc 100644 --- a/src/main/go/g0101_0200/s0148_sort_list/solution.go +++ b/src/main/go/g0101_0200/s0148_sort_list/solution.go @@ -1,10 +1,8 @@ package 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_03_21_Time_40_ms_(97.89%)_Space_7_MB_(83.99%) - -import "slices" +// #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_05_08_Time_7_ms_(87.91%)_Space_8.75_MB_(91.94%) type ListNode struct { Val int @@ -19,21 +17,45 @@ type ListNode struct { * } */ func sortList(head *ListNode) *ListNode { - curr := head - a := []*ListNode{} - for curr != nil { - a = append(a, curr) - curr = curr.Next + if head == nil || head.Next == nil { + return head + } + mid := findMid(head) + left := sortList(head) + right := sortList(mid) + return merge(left, right) +} + +func findMid(head *ListNode) *ListNode { + var prev *ListNode + slow, fast := head, head + for fast != nil && fast.Next != nil { + prev = slow + slow = slow.Next + fast = fast.Next.Next + } + prev.Next = nil + return slow +} + +func merge(left, right *ListNode) *ListNode { + pointer := new(ListNode) + res := pointer + for left != nil && right != nil { + if left.Val < right.Val { + pointer.Next = left + left = left.Next + } else { + pointer.Next = right + right = right.Next + } + pointer = pointer.Next + } + if left != nil { + pointer.Next = left } - slices.SortFunc(a, func(l1, l2 *ListNode) int { - return l1.Val - l2.Val - }) - newNode := &ListNode{} - curr = newNode - for _, node := range a { - curr.Next = node - curr = node + if right != nil { + pointer.Next = right } - curr.Next = nil - return newNode.Next + return res.Next } diff --git a/src/main/go/g0101_0200/s0152_maximum_product_subarray/solution.go b/src/main/go/g0101_0200/s0152_maximum_product_subarray/solution.go index 094cd870..26957433 100644 --- a/src/main/go/g0101_0200/s0152_maximum_product_subarray/solution.go +++ b/src/main/go/g0101_0200/s0152_maximum_product_subarray/solution.go @@ -2,7 +2,7 @@ package 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_03_22_Time_0_ms_(100.00%)_Space_3.6_MB_(17.73%) +// #Big_O_Time_O(N)_Space_O(1) #2025_05_08_Time_0_ms_(100.00%)_Space_5.25_MB_(91.63%) func maxProduct(nums []int) int { res := findMax(nums...) diff --git a/src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.go b/src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.go index 52db7bc9..3f1f48d6 100644 --- a/src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.go +++ b/src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.go @@ -1,8 +1,8 @@ package 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_03_22_Time_0_ms_(100.00%)_Space_2.7_MB_(12.41%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2025_05_08_Time_0_ms_(100.00%)_Space_4.49_MB_(14.09%) func findMin(nums []int) int { low, mid, high := 0, 0, len(nums)-1 diff --git a/src/main/go/g0101_0200/s0155_min_stack/minstack.go b/src/main/go/g0101_0200/s0155_min_stack/minstack.go index 483d45f3..4052528c 100644 --- a/src/main/go/g0101_0200/s0155_min_stack/minstack.go +++ b/src/main/go/g0101_0200/s0155_min_stack/minstack.go @@ -1,8 +1,9 @@ package 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_03_22_Time_12_ms_(79.58%)_Space_7.4_MB_(21.27%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2025_05_08_Time_0_ms_(100.00%)_Space_8.84_MB_(92.55%) import "math" diff --git a/src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go b/src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go index 79fd2379..fda73138 100644 --- a/src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go +++ b/src/main/go/g0101_0200/s0160_intersection_of_two_linked_lists/solution.go @@ -2,7 +2,7 @@ package 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_03_22_Time_16_ms_(99.84%)_Space_6.8_MB_(74.72%) +// #2025_05_08_Time_24_ms_(85.37%)_Space_8.62_MB_(59.52%) type ListNode struct { Val int diff --git a/src/main/go/g0101_0200/s0169_majority_element/solution.go b/src/main/go/g0101_0200/s0169_majority_element/solution.go index 6458be61..e5fd0c08 100644 --- a/src/main/go/g0101_0200/s0169_majority_element/solution.go +++ b/src/main/go/g0101_0200/s0169_majority_element/solution.go @@ -2,7 +2,8 @@ package 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_03_22_Time_15_ms_(70.01%)_Space_6.6_MB_(22.94%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_05_08_Time_0_ms_(100.00%)_Space_8.53_MB_(56.86%) func majorityElement(nums []int) int { count := 1 diff --git a/src/main/go/g0101_0200/s0189_rotate_array/solution.go b/src/main/go/g0101_0200/s0189_rotate_array/solution.go index 4e75b22b..bdd162ea 100644 --- a/src/main/go/g0101_0200/s0189_rotate_array/solution.go +++ b/src/main/go/g0101_0200/s0189_rotate_array/solution.go @@ -1,8 +1,8 @@ package 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_03_22_Time_20_ms_(92.61%)_Space_8.4_MB_(12.16%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2025_05_08_Time_0_ms_(100.00%)_Space_9.63_MB_(40.57%) func reverse(nums []int, l, r int) { for l <= r { diff --git a/src/main/go/g0101_0200/s0198_house_robber/solution.go b/src/main/go/g0101_0200/s0198_house_robber/solution.go index 8df89fda..3d634c3d 100644 --- a/src/main/go/g0101_0200/s0198_house_robber/solution.go +++ b/src/main/go/g0101_0200/s0198_house_robber/solution.go @@ -1,9 +1,9 @@ package 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_03_22_Time_1_ms_(78.69%)_Space_2.3_MB_(7.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_05_08_Time_0_ms_(100.00%)_Space_3.88_MB_(99.40%) func rob(nums []int) int { if len(nums) == 0 { diff --git a/src/main/go/g0101_0200/s0200_number_of_islands/solution.go b/src/main/go/g0101_0200/s0200_number_of_islands/solution.go index 9b9fad1f..78bb81a2 100644 --- a/src/main/go/g0101_0200/s0200_number_of_islands/solution.go +++ b/src/main/go/g0101_0200/s0200_number_of_islands/solution.go @@ -4,7 +4,8 @@ package 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_03_22_Time_4_ms_(76.94%)_Space_4_MB_(44.10%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2025_05_08_Time_2_ms_(87.44%)_Space_5.69_MB_(90.06%) func numIslands(grid [][]byte) int { islands := 0 diff --git a/src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go b/src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go index 15ccf57b..548a9976 100644 --- a/src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go +++ b/src/main/go/g0201_0300/s0206_reverse_linked_list/solution.go @@ -1,9 +1,9 @@ package 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_03_22_Time_2_ms_(76.97%)_Space_2.7_MB_(21.67%) +// #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_05_09_Time_0_ms_(100.00%)_Space_4.36_MB_(95.25%) type ListNode struct { Val int diff --git a/src/main/go/g0201_0300/s0207_course_schedule/solution.go b/src/main/go/g0201_0300/s0207_course_schedule/solution.go index 5105d8fb..0f6a8932 100644 --- a/src/main/go/g0201_0300/s0207_course_schedule/solution.go +++ b/src/main/go/g0201_0300/s0207_course_schedule/solution.go @@ -1,37 +1,46 @@ package 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_03_22_Time_7_ms_(83.17%)_Space_6.3_MB_(51.07%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2025_05_09_Time_0_ms_(100.00%)_Space_7.98_MB_(72.75%) + +type State int + +const ( + Unvisited State = iota + Visiting + Visited +) func canFinish(numCourses int, prerequisites [][]int) bool { - graph := map[int][]int{} - for _, edge := range prerequisites { - graph[edge[1]] = append(graph[edge[1]], edge[0]) + visited := make([]State, numCourses) + graph := make([][]int, numCourses) + for _, dep := range prerequisites { + graph[dep[1]] = append(graph[dep[1]], dep[0]) } - indegree := make([]int, numCourses) - queue := []int{} for i := 0; i < numCourses; i++ { - for _, v := range graph[i] { - indegree[v]++ + if visited[i] == Unvisited { + if !dfs(i, visited, graph) { + return false + } } } - for i := 0; i < numCourses; i++ { - if indegree[i] == 0 { - queue = append(queue, i) - } + return true +} + +func dfs(start int, visited []State, graph [][]int) bool { + if visited[start] == Visiting { + return false } - visited := 0 - for len(queue) > 0 { - node := queue[0] - queue = queue[1:] - visited++ - for _, v := range graph[node] { - indegree[v]-- - if indegree[v] == 0 { - queue = append(queue, v) - } + if visited[start] == Visited { + return true + } + visited[start] = Visiting + for _, next := range graph[start] { + if !dfs(next, visited, graph) { + return false } } - return visited == numCourses + visited[start] = Visited + return true } diff --git a/src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go b/src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go index 12d2bd6d..e82b899b 100644 --- a/src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go +++ b/src/main/go/g0201_0300/s0208_implement_trie_prefix_tree/trie.go @@ -1,9 +1,9 @@ package 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_03_22_Time_40_ms_(94.90%)_Space_8.6_MB_(96.69%) +// #2025_05_09_Time_11_ms_(98.49%)_Space_16.18_MB_(42.49%) import "strings" diff --git a/src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array/solution.go b/src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array/solution.go index 3ef92a49..681c16ca 100644 --- a/src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array/solution.go +++ b/src/main/go/g0201_0300/s0215_kth_largest_element_in_an_array/solution.go @@ -1,8 +1,9 @@ package 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_03_22_Time_62_ms_(98.32%)_Space_7.5_MB_(94.86%) +// #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_05_09_Time_17_ms_(83.49%)_Space_10.00_MB_(66.67%) import "sort" diff --git a/src/main/go/g0201_0300/s0221_maximal_square/solution.go b/src/main/go/g0201_0300/s0221_maximal_square/solution.go index 0330aa8b..73afa00b 100644 --- a/src/main/go/g0201_0300/s0221_maximal_square/solution.go +++ b/src/main/go/g0201_0300/s0221_maximal_square/solution.go @@ -1,8 +1,8 @@ package 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_03_22_Time_0_ms_(100.00%)_Space_7_MB_(29.80%) +// #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_05_09_Time_1_ms_(93.36%)_Space_8.70_MB_(81.82%) func maximalSquare(matrix [][]byte) int { m := len(matrix) diff --git a/src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go b/src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go index 748da664..22166717 100644 --- a/src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go +++ b/src/main/go/g0201_0300/s0226_invert_binary_tree/solution.go @@ -2,7 +2,8 @@ package 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_03_22_Time_0_ms_(100.00%)_Space_2.4_MB_(5.25%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2025_05_09_Time_0_ms_(100.00%)_Space_4.17_MB_(55.19%) type TreeNode struct { Val int diff --git a/src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go b/src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go index 7a6b88a1..81a9e727 100644 --- a/src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go +++ b/src/main/go/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.go @@ -1,8 +1,9 @@ package 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_03_22_Time_0_ms_(100.00%)_Space_6.4_MB_(46.83%) +// #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_05_09_Time_0_ms_(100.00%)_Space_8.52_MB_(17.71%) type TreeNode struct { Val int diff --git a/src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go b/src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go index c7e4c194..7d1f4e19 100644 --- a/src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go +++ b/src/main/go/g0201_0300/s0234_palindrome_linked_list/solution.go @@ -1,8 +1,8 @@ package 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_03_23_Time_104_ms_(97.77%)_Space_8.2_MB_(84.40%) +// #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_05_09_Time_1_ms_(87.36%)_Space_10.64_MB_(70.30%) type ListNode struct { Val int diff --git a/src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go b/src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go index e6b39871..34fffc68 100644 --- a/src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go +++ b/src/main/go/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.go @@ -1,8 +1,9 @@ package 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_03_23_Time_5_ms_(90.18%)_Space_7.7_MB_(22.79%) +// #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_05_09_Time_5_ms_(89.93%)_Space_9.14_MB_(38.67%) type TreeNode struct { Val int diff --git a/src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go b/src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go index 422d425e..df820175 100644 --- a/src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go +++ b/src/main/go/g0201_0300/s0238_product_of_array_except_self/solution.go @@ -1,8 +1,8 @@ package 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_03_23_Time_20_ms_(77.65%)_Space_7.8_MB_(37.12%) +// #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_05_09_Time_0_ms_(100.00%)_Space_9.70_MB_(86.27%) func productExceptSelf(nums []int) []int { n := len(nums) diff --git a/src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go b/src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go index 6873c514..34e4915e 100644 --- a/src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go +++ b/src/main/go/g0201_0300/s0239_sliding_window_maximum/solution.go @@ -1,8 +1,8 @@ package 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_03_18_Time_168_ms_(99.41%)_Space_9.3_MB_(64.37%) +// #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_05_09_Time_10_ms_(98.48%)_Space_19.08_MB_(19.58%) func maxSlidingWindow(nums []int, k int) []int { if k == 1 { diff --git a/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go b/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go index 00f33987..9d4c7736 100644 --- a/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go +++ b/src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go @@ -1,8 +1,8 @@ package 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_03_18_Time_11_ms_(96.10%)_Space_6.6_MB_(39.51%) +// #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_05_10_Time_9_ms_(98.86%)_Space_8.76_MB_(12.12%) func searchMatrix(matrix [][]int, target int) bool { r := 0 diff --git a/src/main/go/g0201_0300/s0283_move_zeroes/solution.go b/src/main/go/g0201_0300/s0283_move_zeroes/solution.go index 0e38510c..09435316 100644 --- a/src/main/go/g0201_0300/s0283_move_zeroes/solution.go +++ b/src/main/go/g0201_0300/s0283_move_zeroes/solution.go @@ -1,8 +1,8 @@ package 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_03_18_Time_15_ms_(88.69%)_Space_8_MB_(5.38%) +// #Big_O_Time_O(n)_Space_O(1) #2025_05_10_Time_0_ms_(100.00%)_Space_9.28_MB_(18.25%) func moveZeroes(nums []int) { var j int diff --git a/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go b/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go index b79a1828..8ae98d9a 100644 --- a/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go +++ b/src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go @@ -1,8 +1,8 @@ package 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_03_18_Time_68_ms_(98.63%)_Space_8.3_MB_(69.20%) +// #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_05_10_Time_1_ms_(90.38%)_Space_10.41_MB_(41.51%) func findDuplicate(nums []int) int { arr := make([]int, len(nums)+1) diff --git a/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go b/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go index 76287e41..c3046a44 100644 --- a/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go +++ b/src/main/go/g0201_0300/s0295_find_median_from_data_stream/medianfinder.go @@ -1,8 +1,8 @@ package 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_03_18_Time_240_ms_(100.00%)_Space_22.5_MB_(23.89%) +// #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_05_10_Time_59_ms_(96.70%)_Space_25.46_MB_(10.38%) func pushHeap(a *[]int, x int) { *a = append(*a, x) diff --git a/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go b/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go index 9d60bfd8..b951ac23 100644 --- a/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go +++ b/src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go @@ -1,9 +1,9 @@ package 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_03_16_Time_5_ms_(91.77%)_Space_3.5_MB_(70.57%) +// #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_05_10_Time_0_ms_(100.00%)_Space_5.28_MB_(69.25%) import "math" diff --git a/src/main/go/g0301_0400/s0322_coin_change/solution.go b/src/main/go/g0301_0400/s0322_coin_change/solution.go index 3ddbdad0..04c50afe 100644 --- a/src/main/go/g0301_0400/s0322_coin_change/solution.go +++ b/src/main/go/g0301_0400/s0322_coin_change/solution.go @@ -1,9 +1,9 @@ package 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_03_16_Time_10_ms_(73.33%)_Space_6.4_MB_(71.07%) +// #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_05_10_Time_10_ms_(79.59%)_Space_8.61_MB_(51.21%) func coinChange(coins []int, amount int) int { dp := make([]int, amount+1) diff --git a/src/main/go/g0301_0400/s0338_counting_bits/solution.go b/src/main/go/g0301_0400/s0338_counting_bits/solution.go index d49c4159..c31a1c87 100644 --- a/src/main/go/g0301_0400/s0338_counting_bits/solution.go +++ b/src/main/go/g0301_0400/s0338_counting_bits/solution.go @@ -1,7 +1,8 @@ package s0338_counting_bits -// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_03_16_Time_0_ms_(100.00%)_Space_4.7_MB_(25.18%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2025_05_10_Time_0_ms_(100.00%)_Space_6.48_MB_(48.26%) func countBits(num int) []int { result := make([]int, num+1) diff --git a/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go b/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go index 86f32f54..d4df1a1e 100644 --- a/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go +++ b/src/main/go/g0301_0400/s0347_top_k_frequent_elements/solution.go @@ -1,9 +1,8 @@ package 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_03_16_Time_8_ms_(88.72%)_Space_6.2_MB_(61.53%) +// #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_05_10_Time_0_ms_(100.00%)_Space_7.96_MB_(62.32%) import "sort" diff --git a/src/main/go/g0301_0400/s0394_decode_string/solution.go b/src/main/go/g0301_0400/s0394_decode_string/solution.go index 26b7e6b6..8aa67fb6 100644 --- a/src/main/go/g0301_0400/s0394_decode_string/solution.go +++ b/src/main/go/g0301_0400/s0394_decode_string/solution.go @@ -1,7 +1,8 @@ package 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_03_16_Time_1_ms_(76.33%)_Space_2.2_MB_(26.06%) +// #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_05_10_Time_0_ms_(100.00%)_Space_4.00_MB_(85.31%) import ( "strings" diff --git a/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go b/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go index 7a1507b4..50b1bd32 100644 --- a/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go +++ b/src/main/go/g0401_0500/s0416_partition_equal_subset_sum/solution.go @@ -1,23 +1,30 @@ package 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_03_12_Time_13_ms_(91.83%)_Space_2.5_MB_(98.44%) +// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_05_10_Time_4_ms_(97.02%)_Space_4.42_MB_(72.07%) func canPartition(nums []int) bool { - sums := 0 - for _, num := range nums { - sums += num + sum := 0 + for _, v := range nums { + sum += v } - if sums%2 == 1 { + if sum%2 == 1 { return false } - sums /= 2 - dp := make([]bool, sums+1) + sum = sum / 2 + dp := make([]bool, sum, sum) dp[0] = true - for _, num := range nums { - for sum := sums; sum >= num; sum-- { - dp[sum] = dp[sum] || dp[sum-num] + for _, n := range nums { + if n <= sum { + if dp[sum-n] == true { + return true + } + for j := sum - n - 1; j >= 0; j-- { + if dp[j] == true { + dp[j+n] = true + } + } } } - return dp[sums] + return false } diff --git a/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go b/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go index 9adcfd3e..df8cd924 100644 --- a/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go +++ b/src/main/go/g0401_0500/s0437_path_sum_iii/solution.go @@ -1,7 +1,7 @@ package 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_03_12_Time_7_ms_(74.18%)_Space_5.3_MB_(19.02%) +// #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_05_10_Time_0_ms_(100.00%)_Space_6.94_MB_(22.90%) type TreeNode struct { Val int diff --git a/src/main/go/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.go b/src/main/go/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.go index 14bd14c8..d728a4ba 100644 --- a/src/main/go/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.go +++ b/src/main/go/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.go @@ -3,7 +3,7 @@ package 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_03_12_Time_0_ms_(100.00%)_Space_5_MB_(45.34%) +// #2025_05_11_Time_0_ms_(100.00%)_Space_6.83_MB_(90.16%) func findAnagrams(s string, p string) []int { var mapArr [26]int diff --git a/src/main/go/g0401_0500/s0494_target_sum/solution.go b/src/main/go/g0401_0500/s0494_target_sum/solution.go index 0679ce47..fdd16092 100644 --- a/src/main/go/g0401_0500/s0494_target_sum/solution.go +++ b/src/main/go/g0401_0500/s0494_target_sum/solution.go @@ -1,7 +1,7 @@ package 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_03_12_Time_7_ms_(80.54%)_Space_6.6_MB_(40.47%) +// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #2025_05_11_Time_3_ms_(84.35%)_Space_8.52_MB_(36.96%) import "math" @@ -11,17 +11,14 @@ func findTargetSumWays(nums []int, s int) int { for _, num := range nums { sum += num } - if s > sum || (sum+s)%2 != 0 { return 0 } - dp := make([][]int, (sum+s)/2+1) for i := range dp { dp[i] = make([]int, len(nums)+1) } dp[0][0] = 1 - for i := 0; i < len(nums); i++ { if nums[i] == 0 { dp[0][i+1] = dp[0][i] * 2 @@ -29,7 +26,6 @@ func findTargetSumWays(nums []int, s int) int { dp[0][i+1] = dp[0][i] } } - for i := 1; i < len(dp); i++ { for j := 0; j < len(nums); j++ { dp[i][j+1] += dp[i][j] @@ -38,6 +34,5 @@ func findTargetSumWays(nums []int, s int) int { } } } - return dp[(sum+s)/2][len(nums)] } diff --git a/src/main/go/g0501_0600/s0543_diameter_of_binary_tree/solution.go b/src/main/go/g0501_0600/s0543_diameter_of_binary_tree/solution.go index 4454e9b2..0716369e 100644 --- a/src/main/go/g0501_0600/s0543_diameter_of_binary_tree/solution.go +++ b/src/main/go/g0501_0600/s0543_diameter_of_binary_tree/solution.go @@ -2,7 +2,7 @@ package 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_03_12_Time_3_ms_(71.60%)_Space_6.8_MB_(5.31%) +// #2025_05_11_Time_0_ms_(100.00%)_Space_8.78_MB_(30.66%) type TreeNode struct { Val int diff --git a/src/main/go/g0501_0600/s0560_subarray_sum_equals_k/solution.go b/src/main/go/g0501_0600/s0560_subarray_sum_equals_k/solution.go index 7cb6027c..2257768c 100644 --- a/src/main/go/g0501_0600/s0560_subarray_sum_equals_k/solution.go +++ b/src/main/go/g0501_0600/s0560_subarray_sum_equals_k/solution.go @@ -1,7 +1,7 @@ package 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_03_10_Time_40_ms_(70.56%)_Space_7.4_MB_(50.68%) +// #Big_O_Time_O(n)_Space_O(n) #2025_05_11_Time_11_ms_(93.74%)_Space_9.28_MB_(56.67%) func subarraySum(nums []int, k int) int { tempSum := 0 diff --git a/src/main/go/g0601_0700/s0647_palindromic_substrings/solution.go b/src/main/go/g0601_0700/s0647_palindromic_substrings/solution.go index 59d0ee8f..ad7be69e 100644 --- a/src/main/go/g0601_0700/s0647_palindromic_substrings/solution.go +++ b/src/main/go/g0601_0700/s0647_palindromic_substrings/solution.go @@ -1,7 +1,7 @@ package s0647_palindromic_substrings -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) -// #2024_03_10_Time_0_ms_(100.00%)_Space_2.1_MB_(41.43%) +// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #2025_05_11_Time_0_ms_(100.00%)_Space_4.02_MB_(35.44%) func expand(a []rune, l int, r int, res *int) { for l >= 0 && r < len(a) { diff --git a/src/main/go/g0701_0800/s0739_daily_temperatures/solution.go b/src/main/go/g0701_0800/s0739_daily_temperatures/solution.go index d29430b4..0616b549 100644 --- a/src/main/go/g0701_0800/s0739_daily_temperatures/solution.go +++ b/src/main/go/g0701_0800/s0739_daily_temperatures/solution.go @@ -1,7 +1,8 @@ package 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_03_10_Time_120_ms_(98.07%)_Space_8.2_MB_(98.62%) +// #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_05_11_Time_5_ms_(96.26%)_Space_10.49_MB_(86.49%) func dailyTemperatures(temperatures []int) []int { sol := make([]int, len(temperatures)) diff --git a/src/main/go/g0701_0800/s0763_partition_labels/solution.go b/src/main/go/g0701_0800/s0763_partition_labels/solution.go index 4b01b54b..e3ef515a 100644 --- a/src/main/go/g0701_0800/s0763_partition_labels/solution.go +++ b/src/main/go/g0701_0800/s0763_partition_labels/solution.go @@ -1,8 +1,7 @@ package 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_03_10_Time_0_ms_(100.00%)_Space_2.3_MB_(63.50%) +// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +// #Big_O_Time_O(n)_Space_O(1) #2025_05_11_Time_0_ms_(100.00%)_Space_4.24_MB_(29.03%) func partitionLabels(s string) []int { letters := []rune(s) diff --git a/src/main/go/g1101_1200/s1143_longest_common_subsequence/solution.go b/src/main/go/g1101_1200/s1143_longest_common_subsequence/solution.go index cadd3c82..a4ef0c8d 100644 --- a/src/main/go/g1101_1200/s1143_longest_common_subsequence/solution.go +++ b/src/main/go/g1101_1200/s1143_longest_common_subsequence/solution.go @@ -1,9 +1,9 @@ package 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_03_10_Time_12_ms_(48.57%)_Space_18.6_MB_(27.42%) +// #2025_05_11_Time_11_ms_(84.94%)_Space_20.05_MB_(31.35%) func longestCommonSubsequence(text1 string, text2 string) int { n := len(text1) diff --git a/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java b/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java index 824016c9..22a8c168 100644 --- a/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java +++ b/src/main/java/g0001_0100/s0006_zigzag_conversion/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0006_zigzag_conversion; -// #Medium #String #Top_Interview_150_Array/String +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) // #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%) public class Solution { diff --git a/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java b/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java index 50ba785a..95654148 100644 --- a/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java +++ b/src/main/java/g0001_0100/s0007_reverse_integer/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0007_reverse_integer; -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2024_11_09_Time_0_ms_(100.00%)_Space_40.9_MB_(36.21%) public class Solution { diff --git a/src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java b/src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java index b573024a..760f2d2c 100644 --- a/src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java +++ b/src/main/java/g0001_0100/s0008_string_to_integer_atoi/Solution.java @@ -1,6 +1,7 @@ package g0001_0100.s0008_string_to_integer_atoi; -// #Medium #Top_Interview_Questions #String #2024_11_09_Time_1_ms_(100.00%)_Space_42_MB_(95.40%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2024_11_09_Time_1_ms_(100.00%)_Space_42_MB_(95.40%) public class Solution { public int myAtoi(String str) { diff --git a/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java b/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java index 54c80c2e..9993b4e6 100644 --- a/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java +++ b/src/main/java/g0001_0100/s0009_palindrome_number/Solution.java @@ -1,6 +1,6 @@ package g0001_0100.s0009_palindrome_number; -// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) // #2024_11_09_Time_4_ms_(100.00%)_Space_44.1_MB_(28.20%) public class Solution { 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/s0138_copy_list_with_random_pointer/Solution.java b/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java index 296a29a8..32cb7140 100644 --- a/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java +++ b/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer/Solution.java @@ -2,70 +2,41 @@ // #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) #2024_11_13_Time_0_ms_(100.00%)_Space_44.1_MB_(92.12%) +// #Big_O_Time_O(N)_Space_O(N) #2025_07_04_Time_0_ms_(100.00%)_Space_43.96_MB_(99.29%) import com_github_leetcode.random.Node; +import java.util.HashMap; +import java.util.Map; /* // Definition for a Node. class Node { - public int val; - public Node next; - public Node random; + int val; + Node next; + Node random; - public Node() {} - - public Node(int _val,Node _next,Node _random) { - val = _val; - next = _next; - random = _random; + public Node(int val) { + this.val = val; + this.next = null; + this.random = null; } -}; +} */ public class Solution { public Node copyRandomList(Node head) { - if (head == null) { - return null; - } - // first pass to have a clone node point to the next node. ie A->B becomes A->clonedNode->B - Node curr = head; - while (curr != null) { - Node clonedNode = new Node(curr.val); - clonedNode.next = curr.next; - curr.next = clonedNode; - curr = clonedNode.next; - } - curr = head; - // second pass to make the cloned node's random pointer point to the orginal node's randome - // pointer. - // ie. A's random pointer becomes ClonedNode's random pointer - while (curr != null) { - if (curr.random != null) { - curr.next.random = curr.random.next; - } else { - curr.next.random = null; - } - curr = curr.next.next; + Map hashMap = new HashMap<>(); + Node cur = head; + while (cur != null) { + hashMap.put(cur, new Node(cur.val)); + cur = cur.next; } - curr = head; - // third pass to restore the links and return the head of the cloned nodes' list. - Node newHead = null; - while (curr != null) { - Node clonedNode; - if (newHead == null) { - clonedNode = curr.next; - newHead = clonedNode; - } else { - clonedNode = curr.next; - } - curr.next = clonedNode.next; - if (curr.next != null) { - clonedNode.next = curr.next.next; - } else { - clonedNode.next = null; - } - curr = curr.next; + cur = head; + while (cur != null) { + Node copy = hashMap.get(cur); + copy.next = hashMap.get(cur.next); + copy.random = hashMap.get(cur.random); + cur = cur.next; } - return newHead; + return hashMap.get(head); } } 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..e8704b66 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,6 +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) +// #Medium #Top_100_Liked_Questions #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; diff --git a/src/main/java/g0401_0500/s0494_target_sum/Solution.java b/src/main/java/g0401_0500/s0494_target_sum/Solution.java index bef704a8..71f6176b 100644 --- a/src/main/java/g0401_0500/s0494_target_sum/Solution.java +++ b/src/main/java/g0401_0500/s0494_target_sum/Solution.java @@ -6,9 +6,8 @@ public class Solution { public int findTargetSumWays(int[] nums, int target) { int totalSum = 0; - int n = nums.length; - for (int i = 0; i < n; i++) { - totalSum += nums[i]; + for (int num : nums) { + totalSum += num; } int sum = totalSum - target; if (sum < 0 || sum % 2 == 1) { 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/g0701_0800/s0763_partition_labels/Solution.java b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java index 87154140..c5594c5c 100644 --- a/src/main/java/g0701_0800/s0763_partition_labels/Solution.java +++ b/src/main/java/g0701_0800/s0763_partition_labels/Solution.java @@ -1,7 +1,8 @@ package 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) #2024_11_17_Time_2_ms_(100.00%)_Space_41.9_MB_(73.06%) +// #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_11_17_Time_2_ms_(100.00%)_Space_41.9_MB_(73.06%) import java.util.ArrayList; import java.util.List; 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/js/g0001_0100/s0001_two_sum/solution.js b/src/main/js/g0001_0100/s0001_two_sum/solution.js index f948ebab..a6723e8e 100644 --- a/src/main/js/g0001_0100/s0001_two_sum/solution.js +++ b/src/main/js/g0001_0100/s0001_two_sum/solution.js @@ -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_11_17_Time_1_ms_(89.15%)_Space_51.9_MB_(13.71%) +// #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_11_17_Time_1_ms_(89.15%)_Space_51.9_MB_(13.71%) /** * @param {number[]} nums diff --git a/src/main/js/g0001_0100/s0002_add_two_numbers/solution.js b/src/main/js/g0001_0100/s0002_add_two_numbers/solution.js index 2a634cd8..a5d2b497 100644 --- a/src/main/js/g0001_0100/s0002_add_two_numbers/solution.js +++ b/src/main/js/g0001_0100/s0002_add_two_numbers/solution.js @@ -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_11_29_Time_3_ms_(81.61%)_Space_55.3_MB_(96.39%) +// #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_11_29_Time_3_ms_(81.61%)_Space_55.3_MB_(96.39%) import { ListNode } from 'src/main/js/com_github_leetcode/listnode' diff --git a/src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js b/src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js index faea5b18..bf7886d2 100644 --- a/src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js +++ b/src/main/js/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.js @@ -1,6 +1,6 @@ // #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) #AI_can_be_used_to_solve_the_task +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task // #2024_11_29_Time_3_ms_(98.96%)_Space_53.9_MB_(69.91%) /** diff --git a/src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays/solution.js b/src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays/solution.js index c3294344..e4ede773 100644 --- a/src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays/solution.js +++ b/src/main/js/g0001_0100/s0004_median_of_two_sorted_arrays/solution.js @@ -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) #AI_can_be_used_to_solve_the_task -// #2024_11_29_Time_3_ms_(91.90%)_Space_54.1_MB_(88.03%) +// #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_11_29_Time_3_ms_(91.90%)_Space_54.1_MB_(88.03%) /** * @param {number[]} nums1 diff --git a/src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js b/src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js index 3d99248d..1cb35518 100644 --- a/src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js +++ b/src/main/js/g0001_0100/s0005_longest_palindromic_substring/solution.js @@ -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_11_29_Time_10_ms_(99.54%)_Space_52.7_MB_(52.69%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_11_29_Time_10_ms_(99.54%)_Space_52.7_MB_(52.69%) /** * @param {string} s diff --git a/src/main/js/g0001_0100/s0006_zigzag_conversion/solution.js b/src/main/js/g0001_0100/s0006_zigzag_conversion/solution.js index 279e52d4..6482dcf8 100644 --- a/src/main/js/g0001_0100/s0006_zigzag_conversion/solution.js +++ b/src/main/js/g0001_0100/s0006_zigzag_conversion/solution.js @@ -1,4 +1,5 @@ -// #Medium #String #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%) +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) +// #2024_11_17_Time_2_ms_(99.71%)_Space_44.5_MB_(94.69%) /** * @param {string} s diff --git a/src/main/js/g0001_0100/s0007_reverse_integer/solution.js b/src/main/js/g0001_0100/s0007_reverse_integer/solution.js index 482c48a5..5caf3846 100644 --- a/src/main/js/g0001_0100/s0007_reverse_integer/solution.js +++ b/src/main/js/g0001_0100/s0007_reverse_integer/solution.js @@ -1,4 +1,4 @@ -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2024_12_04_Time_67_ms_(85.38%)_Space_53.1_MB_(34.57%) /** diff --git a/src/main/js/g0001_0100/s0008_string_to_integer_atoi/solution.js b/src/main/js/g0001_0100/s0008_string_to_integer_atoi/solution.js index 6144f7de..2f30a1d6 100644 --- a/src/main/js/g0001_0100/s0008_string_to_integer_atoi/solution.js +++ b/src/main/js/g0001_0100/s0008_string_to_integer_atoi/solution.js @@ -1,4 +1,5 @@ -// #Medium #Top_Interview_Questions #String #2024_12_03_Time_1_ms_(96.63%)_Space_53.7_MB_(52.53%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2024_12_03_Time_1_ms_(96.63%)_Space_53.7_MB_(52.53%) /** * @param {string} s diff --git a/src/main/js/g0001_0100/s0009_palindrome_number/solution.js b/src/main/js/g0001_0100/s0009_palindrome_number/solution.js index 18fd35b1..1bd58b71 100644 --- a/src/main/js/g0001_0100/s0009_palindrome_number/solution.js +++ b/src/main/js/g0001_0100/s0009_palindrome_number/solution.js @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_12_03_Time_4_ms_(97.14%)_Space_59.8_MB_(5.70%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) +// #2024_12_03_Time_4_ms_(97.14%)_Space_59.8_MB_(5.70%) /** * @param {number} x diff --git a/src/main/js/g0001_0100/s0011_container_with_most_water/solution.js b/src/main/js/g0001_0100/s0011_container_with_most_water/solution.js index 23651f15..9c643dd8 100644 --- a/src/main/js/g0001_0100/s0011_container_with_most_water/solution.js +++ b/src/main/js/g0001_0100/s0011_container_with_most_water/solution.js @@ -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_12_03_Time_1_ms_(95.77%)_Space_58_MB_(27.55%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2024_12_03_Time_1_ms_(95.77%)_Space_58_MB_(27.55%) /** * @param {number[]} height diff --git a/src/main/js/g0001_0100/s0015_3sum/solution.js b/src/main/js/g0001_0100/s0015_3sum/solution.js index 88294f33..fba50e47 100644 --- a/src/main/js/g0001_0100/s0015_3sum/solution.js +++ b/src/main/js/g0001_0100/s0015_3sum/solution.js @@ -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_12_03_Time_31_ms_(91.92%)_Space_66.4_MB_(31.02%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_12_03_Time_31_ms_(91.92%)_Space_66.4_MB_(31.02%) /** * @param {number[]} nums diff --git a/src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js b/src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js index 600d5766..0f580404 100644 --- a/src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js +++ b/src/main/js/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.js @@ -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_12_03_Time_0_ms_(100.00%)_Space_49.9_MB_(6.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) +// #2024_12_03_Time_0_ms_(100.00%)_Space_49.9_MB_(6.39%) /** * @param {string} digits diff --git a/src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js b/src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js index 1e2e732e..089cb5b3 100644 --- a/src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js +++ b/src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js @@ -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_12_03_Time_0_ms_(100.00%)_Space_51.2_MB_(27.67%) +// #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_12_03_Time_0_ms_(100.00%)_Space_51.2_MB_(27.67%) import { ListNode } from '../../com_github_leetcode/listnode' diff --git a/src/main/js/g0001_0100/s0020_valid_parentheses/solution.js b/src/main/js/g0001_0100/s0020_valid_parentheses/solution.js index 59c7b781..a53153b1 100644 --- a/src/main/js/g0001_0100/s0020_valid_parentheses/solution.js +++ b/src/main/js/g0001_0100/s0020_valid_parentheses/solution.js @@ -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_12_03_Time_0_ms_(100.00%)_Space_51.9_MB_(21.82%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_12_03_Time_0_ms_(100.00%)_Space_51.9_MB_(21.82%) /** * @param {string} s diff --git a/src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js b/src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js index a42d49fa..7bf93955 100644 --- a/src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js +++ b/src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js @@ -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_12_04_Time_0_ms_(100.00%)_Space_52.3_MB_(20.64%) +// #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_12_04_Time_0_ms_(100.00%)_Space_52.3_MB_(20.64%) import { ListNode } from '../../com_github_leetcode/listnode'; diff --git a/src/main/js/g0001_0100/s0022_generate_parentheses/solution.js b/src/main/js/g0001_0100/s0022_generate_parentheses/solution.js index 25f288ea..80bafaa6 100644 --- a/src/main/js/g0001_0100/s0022_generate_parentheses/solution.js +++ b/src/main/js/g0001_0100/s0022_generate_parentheses/solution.js @@ -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_12_04_Time_0_ms_(100.00%)_Space_50.7_MB_(42.00%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_12_04_Time_0_ms_(100.00%)_Space_50.7_MB_(42.00%) /** * @param {number} n diff --git a/src/main/js/g0001_0100/s0023_merge_k_sorted_lists/solution.js b/src/main/js/g0001_0100/s0023_merge_k_sorted_lists/solution.js index eadf2eca..bb79fe28 100644 --- a/src/main/js/g0001_0100/s0023_merge_k_sorted_lists/solution.js +++ b/src/main/js/g0001_0100/s0023_merge_k_sorted_lists/solution.js @@ -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_12_04_Time_3_ms_(99.39%)_Space_55.8_MB_(67.69%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2024_12_04_Time_3_ms_(99.39%)_Space_55.8_MB_(67.69%) /** * Definition for singly-linked list. diff --git a/src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group/solution.js b/src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group/solution.js index 2d6629b9..727f6641 100644 --- a/src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group/solution.js +++ b/src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group/solution.js @@ -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_12_04_Time_0_ms_(100.00%)_Space_53.3_MB_(54.66%) /** diff --git a/src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array/solution.js b/src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array/solution.js index 4b3d7699..5db3b165 100644 --- a/src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array/solution.js +++ b/src/main/js/g0001_0100/s0033_search_in_rotated_sorted_array/solution.js @@ -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_12_05_Time_0_ms_(100.00%)_Space_49.3_MB_(21.97%) /** diff --git a/src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.js b/src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.js index ed704cf6..278d85ac 100644 --- a/src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.js +++ b/src/main/js/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.js @@ -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_12_05_Time_0_ms_(100.00%)_Space_49.9_MB_(40.62%) +// #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_12_05_Time_0_ms_(100.00%)_Space_49.9_MB_(40.62%) /** * @param {number[]} nums diff --git a/src/main/js/g0001_0100/s0035_search_insert_position/solution.js b/src/main/js/g0001_0100/s0035_search_insert_position/solution.js index 7fa58d20..0d427705 100644 --- a/src/main/js/g0001_0100/s0035_search_insert_position/solution.js +++ b/src/main/js/g0001_0100/s0035_search_insert_position/solution.js @@ -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_12_05_Time_0_ms_(100.00%)_Space_49.1_MB_(65.54%) /** diff --git a/src/main/js/g0001_0100/s0039_combination_sum/solution.js b/src/main/js/g0001_0100/s0039_combination_sum/solution.js index b7c2b7b5..04d738ff 100644 --- a/src/main/js/g0001_0100/s0039_combination_sum/solution.js +++ b/src/main/js/g0001_0100/s0039_combination_sum/solution.js @@ -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_12_08_Time_1_ms_(98.51%)_Space_54.6_MB_(59.25%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_12_08_Time_1_ms_(98.51%)_Space_54.6_MB_(59.25%) /** * @param {number[]} candidates diff --git a/src/main/js/g0001_0100/s0042_trapping_rain_water/solution.js b/src/main/js/g0001_0100/s0042_trapping_rain_water/solution.js index dd87797a..8771fccf 100644 --- a/src/main/js/g0001_0100/s0042_trapping_rain_water/solution.js +++ b/src/main/js/g0001_0100/s0042_trapping_rain_water/solution.js @@ -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_12_08_Time_0_ms_(100.00%)_Space_51.2_MB_(88.05%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_12_08_Time_0_ms_(100.00%)_Space_51.2_MB_(88.05%) /** * @param {number[]} height diff --git a/src/main/js/g0001_0100/s0045_jump_game_ii/solution.js b/src/main/js/g0001_0100/s0045_jump_game_ii/solution.js index 12c0a344..99d7351b 100644 --- a/src/main/js/g0001_0100/s0045_jump_game_ii/solution.js +++ b/src/main/js/g0001_0100/s0045_jump_game_ii/solution.js @@ -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_12_08_Time_0_ms_(100.00%)_Space_51.5_MB_(23.51%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_12_08_Time_0_ms_(100.00%)_Space_51.5_MB_(23.51%) /** * @param {number[]} nums diff --git a/src/main/js/g0001_0100/s0046_permutations/solution.js b/src/main/js/g0001_0100/s0046_permutations/solution.js index 7e4261b5..f4ec190f 100644 --- a/src/main/js/g0001_0100/s0046_permutations/solution.js +++ b/src/main/js/g0001_0100/s0046_permutations/solution.js @@ -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_12_08_Time_0_ms_(100.00%)_Space_54.2_MB_(26.23%) /** diff --git a/src/main/js/g0001_0100/s0048_rotate_image/solution.js b/src/main/js/g0001_0100/s0048_rotate_image/solution.js index 19cb611d..2e51091f 100644 --- a/src/main/js/g0001_0100/s0048_rotate_image/solution.js +++ b/src/main/js/g0001_0100/s0048_rotate_image/solution.js @@ -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_12_09_Time_0_ms_(100.00%)_Space_51.6_MB_(12.89%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_12_09_Time_0_ms_(100.00%)_Space_51.6_MB_(12.89%) /** * @param {number[][]} matrix diff --git a/src/main/js/g0001_0100/s0049_group_anagrams/solution.js b/src/main/js/g0001_0100/s0049_group_anagrams/solution.js index b37726f4..0cd8c064 100644 --- a/src/main/js/g0001_0100/s0049_group_anagrams/solution.js +++ b/src/main/js/g0001_0100/s0049_group_anagrams/solution.js @@ -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_12_09_Time_24_ms_(91.62%)_Space_64.4_MB_(18.40%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_12_09_Time_24_ms_(91.62%)_Space_64.4_MB_(18.40%) /** * @param {string[]} strs diff --git a/src/main/js/g0001_0100/s0053_maximum_subarray/solution.js b/src/main/js/g0001_0100/s0053_maximum_subarray/solution.js index 41a9c367..6ca881fc 100644 --- a/src/main/js/g0001_0100/s0053_maximum_subarray/solution.js +++ b/src/main/js/g0001_0100/s0053_maximum_subarray/solution.js @@ -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_12_09_Time_1_ms_(85.69%)_Space_59.1_MB_(13.72%) /** diff --git a/src/main/js/g0001_0100/s0055_jump_game/solution.js b/src/main/js/g0001_0100/s0055_jump_game/solution.js index e48c08c8..dcfa649f 100644 --- a/src/main/js/g0001_0100/s0055_jump_game/solution.js +++ b/src/main/js/g0001_0100/s0055_jump_game/solution.js @@ -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_12_09_Time_0_ms_(100.00%)_Space_53.2_MB_(74.50%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_12_09_Time_0_ms_(100.00%)_Space_53.2_MB_(74.50%) /** * @param {number[]} nums diff --git a/src/main/js/g0001_0100/s0056_merge_intervals/solution.js b/src/main/js/g0001_0100/s0056_merge_intervals/solution.js index c998c40c..82b1c2c6 100644 --- a/src/main/js/g0001_0100/s0056_merge_intervals/solution.js +++ b/src/main/js/g0001_0100/s0056_merge_intervals/solution.js @@ -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_12_10_Time_7_ms_(81.68%)_Space_59.2_MB_(41.78%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_12_10_Time_7_ms_(81.68%)_Space_59.2_MB_(41.78%) /** * @param {number[][]} intervals diff --git a/src/main/js/g0001_0100/s0062_unique_paths/solution.js b/src/main/js/g0001_0100/s0062_unique_paths/solution.js index cf95298d..b98fbec1 100644 --- a/src/main/js/g0001_0100/s0062_unique_paths/solution.js +++ b/src/main/js/g0001_0100/s0062_unique_paths/solution.js @@ -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_12_10_Time_0_ms_(100.00%)_Space_49.1_MB_(57.14%) +// #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_12_10_Time_0_ms_(100.00%)_Space_49.1_MB_(57.14%) /** * @param {number} m diff --git a/src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js b/src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js index 588e724d..14687ede 100644 --- a/src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js +++ b/src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js @@ -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_12_10_Time_3_ms_(83.07%)_Space_51.2_MB_(74.79%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_12_10_Time_3_ms_(83.07%)_Space_51.2_MB_(74.79%) /** * @param {number[][]} grid diff --git a/src/main/js/g0001_0100/s0070_climbing_stairs/solution.js b/src/main/js/g0001_0100/s0070_climbing_stairs/solution.js index adc619c2..65f03dcd 100644 --- a/src/main/js/g0001_0100/s0070_climbing_stairs/solution.js +++ b/src/main/js/g0001_0100/s0070_climbing_stairs/solution.js @@ -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_12_10_Time_0_ms_(100.00%)_Space_49_MB_(22.45%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_12_10_Time_0_ms_(100.00%)_Space_49_MB_(22.45%) /** * @param {number} n diff --git a/src/main/js/g0001_0100/s0072_edit_distance/solution.js b/src/main/js/g0001_0100/s0072_edit_distance/solution.js index 8786b9ca..367cd4da 100644 --- a/src/main/js/g0001_0100/s0072_edit_distance/solution.js +++ b/src/main/js/g0001_0100/s0072_edit_distance/solution.js @@ -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_12_10_Time_5_ms_(99.01%)_Space_54.5_MB_(81.30%) /** diff --git a/src/main/js/g0001_0100/s0073_set_matrix_zeroes/solution.js b/src/main/js/g0001_0100/s0073_set_matrix_zeroes/solution.js index 51195255..b6cb7967 100644 --- a/src/main/js/g0001_0100/s0073_set_matrix_zeroes/solution.js +++ b/src/main/js/g0001_0100/s0073_set_matrix_zeroes/solution.js @@ -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_12_11_Time_0_ms_(100.00%)_Space_54_MB_(33.87%) /** diff --git a/src/main/js/g0001_0100/s0074_search_a_2d_matrix/solution.js b/src/main/js/g0001_0100/s0074_search_a_2d_matrix/solution.js index e7b91e47..17062021 100644 --- a/src/main/js/g0001_0100/s0074_search_a_2d_matrix/solution.js +++ b/src/main/js/g0001_0100/s0074_search_a_2d_matrix/solution.js @@ -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_12_11_Time_0_ms_(100.00%)_Space_49.1_MB_(63.49%) /** diff --git a/src/main/js/g0001_0100/s0076_minimum_window_substring/solution.js b/src/main/js/g0001_0100/s0076_minimum_window_substring/solution.js index aa804c82..167d06c7 100644 --- a/src/main/js/g0001_0100/s0076_minimum_window_substring/solution.js +++ b/src/main/js/g0001_0100/s0076_minimum_window_substring/solution.js @@ -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_12_11_Time_4_ms_(99.86%)_Space_51.7_MB_(98.27%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_12_11_Time_4_ms_(99.86%)_Space_51.7_MB_(98.27%) /** * @param {string} s diff --git a/src/main/js/g0001_0100/s0079_word_search/solution.js b/src/main/js/g0001_0100/s0079_word_search/solution.js index 7dd30503..ad7b4038 100644 --- a/src/main/js/g0001_0100/s0079_word_search/solution.js +++ b/src/main/js/g0001_0100/s0079_word_search/solution.js @@ -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_12_12_Time_292_ms_(83.26%)_Space_49.6_MB_(62.55%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_12_12_Time_292_ms_(83.26%)_Space_49.6_MB_(62.55%) /** * @param {character[][]} board diff --git a/src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js b/src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js index 2817f011..12d19619 100644 --- a/src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js +++ b/src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js @@ -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_12_12_Time_0_ms_(100.00%)_Space_53.7_MB_(22.50%) /** diff --git a/src/main/js/g0101_0200/s0101_symmetric_tree/solution.js b/src/main/js/g0101_0200/s0101_symmetric_tree/solution.js index 1081082e..4643cdde 100644 --- a/src/main/js/g0101_0200/s0101_symmetric_tree/solution.js +++ b/src/main/js/g0101_0200/s0101_symmetric_tree/solution.js @@ -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)) +// #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)) // #2024_12_12_Time_0_ms_(100.00%)_Space_53.7_MB_(22.50%) /** diff --git a/src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js b/src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js index 508357a0..641734aa 100644 --- a/src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js +++ b/src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js @@ -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_12_13_Time_1_ms_(87.97%)_Space_54.7_MB_(69.27%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_12_13_Time_1_ms_(87.97%)_Space_54.7_MB_(69.27%) /** * Definition for a binary tree node. diff --git a/src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js b/src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js index cdb35415..eb9b04c8 100644 --- a/src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js +++ b/src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js @@ -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_12_13_Time_0_ms_(100.00%)_Space_52.6_MB_(22.16%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_12_13_Time_0_ms_(100.00%)_Space_52.6_MB_(22.16%) /** * Definition for a binary tree node. diff --git a/src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.js b/src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.js index 21814647..b32c6c32 100644 --- a/src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.js +++ b/src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.js @@ -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_12_13_Time_1_ms_(98.60%)_Space_53.9_MB_(86.87%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_12_13_Time_1_ms_(98.60%)_Space_53.9_MB_(86.87%) import { TreeNode } from '../../com_github_leetcode/treenode'; diff --git a/src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js b/src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js index 8cf9f371..eb55643d 100644 --- a/src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js +++ b/src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js @@ -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_12_13_Time_0_ms_(100.00%)_Space_52.4_MB_(70.97%) /** diff --git a/src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js b/src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js index dbcb97dd..fb3ce60d 100644 --- a/src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js +++ b/src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js @@ -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_12_15_Time_1_ms_(97.34%)_Space_59.1_MB_(51.64%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_12_15_Time_1_ms_(97.34%)_Space_59.1_MB_(51.64%) /** * @param {number[]} prices diff --git a/src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js b/src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js index a5d89146..9306e468 100644 --- a/src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js +++ b/src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js @@ -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_12_15_Time_1_ms_(98.34%)_Space_59.8_MB_(12.47%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_12_15_Time_1_ms_(98.34%)_Space_59.8_MB_(12.47%) /** * Definition for a binary tree node. diff --git a/src/main/js/g0101_0200/s0128_longest_consecutive_sequence/solution.js b/src/main/js/g0101_0200/s0128_longest_consecutive_sequence/solution.js index 3fd4e29b..35e0be7a 100644 --- a/src/main/js/g0101_0200/s0128_longest_consecutive_sequence/solution.js +++ b/src/main/js/g0101_0200/s0128_longest_consecutive_sequence/solution.js @@ -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_12_15_Time_31_ms_(93.87%)_Space_59_MB_(96.32%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_12_15_Time_31_ms_(93.87%)_Space_59_MB_(96.32%) /** * @param {number[]} nums diff --git a/src/main/js/g0101_0200/s0136_single_number/solution.js b/src/main/js/g0101_0200/s0136_single_number/solution.js index 419c3835..79a1117a 100644 --- a/src/main/js/g0101_0200/s0136_single_number/solution.js +++ b/src/main/js/g0101_0200/s0136_single_number/solution.js @@ -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_12_15_Time_0_ms_(100.00%)_Space_52.3_MB_(38.50%) /** diff --git a/src/main/js/g0101_0200/s0138_copy_list_with_random_pointer/solution.js b/src/main/js/g0101_0200/s0138_copy_list_with_random_pointer/solution.js index 244b3d30..ac88f59c 100644 --- a/src/main/js/g0101_0200/s0138_copy_list_with_random_pointer/solution.js +++ b/src/main/js/g0101_0200/s0138_copy_list_with_random_pointer/solution.js @@ -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_12_15_Time_43_ms_(97.07%)_Space_51.1_MB_(34.27%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2024_12_15_Time_43_ms_(97.07%)_Space_51.1_MB_(34.27%) import { Node } from '../../com_github_leetcode/node' diff --git a/src/main/js/g0101_0200/s0139_word_break/solution.js b/src/main/js/g0101_0200/s0139_word_break/solution.js index 45005a44..683bac09 100644 --- a/src/main/js/g0101_0200/s0139_word_break/solution.js +++ b/src/main/js/g0101_0200/s0139_word_break/solution.js @@ -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_12_15_Time_0_ms_(100.00%)_Space_51.5_MB_(44.49%) +// #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_12_15_Time_0_ms_(100.00%)_Space_51.5_MB_(44.49%) /** * @param {string} s diff --git a/src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js b/src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js index 16b26b0f..2e09065f 100644 --- a/src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js +++ b/src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js @@ -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_12_15_Time_49_ms_(99.06%)_Space_53_MB_(64.12%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2024_12_15_Time_49_ms_(99.06%)_Space_53_MB_(64.12%) /** * Definition for singly-linked list. diff --git a/src/main/js/g0101_0200/s0146_lru_cache/solution.js b/src/main/js/g0101_0200/s0146_lru_cache/solution.js index d81881de..8206fc66 100644 --- a/src/main/js/g0101_0200/s0146_lru_cache/solution.js +++ b/src/main/js/g0101_0200/s0146_lru_cache/solution.js @@ -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_12_15_Time_91_ms_(96.82%)_Space_105.3_MB_(70.46%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_12_15_Time_91_ms_(96.82%)_Space_105.3_MB_(70.46%) /** * @param {number} capacity diff --git a/src/main/js/g0101_0200/s0148_sort_list/solution.js b/src/main/js/g0101_0200/s0148_sort_list/solution.js index aee8eaac..51a58cf6 100644 --- a/src/main/js/g0101_0200/s0148_sort_list/solution.js +++ b/src/main/js/g0101_0200/s0148_sort_list/solution.js @@ -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_12_16_Time_17_ms_(93.53%)_Space_72.5_MB_(66.21%) +// #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_12_16_Time_17_ms_(93.53%)_Space_72.5_MB_(66.21%) /** * Definition for singly-linked list. diff --git a/src/main/js/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.js b/src/main/js/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.js index 17da2d9a..25b8482d 100644 --- a/src/main/js/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.js +++ b/src/main/js/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.js @@ -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_12_16_Time_0_ms_(100.00%)_Space_48.6_MB_(91.77%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_12_16_Time_0_ms_(100.00%)_Space_48.6_MB_(91.77%) /** * @param {number[]} nums diff --git a/src/main/js/g0101_0200/s0155_min_stack/solution.js b/src/main/js/g0101_0200/s0155_min_stack/solution.js index 5a6f00e8..922ef19a 100644 --- a/src/main/js/g0101_0200/s0155_min_stack/solution.js +++ b/src/main/js/g0101_0200/s0155_min_stack/solution.js @@ -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_12_16_Time_6_ms_(99.32%)_Space_60.1_MB_(41.88%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2024_12_16_Time_6_ms_(99.32%)_Space_60.1_MB_(41.88%) var MinStack = function () { this.stack = [] diff --git a/src/main/js/g0101_0200/s0169_majority_element/solution.js b/src/main/js/g0101_0200/s0169_majority_element/solution.js index 6e3a160e..2b9c6245 100644 --- a/src/main/js/g0101_0200/s0169_majority_element/solution.js +++ b/src/main/js/g0101_0200/s0169_majority_element/solution.js @@ -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_12_17_Time_0_ms_(100.00%)_Space_51.8_MB_(69.63%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_12_17_Time_0_ms_(100.00%)_Space_51.8_MB_(69.63%) /** * @param {number[]} nums diff --git a/src/main/js/g0101_0200/s0189_rotate_array/solution.js b/src/main/js/g0101_0200/s0189_rotate_array/solution.js index 68d5c9f9..b3aab46d 100644 --- a/src/main/js/g0101_0200/s0189_rotate_array/solution.js +++ b/src/main/js/g0101_0200/s0189_rotate_array/solution.js @@ -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_12_17_Time_0_ms_(100.00%)_Space_60.8_MB_(38.22%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_12_17_Time_0_ms_(100.00%)_Space_60.8_MB_(38.22%) /** * @param {number[]} nums diff --git a/src/main/js/g0101_0200/s0198_house_robber/solution.js b/src/main/js/g0101_0200/s0198_house_robber/solution.js index 345cbdbb..dc73b4e2 100644 --- a/src/main/js/g0101_0200/s0198_house_robber/solution.js +++ b/src/main/js/g0101_0200/s0198_house_robber/solution.js @@ -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_12_17_Time_0_ms_(100.00%)_Space_49_MB_(33.76%) +// #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_12_17_Time_0_ms_(100.00%)_Space_49_MB_(33.76%) /** * @param {number[]} nums diff --git a/src/main/js/g0101_0200/s0200_number_of_islands/solution.js b/src/main/js/g0101_0200/s0200_number_of_islands/solution.js index 94dffe42..c3cc6c56 100644 --- a/src/main/js/g0101_0200/s0200_number_of_islands/solution.js +++ b/src/main/js/g0101_0200/s0200_number_of_islands/solution.js @@ -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_12_17_Time_62_ms_(90.80%)_Space_52.5_MB_(66.24%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_12_17_Time_62_ms_(90.80%)_Space_52.5_MB_(66.24%) /** * @param {character[][]} grid diff --git a/src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js b/src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js index cba4e621..122e6d38 100644 --- a/src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js +++ b/src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js @@ -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_12_17_Time_0_ms_(100.00%)_Space_51.5_MB_(86.35%) +// #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_12_17_Time_0_ms_(100.00%)_Space_51.5_MB_(86.35%) /** * Definition for singly-linked list. diff --git a/src/main/js/g0201_0300/s0207_course_schedule/solution.js b/src/main/js/g0201_0300/s0207_course_schedule/solution.js index 17136dd6..1f14be03 100644 --- a/src/main/js/g0201_0300/s0207_course_schedule/solution.js +++ b/src/main/js/g0201_0300/s0207_course_schedule/solution.js @@ -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_12_17_Time_6_ms_(95.35%)_Space_57_MB_(39.46%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_12_17_Time_6_ms_(95.35%)_Space_57_MB_(39.46%) /** * @param {number} numCourses diff --git a/src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js b/src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js index 9f5a6b99..8d4be286 100644 --- a/src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js +++ b/src/main/js/g0201_0300/s0208_implement_trie_prefix_tree/solution.js @@ -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_12_17_Time_39_ms_(93.97%)_Space_66.4_MB_(88.79%) diff --git a/src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js b/src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js index e746f6f8..6a60e3ce 100644 --- a/src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js +++ b/src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js @@ -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_12_18_Time_9_ms_(97.67%)_Space_59.2_MB_(71.97%) /** diff --git a/src/main/js/g0201_0300/s0221_maximal_square/solution.js b/src/main/js/g0201_0300/s0221_maximal_square/solution.js index 613ca2b1..ff1802e6 100644 --- a/src/main/js/g0201_0300/s0221_maximal_square/solution.js +++ b/src/main/js/g0201_0300/s0221_maximal_square/solution.js @@ -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_12_17_Time_12_ms_(87.32%)_Space_58.1_MB_(64.73%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_12_17_Time_12_ms_(87.32%)_Space_58.1_MB_(64.73%) /** * @param {character[][]} mArr diff --git a/src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js b/src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js index 80ef0128..11967811 100644 --- a/src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js +++ b/src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js @@ -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_12_17_Time_0_ms_(100.00%)_Space_49.4_MB_(64.65%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_12_17_Time_0_ms_(100.00%)_Space_49.4_MB_(64.65%) /** * Definition for a binary tree node. diff --git a/src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js b/src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js index f49d6dc3..5b8c319b 100644 --- a/src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js +++ b/src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js @@ -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_12_21_Time_0_ms_(100.00%)_Space_55.4_MB_(48.16%) /** diff --git a/src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js b/src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js index c95c43f6..76cb843f 100644 --- a/src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js +++ b/src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js @@ -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_12_21_Time_53_ms_(98.59%)_Space_58.7_MB_(88.33%) /** diff --git a/src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js b/src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js index e7abf0dd..f88051b0 100644 --- a/src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js +++ b/src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js @@ -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_12_21_Time_3_ms_(93.60%)_Space_64.9_MB_(45.67%) /** diff --git a/src/main/js/g0201_0300/s0283_move_zeroes/solution.js b/src/main/js/g0201_0300/s0283_move_zeroes/solution.js index d96ef5eb..50091b6e 100644 --- a/src/main/js/g0201_0300/s0283_move_zeroes/solution.js +++ b/src/main/js/g0201_0300/s0283_move_zeroes/solution.js @@ -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_12_21_Time_0_ms_(100.00%)_Space_54.1_MB_(63.69%) +// #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_12_21_Time_0_ms_(100.00%)_Space_54.1_MB_(63.69%) /** * @param {number[]} nums diff --git a/src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js b/src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js index 6ce2c299..430b2f91 100644 --- a/src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js +++ b/src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js @@ -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_12_21_Time_134_ms_(76.00%)_Space_83.2_MB_(52.42%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_12_21_Time_134_ms_(76.00%)_Space_83.2_MB_(52.42%) var MedianFinder = function () { this.large = new Heap(); diff --git a/src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js b/src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js index 5a5dfdd8..67016438 100644 --- a/src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js +++ b/src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js @@ -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_12_21_Time_4_ms_(93.09%)_Space_51.3_MB_(34.72%) /** diff --git a/src/main/js/g0301_0400/s0322_coin_change/solution.js b/src/main/js/g0301_0400/s0322_coin_change/solution.js index ffe34b5e..295224a2 100644 --- a/src/main/js/g0301_0400/s0322_coin_change/solution.js +++ b/src/main/js/g0301_0400/s0322_coin_change/solution.js @@ -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_12_22_Time_26_ms_(95.33%)_Space_54.1_MB_(79.36%) /** diff --git a/src/main/js/g0301_0400/s0338_counting_bits/solution.js b/src/main/js/g0301_0400/s0338_counting_bits/solution.js index 0c847fd7..33aa2cc4 100644 --- a/src/main/js/g0301_0400/s0338_counting_bits/solution.js +++ b/src/main/js/g0301_0400/s0338_counting_bits/solution.js @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_12_22_Time_0_ms_(100.00%)_Space_57_MB_(33.09%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_12_22_Time_0_ms_(100.00%)_Space_57_MB_(33.09%) /** * @param {number} n diff --git a/src/main/js/g0301_0400/s0394_decode_string/solution.js b/src/main/js/g0301_0400/s0394_decode_string/solution.js index 6856885f..37972dfe 100644 --- a/src/main/js/g0301_0400/s0394_decode_string/solution.js +++ b/src/main/js/g0301_0400/s0394_decode_string/solution.js @@ -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_12_22_Time_0_ms_(100.00%)_Space_49.4_MB_(10.78%) +// #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_12_22_Time_0_ms_(100.00%)_Space_49.4_MB_(10.78%) /** * @param {string} s diff --git a/src/main/js/g0401_0500/s0437_path_sum_iii/solution.js b/src/main/js/g0401_0500/s0437_path_sum_iii/solution.js index e441c70d..506aade7 100644 --- a/src/main/js/g0401_0500/s0437_path_sum_iii/solution.js +++ b/src/main/js/g0401_0500/s0437_path_sum_iii/solution.js @@ -1,4 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #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_12_22_Time_2_ms_(97.05%)_Space_53.5_MB_(88.05%) /** diff --git a/src/main/js/g0701_0800/s0739_daily_temperatures/solution.js b/src/main/js/g0701_0800/s0739_daily_temperatures/solution.js index 42ae761c..42263bed 100644 --- a/src/main/js/g0701_0800/s0739_daily_temperatures/solution.js +++ b/src/main/js/g0701_0800/s0739_daily_temperatures/solution.js @@ -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_12_24_Time_9_ms_(99.89%)_Space_75.6_MB_(27.87%) +// #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_12_24_Time_9_ms_(99.89%)_Space_75.6_MB_(27.87%) /** * @param {number[]} temperatures diff --git a/src/main/js/g0701_0800/s0763_partition_labels/solution.js b/src/main/js/g0701_0800/s0763_partition_labels/solution.js index 6f17563d..7d43034d 100644 --- a/src/main/js/g0701_0800/s0763_partition_labels/solution.js +++ b/src/main/js/g0701_0800/s0763_partition_labels/solution.js @@ -1,5 +1,6 @@ -// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String -// #Big_O_Time_O(n)_Space_O(1) #2024_12_24_Time_3_ms_(94.02%)_Space_52.1_MB_(22.51%) +// #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_12_24_Time_3_ms_(94.02%)_Space_52.1_MB_(22.51%) /** * @param {string} s diff --git a/src/main/js/g1101_1200/s1143_longest_common_subsequence/solution.js b/src/main/js/g1101_1200/s1143_longest_common_subsequence/solution.js index 26e219f8..d5665fd6 100644 --- a/src/main/js/g1101_1200/s1143_longest_common_subsequence/solution.js +++ b/src/main/js/g1101_1200/s1143_longest_common_subsequence/solution.js @@ -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_12_24_Time_28_ms_(90.92%)_Space_56_MB_(89.99%) diff --git a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt index bd87acd7..3df09309 100644 --- a/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0001_two_sum/Solution.kt @@ -3,11 +3,11 @@ package 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 #Top_Interview_150_Hashmap // #Big_O_Time_O(n)_Space_O(n) #AI_can_be_used_to_solve_the_task -// #2023_07_03_Time_202_ms_(91.18%)_Space_38.1_MB_(76.07%) +// #2025_07_11_Time_2_ms_(98.77%)_Space_48.00_MB_(52.59%) class Solution { fun twoSum(numbers: IntArray, target: Int): IntArray { - val indexMap: MutableMap = HashMap() + val indexMap = HashMap() for (i in numbers.indices) { val requiredNum = target - numbers[i] if (indexMap.containsKey(requiredNum)) { diff --git a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt index ad1ca0c5..4df6e669 100644 --- a/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0002_add_two_numbers/Solution.kt @@ -3,7 +3,7 @@ package 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 // #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_07_03_Time_203_ms_(96.13%)_Space_41_MB_(77.03%) +// #AI_can_be_used_to_solve_the_task #2025_07_11_Time_2_ms_(87.63%)_Space_45.71_MB_(80.15%) import com_github_leetcode.ListNode diff --git a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt index e84071a4..8f30beff 100644 --- a/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.kt @@ -3,30 +3,29 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters // #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 // #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task -// #2023_07_03_Time_201_ms_(87.28%)_Space_38.3_MB_(60.85%) +// #2025_07_11_Time_3_ms_(99.17%)_Space_46.05_MB_(66.40%) class Solution { fun lengthOfLongestSubstring(s: String): Int { - var i = 0 - var j = 0 - var longest = 0 - // 1. if string empty, return 0 - if (s.isEmpty()) { - return 0 - } - while (j < s.length) { - // 2. if the char at index j already seen, update the longest if needs - if (i != j && s.substring(i, j).indexOf(s[j]) > -1) { - longest = Math.max(j - i, longest) - i++ + val lastIndices = IntArray(256) { -1 } + var maxLen = 0 + var curLen = 0 + var start = 0 + for (i in s.indices) { + val cur = s[i] + if (lastIndices[cur.code] < start) { + lastIndices[cur.code] = i + curLen++ } else { - // 3. j out of bound already, update longest - if (++j == s.length) { - longest = Math.max(s.length - i, longest) - break - } + val lastIndex = lastIndices[cur.code] + start = lastIndex + 1 + curLen = i - start + 1 + lastIndices[cur.code] = i + } + if (curLen > maxLen) { + maxLen = curLen } } - return longest + return maxLen } } diff --git a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt index 06d87954..e43c2e39 100644 --- a/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.kt @@ -2,25 +2,39 @@ package g0001_0100.s0004_median_of_two_sorted_arrays // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Divide_and_Conquer // #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_07_03_Time_293_ms_(75.96%)_Space_47.5_MB_(64.85%) +// #AI_can_be_used_to_solve_the_task #2025_07_11_Time_2_ms_(99.23%)_Space_51.04_MB_(73.69%) + +import kotlin.math.max +import kotlin.math.min class Solution { fun findMedianSortedArrays(nums1: IntArray, nums2: IntArray): Double { - val l: MutableList = ArrayList() - val f: Double - for (j in nums1) { - l.add(j) - } - for (i in nums2) { - l.add(i) + if (nums2.size < nums1.size) { + return findMedianSortedArrays(nums2, nums1) } - l.sort() - val k = l.size - f = if (k % 2 == 0) { - (l[k / 2 - 1] + l[k / 2]).toDouble() / 2 - } else { - l[(k + 1) / 2 - 1].toDouble() + val n1 = nums1.size + val n2 = nums2.size + var low = 0 + var high = n1 + while (low <= high) { + val cut1 = (low + high) / 2 + val cut2 = ((n1 + n2 + 1) / 2) - cut1 + val l1 = if (cut1 == 0) Int.MIN_VALUE else nums1[cut1 - 1] + val l2 = if (cut2 == 0) Int.MIN_VALUE else nums2[cut2 - 1] + val r1 = if (cut1 == n1) Int.MAX_VALUE else nums1[cut1] + val r2 = if (cut2 == n2) Int.MAX_VALUE else nums2[cut2] + if (l1 <= r2 && l2 <= r1) { + return if ((n1 + n2) % 2 == 0) { + (max(l1, l2).toDouble() + min(r1, r2).toDouble()) / 2.0 + } else { + max(l1, l2).toDouble() + } + } else if (l1 > r2) { + high = cut1 - 1 + } else { + low = cut1 + 1 + } } - return f + return 0.0 } } diff --git a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt index 76a5fc17..12f3703b 100644 --- a/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0005_longest_palindromic_substring/Solution.kt @@ -3,7 +3,7 @@ package 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 #Top_Interview_150_Multidimensional_DP -// #Big_O_Time_O(n)_Space_O(n) #2023_07_03_Time_162_ms_(99.00%)_Space_36.6_MB_(79.10%) +// #Big_O_Time_O(n)_Space_O(n) #2025_07_11_Time_8_ms_(96.61%)_Space_43.12_MB_(69.70%) class Solution { fun longestPalindrome(s: String): String { diff --git a/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt b/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt index 3e080d10..d60d6804 100644 --- a/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0006_zigzag_conversion/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0006_zigzag_conversion -// #Medium #String #Top_Interview_150_Array/String +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) // #2023_07_03_Time_200_ms_(97.79%)_Space_37.3_MB_(91.71%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt b/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt index db280185..a9e5a7da 100644 --- a/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0007_reverse_integer/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0007_reverse_integer -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2023_07_03_Time_149_ms_(77.89%)_Space_33.5_MB_(84.42%) class Solution { diff --git a/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt b/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt index 9cf2d12f..0aa849bc 100644 --- a/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0008_string_to_integer_atoi/Solution.kt @@ -1,6 +1,7 @@ package g0001_0100.s0008_string_to_integer_atoi -// #Medium #Top_Interview_Questions #String #2023_07_03_Time_172_ms_(82.90%)_Space_34.9_MB_(88.08%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2023_07_03_Time_172_ms_(82.90%)_Space_34.9_MB_(88.08%) class Solution { fun myAtoi(str: String): Int { diff --git a/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt b/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt index ed6f39fe..f77297ce 100644 --- a/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt +++ b/src/main/kotlin/g0001_0100/s0009_palindrome_number/Solution.kt @@ -1,6 +1,6 @@ package g0001_0100.s0009_palindrome_number -// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) // #2023_07_03_Time_217_ms_(95.34%)_Space_36.1_MB_(98.21%) class Solution { 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/s0138_copy_list_with_random_pointer/Solution.kt b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt index 70b4013e..34b196ff 100644 --- a/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt +++ b/src/main/kotlin/g0101_0200/s0138_copy_list_with_random_pointer/Solution.kt @@ -2,7 +2,7 @@ package 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) #2022_09_03_Time_274_ms_(80.58%)_Space_40.5_MB_(58.99%) +// #Big_O_Time_O(N)_Space_O(N) #2025_07_04_Time_123_ms_(90.70%)_Space_43.99_MB_(97.67%) import com_github_leetcode.random.Node @@ -18,48 +18,19 @@ import com_github_leetcode.random.Node */ class Solution { fun copyRandomList(head: Node?): Node? { - if (head == null) { - return null + val hashMap: MutableMap = HashMap() + var cur = head + while (cur != null) { + hashMap.put(cur, Node(cur.`val`)) + cur = cur.next } - // first pass to have a clone node point to the next node. ie A->B becomes A->clonedNode->B - var curr: Node? = head - while (curr != null) { - val clonedNode = Node(curr.`val`) - clonedNode.next = curr.next - curr.next = clonedNode - curr = clonedNode.next + cur = head + while (cur != null) { + val copy: Node = hashMap[cur]!! + copy.next = hashMap[cur.next] + copy.random = hashMap[cur.random] + cur = cur.next } - curr = head - // second pass to make the cloned node's random pointer point to the orginal node's randome - // pointer. - // ie. A's random pointer becomes ClonedNode's random pointer - while (curr != null) { - if (curr.random != null) { - curr.next?.random = curr.random!!.next - } else { - curr.next?.random = null - } - curr = curr.next?.next - } - curr = head - // third pass to restore the links and return the head of the cloned nodes' list. - var newHead: Node? = null - while (curr != null) { - var clonedNode: Node - if (newHead == null) { - clonedNode = curr.next!! - newHead = clonedNode - } else { - clonedNode = curr.next!! - } - curr.next = clonedNode.next - if (curr.next != null) { - clonedNode.next = curr.next!!.next - } else { - clonedNode.next = null - } - curr = curr.next - } - return newHead + return hashMap[head] } } 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..fdf6616a 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,6 +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) +// #Medium #Top_100_Liked_Questions #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/g0701_0800/s0763_partition_labels/Solution.kt b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt index c4f9e958..02137f7e 100644 --- a/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt +++ b/src/main/kotlin/g0701_0800/s0763_partition_labels/Solution.kt @@ -1,7 +1,8 @@ package 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) #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%) +// #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) +// #2022_09_13_Time_235_ms_(84.75%)_Space_35.2_MB_(91.53%) class Solution { fun partitionLabels(s: String): List { 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..788b0ee3 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 #Big_O_Time_O(n)_Space_O(n) +// #2023_12_03_Time_12_ms_(80.63%)_Space_19.3_MB_(57.66%) class Solution { /** diff --git a/src/main/php/g0001_0100/s0007_reverse_integer/Solution.php b/src/main/php/g0001_0100/s0007_reverse_integer/Solution.php index bbe34558..fee687bd 100644 --- a/src/main/php/g0001_0100/s0007_reverse_integer/Solution.php +++ b/src/main/php/g0001_0100/s0007_reverse_integer/Solution.php @@ -2,7 +2,7 @@ namespace leetcode\g0001_0100\s0007_reverse_integer; -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2023_12_03_Time_3_ms_(90.99%)_Space_19.2_MB_(44.23%) class Solution { diff --git a/src/main/php/g0001_0100/s0008_string_to_integer_atoi/Solution.php b/src/main/php/g0001_0100/s0008_string_to_integer_atoi/Solution.php index 7212b5e4..5a654979 100644 --- a/src/main/php/g0001_0100/s0008_string_to_integer_atoi/Solution.php +++ b/src/main/php/g0001_0100/s0008_string_to_integer_atoi/Solution.php @@ -2,7 +2,8 @@ namespace leetcode\g0001_0100\s0008_string_to_integer_atoi; -// #Medium #Top_Interview_Questions #String #2023_12_03_Time_3_ms_(93.18%)_Space_19.1_MB_(36.36%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2023_12_03_Time_3_ms_(93.18%)_Space_19.1_MB_(36.36%) 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..f94fcf6b 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 #Big_O_Time_O(log10(x))_Space_O(1) +// #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..68331992 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,8 +2,9 @@ namespace leetcode\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) #2023_12_24_Time_11_ms_(100.00%)_Space_20.7_MB_(12.50%) +// #Medium #Top_100_Liked_Questions #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%) /** * Definition for a binary tree node. 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/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/Solution0001.py similarity index 72% rename from src/main/python/g0001_0100/s0001_two_sum/Solution.py rename to src/main/python/g0001_0100/s0001_two_sum/Solution0001.py index f6843fbf..3cec7599 100644 --- a/src/main/python/g0001_0100/s0001_two_sum/Solution.py +++ b/src/main/python/g0001_0100/s0001_two_sum/Solution0001.py @@ -1,6 +1,9 @@ # #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) -# #2024_06_06_Time_62_ms_(53.52%)_Space_17.8_MB_(37.79%) +# #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_07_06_Time_0_ms_(100.00%)_Space_19.05_MB_(23.85%) + +from typing import List class Solution: def twoSum(self, numbers: List[int], target: int) -> List[int]: diff --git a/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py b/src/main/python/g0001_0100/s0002_add_two_numbers/Solution0002.py similarity index 77% rename from src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py rename to src/main/python/g0001_0100/s0002_add_two_numbers/Solution0002.py index f96ac8ba..4f661e39 100644 --- a/src/main/python/g0001_0100/s0002_add_two_numbers/Solution.py +++ b/src/main/python/g0001_0100/s0002_add_two_numbers/Solution0002.py @@ -1,6 +1,14 @@ # #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 #2025_07_22_Time_0_ms_(100.00%)_Space_17.84_MB_(56.69%) + +from typing import Optional + +class ListNode: + def __init__(self, val=0, next=None): + self.val = val + self.next = next # 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/Solution0003.py similarity index 83% rename from src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.py rename to src/main/python/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution0003.py index 05159e70..1bebda58 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/Solution0003.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 +# #2025_07_22_Time_9_ms_(97.01%)_Space_17.98_MB_(34.00%) 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/Solution0004.py similarity index 84% rename from src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.py rename to src/main/python/g0001_0100/s0004_median_of_two_sorted_arrays/Solution0004.py index dabed05b..ef7858fd 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/Solution0004.py @@ -1,5 +1,8 @@ # #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 #2025_07_22_Time_3_ms_(51.31%)_Space_18.28_MB_(18.81%) + +from typing import List 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/Solution0005.py similarity index 87% rename from src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py rename to src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution0005.py index b58972c7..353d4a4b 100644 --- a/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution.py +++ b/src/main/python/g0001_0100/s0005_longest_palindromic_substring/Solution0005.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) #2025_07_22_Time_47_ms_(97.38%)_Space_17.90_MB_(59.55%) 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/Solution0006.py similarity index 84% rename from src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py rename to src/main/python/g0001_0100/s0006_zigzag_conversion/Solution0006.py index e1f35a0e..04e559a7 100644 --- a/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution.py +++ b/src/main/python/g0001_0100/s0006_zigzag_conversion/Solution0006.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 #Big_O_Time_O(n)_Space_O(n) +# #2025_07_22_Time_5_ms_(93.09%)_Space_17.85_MB_(70.00%) class Solution: def convert(self, s: str, numRows: int) -> str: diff --git a/src/main/python/g0001_0100/s0007_reverse_integer/Solution.py b/src/main/python/g0001_0100/s0007_reverse_integer/Solution0007.py similarity index 67% rename from src/main/python/g0001_0100/s0007_reverse_integer/Solution.py rename to src/main/python/g0001_0100/s0007_reverse_integer/Solution0007.py index f92f486d..53710fba 100644 --- a/src/main/python/g0001_0100/s0007_reverse_integer/Solution.py +++ b/src/main/python/g0001_0100/s0007_reverse_integer/Solution0007.py @@ -1,5 +1,5 @@ -# #Medium #Top_Interview_Questions #Math #Udemy_Integers -# #2024_06_03_Time_28_ms_(94.06%)_Space_16.5_MB_(93.17%) +# #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) +# #2025_07_22_Time_37_ms_(69.51%)_Space_17.70_MB_(57.22%) class Solution: def reverse(self, x: int) -> int: diff --git a/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py b/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution0008.py similarity index 83% rename from src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py rename to src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution0008.py index 8fa1c604..62813b04 100644 --- a/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution.py +++ b/src/main/python/g0001_0100/s0008_string_to_integer_atoi/Solution0008.py @@ -1,4 +1,5 @@ -# #Medium #Top_Interview_Questions #String #2024_06_03_Time_29_ms_(95.47%)_Space_16.6_MB_(73.62%) +# #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +# #2025_07_22_Time_0_ms_(100.00%)_Space_17.71_MB_(77.35%) class Solution: def myAtoi(self, s: str) -> int: diff --git a/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py b/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py deleted file mode 100644 index d4d2b9b4..00000000 --- a/src/main/python/g0001_0100/s0009_palindrome_number/Solution.py +++ /dev/null @@ -1,5 +0,0 @@ -# #Easy #Math #Udemy_Integers #2024_06_03_Time_43_ms_(91.99%)_Space_16.5_MB_(58.90%) - -class Solution: - def isPalindrome(self, x: int) -> bool: - return str(x) == str(x)[::-1] diff --git a/src/main/python/g0001_0100/s0009_palindrome_number/Solution0009.py b/src/main/python/g0001_0100/s0009_palindrome_number/Solution0009.py new file mode 100644 index 00000000..6121536c --- /dev/null +++ b/src/main/python/g0001_0100/s0009_palindrome_number/Solution0009.py @@ -0,0 +1,6 @@ +# #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) +# #2025_07_22_Time_4_ms_(80.28%)_Space_17.98_MB_(19.56%) + +class Solution: + def isPalindrome(self, x: int) -> bool: + return str(x) == str(x)[::-1] diff --git a/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py b/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution0010.py similarity index 90% rename from src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py rename to src/main/python/g0001_0100/s0010_regular_expression_matching/Solution0010.py index 6eb65921..bafa351e 100644 --- a/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution.py +++ b/src/main/python/g0001_0100/s0010_regular_expression_matching/Solution0010.py @@ -1,5 +1,5 @@ # #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming -# #Big_O_Time_O(m*n)_Space_O(m*n) #2024_06_03_Time_23_ms_(99.97%)_Space_16.3_MB_(98.67%) +# #Big_O_Time_O(m*n)_Space_O(m*n) #2025_07_22_Time_1_ms_(97.40%)_Space_17.83_MB_(64.20%) class Solution: def __init__(self): 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/Solution0011.py similarity index 72% rename from src/main/python/g0001_0100/s0011_container_with_most_water/Solution.py rename to src/main/python/g0001_0100/s0011_container_with_most_water/Solution0011.py index 16972141..2110b503 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/Solution0011.py @@ -1,6 +1,8 @@ # #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) #2025_07_22_Time_68_ms_(91.16%)_Space_28.60_MB_(23.78%) + +from typing import List 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/Solution0015.py similarity index 89% rename from src/main/python/g0001_0100/s0015_3sum/Solution.py rename to src/main/python/g0001_0100/s0015_3sum/Solution0015.py index 02c8ccdf..da14cfc2 100644 --- a/src/main/python/g0001_0100/s0015_3sum/Solution.py +++ b/src/main/python/g0001_0100/s0015_3sum/Solution0015.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) +# #2025_07_22_Time_581_ms_(56.92%)_Space_20.72_MB_(36.56%) 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/Solution0017.py similarity index 78% rename from src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.py rename to src/main/python/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution0017.py index ed080358..94b334b0 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/Solution0017.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) +# #2025_07_22_Time_0_ms_(100.00%)_Space_17.68_MB_(92.03%) 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/Solution0019.py similarity index 78% rename from src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.py rename to src/main/python/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution0019.py index 8028f639..d3e98985 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/Solution0019.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) #2025_07_22_Time_0_ms_(100.00%)_Space_17.70_MB_(84.76%) # 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/Solution0020.py similarity index 72% rename from src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py rename to src/main/python/g0001_0100/s0020_valid_parentheses/Solution0020.py index 717019b8..e878e3ca 100644 --- a/src/main/python/g0001_0100/s0020_valid_parentheses/Solution.py +++ b/src/main/python/g0001_0100/s0020_valid_parentheses/Solution0020.py @@ -1,9 +1,9 @@ # #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) #2025_07_22_Time_0_ms_(100.00%)_Space_17.79_MB_(80.81%) class Solution: - def isValid(self, s): + def isValid(self, s: str) -> bool: stack = [] for char in s: if char in "({[": 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/Solution0021.py similarity index 87% rename from src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution.py rename to src/main/python/g0001_0100/s0021_merge_two_sorted_lists/Solution0021.py index b187b064..f2468372 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/Solution0021.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) #2025_07_22_Time_0_ms_(100.00%)_Space_17.70_MB_(61.28%) # 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/Solution0022.py similarity index 86% rename from src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py rename to src/main/python/g0001_0100/s0022_generate_parentheses/Solution0022.py index 185ce345..7e1cf0e8 100644 --- a/src/main/python/g0001_0100/s0022_generate_parentheses/Solution.py +++ b/src/main/python/g0001_0100/s0022_generate_parentheses/Solution0022.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) +# #2025_07_22_Time_0_ms_(100.00%)_Space_18.17_MB_(25.52%) 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/Solution0023.py similarity index 88% rename from src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution.py rename to src/main/python/g0001_0100/s0023_merge_k_sorted_lists/Solution0023.py index b0a32e78..420ef6e4 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/Solution0023.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)) #2025_07_22_Time_5_ms_(93.52%)_Space_20.28_MB_(55.14%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution.py b/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution0024.py similarity index 90% rename from src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution.py rename to src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution0024.py index 9fed07eb..1f3c87a3 100644 --- a/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution.py +++ b/src/main/python/g0001_0100/s0024_swap_nodes_in_pairs/Solution0024.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_04_Time_27_ms_(93.88%)_Space_16.4_MB_(83.92%) +# #2025_07_22_Time_0_ms_(100.00%)_Space_17.66_MB_(83.09%) # 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/Solution0025.py similarity index 90% rename from src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.py rename to src/main/python/g0001_0100/s0025_reverse_nodes_in_k_group/Solution0025.py index 7ef64d0c..c9dc6633 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/Solution0025.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_04_Time_36_ms_(90.51%)_Space_17.3_MB_(94.94%) +# #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) +# #2025_07_22_Time_0_ms_(100.00%)_Space_18.73_MB_(19.01%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0001_0100/s0031_next_permutation/Solution.py b/src/main/python/g0001_0100/s0031_next_permutation/Solution0031.py similarity index 93% rename from src/main/python/g0001_0100/s0031_next_permutation/Solution.py rename to src/main/python/g0001_0100/s0031_next_permutation/Solution0031.py index 428dd77b..e605fd1c 100644 --- a/src/main/python/g0001_0100/s0031_next_permutation/Solution.py +++ b/src/main/python/g0001_0100/s0031_next_permutation/Solution0031.py @@ -1,5 +1,5 @@ # #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1) -# #2024_06_08_Time_35_ms_(93.06%)_Space_16.5_MB_(44.75%) +# #2025_07_22_Time_0_ms_(100.00%)_Space_17.71_MB_(56.73%) class Solution: def nextPermutation(self, nums: List[int]) -> None: diff --git a/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution.py b/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution0032.py similarity index 94% rename from src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution.py rename to src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution0032.py index b3edbe9d..7636fcae 100644 --- a/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution.py +++ b/src/main/python/g0001_0100/s0032_longest_valid_parentheses/Solution0032.py @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1) -# #2024_06_08_Time_36_ms_(89.25%)_Space_16.7_MB_(89.20%) +# #2025_07_22_Time_6_ms_(66.50%)_Space_17.80_MB_(97.72%) class Solution: def longestValidParentheses(self, s: str) -> int: 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/Solution0033.py similarity index 85% rename from src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.py rename to src/main/python/g0001_0100/s0033_search_in_rotated_sorted_array/Solution0033.py index a483e573..fc05fc51 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/Solution0033.py @@ -1,7 +1,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) -# #2024_06_08_Time_36_ms_(91.71%)_Space_16.8_MB_(98.65%) +# #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +# #2025_07_22_Time_0_ms_(100.00%)_Space_18.28_MB_(22.25%) class Solution: def search(self, nums: List[int], target: int) -> int: 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/Solution0034.py similarity index 79% rename from src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.py rename to src/main/python/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution0034.py index 433733e2..61c7a6e2 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/Solution0034.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) #2025_07_22_Time_0_ms_(100.00%)_Space_18.99_MB_(75.63%) 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/Solution0035.py similarity index 82% rename from src/main/python/g0001_0100/s0035_search_insert_position/Solution.py rename to src/main/python/g0001_0100/s0035_search_insert_position/Solution0035.py index ceb4cc02..fd8b30b8 100644 --- a/src/main/python/g0001_0100/s0035_search_insert_position/Solution.py +++ b/src/main/python/g0001_0100/s0035_search_insert_position/Solution0035.py @@ -1,6 +1,6 @@ # #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_06_08_Time_41_ms_(94.38%)_Space_17.4_MB_(43.81%) +# #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +# #2025_07_22_Time_0_ms_(100.00%)_Space_18.46_MB_(43.50%) class Solution: def searchInsert(self, nums: List[int], target: int) -> int: diff --git a/src/main/python/g0001_0100/s0039_combination_sum/Solution.py b/src/main/python/g0001_0100/s0039_combination_sum/Solution0039.py similarity index 88% rename from src/main/python/g0001_0100/s0039_combination_sum/Solution.py rename to src/main/python/g0001_0100/s0039_combination_sum/Solution0039.py index 35bd696d..f67126cb 100644 --- a/src/main/python/g0001_0100/s0039_combination_sum/Solution.py +++ b/src/main/python/g0001_0100/s0039_combination_sum/Solution0039.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) +# #2025_07_22_Time_4_ms_(90.51%)_Space_17.64_MB_(98.10%) class Solution: def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: diff --git a/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py b/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py index 8fcb9545..2c8e154b 100644 --- a/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py +++ b/src/main/python/g0001_0100/s0041_first_missing_positive/Solution.py @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays -# #Big_O_Time_O(n)_Space_O(n) #2024_06_08_Time_334_ms_(98.05%)_Space_34.7_MB_(28.20%) +# #Big_O_Time_O(n)_Space_O(n) #2025_07_24_Time_19_ms_(93.81%)_Space_34.68_MB_(19.66%) class Solution: def firstMissingPositive(self, nums: List[int]) -> 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..79108c94 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) +# #2025_07_24_Time_11_ms_(71.16%)_Space_19.22_MB_(68.64%) 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..04881f8d 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) +# #2025_07_24_Time_8_ms_(57.34%)_Space_18.40_MB_(92.28%) 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..6646dad0 100644 --- a/src/main/python/g0001_0100/s0046_permutations/Solution.py +++ b/src/main/python/g0001_0100/s0046_permutations/Solution.py @@ -1,7 +1,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!) -# #2024_06_08_Time_28_ms_(98.67%)_Space_16.6_MB_(93.71%) +# #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) +# #2025_07_24_Time_0_ms_(100.00%)_Space_18.04_MB_(32.82%) class Solution: def permute(self, nums: List[int]) -> List[List[int]]: 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..a71d9608 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) +# #2025_07_24_Time_0_ms_(100.00%)_Space_17.66_MB_(91.44%) 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..10fabce5 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) +# #2025_07_24_Time_11_ms_(82.75%)_Space_20.85_MB_(56.49%) from collections import defaultdict diff --git a/src/main/python/g0001_0100/s0051_n_queens/Solution.py b/src/main/python/g0001_0100/s0051_n_queens/Solution.py index 7ce48d28..b6e71932 100644 --- a/src/main/python/g0001_0100/s0051_n_queens/Solution.py +++ b/src/main/python/g0001_0100/s0051_n_queens/Solution.py @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N) -# #2024_06_08_Time_31_ms_(99.90%)_Space_16.9_MB_(70.82%) +# #2025_07_24_Time_6_ms_(98.12%)_Space_18.42_MB_(15.31%) class Solution: def solveNQueens(self, n: int) -> List[List[str]]: 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..d06b9b02 100644 --- a/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py +++ b/src/main/python/g0001_0100/s0053_maximum_subarray/Solution.py @@ -1,7 +1,7 @@ # #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_06_08_Time_501_ms_(83.84%)_Space_30.7_MB_(91.05%) +# #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) +# #2025_07_24_Time_50_ms_(77.23%)_Space_32.78_MB_(39.19%) class Solution: def maxSubArray(self, nums: List[int]) -> int: 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..4cc549b4 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) +# #2025_07_24_Time_12_ms_(85.38%)_Space_18.61_MB_(41.98%) 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..8642c557 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) +# #2025_07_24_Time_7_ms_(72.98%)_Space_20.89_MB_(89.16%) 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..71878c8c 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) #2025_07_24_Time_0_ms_(100.00%)_Space_17.83_MB_(45.92%) class Solution: def uniquePaths(self, m: int, n: int) -> int: @@ -14,4 +14,3 @@ def uniquePaths(self, m: int, n: int) -> int: for j in range(1, n): dp[i][j] = dp[i - 1][j] + dp[i][j - 1] return dp[m - 1][n - 1] - 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..0fc84370 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) #2025_07_24_Time_15_ms_(60.38%)_Space_20.01_MB_(64.76%) 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..caaa3bcd 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) #2025_07_24_Time_0_ms_(100.00%)_Space_17.79_MB_(48.58%) 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..5fe5a28b 100644 --- a/src/main/python/g0001_0100/s0072_edit_distance/Solution.py +++ b/src/main/python/g0001_0100/s0072_edit_distance/Solution.py @@ -1,7 +1,7 @@ -# #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) -# #2024_06_08_Time_60_ms_(98.17%)_Space_18.5_MB_(81.62%) +# #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2) +# #2025_07_24_Time_23_ms_(98.84%)_Space_19.79_MB_(77.91%) class Solution: def solve(self, str1, i, str2, j, dp): 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..88819ca9 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,6 +1,6 @@ # #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_06_09_Time_93_ms_(94.48%)_Space_17.4_MB_(67.69%) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) +# #2025_07_24_Time_3_ms_(71.07%)_Space_18.35_MB_(78.72%) class Solution: def setZeroes(self, matrix: List[List[int]]) -> None: 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..ca7901d2 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,7 +1,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) -# #2024_06_09_Time_35_ms_(97.66%)_Space_17_MB_(69.27%) +# #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) +# #2025_07_24_Time_0_ms_(100.00%)_Space_18.07_MB_(93.02%) class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: diff --git a/src/main/python/g0001_0100/s0075_sort_colors/Solution.py b/src/main/python/g0001_0100/s0075_sort_colors/Solution.py index edf2c2cd..f2c002f5 100644 --- a/src/main/python/g0001_0100/s0075_sort_colors/Solution.py +++ b/src/main/python/g0001_0100/s0075_sort_colors/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_31_ms_(90.70%)_Space_16.4_MB_(80.54%) +# #2025_07_24_Time_0_ms_(100.00%)_Space_17.89_MB_(33.05%) class Solution: def sortColors(self, nums: List[int]) -> None: 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..35285675 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) #2025_07_24_Time_59_ms_(88.78%)_Space_18.10_MB_(93.29%) class Solution: def minWindow(self, s: str, t: str) -> str: diff --git a/src/main/python/g0001_0100/s0078_subsets/Solution.py b/src/main/python/g0001_0100/s0078_subsets/Solution.py index a9c07003..c1acde90 100644 --- a/src/main/python/g0001_0100/s0078_subsets/Solution.py +++ b/src/main/python/g0001_0100/s0078_subsets/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_30_ms_(92.66%)_Space_16.7_MB_(74.16%) +# #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_07_24_Time_0_ms_(100.00%)_Space_18.05_MB_(21.18%) from itertools import combinations 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..70f74f5c 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) #2025_07_24_Time_623_ms_(94.85%)_Space_17.84_MB_(65.07%) 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/s0084_largest_rectangle_in_histogram/Solution.py b/src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.py index 1fc1071e..9f92341d 100644 --- a/src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.py +++ b/src/main/python/g0001_0100/s0084_largest_rectangle_in_histogram/Solution.py @@ -1,5 +1,5 @@ # #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack -# #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_06_09_Time_644_ms_(90.89%)_Space_30.7_MB_(64.32%) +# #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_07_24_Time_63_ms_(99.53%)_Space_29.12_MB_(95.20%) class Solution: def largestRectangleArea(self, heights: List[int]) -> int: diff --git a/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py b/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py index 84c3bef7..94b1f748 100644 --- a/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py +++ b/src/main/python/g0001_0100/s0094_binary_tree_inorder_traversal/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_28_ms_(91.67%)_Space_16.5_MB_(69.09%) +# #2025_07_24_Time_0_ms_(100.00%)_Space_17.90_MB_(12.04%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py b/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py index 361e0bd7..72a94a6f 100644 --- a/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py +++ b/src/main/python/g0001_0100/s0096_unique_binary_search_trees/Solution.py @@ -1,6 +1,6 @@ # #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree # #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) -# #2024_06_09_Time_30_ms_(84.13%)_Space_16.4_MB_(71.22%) +# #2025_07_24_Time_0_ms_(100.00%)_Space_17.82_MB_(32.26%) class Solution: def numTrees(self, n: int) -> int: 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..15e5da93 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,7 +1,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)) -# #2024_06_09_Time_38_ms_(77.48%)_Space_18.3_MB_(75.64%) +# #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) +# #2025_07_24_Time_0_ms_(100.00%)_Space_19.66_MB_(89.79%) # Definition for a binary tree node. # class TreeNode: 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..5ec499f4 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)) +# #2025_07_24_Time_0_ms_(100.00%)_Space_17.74_MB_(83.76%) # 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..40c308a3 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) +# #2025_07_24_Time_0_ms_(100.00%)_Space_18.34_MB_(87.01%) # 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..5741e68e 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) +# #2025_07_25_Time_0_ms_(100.00%)_Space_19.23_MB_(7.43%) # 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..fc93b06c 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) #2025_07_25_Time_4_ms_(73.84%)_Space_19.14_MB_(84.59%) # 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..8e3f4ce3 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,6 +1,6 @@ # #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_06_09_Time_24_ms_(99.54%)_Space_16.7_MB_(86.32%) +# #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) +# #2025_07_25_Time_0_ms_(100.00%)_Space_17.94_MB_(73.46%) # Definition for a binary tree node. # class TreeNode: 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..29cdd9b1 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) +# #2025_07_25_Time_17_ms_(98.03%)_Space_26.89_MB_(77.51%) 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..5fd9e578 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) #2025_07_25_Time_11_ms_(91.40%)_Space_22.92_MB_(80.36%) # 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..1146b283 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) +# #2025_07_25_Time_47_ms_(76.47%)_Space_33.24_MB_(81.27%) class Solution: def longestConsecutive(self, nums: List[int]) -> int: diff --git a/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py b/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py index 3dec491c..3659fc21 100644 --- a/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py +++ b/src/main/python/g0101_0200/s0131_palindrome_partitioning/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_444_ms_(93.43%)_Space_32.1_MB_(84.45%) +# #2025_07_25_Time_50_ms_(56.82%)_Space_32.70_MB_(87.12%) class Solution: def partition(self, s: str) -> List[List[str]]: 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..34419ae9 100644 --- a/src/main/python/g0101_0200/s0136_single_number/Solution.py +++ b/src/main/python/g0101_0200/s0136_single_number/Solution.py @@ -1,6 +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 -# #Big_O_Time_O(N)_Space_O(1) #2024_06_09_Time_98_ms_(96.80%)_Space_19_MB_(89.40%) +# #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_07_25_Time_0_ms_(100.00%)_Space_19.69_MB_(43.28%) class Solution: def singleNumber(self, nums: List[int]) -> int: 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..d741118c 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) #2025_07_25_Time_38_ms_(77.31%)_Space_18.72_MB_(18.76%) """ # 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..b9a1f3a5 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) #2025_07_25_Time_3_ms_(70.59%)_Space_17.90_MB_(63.78%) 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..07f9b2a4 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) #2025_07_25_Time_44_ms_(80.06%)_Space_19.98_MB_(29.66%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py b/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py index 2ed530a0..5a7526e2 100644 --- a/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py +++ b/src/main/python/g0101_0200/s0142_linked_list_cycle_ii/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_30_ms_(99.28%)_Space_19.1_MB_(38.61%) +# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_38_ms_(94.15%)_Space_19.60_MB_(79.86%) # 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..27990129 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) #2025_07_25_Time_113_ms_(84.08%)_Space_77.93_MB_(87.77%) 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..be18afe4 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)) #2025_07_25_Time_186_ms_(43.67%)_Space_32.96_MB_(41.09%) # Definition for singly-linked list. # class ListNode: diff --git a/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py b/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py index d2fa3060..b05561ac 100644 --- a/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py +++ b/src/main/python/g0101_0200/s0152_maximum_product_subarray/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_71_ms_(61.48%)_Space_17_MB_(43.09%) +# #Big_O_Time_O(N)_Space_O(1) #2025_07_25_Time_3_ms_(98.51%)_Space_18.56_MB_(15.01%) class Solution: def maxProduct(self, nums: List[int]) -> int: 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..a8869fc4 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) #2025_07_25_Time_0_ms_(100.00%)_Space_18.07_MB_(50.37%) class Solution: def findMinUtil(self, nums: List[int], l: int, r: int) -> int: @@ -24,5 +24,5 @@ def findMinUtil(self, nums: List[int], l: int, r: int) -> int: def findMin(self, nums: List[int]) -> int: l = 0 - r = nums.length - 1 + r = len(nums) - 1 return self.findMinUtil(nums, l, r) 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..0f63bb4a 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) +# #2025_07_25_Time_3_ms_(83.83%)_Space_22.26_MB_(6.08%) class MinStack: class Node: diff --git a/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py b/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py index 2bb6eb3a..d12b0681 100644 --- a/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py +++ b/src/main/python/g0101_0200/s0160_intersection_of_two_linked_lists/Solution.py @@ -1,6 +1,6 @@ # #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_06_09_Time_79_ms_(66.59%)_Space_27_MB_(66.94%) +# #2025_07_25_Time_83_ms_(67.29%)_Space_27.89_MB_(40.40%) # Definition for singly-linked list. # class ListNode: 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..1819adc7 100644 --- a/src/main/python/g0101_0200/s0169_majority_element/Solution.py +++ b/src/main/python/g0101_0200/s0169_majority_element/Solution.py @@ -1,29 +1,30 @@ # #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) +# #2025_07_25_Time_7_ms_(56.72%)_Space_19.50_MB_(19.10%) class Solution: def majorityElement(self, nums: List[int]) -> int: count = 1 - majority = arr[0] + majority = nums[0] # For Potential Majority Element - for i in range(1, len(arr)): - if arr[i] == majority: + for i in range(1, len(nums)): + if nums[i] == majority: count += 1 else: if count > 1: count -= 1 else: - majority = arr[i] + majority = nums[i] # For Confirmation count = 0 - for j in arr: + for j in nums: if j == majority: count += 1 - if count >= (len(arr) // 2) + 1: + if count >= (len(nums) // 2) + 1: return majority else: return -1 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..43e62d3f 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) #2025_07_25_Time_3_ms_(74.65%)_Space_25.70_MB_(46.80%) 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..c87f4b0b 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) #2025_07_25_Time_0_ms_(100.00%)_Space_17.77_MB_(54.18%) 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..7dab0ea4 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) +# #2025_07_25_Time_234_ms_(82.73%)_Space_19.96_MB_(95.69%) 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..66eaae84 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) #2025_07_25_Time_0_ms_(100.00%)_Space_18.75_MB_(37.87%) # 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..df8d8d8c 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) #2025_07_25_Time_3_ms_(88.23%)_Space_19.05_MB_(73.39%) 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..14939486 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,51 +1,40 @@ # #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%) +# #2025_07_25_Time_44_ms_(68.94%)_Space_32.08_MB_(76.05%) class TrieNode: - # Initialize your data structure here. def __init__(self): - self.children = [None] * 26 - self.isWord = False + self.children = dict() + self.isWordEnd = False class Trie: def __init__(self): self.root = TrieNode() - self.startWith = False - # Inserts a word into the trie. - def insert(self, word): - self._insert(word, self.root, 0) - - def _insert(self, word, root, idx): - if idx == len(word): - root.isWord = True - return - index = ord(word[idx]) - ord('a') - if root.children[index] is None: - root.children[index] = TrieNode() - self._insert(word, root.children[index], idx + 1) - - # Returns if the word is in the trie. - def search(self, word): - return self._search(word, self.root, 0) - - def _search(self, word, root, idx): - if idx == len(word): - self.startWith = True - return root.isWord - index = ord(word[idx]) - ord('a') - if root.children[index] is None: - self.startWith = False - return False - return self._search(word, root.children[index], idx + 1) - - # Returns if there is any word in the trie - # that starts with the given prefix. - def startsWith(self, prefix): - self.search(prefix) - return self.startWith + def insert(self, word: str) -> None: + curr = self.root + for c in word: + if c not in curr.children: + curr.children[c] = TrieNode() + curr = curr.children[c] + curr.isWordEnd = True + + def search(self, word: str) -> bool: + curr = self.root + for c in word: + if c not in curr.children: + return False + curr = curr.children[c] + return curr.isWordEnd + + def startsWith(self, prefix: str) -> bool: + curr = self.root + for c in prefix: + if c not in curr.children: + return False + curr = curr.children[c] + return True # Your Trie object will be instantiated and called as such: # obj = Trie() 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..3c625ef7 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,6 +1,7 @@ # #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_06_09_Time_446_ms_(79.92%)_Space_29.9_MB_(52.14%) +# #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_07_25_Time_45_ms_(90.46%)_Space_28.73_MB_(45.18%) class Solution: def findKthLargest(self, nums: List[int], k: int) -> int: 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..a54e2e98 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) +# #2025_07_25_Time_129_ms_(64.49%)_Space_33.02_MB_(58.33%) 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..702987b5 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) +# #2025_07_25_Time_0_ms_(100.00%)_Space_17.94_MB_(9.36%) # 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..8a63a751 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,6 +1,7 @@ # #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) -# #2024_06_09_Time_44_ms_(61.91%)_Space_19.4_MB_(88.66%) +# #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_07_25_Time_0_ms_(100.00%)_Space_21.13_MB_(27.27%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py b/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py index 30eef8ed..4a09d6c3 100644 --- a/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py +++ b/src/main/python/g0201_0300/s0234_palindrome_linked_list/Solution.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_09_Time_282_ms_(75.97%)_Space_31.9_MB_(83.09%) +# #2025_07_25_Time_23_ms_(81.92%)_Space_39.40_MB_(37.99%) # Definition for singly-linked list. # class ListNode: @@ -9,31 +9,15 @@ # self.next = next class Solution: def isPalindrome(self, head: Optional[ListNode]) -> bool: - # Calculate the length of the linked list - length = 0 - right = head - while right: - right = right.next - length += 1 - - # Reverse the right half of the list - length //= 2 - right = head - for _ in range(length): - right = right.next - - prev = None - while right: - next_node = right.next - right.next = prev - prev = right - right = next_node - - # Compare the left half and the right half - for _ in range(length): - if head and prev and head.val == prev.val: - head = head.next - prev = prev.next - else: + arr = [] + while head: + arr.append(head.val) + head = head.next + l = 0 + r = len(arr) -1 + while l <= r: + if arr[l] != arr[r]: return False + l+=1 + r-=1 return True 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..e3b7b7cf 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,6 +1,7 @@ # #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) -# #2024_06_09_Time_43_ms_(89.34%)_Space_21_MB_(44.04%) +# #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_07_25_Time_41_ms_(97.74%)_Space_22.14_MB_(43.54%) # Definition for a binary tree node. # class TreeNode: 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..f3224e2b 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,5 +1,6 @@ -# #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays -# #Big_O_Time_O(n^2)_Space_O(n) #2024_06_09_Time_241_ms_(99.65%)_Space_25.5_MB_(94.18%) +# #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_07_25_Time_15_ms_(97.12%)_Space_23.25_MB_(79.77%) class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: diff --git a/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py b/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py index 2e27ee02..2c25e51e 100644 --- a/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py +++ b/src/main/python/g0201_0300/s0239_sliding_window_maximum/Solution.py @@ -1,28 +1,17 @@ # #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) -# #2024_06_08_Time_1093_ms_(66.83%)_Space_32_MB_(94.89%) - -from collections import deque +# #2025_07_25_Time_152_ms_(81.96%)_Space_30.79_MB_(96.65%) class Solution: def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]: - n = len(nums) - res = [0] * (n - k + 1) - dq = deque() - i, j = 0, 0 - x = 0 - - while j < len(nums): - while dq and dq[-1] < nums[j]: - dq.pop() - dq.append(nums[j]) - - if j - i + 1 == k: - res[x] = dq[0] - x += 1 - if dq[0] == nums[i]: - dq.popleft() - i += 1 - j += 1 - - return res + q = deque() + result = [] + for right in range(len(nums)): + while q and nums[right] > nums[q[-1]]: + q.pop() + q.append(right) + if q[0] <= right - k: + q.popleft() + if right >= k - 1: + result.append(nums[q[0]]) + return result diff --git a/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py b/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py index 9e48cfbc..16c519a5 100644 --- a/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py +++ b/src/main/python/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_08_Time_130_ms_(91.49%)_Space_22.8_MB_(65.80%) +# #2025_07_25_Time_143_ms_(64.84%)_Space_24.00_MB_(80.86%) class Solution: def searchMatrix(self, matrix: List[List[int]], target: int) -> bool: 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..6e01af3b 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) #2025_07_25_Time_3_ms_(80.05%)_Space_18.63_MB_(94.75%) class Solution: def moveZeroes(self, nums: List[int]) -> None: diff --git a/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py b/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py index 9f447ecf..c43dcbf4 100644 --- a/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py +++ b/src/main/python/g0201_0300/s0287_find_the_duplicate_number/Solution.py @@ -1,6 +1,6 @@ # #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) -# #2024_06_08_Time_453_ms_(81.73%)_Space_31.1_MB_(24.78%) +# #2025_07_25_Time_16_ms_(96.25%)_Space_30.09_MB_(49.05%) class Solution: def findDuplicate(self, nums: List[int]) -> int: 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..ff67f448 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) +# #2025_07_25_Time_131_ms_(72.46%)_Space_40.10_MB_(17.67%) 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..0d8148b4 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,7 +1,7 @@ # #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) -# #2024_06_08_Time_58_ms_(96.98%)_Space_16.9_MB_(78.92%) +# #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n) +# #2025_07_25_Time_11_ms_(78.54%)_Space_18.12_MB_(38.75%) 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..195ef71c 100644 --- a/src/main/python/g0301_0400/s0322_coin_change/Solution.py +++ b/src/main/python/g0301_0400/s0322_coin_change/Solution.py @@ -1,7 +1,7 @@ # #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) -# #2024_06_08_Time_488_ms_(96.38%)_Space_16.9_MB_(86.07%) +# #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount) +# #2025_07_25_Time_454_ms_(96.33%)_Space_18.19_MB_(69.69%) class Solution: def coinChange(self, coins: List[int], amount: int) -> int: 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..08c511ee 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) +# #2025_07_25_Time_3_ms_(94.51%)_Space_18.68_MB_(22.83%) class Solution: def countBits(self, num: int) -> List[int]: diff --git a/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py b/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py index 175be319..07b29d6b 100644 --- a/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py +++ b/src/main/python/g0301_0400/s0347_top_k_frequent_elements/Solution.py @@ -1,6 +1,6 @@ # #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) #2024_06_08_Time_86_ms_(71.64%)_Space_20.7_MB_(94.24%) +# #Big_O_Time_O(n*log(n))_Space_O(k) #2025_07_25_Time_4_ms_(69.79%)_Space_21.51_MB_(27.28%) import heapq from collections import Counter 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..2e222f81 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) +# #2025_07_25_Time_0_ms_(100.00%)_Space_17.56_MB_(97.37%) class Solution: def __init__(self): diff --git a/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py b/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py index a9825156..76b51a86 100644 --- a/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py +++ b/src/main/python/g0401_0500/s0416_partition_equal_subset_sum/Solution.py @@ -1,5 +1,5 @@ # #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_06_07_Time_550_ms_(64.93%)_Space_16.6_MB_(92.89%) +# #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_07_25_Time_564_ms_(63.45%)_Space_18.06_MB_(74.36%) class Solution: def canPartition(self, nums: List[int]) -> bool: 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..8a33769f 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,6 @@ -# #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 #Top_100_Liked_Questions #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_07_26_Time_0_ms_(100.00%)_Space_18.23_MB_(71.00%) # Definition for a binary tree node. # class TreeNode: @@ -8,24 +9,20 @@ # self.left = left # self.right = right class Solution: - def __init__(self): - self.count = 0 - def pathSum(self, root: Optional[TreeNode], targetSum: int) -> int: - if root is None: - return 0 - self.helper(root, targetSum, 0) - self.pathSum(root.left, targetSum) - self.pathSum(root.right, targetSum) - return self.count + def dfs(node: TreeNode, targetSum: int, curr_sum: int) -> None: + if not node: + return + + curr_sum += node.val + self.count += self.prefix_sum.get(curr_sum - targetSum, 0) + self.prefix_sum[curr_sum] = self.prefix_sum.get(curr_sum, 0) + 1 + dfs(node.left, targetSum, curr_sum) + dfs(node.right, targetSum, curr_sum) - def helper(self, node: TreeNode, targetSum: int, currSum: int) -> None: - if node is None: - return - currSum += node.val - if targetSum == currSum: - self.count += 1 - if node.left is not None: - self.helper(node.left, targetSum, currSum) - if node.right is not None: - self.helper(node.right, targetSum, currSum) + self.prefix_sum[curr_sum] -= 1 + + self.count = 0 + self.prefix_sum = {0: 1} + dfs(root, targetSum, 0) + return self.count diff --git a/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py b/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py index 161f186d..cd1203ea 100644 --- a/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py +++ b/src/main/python/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.py @@ -1,7 +1,7 @@ # #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_06_07_Time_100_ms_(50.22%)_Space_17.6_MB_(97.85%) +# #2025_07_25_Time_54_ms_(54.80%)_Space_18.16_MB_(94.43%) from collections import defaultdict diff --git a/src/main/python/g0401_0500/s0494_target_sum/Solution.py b/src/main/python/g0401_0500/s0494_target_sum/Solution.py index 5d43f07f..90ebf71a 100644 --- a/src/main/python/g0401_0500/s0494_target_sum/Solution.py +++ b/src/main/python/g0401_0500/s0494_target_sum/Solution.py @@ -1,5 +1,5 @@ # #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) -# #2024_06_07_Time_105_ms_(86.96%)_Space_16.7_MB_(80.93%) +# #2025_07_25_Time_59_ms_(77.59%)_Space_18.11_MB_(61.50%) class Solution: def findTargetSumWays(self, nums: List[int], target: int) -> int: diff --git a/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py b/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py index d801db35..812d1dc2 100644 --- a/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py +++ b/src/main/python/g0501_0600/s0543_diameter_of_binary_tree/Solution.py @@ -1,6 +1,6 @@ # #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_06_07_Time_51_ms_(36.84%)_Space_19.2_MB_(86.39%) +# #2025_07_25_Time_3_ms_(94.30%)_Space_20.69_MB_(95.89%) # Definition for a binary tree node. # class TreeNode: diff --git a/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py b/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py index d2ef6456..b14c57ae 100644 --- a/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py +++ b/src/main/python/g0501_0600/s0560_subarray_sum_equals_k/Solution.py @@ -1,19 +1,17 @@ # #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_06_07_Time_224_ms_(72.29%)_Space_19.4_MB_(91.64%) +# #Big_O_Time_O(n)_Space_O(n) #2025_07_25_Time_27_ms_(84.54%)_Space_20.34_MB_(71.80%) from collections import defaultdict class Solution: def subarraySum(self, nums: List[int], k: int) -> int: - tempSum = 0 - ret = 0 - sumCount = defaultdict(int) - sumCount[0] = 1 - - for i in nums: - tempSum += i - if tempSum - k in sumCount: - ret += sumCount[tempSum - k] - sumCount[tempSum] += 1 + sub_num = {0:1} + total, count = 0, 0 + + for n in nums: + total += n + if total - k in sub_num: + count += sub_num[total-k] + sub_num[total] = 1 + sub_num.get(total, 0) - return ret + return count diff --git a/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py b/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py index 9ce0f3aa..4d67b7b2 100644 --- a/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py +++ b/src/main/python/g0601_0700/s0647_palindromic_substrings/Solution.py @@ -1,20 +1,20 @@ # #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) -# #2024_06_07_Time_167_ms_(49.16%)_Space_16.4_MB_(97.33%) +# #2025_07_25_Time_4_ms_(99.42%)_Space_17.67_MB_(87.53%) class Solution: - def expand(self, a: List[str], l: int, r: int, res: List[int]) -> None: - while l >= 0 and r < len(a): - if a[l] != a[r]: - return - else: - res[0] += 1 - l -= 1 - r += 1 - def countSubstrings(self, s: str) -> int: - a = list(s) - res = [0] - for i in range(len(a)): - self.expand(a, i, i, res) - self.expand(a, i, i + 1, res) - return res[0] + result = 0 + i = 0 + while i < len(s): + l = i + while i < len(s) and s[i] == s[l]: + i+=1 + r = i - 1 + for j in range(r-l+1): + result += j+1 + while l-1>=0 and r+1 < len(s) and s[l-1] == s[r+1]: + result+=1 + + l-=1 + r+=1 + return result 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..40507bfd 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) +# #2025_07_25_Time_105_ms_(58.04%)_Space_26.59_MB_(95.95%) class Solution: def dailyTemperatures(self, temperatures: List[int]) -> List[int]: diff --git a/src/main/python/g0701_0800/s0763_partition_labels/Solution.py b/src/main/python/g0701_0800/s0763_partition_labels/Solution.py index 189e7e81..b3dd8b54 100644 --- a/src/main/python/g0701_0800/s0763_partition_labels/Solution.py +++ b/src/main/python/g0701_0800/s0763_partition_labels/Solution.py @@ -1,5 +1,6 @@ -# #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String -# #Big_O_Time_O(n)_Space_O(1) #2024_06_07_Time_32_ms_(95.28%)_Space_16.4_MB_(98.19%) +# #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) +# #2025_07_25_Time_5_ms_(53.34%)_Space_17.62_MB_(84.14%) class Solution: def partitionLabels(self, s: str) -> 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..a2339dc0 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,7 +1,7 @@ -# #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%) +# #2025_07_25_Time_463_ms_(61.43%)_Space_42.65_MB_(76.06%) class Solution: def longestCommonSubsequence(self, text1: str, text2: str) -> int: diff --git a/src/main/racket/g0001_0100/s0006_zigzag_conversion/Solution.rkt b/src/main/racket/g0001_0100/s0006_zigzag_conversion/Solution.rkt index d8db552f..1b79053e 100644 --- a/src/main/racket/g0001_0100/s0006_zigzag_conversion/Solution.rkt +++ b/src/main/racket/g0001_0100/s0006_zigzag_conversion/Solution.rkt @@ -1,4 +1,4 @@ -; #Medium #String #Top_Interview_150_Array/String +; #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) ; #2025_02_03_Time_57_ms_(100.00%)_Space_130.82_MB_(60.00%) (define/contract (convert s numRows) diff --git a/src/main/racket/g0001_0100/s0007_reverse_integer/Solution.rkt b/src/main/racket/g0001_0100/s0007_reverse_integer/Solution.rkt index 9392b663..6274304f 100644 --- a/src/main/racket/g0001_0100/s0007_reverse_integer/Solution.rkt +++ b/src/main/racket/g0001_0100/s0007_reverse_integer/Solution.rkt @@ -1,4 +1,4 @@ -; #Medium #Top_Interview_Questions #Math #Udemy_Integers +; #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) ; #2025_02_03_Time_204_ms_(100.00%)_Space_101.45_MB_(100.00%) (define/contract (reverse x) diff --git a/src/main/racket/g0001_0100/s0008_string_to_integer_atoi/Solution.rkt b/src/main/racket/g0001_0100/s0008_string_to_integer_atoi/Solution.rkt index 10ebcd6b..56ac0480 100644 --- a/src/main/racket/g0001_0100/s0008_string_to_integer_atoi/Solution.rkt +++ b/src/main/racket/g0001_0100/s0008_string_to_integer_atoi/Solution.rkt @@ -1,4 +1,4 @@ -; #Medium #Top_Interview_Questions #String +; #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) ; #2025_02_03_Time_3_ms_(100.00%)_Space_101.64_MB_(100.00%) (define/contract (my-atoi s) diff --git a/src/main/racket/g0001_0100/s0009_palindrome_number/Solution.rkt b/src/main/racket/g0001_0100/s0009_palindrome_number/Solution.rkt index 8378b693..6b248977 100644 --- a/src/main/racket/g0001_0100/s0009_palindrome_number/Solution.rkt +++ b/src/main/racket/g0001_0100/s0009_palindrome_number/Solution.rkt @@ -1,4 +1,4 @@ -; #Easy #Math #Udemy_Integers #Top_Interview_150_Math +; #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) ; #2025_02_03_Time_8_ms_(100.00%)_Space_129.01_MB_(88.24%) (define/contract (is-palindrome x) diff --git a/src/main/racket/g0001_0100/s0011_container_with_most_water/Solution.rkt b/src/main/racket/g0001_0100/s0011_container_with_most_water/Solution.rkt index c0a1213e..b61d112e 100644 --- a/src/main/racket/g0001_0100/s0011_container_with_most_water/Solution.rkt +++ b/src/main/racket/g0001_0100/s0011_container_with_most_water/Solution.rkt @@ -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_02_03_Time_32_ms_(100.00%)_Space_130.58_MB_(100.00%) +; #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +; #Big_O_Time_O(n)_Space_O(1) #2025_02_03_Time_32_ms_(100.00%)_Space_130.58_MB_(100.00%) (define/contract (max-area height) (-> (listof exact-integer?) exact-integer?) diff --git a/src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rkt b/src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rkt index 16dbe736..3786dcf1 100644 --- a/src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rkt +++ b/src/main/racket/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.rkt @@ -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_02_03_Time_0_ms_(100.00%)_Space_102.48_MB_(_%) (define (letter-combinations digits) diff --git a/src/main/racket/g0001_0100/s0062_unique_paths/Solution.rkt b/src/main/racket/g0001_0100/s0062_unique_paths/Solution.rkt index c6ce88fa..85356808 100644 --- a/src/main/racket/g0001_0100/s0062_unique_paths/Solution.rkt +++ b/src/main/racket/g0001_0100/s0062_unique_paths/Solution.rkt @@ -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_02_03_Time_6_ms_(100.00%)_Space_102.66_MB_(100.00%) +; #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_02_03_Time_6_ms_(100.00%)_Space_102.66_MB_(100.00%) (define (calc-path! start end direction cache other-p) (begin (if (string=? direction "v") diff --git a/src/main/racket/g0001_0100/s0072_edit_distance/Solution.rkt b/src/main/racket/g0001_0100/s0072_edit_distance/Solution.rkt index e7e9b99d..e936569a 100644 --- a/src/main/racket/g0001_0100/s0072_edit_distance/Solution.rkt +++ b/src/main/racket/g0001_0100/s0072_edit_distance/Solution.rkt @@ -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_02_04_Time_4_ms_(100.00%)_Space_102.31_MB_(100.00%) diff --git a/src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rkt b/src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rkt index 8902a995..81c36b26 100644 --- a/src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rkt +++ b/src/main/racket/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.rkt @@ -1,5 +1,5 @@ ; #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_02_05_Time_0_ms_(100.00%)_Space_101.36_MB_(100.00%) diff --git a/src/main/racket/g0101_0200/s0136_single_number/Solution.rkt b/src/main/racket/g0101_0200/s0136_single_number/Solution.rkt index 20389a71..05f24a4b 100644 --- a/src/main/racket/g0101_0200/s0136_single_number/Solution.rkt +++ b/src/main/racket/g0101_0200/s0136_single_number/Solution.rkt @@ -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_02_07_Time_0_ms_(100.00%)_Space_129.05_MB_(100.00%) +; #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_02_07_Time_0_ms_(100.00%)_Space_129.05_MB_(100.00%) (define (single-number nums) (apply bitwise-xor nums) diff --git a/src/main/racket/g0101_0200/s0198_house_robber/Solution.rkt b/src/main/racket/g0101_0200/s0198_house_robber/Solution.rkt index c0c7d809..ae844d04 100644 --- a/src/main/racket/g0101_0200/s0198_house_robber/Solution.rkt +++ b/src/main/racket/g0101_0200/s0198_house_robber/Solution.rkt @@ -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_02_08_Time_0_ms_(100.00%)_Space_101.46_MB_(100.00%) diff --git a/src/main/racket/g0201_0300/s0206_reverse_linked_list/Solution.rkt b/src/main/racket/g0201_0300/s0206_reverse_linked_list/Solution.rkt index 20547d9e..3bfd0246 100644 --- a/src/main/racket/g0201_0300/s0206_reverse_linked_list/Solution.rkt +++ b/src/main/racket/g0201_0300/s0206_reverse_linked_list/Solution.rkt @@ -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) -; #2025_02_08_Time_0_ms_(100.00%)_Space_102.22_MB_(100.00%) +; #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_02_08_Time_0_ms_(100.00%)_Space_102.22_MB_(100.00%) ; Definition for singly-linked list: #| diff --git a/src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rkt b/src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rkt index f9b1295b..51f50b95 100644 --- a/src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rkt +++ b/src/main/racket/g0201_0300/s0208_implement_trie_prefix_tree/Trie.rkt @@ -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_02_10_Time_102_ms_(100.00%)_Space_134.45_MB_(100.00%) diff --git a/src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rkt b/src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rkt index 379f45f1..efab26b4 100644 --- a/src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rkt +++ b/src/main/racket/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.rkt @@ -1,6 +1,7 @@ ; #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)) +; #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_02_10_Time_79_ms_(100.00%)_Space_135.10_MB_(100.00%) (define/contract (find-kth-largest nums k) diff --git a/src/main/racket/g0201_0300/s0238_product_of_array_except_self/Solution.rkt b/src/main/racket/g0201_0300/s0238_product_of_array_except_self/Solution.rkt index 2affae36..1d6b88a3 100644 --- a/src/main/racket/g0201_0300/s0238_product_of_array_except_self/Solution.rkt +++ b/src/main/racket/g0201_0300/s0238_product_of_array_except_self/Solution.rkt @@ -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_02_10_Time_10_ms_(100.00%)_Space_132.25_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) #2025_02_10_Time_10_ms_(100.00%)_Space_132.25_MB_(100.00%) (define/contract (product-except-self nums) (-> (listof exact-integer?) (listof exact-integer?)) diff --git a/src/main/racket/g0301_0400/s0338_counting_bits/Solution.rkt b/src/main/racket/g0301_0400/s0338_counting_bits/Solution.rkt index f19f8d47..437ba183 100644 --- a/src/main/racket/g0301_0400/s0338_counting_bits/Solution.rkt +++ b/src/main/racket/g0301_0400/s0338_counting_bits/Solution.rkt @@ -1,5 +1,6 @@ -; #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -; #Big_O_Time_O(num)_Space_O(num) #2025_02_11_Time_3_ms_(100.00%)_Space_135.21_MB_(100.00%) +; #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +; #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +; #2025_02_11_Time_3_ms_(100.00%)_Space_135.21_MB_(100.00%) (define (near-bit n i) (if (and (<= i n) (< n (* i 2))) diff --git a/src/main/racket/g0301_0400/s0394_decode_string/Solution.rkt b/src/main/racket/g0301_0400/s0394_decode_string/Solution.rkt index 900b876d..2af26875 100644 --- a/src/main/racket/g0301_0400/s0394_decode_string/Solution.rkt +++ b/src/main/racket/g0301_0400/s0394_decode_string/Solution.rkt @@ -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_02_11_Time_0_ms_(100.00%)_Space_101.43_MB_(100.00%) +; #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_02_11_Time_0_ms_(100.00%)_Space_101.43_MB_(100.00%) (define/contract (decode-string s) (-> string? string?) diff --git a/src/main/racket/g0401_0500/s0437_path_sum_iii/Solution.rkt b/src/main/racket/g0401_0500/s0437_path_sum_iii/Solution.rkt index f4f2e72a..53e2e31a 100644 --- a/src/main/racket/g0401_0500/s0437_path_sum_iii/Solution.rkt +++ b/src/main/racket/g0401_0500/s0437_path_sum_iii/Solution.rkt @@ -1,4 +1,5 @@ -; #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) +; #Medium #Top_100_Liked_Questions #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_02_11_Time_107_ms_(100.00%)_Space_136.84_MB_(100.00%) ; Definition for a binary tree node. diff --git a/src/main/racket/g0701_0800/s0739_daily_temperatures/Solution.rkt b/src/main/racket/g0701_0800/s0739_daily_temperatures/Solution.rkt index 983b0a0f..7b82f52e 100644 --- a/src/main/racket/g0701_0800/s0739_daily_temperatures/Solution.rkt +++ b/src/main/racket/g0701_0800/s0739_daily_temperatures/Solution.rkt @@ -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_02_12_Time_42_ms_(100.00%)_Space_132.69_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) +; #2025_02_12_Time_42_ms_(100.00%)_Space_132.69_MB_(100.00%) (define/contract (daily-temperatures temp) (-> (listof exact-integer?) (listof exact-integer?)) diff --git a/src/main/racket/g0701_0800/s0763_partition_labels/Solution.rkt b/src/main/racket/g0701_0800/s0763_partition_labels/Solution.rkt index a45d768f..43cbdc45 100644 --- a/src/main/racket/g0701_0800/s0763_partition_labels/Solution.rkt +++ b/src/main/racket/g0701_0800/s0763_partition_labels/Solution.rkt @@ -1,5 +1,6 @@ -; #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String -; #Big_O_Time_O(n)_Space_O(1) #2025_02_12_Time_0_ms_(100.00%)_Space_101.55_MB_(100.00%) +; #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) +; #2025_02_12_Time_0_ms_(100.00%)_Space_101.55_MB_(100.00%) (define/contract (partition-labels s) (-> string? (listof exact-integer?)) diff --git a/src/main/racket/g1101_1200/s1143_longest_common_subsequence/Solution.rkt b/src/main/racket/g1101_1200/s1143_longest_common_subsequence/Solution.rkt index b8f45ab0..cbbfad47 100644 --- a/src/main/racket/g1101_1200/s1143_longest_common_subsequence/Solution.rkt +++ b/src/main/racket/g1101_1200/s1143_longest_common_subsequence/Solution.rkt @@ -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_02_12_Time_110_ms_(100.00%)_Space_141.77_MB_(100.00%) 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/scala/g0001_0100/s0001_two_sum/Solution.scala b/src/main/scala/g0001_0100/s0001_two_sum/Solution.scala index ee66e868..e1a3df11 100644 --- a/src/main/scala/g0001_0100/s0001_two_sum/Solution.scala +++ b/src/main/scala/g0001_0100/s0001_two_sum/Solution.scala @@ -1,7 +1,8 @@ package 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 // #2024_05_15_Time_680_ms_(76.33%)_Space_59.5_MB_(64.20%) object Solution { diff --git a/src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala b/src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala index 8c742af4..905285f0 100644 --- a/src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala +++ b/src/main/scala/g0001_0100/s0002_add_two_numbers/Solution.scala @@ -2,8 +2,8 @@ package 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_10_17_Time_571_ms_(75.12%)_Space_58.8_MB_(68.16%) +// #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_10_17_Time_571_ms_(75.12%)_Space_58.8_MB_(68.16%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala b/src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala index 62f377ce..7177f70f 100644 --- a/src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala +++ b/src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala @@ -2,7 +2,8 @@ package g0001_0100.s0003_longest_substring_without_repeating_characters // #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_10_17_Time_482_ms_(96.91%)_Space_55.1_MB_(89.18%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2023_10_17_Time_482_ms_(96.91%)_Space_55.1_MB_(89.18%) object Solution { def lengthOfLongestSubstring(s: String): Int = { diff --git a/src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala b/src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala index b3e58f78..05cc317d 100644 --- a/src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala +++ b/src/main/scala/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.scala @@ -1,7 +1,8 @@ package 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_10_29_Time_644_ms_(80.82%)_Space_57.9_MB_(91.78%) +// #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_10_29_Time_644_ms_(80.82%)_Space_57.9_MB_(91.78%) object Solution { @SuppressWarnings(Array("scala:S3776")) diff --git a/src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala b/src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala index ab2cc405..8aefef52 100644 --- a/src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala +++ b/src/main/scala/g0001_0100/s0005_longest_palindromic_substring/Solution.scala @@ -2,8 +2,8 @@ package 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_10_29_Time_502_ms_(87.65%)_Space_54.1_MB_(100.00%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_10_29_Time_502_ms_(87.65%)_Space_54.1_MB_(100.00%) object Solution { def longestPalindrome(s: String): String = { diff --git a/src/main/scala/g0001_0100/s0006_zigzag_conversion/Solution.scala b/src/main/scala/g0001_0100/s0006_zigzag_conversion/Solution.scala index a207f1b8..b93161d4 100644 --- a/src/main/scala/g0001_0100/s0006_zigzag_conversion/Solution.scala +++ b/src/main/scala/g0001_0100/s0006_zigzag_conversion/Solution.scala @@ -1,6 +1,7 @@ package g0001_0100.s0006_zigzag_conversion -// #Medium #String #2023_11_09_Time_542_ms_(85.71%)_Space_55.7_MB_(90.48%) +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) +// #2023_11_09_Time_542_ms_(85.71%)_Space_55.7_MB_(90.48%) import scala.collection.mutable diff --git a/src/main/scala/g0001_0100/s0007_reverse_integer/Solution.scala b/src/main/scala/g0001_0100/s0007_reverse_integer/Solution.scala index 0d06fe04..f35b141f 100644 --- a/src/main/scala/g0001_0100/s0007_reverse_integer/Solution.scala +++ b/src/main/scala/g0001_0100/s0007_reverse_integer/Solution.scala @@ -1,6 +1,6 @@ package g0001_0100.s0007_reverse_integer -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2023_11_09_Time_405_ms_(90.16%)_Space_52.3_MB_(31.15%) object Solution { diff --git a/src/main/scala/g0001_0100/s0008_string_to_integer_atoi/Solution.scala b/src/main/scala/g0001_0100/s0008_string_to_integer_atoi/Solution.scala index 8a5f1373..a7393704 100644 --- a/src/main/scala/g0001_0100/s0008_string_to_integer_atoi/Solution.scala +++ b/src/main/scala/g0001_0100/s0008_string_to_integer_atoi/Solution.scala @@ -1,6 +1,7 @@ package g0001_0100.s0008_string_to_integer_atoi -// #Medium #Top_Interview_Questions #String #2023_11_09_Time_441_ms_(100.00%)_Space_54.7_MB_(67.86%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2023_11_09_Time_441_ms_(100.00%)_Space_54.7_MB_(67.86%) object Solution { @SuppressWarnings(Array("scala:S3776")) diff --git a/src/main/scala/g0001_0100/s0009_palindrome_number/Solution.scala b/src/main/scala/g0001_0100/s0009_palindrome_number/Solution.scala index 46083010..9dfb27d7 100644 --- a/src/main/scala/g0001_0100/s0009_palindrome_number/Solution.scala +++ b/src/main/scala/g0001_0100/s0009_palindrome_number/Solution.scala @@ -1,6 +1,7 @@ package g0001_0100.s0009_palindrome_number -// #Easy #Math #Udemy_Integers #2023_11_09_Time_453_ms_(99.49%)_Space_53.3_MB_(79.49%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) +// #2023_11_09_Time_453_ms_(99.49%)_Space_53.3_MB_(79.49%) object Solution { def isPalindrome(x: Int): Boolean = { diff --git a/src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala b/src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala index db434b83..8602b036 100644 --- a/src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala +++ b/src/main/scala/g0001_0100/s0010_regular_expression_matching/Solution.scala @@ -1,8 +1,7 @@ package 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_10_29_Time_459_ms_(75.00%)_Space_54.4_MB_(100.00%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2023_10_29_Time_459_ms_(75.00%)_Space_54.4_MB_(100.00%) object Solution { private var cache: Array[Array[Option[Boolean]]] = Array.ofDim[Option[Boolean]](0, 0) diff --git a/src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala b/src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala index 98a3d3ab..db51f1b6 100644 --- a/src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala +++ b/src/main/scala/g0001_0100/s0011_container_with_most_water/Solution.scala @@ -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 #Big_O_Time_O(n)_Space_O(1) -// #2023_10_29_Time_683_ms_(99.13%)_Space_76.3_MB_(73.04%) +// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers +// #Big_O_Time_O(n)_Space_O(1) #2023_10_29_Time_683_ms_(99.13%)_Space_76.3_MB_(73.04%) object Solution { def maxArea(height: Array[Int]): Int = { diff --git a/src/main/scala/g0001_0100/s0015_3sum/Solution.scala b/src/main/scala/g0001_0100/s0015_3sum/Solution.scala index 14737308..f620bb92 100644 --- a/src/main/scala/g0001_0100/s0015_3sum/Solution.scala +++ b/src/main/scala/g0001_0100/s0015_3sum/Solution.scala @@ -2,7 +2,8 @@ package 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_10_29_Time_721_ms_(95.24%)_Space_66.4_MB_(91.67%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2023_10_29_Time_721_ms_(95.24%)_Space_66.4_MB_(91.67%) object Solution { @SuppressWarnings(Array("scala:S3776")) diff --git a/src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala b/src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala index 8d8427ef..ee4a7cca 100644 --- a/src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala +++ b/src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.scala @@ -1,8 +1,9 @@ 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 -// #Big_O_Time_O(4^n)_Space_O(n) #2023_10_29_Time_459_ms_(58.54%)_Space_54_MB_(92.68%) +// #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_10_29_Time_459_ms_(58.54%)_Space_54_MB_(92.68%) import scala.collection.mutable.ListBuffer diff --git a/src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala b/src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala index 48c18c4a..d0f991e0 100644 --- a/src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala +++ b/src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala @@ -1,8 +1,8 @@ package 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_10_29_Time_492_ms_(52.63%)_Space_57_MB_(50.88%) +// #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_10_29_Time_492_ms_(52.63%)_Space_57_MB_(50.88%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala b/src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala index c55cd330..babe8277 100644 --- a/src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala +++ b/src/main/scala/g0001_0100/s0020_valid_parentheses/Solution.scala @@ -1,8 +1,8 @@ package 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) -// #2024_06_01_Time_587_ms_(69.29%)_Space_58.3_MB_(60.63%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_06_01_Time_587_ms_(69.29%)_Space_58.3_MB_(60.63%) import scala.collection.mutable.Stack import scala.util.control.Breaks._ diff --git a/src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala b/src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala index 4e6be14e..60844826 100644 --- a/src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala +++ b/src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala @@ -2,8 +2,8 @@ package 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_10_29_Time_480_ms_(89.72%)_Space_56.7_MB_(93.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_10_29_Time_480_ms_(89.72%)_Space_56.7_MB_(93.46%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala b/src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala index a0cfbd80..6cdf8e14 100644 --- a/src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala +++ b/src/main/scala/g0001_0100/s0022_generate_parentheses/Solution.scala @@ -2,7 +2,8 @@ package 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_10_29_Time_380_ms_(100.00%)_Space_53.4_MB_(84.85%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2023_10_29_Time_380_ms_(100.00%)_Space_53.4_MB_(84.85%) import scala.collection.mutable.ListBuffer diff --git a/src/main/scala/g0001_0100/s0023_merge_k_sorted_lists/Solution.scala b/src/main/scala/g0001_0100/s0023_merge_k_sorted_lists/Solution.scala index c9aceb34..97ae6c5d 100644 --- a/src/main/scala/g0001_0100/s0023_merge_k_sorted_lists/Solution.scala +++ b/src/main/scala/g0001_0100/s0023_merge_k_sorted_lists/Solution.scala @@ -1,7 +1,8 @@ package 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)) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) // #2023_10_30_Time_549_ms_(94.74%)_Space_59.6_MB_(89.47%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.scala b/src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.scala index 40d46a94..020f48d2 100644 --- a/src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.scala +++ b/src/main/scala/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.scala @@ -1,7 +1,7 @@ package 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_10_30_Time_520_ms_(80.00%)_Space_58_MB_(50.00%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.scala b/src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.scala index 81586c45..a5e27035 100644 --- a/src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.scala +++ b/src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.scala @@ -2,7 +2,7 @@ package 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) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) // #2023_10_30_Time_453_ms_(91.53%)_Space_54.9_MB_(49.15%) object Solution { diff --git a/src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.scala b/src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.scala index 98f101fe..6d6dcadc 100644 --- a/src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.scala +++ b/src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.scala @@ -1,8 +1,8 @@ package 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_10_30_Time_478_ms_(97.85%)_Space_58.1_MB_(5.38%) +// #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_10_30_Time_478_ms_(97.85%)_Space_58.1_MB_(5.38%) object Solution { def searchRange(nums: Array[Int], target: Int): Array[Int] = { diff --git a/src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala b/src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala index ddf6015e..f74fa041 100644 --- a/src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala +++ b/src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala @@ -1,7 +1,7 @@ package 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_10_30_Time_466_ms_(87.04%)_Space_55.1_MB_(35.19%) object Solution { diff --git a/src/main/scala/g0001_0100/s0039_combination_sum/Solution.scala b/src/main/scala/g0001_0100/s0039_combination_sum/Solution.scala index 6eb8d861..40dfbdf9 100644 --- a/src/main/scala/g0001_0100/s0039_combination_sum/Solution.scala +++ b/src/main/scala/g0001_0100/s0039_combination_sum/Solution.scala @@ -2,7 +2,8 @@ package 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_10_30_Time_488_ms_(97.50%)_Space_55.2_MB_(97.50%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2023_10_30_Time_488_ms_(97.50%)_Space_55.2_MB_(97.50%) import scala.collection.mutable.ListBuffer diff --git a/src/main/scala/g0001_0100/s0042_trapping_rain_water/Solution.scala b/src/main/scala/g0001_0100/s0042_trapping_rain_water/Solution.scala index 6a4a8824..49f61bef 100644 --- a/src/main/scala/g0001_0100/s0042_trapping_rain_water/Solution.scala +++ b/src/main/scala/g0001_0100/s0042_trapping_rain_water/Solution.scala @@ -2,7 +2,8 @@ package 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_10_31_Time_521_ms_(87.88%)_Space_58_MB_(24.24%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_10_31_Time_521_ms_(87.88%)_Space_58_MB_(24.24%) object Solution { def trap(height: Array[Int]): Int = { diff --git a/src/main/scala/g0001_0100/s0045_jump_game_ii/Solution.scala b/src/main/scala/g0001_0100/s0045_jump_game_ii/Solution.scala index e3eee4f6..f5a94647 100644 --- a/src/main/scala/g0001_0100/s0045_jump_game_ii/Solution.scala +++ b/src/main/scala/g0001_0100/s0045_jump_game_ii/Solution.scala @@ -2,7 +2,8 @@ package 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_06_01_Time_653_ms_(83.87%)_Space_58.6_MB_(87.10%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_01_Time_653_ms_(83.87%)_Space_58.6_MB_(87.10%) object Solution { def jump(nums: Array[Int]): Int = { diff --git a/src/main/scala/g0001_0100/s0046_permutations/Solution.scala b/src/main/scala/g0001_0100/s0046_permutations/Solution.scala index a454fff9..a268b6dc 100644 --- a/src/main/scala/g0001_0100/s0046_permutations/Solution.scala +++ b/src/main/scala/g0001_0100/s0046_permutations/Solution.scala @@ -2,7 +2,7 @@ package 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!) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) // #2023_10_31_Time_470_ms_(92.31%)_Space_56.6_MB_(41.03%) object Solution { diff --git a/src/main/scala/g0001_0100/s0048_rotate_image/Solution.scala b/src/main/scala/g0001_0100/s0048_rotate_image/Solution.scala index c8fa47db..006c7a30 100644 --- a/src/main/scala/g0001_0100/s0048_rotate_image/Solution.scala +++ b/src/main/scala/g0001_0100/s0048_rotate_image/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_10_31_Time_472_ms_(66.67%)_Space_55.3_MB_(20.83%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2023_10_31_Time_472_ms_(66.67%)_Space_55.3_MB_(20.83%) object Solution { def rotate(matrix: Array[Array[Int]]): Unit = { diff --git a/src/main/scala/g0001_0100/s0049_group_anagrams/Solution.scala b/src/main/scala/g0001_0100/s0049_group_anagrams/Solution.scala index 4fc8265a..c5de2f33 100644 --- a/src/main/scala/g0001_0100/s0049_group_anagrams/Solution.scala +++ b/src/main/scala/g0001_0100/s0049_group_anagrams/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_10_31_Time_618_ms_(91.67%)_Space_61.7_MB_(51.85%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2023_10_31_Time_618_ms_(91.67%)_Space_61.7_MB_(51.85%) import scala.collection.mutable.{ArrayBuffer, Map} diff --git a/src/main/scala/g0001_0100/s0053_maximum_subarray/Solution.scala b/src/main/scala/g0001_0100/s0053_maximum_subarray/Solution.scala index fa459ed7..d84f5d32 100644 --- a/src/main/scala/g0001_0100/s0053_maximum_subarray/Solution.scala +++ b/src/main/scala/g0001_0100/s0053_maximum_subarray/Solution.scala @@ -1,8 +1,8 @@ package 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_10_31_Time_766_ms_(84.95%)_Space_73.1_MB_(74.19%) object Solution { diff --git a/src/main/scala/g0001_0100/s0055_jump_game/Solution.scala b/src/main/scala/g0001_0100/s0055_jump_game/Solution.scala index 8de065f6..9ccf5620 100644 --- a/src/main/scala/g0001_0100/s0055_jump_game/Solution.scala +++ b/src/main/scala/g0001_0100/s0055_jump_game/Solution.scala @@ -2,7 +2,8 @@ package 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_06_01_Time_769_ms_(79.03%)_Space_59.8_MB_(50.00%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_01_Time_769_ms_(79.03%)_Space_59.8_MB_(50.00%) object Solution { def canJump(nums: Array[Int]): Boolean = { diff --git a/src/main/scala/g0001_0100/s0056_merge_intervals/Solution.scala b/src/main/scala/g0001_0100/s0056_merge_intervals/Solution.scala index 26077408..dae06cf6 100644 --- a/src/main/scala/g0001_0100/s0056_merge_intervals/Solution.scala +++ b/src/main/scala/g0001_0100/s0056_merge_intervals/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_10_31_Time_583_ms_(90.91%)_Space_60.2_MB_(90.91%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2023_10_31_Time_583_ms_(90.91%)_Space_60.2_MB_(90.91%) object Solution { def merge(intervals: Array[Array[Int]]): Array[Array[Int]] = { diff --git a/src/main/scala/g0001_0100/s0062_unique_paths/Solution.scala b/src/main/scala/g0001_0100/s0062_unique_paths/Solution.scala index d7ec6181..d3f307d7 100644 --- a/src/main/scala/g0001_0100/s0062_unique_paths/Solution.scala +++ b/src/main/scala/g0001_0100/s0062_unique_paths/Solution.scala @@ -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_10_31_Time_405_ms_(70.18%)_Space_52.2_MB_(42.11%) +// #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_10_31_Time_405_ms_(70.18%)_Space_52.2_MB_(42.11%) object Solution { def uniquePaths(m: Int, n: Int): Int = { diff --git a/src/main/scala/g0001_0100/s0064_minimum_path_sum/Solution.scala b/src/main/scala/g0001_0100/s0064_minimum_path_sum/Solution.scala index 1c346971..4a2fe371 100644 --- a/src/main/scala/g0001_0100/s0064_minimum_path_sum/Solution.scala +++ b/src/main/scala/g0001_0100/s0064_minimum_path_sum/Solution.scala @@ -1,8 +1,8 @@ package 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_11_02_Time_521_ms_(92.86%)_Space_59.9_MB_(21.43%) +// #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_02_Time_521_ms_(92.86%)_Space_59.9_MB_(21.43%) object Solution { def minPathSum(grid: Array[Array[Int]]): Int = { diff --git a/src/main/scala/g0001_0100/s0070_climbing_stairs/Solution.scala b/src/main/scala/g0001_0100/s0070_climbing_stairs/Solution.scala index 9003c1a6..a003227b 100644 --- a/src/main/scala/g0001_0100/s0070_climbing_stairs/Solution.scala +++ b/src/main/scala/g0001_0100/s0070_climbing_stairs/Solution.scala @@ -2,8 +2,8 @@ package 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) -// #2023_11_02_Time_369_ms_(98.32%)_Space_52_MB_(32.77%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2023_11_02_Time_369_ms_(98.32%)_Space_52_MB_(32.77%) object Solution { def climbStairs(n: Int): Int = { diff --git a/src/main/scala/g0001_0100/s0072_edit_distance/Solution.scala b/src/main/scala/g0001_0100/s0072_edit_distance/Solution.scala index df8735ea..e432b1b3 100644 --- a/src/main/scala/g0001_0100/s0072_edit_distance/Solution.scala +++ b/src/main/scala/g0001_0100/s0072_edit_distance/Solution.scala @@ -1,8 +1,8 @@ package 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_11_02_Time_487_ms_(100.00%)_Space_55.3_MB_(100.00%) object Solution { diff --git a/src/main/scala/g0001_0100/s0073_set_matrix_zeroes/Solution.scala b/src/main/scala/g0001_0100/s0073_set_matrix_zeroes/Solution.scala index 5bdd4f27..d622400d 100644 --- a/src/main/scala/g0001_0100/s0073_set_matrix_zeroes/Solution.scala +++ b/src/main/scala/g0001_0100/s0073_set_matrix_zeroes/Solution.scala @@ -1,7 +1,7 @@ package 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_11_02_Time_557_ms_(90.91%)_Space_57.7_MB_(36.36%) object Solution { diff --git a/src/main/scala/g0001_0100/s0074_search_a_2d_matrix/Solution.scala b/src/main/scala/g0001_0100/s0074_search_a_2d_matrix/Solution.scala index 359d8c79..464dc1dc 100644 --- a/src/main/scala/g0001_0100/s0074_search_a_2d_matrix/Solution.scala +++ b/src/main/scala/g0001_0100/s0074_search_a_2d_matrix/Solution.scala @@ -2,7 +2,7 @@ package 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) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) // #2023_11_02_Time_478_ms_(83.33%)_Space_55.4_MB_(29.17%) object Solution { diff --git a/src/main/scala/g0001_0100/s0076_minimum_window_substring/Solution.scala b/src/main/scala/g0001_0100/s0076_minimum_window_substring/Solution.scala index a24f367f..5f43c4e0 100644 --- a/src/main/scala/g0001_0100/s0076_minimum_window_substring/Solution.scala +++ b/src/main/scala/g0001_0100/s0076_minimum_window_substring/Solution.scala @@ -1,8 +1,8 @@ package 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_11_02_Time_453_ms_(100.00%)_Space_54.7_MB_(100.00%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2023_11_02_Time_453_ms_(100.00%)_Space_54.7_MB_(100.00%) object Solution { def minWindow(s: String, t: String): String = { diff --git a/src/main/scala/g0001_0100/s0079_word_search/Solution.scala b/src/main/scala/g0001_0100/s0079_word_search/Solution.scala index f2eaf950..fdda9133 100644 --- a/src/main/scala/g0001_0100/s0079_word_search/Solution.scala +++ b/src/main/scala/g0001_0100/s0079_word_search/Solution.scala @@ -1,8 +1,8 @@ package 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_06_01_Time_848_ms_(74.19%)_Space_59.5_MB_(66.67%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_06_01_Time_848_ms_(74.19%)_Space_59.5_MB_(66.67%) object Solution { private val directions = Array(Array(-1, 0), Array(1, 0), Array(0, -1), Array(0, 1)) diff --git a/src/main/scala/g0001_0100/s0096_unique_binary_search_trees/Solution.scala b/src/main/scala/g0001_0100/s0096_unique_binary_search_trees/Solution.scala index 18c3a77a..ed69e257 100644 --- a/src/main/scala/g0001_0100/s0096_unique_binary_search_trees/Solution.scala +++ b/src/main/scala/g0001_0100/s0096_unique_binary_search_trees/Solution.scala @@ -1,7 +1,7 @@ package 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_11_03_Time_403_ms_(66.67%)_Space_51.5_MB_(100.00%) object Solution { diff --git a/src/main/scala/g0001_0100/s0098_validate_binary_search_tree/Solution.scala b/src/main/scala/g0001_0100/s0098_validate_binary_search_tree/Solution.scala index 33c883ef..43118319 100644 --- a/src/main/scala/g0001_0100/s0098_validate_binary_search_tree/Solution.scala +++ b/src/main/scala/g0001_0100/s0098_validate_binary_search_tree/Solution.scala @@ -2,7 +2,7 @@ package 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)) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) // #2023_11_03_Time_507_ms_(70.21%)_Space_57_MB_(93.62%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0101_symmetric_tree/Solution.scala b/src/main/scala/g0101_0200/s0101_symmetric_tree/Solution.scala index fbdacb65..3f604444 100644 --- a/src/main/scala/g0101_0200/s0101_symmetric_tree/Solution.scala +++ b/src/main/scala/g0101_0200/s0101_symmetric_tree/Solution.scala @@ -2,7 +2,8 @@ package 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)) #2023_11_03_Time_454_ms_(90.38%)_Space_57.2_MB_(28.85%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2023_11_03_Time_454_ms_(90.38%)_Space_57.2_MB_(28.85%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.scala b/src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.scala index 7b699d73..a6c03341 100644 --- a/src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.scala +++ b/src/main/scala/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_11_03_Time_522_ms_(83.33%)_Space_57.8_MB_(54.17%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2023_11_03_Time_522_ms_(83.33%)_Space_57.8_MB_(54.17%) import com_github_leetcode.TreeNode import scala.collection.mutable.{ListBuffer, Queue} diff --git a/src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.scala b/src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.scala index e9b23c39..c18da251 100644 --- a/src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.scala +++ b/src/main/scala/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.scala @@ -1,9 +1,10 @@ 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 -// #Big_O_Time_O(N)_Space_O(H) #2023_11_03_Time_472_ms_(90.83%)_Space_57_MB_(67.89%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2023_11_03_Time_472_ms_(90.83%)_Space_57_MB_(67.89%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.scala b/src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.scala index 24d15792..15e70051 100644 --- a/src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.scala +++ b/src/main/scala/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.scala @@ -1,8 +1,8 @@ package 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_11_03_Time_564_ms_(91.67%)_Space_58.5_MB_(58.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_11_03_Time_564_ms_(91.67%)_Space_58.5_MB_(58.33%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.scala b/src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.scala index 8d22049a..69ed4957 100644 --- a/src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.scala +++ b/src/main/scala/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.scala @@ -1,7 +1,7 @@ package 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_11_03_Time_491_ms_(54.17%)_Space_57.5_MB_(41.67%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.scala b/src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.scala index b09991c4..c5c58866 100644 --- a/src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.scala +++ b/src/main/scala/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_11_03_Time_762_ms_(98.45%)_Space_68.4_MB_(71.65%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2023_11_03_Time_762_ms_(98.45%)_Space_68.4_MB_(71.65%) object Solution { def maxProfit(prices: Array[Int]): Int = { diff --git a/src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.scala b/src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.scala index c104d577..0396d52f 100644 --- a/src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.scala +++ b/src/main/scala/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.scala @@ -1,8 +1,8 @@ package 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_11_03_Time_523_ms_(89.47%)_Space_57.9_MB_(73.68%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2023_11_03_Time_523_ms_(89.47%)_Space_57.9_MB_(73.68%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0101_0200/s0128_longest_consecutive_sequence/Solution.scala b/src/main/scala/g0101_0200/s0128_longest_consecutive_sequence/Solution.scala index 4ec0c282..a9d1b088 100644 --- a/src/main/scala/g0101_0200/s0128_longest_consecutive_sequence/Solution.scala +++ b/src/main/scala/g0101_0200/s0128_longest_consecutive_sequence/Solution.scala @@ -1,7 +1,8 @@ package 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_11_04_Time_708_ms_(100.00%)_Space_71.7_MB_(94.55%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2023_11_04_Time_708_ms_(100.00%)_Space_71.7_MB_(94.55%) import scala.util.Sorting.quickSort diff --git a/src/main/scala/g0101_0200/s0136_single_number/Solution.scala b/src/main/scala/g0101_0200/s0136_single_number/Solution.scala index de672866..40765e20 100644 --- a/src/main/scala/g0101_0200/s0136_single_number/Solution.scala +++ b/src/main/scala/g0101_0200/s0136_single_number/Solution.scala @@ -1,7 +1,8 @@ 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 +// #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_04_Time_530_ms_(78.57%)_Space_56.1_MB_(44.05%) object Solution { diff --git a/src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer/Solution.scala b/src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer/Solution.scala index 62f5bd18..05521bf3 100644 --- a/src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer/Solution.scala +++ b/src/main/scala/g0101_0200/s0138_copy_list_with_random_pointer/Solution.scala @@ -1,8 +1,8 @@ package 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_11_04_Time_477_ms_(96.00%)_Space_56.6_MB_(61.00%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2023_11_04_Time_477_ms_(96.00%)_Space_56.6_MB_(61.00%) import com_github_leetcode.random.Node diff --git a/src/main/scala/g0101_0200/s0139_word_break/Solution.scala b/src/main/scala/g0101_0200/s0139_word_break/Solution.scala index 40c1bd54..dadc340d 100644 --- a/src/main/scala/g0101_0200/s0139_word_break/Solution.scala +++ b/src/main/scala/g0101_0200/s0139_word_break/Solution.scala @@ -2,8 +2,8 @@ package 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) -// #2023_11_04_Time_482_ms_(66.67%)_Space_57.5_MB_(6.67%) +// #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_04_Time_482_ms_(66.67%)_Space_57.5_MB_(6.67%) object Solution { def wordBreak(s: String, wordDict: List[String]): Boolean = { diff --git a/src/main/scala/g0101_0200/s0141_linked_list_cycle/Solution.scala b/src/main/scala/g0101_0200/s0141_linked_list_cycle/Solution.scala index f2461df5..06581bf5 100644 --- a/src/main/scala/g0101_0200/s0141_linked_list_cycle/Solution.scala +++ b/src/main/scala/g0101_0200/s0141_linked_list_cycle/Solution.scala @@ -1,8 +1,8 @@ package 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_11_04_Time_503_ms_(84.25%)_Space_55.9_MB_(33.07%) +// #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_04_Time_503_ms_(84.25%)_Space_55.9_MB_(33.07%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala b/src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala index a2741974..af67a046 100644 --- a/src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala +++ b/src/main/scala/g0101_0200/s0146_lru_cache/LRUCache.scala @@ -1,8 +1,8 @@ package 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_11_04_Time_1590_ms_(85.19%)_Space_178.7_MB_(14.81%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2023_11_04_Time_1590_ms_(85.19%)_Space_178.7_MB_(14.81%) class LRUCache(capacity: Int) { case class LRUCacheNode(key: Int, var value: Int, var prev: LRUCacheNode = null, var next: LRUCacheNode = null) diff --git a/src/main/scala/g0101_0200/s0148_sort_list/Solution.scala b/src/main/scala/g0101_0200/s0148_sort_list/Solution.scala index f9857cf9..325195ad 100644 --- a/src/main/scala/g0101_0200/s0148_sort_list/Solution.scala +++ b/src/main/scala/g0101_0200/s0148_sort_list/Solution.scala @@ -1,8 +1,8 @@ package 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_11_04_Time_745_ms_(75.00%)_Space_68.2_MB_(75.00%) +// #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_04_Time_745_ms_(75.00%)_Space_68.2_MB_(75.00%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.scala b/src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.scala index e27ea2c0..d4900e65 100644 --- a/src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.scala +++ b/src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.scala @@ -1,8 +1,8 @@ package 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_11_05_Time_457_ms_(78.79%)_Space_55.5_MB_(6.06%) +// #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_05_Time_457_ms_(78.79%)_Space_55.5_MB_(6.06%) object Solution { def findMin(nums: Array[Int]): Int = { diff --git a/src/main/scala/g0101_0200/s0155_min_stack/MinStack.scala b/src/main/scala/g0101_0200/s0155_min_stack/MinStack.scala index 4bc70e4b..5d15b2e5 100644 --- a/src/main/scala/g0101_0200/s0155_min_stack/MinStack.scala +++ b/src/main/scala/g0101_0200/s0155_min_stack/MinStack.scala @@ -1,8 +1,8 @@ package 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_11_05_Time_566_ms_(90.91%)_Space_60.6_MB_(84.85%) class MinStack { diff --git a/src/main/scala/g0101_0200/s0169_majority_element/Solution.scala b/src/main/scala/g0101_0200/s0169_majority_element/Solution.scala index 203794d0..2bb45650 100644 --- a/src/main/scala/g0101_0200/s0169_majority_element/Solution.scala +++ b/src/main/scala/g0101_0200/s0169_majority_element/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_11_05_Time_538_ms_(92.57%)_Space_59.7_MB_(52.70%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2023_11_05_Time_538_ms_(92.57%)_Space_59.7_MB_(52.70%) object Solution { def majorityElement(nums: Array[Int]): Int = { diff --git a/src/main/scala/g0101_0200/s0189_rotate_array/Solution.scala b/src/main/scala/g0101_0200/s0189_rotate_array/Solution.scala index d379d436..2b7bf69e 100644 --- a/src/main/scala/g0101_0200/s0189_rotate_array/Solution.scala +++ b/src/main/scala/g0101_0200/s0189_rotate_array/Solution.scala @@ -1,8 +1,8 @@ package 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_11_05_Time_600_ms_(96.59%)_Space_73.7_MB_(17.05%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2023_11_05_Time_600_ms_(96.59%)_Space_73.7_MB_(17.05%) object Solution { private def reverse(nums: Array[Int], l: Int, r: Int): Unit = { diff --git a/src/main/scala/g0101_0200/s0198_house_robber/Solution.scala b/src/main/scala/g0101_0200/s0198_house_robber/Solution.scala index f09fc4a5..d5f7e925 100644 --- a/src/main/scala/g0101_0200/s0198_house_robber/Solution.scala +++ b/src/main/scala/g0101_0200/s0198_house_robber/Solution.scala @@ -1,9 +1,9 @@ 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 -// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Big_O_Time_O(n)_Space_O(n) -// #2023_11_05_Time_426_ms_(98.04%)_Space_54.8_MB_(49.02%) +// #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_05_Time_426_ms_(98.04%)_Space_54.8_MB_(49.02%) object Solution { def rob(nums: Array[Int]): Int = { diff --git a/src/main/scala/g0101_0200/s0200_number_of_islands/Solution.scala b/src/main/scala/g0101_0200/s0200_number_of_islands/Solution.scala index d3213699..4bcddcf2 100644 --- a/src/main/scala/g0101_0200/s0200_number_of_islands/Solution.scala +++ b/src/main/scala/g0101_0200/s0200_number_of_islands/Solution.scala @@ -4,7 +4,8 @@ package 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) #2023_11_05_Time_537_ms_(93.18%)_Space_63.1_MB_(52.27%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2023_11_05_Time_537_ms_(93.18%)_Space_63.1_MB_(52.27%) object Solution { def numIslands(grid: Array[Array[Char]]): Int = { diff --git a/src/main/scala/g0201_0300/s0206_reverse_linked_list/Solution.scala b/src/main/scala/g0201_0300/s0206_reverse_linked_list/Solution.scala index 4abfa8cf..1a4a1b26 100644 --- a/src/main/scala/g0201_0300/s0206_reverse_linked_list/Solution.scala +++ b/src/main/scala/g0201_0300/s0206_reverse_linked_list/Solution.scala @@ -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) -// #2023_11_05_Time_474_ms_(87.50%)_Space_57.4_MB_(18.06%) +// #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_05_Time_474_ms_(87.50%)_Space_57.4_MB_(18.06%) import com_github_leetcode.ListNode diff --git a/src/main/scala/g0201_0300/s0207_course_schedule/Solution.scala b/src/main/scala/g0201_0300/s0207_course_schedule/Solution.scala index a3049a20..f6133be7 100644 --- a/src/main/scala/g0201_0300/s0207_course_schedule/Solution.scala +++ b/src/main/scala/g0201_0300/s0207_course_schedule/Solution.scala @@ -1,8 +1,8 @@ package 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_06_02_Time_720_ms_(91.11%)_Space_61.7_MB_(75.56%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_06_02_Time_720_ms_(91.11%)_Space_61.7_MB_(75.56%) object Solution { def canFinish(numCourses: Int, prerequisites: Array[Array[Int]]): Boolean = { diff --git a/src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree/Trie.scala b/src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree/Trie.scala index 3c93a074..cd6bbb2a 100644 --- a/src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree/Trie.scala +++ b/src/main/scala/g0201_0300/s0208_implement_trie_prefix_tree/Trie.scala @@ -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 +// #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_05_Time_610_ms_(100.00%)_Space_67.5_MB_(64.00%) diff --git a/src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.scala b/src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.scala index 38cde5db..651d658e 100644 --- a/src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.scala +++ b/src/main/scala/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.scala @@ -1,7 +1,8 @@ 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 +// #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_07_Time_799_ms_(95.45%)_Space_77.8_MB_(62.12%) import scala.util.Sorting diff --git a/src/main/scala/g0201_0300/s0221_maximal_square/Solution.scala b/src/main/scala/g0201_0300/s0221_maximal_square/Solution.scala index f4307ca8..d6f28c93 100644 --- a/src/main/scala/g0201_0300/s0221_maximal_square/Solution.scala +++ b/src/main/scala/g0201_0300/s0221_maximal_square/Solution.scala @@ -1,7 +1,7 @@ package 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_11_07_Time_626_ms_(100.00%)_Space_65.3_MB_(100.00%) object Solution { diff --git a/src/main/scala/g0201_0300/s0226_invert_binary_tree/Solution.scala b/src/main/scala/g0201_0300/s0226_invert_binary_tree/Solution.scala index 395bb87b..1cec19f8 100644 --- a/src/main/scala/g0201_0300/s0226_invert_binary_tree/Solution.scala +++ b/src/main/scala/g0201_0300/s0226_invert_binary_tree/Solution.scala @@ -2,7 +2,8 @@ package 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) #2023_11_07_Time_421_ms_(97.33%)_Space_58.9_MB_(6.67%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2023_11_07_Time_421_ms_(97.33%)_Space_58.9_MB_(6.67%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.scala b/src/main/scala/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.scala index adf3efe1..1b8236a8 100644 --- a/src/main/scala/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.scala +++ b/src/main/scala/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.scala @@ -1,8 +1,9 @@ package 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_11_07_Time_503_ms_(91.30%)_Space_57.9_MB_(60.87%) +// #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_07_Time_503_ms_(91.30%)_Space_57.9_MB_(60.87%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.scala b/src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.scala index 18240e3f..c2e89194 100644 --- a/src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.scala +++ b/src/main/scala/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.scala @@ -1,7 +1,8 @@ package 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_11_07_Time_539_ms_(70.73%)_Space_59.3_MB_(29.27%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0201_0300/s0238_product_of_array_except_self/Solution.scala b/src/main/scala/g0201_0300/s0238_product_of_array_except_self/Solution.scala index 5abf8bb0..d0d2ed53 100644 --- a/src/main/scala/g0201_0300/s0238_product_of_array_except_self/Solution.scala +++ b/src/main/scala/g0201_0300/s0238_product_of_array_except_self/Solution.scala @@ -1,8 +1,8 @@ package 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_11_07_Time_634_ms_(79.44%)_Space_65.6_MB_(75.70%) +// #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_07_Time_634_ms_(79.44%)_Space_65.6_MB_(75.70%) object Solution { def productExceptSelf(nums: Array[Int]): Array[Int] = { diff --git a/src/main/scala/g0201_0300/s0239_sliding_window_maximum/Solution.scala b/src/main/scala/g0201_0300/s0239_sliding_window_maximum/Solution.scala index d12a401b..76b7420f 100644 --- a/src/main/scala/g0201_0300/s0239_sliding_window_maximum/Solution.scala +++ b/src/main/scala/g0201_0300/s0239_sliding_window_maximum/Solution.scala @@ -1,7 +1,7 @@ package 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_11_07_Time_1149_ms_(86.67%)_Space_83.5_MB_(46.67%) object Solution { diff --git a/src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.scala b/src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.scala index 515bccc8..25bfe78a 100644 --- a/src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.scala +++ b/src/main/scala/g0201_0300/s0240_search_a_2d_matrix_ii/Solution.scala @@ -1,8 +1,8 @@ package 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_11_07_Time_579_ms_(66.67%)_Space_65.2_MB_(33.33%) +// #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_07_Time_579_ms_(66.67%)_Space_65.2_MB_(33.33%) object Solution { def searchMatrix(matrix: Array[Array[Int]], target: Int): Boolean = { diff --git a/src/main/scala/g0201_0300/s0283_move_zeroes/Solution.scala b/src/main/scala/g0201_0300/s0283_move_zeroes/Solution.scala index ca6a3c36..cde46c1e 100644 --- a/src/main/scala/g0201_0300/s0283_move_zeroes/Solution.scala +++ b/src/main/scala/g0201_0300/s0283_move_zeroes/Solution.scala @@ -1,6 +1,6 @@ package 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_11_07_Time_572_ms_(86.11%)_Space_56.1_MB_(47.22%) diff --git a/src/main/scala/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.scala b/src/main/scala/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.scala index c69cade6..e1338d65 100644 --- a/src/main/scala/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.scala +++ b/src/main/scala/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.scala @@ -1,7 +1,7 @@ package 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_11_08_Time_1690_ms_(83.33%)_Space_96.2_MB_(8.33%) import scala.collection.mutable diff --git a/src/main/scala/g0201_0300/s0300_longest_increasing_subsequence/Solution.scala b/src/main/scala/g0201_0300/s0300_longest_increasing_subsequence/Solution.scala index f6c0421a..91e778fd 100644 --- a/src/main/scala/g0201_0300/s0300_longest_increasing_subsequence/Solution.scala +++ b/src/main/scala/g0201_0300/s0300_longest_increasing_subsequence/Solution.scala @@ -1,8 +1,8 @@ package 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_11_08_Time_522_ms_(88.89%)_Space_55.5_MB_(88.89%) object Solution { diff --git a/src/main/scala/g0301_0400/s0322_coin_change/Solution.scala b/src/main/scala/g0301_0400/s0322_coin_change/Solution.scala index e8503817..db7e1ccd 100644 --- a/src/main/scala/g0301_0400/s0322_coin_change/Solution.scala +++ b/src/main/scala/g0301_0400/s0322_coin_change/Solution.scala @@ -1,8 +1,8 @@ package 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_11_08_Time_533_ms_(84.21%)_Space_55.7_MB_(84.21%) object Solution { diff --git a/src/main/scala/g0301_0400/s0338_counting_bits/Solution.scala b/src/main/scala/g0301_0400/s0338_counting_bits/Solution.scala index e747716e..08f609b4 100644 --- a/src/main/scala/g0301_0400/s0338_counting_bits/Solution.scala +++ b/src/main/scala/g0301_0400/s0338_counting_bits/Solution.scala @@ -1,7 +1,8 @@ package 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_11_08_Time_447_ms_(92.68%)_Space_54.6_MB_(43.90%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2023_11_08_Time_447_ms_(92.68%)_Space_54.6_MB_(43.90%) object Solution { def countBits(num: Int): Array[Int] = { diff --git a/src/main/scala/g0301_0400/s0347_top_k_frequent_elements/Solution.scala b/src/main/scala/g0301_0400/s0347_top_k_frequent_elements/Solution.scala index 5b353662..22a531bf 100644 --- a/src/main/scala/g0301_0400/s0347_top_k_frequent_elements/Solution.scala +++ b/src/main/scala/g0301_0400/s0347_top_k_frequent_elements/Solution.scala @@ -1,9 +1,8 @@ package 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_11_08_Time_589_ms_(93.24%)_Space_59.4_MB_(72.97%) +// #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_08_Time_589_ms_(93.24%)_Space_59.4_MB_(72.97%) import scala.collection.mutable diff --git a/src/main/scala/g0301_0400/s0394_decode_string/Solution.scala b/src/main/scala/g0301_0400/s0394_decode_string/Solution.scala index 6148be3d..220ee230 100644 --- a/src/main/scala/g0301_0400/s0394_decode_string/Solution.scala +++ b/src/main/scala/g0301_0400/s0394_decode_string/Solution.scala @@ -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) #2023_11_09_Time_449_ms_(50.00%)_Space_56.5_MB_(45.45%) +// #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_09_Time_449_ms_(50.00%)_Space_56.5_MB_(45.45%) object Solution { def decodeString(s: String): String = { diff --git a/src/main/scala/g0401_0500/s0437_path_sum_iii/Solution.scala b/src/main/scala/g0401_0500/s0437_path_sum_iii/Solution.scala index 9ab5511d..39f1ecfb 100644 --- a/src/main/scala/g0401_0500/s0437_path_sum_iii/Solution.scala +++ b/src/main/scala/g0401_0500/s0437_path_sum_iii/Solution.scala @@ -1,7 +1,8 @@ package 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) #2023_11_08_Time_498_ms_(90.91%)_Space_57.3_MB_(72.73%) +// #Medium #Top_100_Liked_Questions #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_08_Time_498_ms_(90.91%)_Space_57.3_MB_(72.73%) import com_github_leetcode.TreeNode diff --git a/src/main/scala/g0401_0500/s0494_target_sum/Solution.scala b/src/main/scala/g0401_0500/s0494_target_sum/Solution.scala index a7f84252..c0664cf7 100644 --- a/src/main/scala/g0401_0500/s0494_target_sum/Solution.scala +++ b/src/main/scala/g0401_0500/s0494_target_sum/Solution.scala @@ -1,7 +1,6 @@ package 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_11_09_Time_494_ms_(100.00%)_Space_55.2_MB_(33.33%) object Solution { diff --git a/src/main/scala/g0601_0700/s0647_palindromic_substrings/Solution.scala b/src/main/scala/g0601_0700/s0647_palindromic_substrings/Solution.scala index 4413cc05..0c1d4165 100644 --- a/src/main/scala/g0601_0700/s0647_palindromic_substrings/Solution.scala +++ b/src/main/scala/g0601_0700/s0647_palindromic_substrings/Solution.scala @@ -1,6 +1,6 @@ package 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_11_09_Time_423_ms_(100.00%)_Space_54.7_MB_(81.82%) object Solution { diff --git a/src/main/scala/g0701_0800/s0739_daily_temperatures/Solution.scala b/src/main/scala/g0701_0800/s0739_daily_temperatures/Solution.scala index 129c5e12..4c0b6fa2 100644 --- a/src/main/scala/g0701_0800/s0739_daily_temperatures/Solution.scala +++ b/src/main/scala/g0701_0800/s0739_daily_temperatures/Solution.scala @@ -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) #2023_11_09_Time_931_ms_(97.30%)_Space_69.2_MB_(97.30%) +// #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_09_Time_931_ms_(97.30%)_Space_69.2_MB_(97.30%) object Solution { def dailyTemperatures(temperatures: Array[Int]): Array[Int] = { diff --git a/src/main/scala/g1101_1200/s1143_longest_common_subsequence/Solution.scala b/src/main/scala/g1101_1200/s1143_longest_common_subsequence/Solution.scala index de90da46..0b7e41c3 100644 --- a/src/main/scala/g1101_1200/s1143_longest_common_subsequence/Solution.scala +++ b/src/main/scala/g1101_1200/s1143_longest_common_subsequence/Solution.scala @@ -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) // #2023_11_09_Time_507_ms_(100.00%)_Space_62.6_MB_(41.67%) diff --git a/src/main/swift/g0001_0100/s0001_two_sum/Solution.swift b/src/main/swift/g0001_0100/s0001_two_sum/Solution.swift index 672d3264..6fd8dd9e 100644 --- a/src/main/swift/g0001_0100/s0001_two_sum/Solution.swift +++ b/src/main/swift/g0001_0100/s0001_two_sum/Solution.swift @@ -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_17_Time_22_ms_(65.41%)_Space_16_MB_(83.22%) class Solution { diff --git a/src/main/swift/g0001_0100/s0002_add_two_numbers/Solution.swift b/src/main/swift/g0001_0100/s0002_add_two_numbers/Solution.swift index a27a6b78..d29cfa81 100644 --- a/src/main/swift/g0001_0100/s0002_add_two_numbers/Solution.swift +++ b/src/main/swift/g0001_0100/s0002_add_two_numbers/Solution.swift @@ -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_17_Time_17_ms_(76.59%)_Space_15.7_MB_(14.57%) +// #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_17_Time_17_ms_(76.59%)_Space_15.7_MB_(14.57%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.swift b/src/main/swift/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.swift index 542f98ab..f0fe33d5 100644 --- a/src/main/swift/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.swift +++ b/src/main/swift/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.swift @@ -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_17_Time_8_ms_(93.40%)_Space_16.6_MB_(54.36%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2024_06_17_Time_8_ms_(93.40%)_Space_16.6_MB_(54.36%) public class Solution { public func lengthOfLongestSubstring(_ s: String) -> Int { diff --git a/src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.swift b/src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.swift index 26f8fbd4..39fb39f7 100644 --- a/src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.swift +++ b/src/main/swift/g0001_0100/s0004_median_of_two_sorted_arrays/Solution.swift @@ -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_17_Time_26_ms_(94.07%)_Space_16_MB_(90.06%) +// #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_17_Time_26_ms_(94.07%)_Space_16_MB_(90.06%) public class Solution { public func findMedianSortedArrays(_ nums1: [Int], _ nums2: [Int]) -> Double { diff --git a/src/main/swift/g0001_0100/s0005_longest_palindromic_substring/Solution.swift b/src/main/swift/g0001_0100/s0005_longest_palindromic_substring/Solution.swift index 6da7262f..f0eb292a 100644 --- a/src/main/swift/g0001_0100/s0005_longest_palindromic_substring/Solution.swift +++ b/src/main/swift/g0001_0100/s0005_longest_palindromic_substring/Solution.swift @@ -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_17_Time_10_ms_(97.20%)_Space_16.5_MB_(62.80%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_06_17_Time_10_ms_(97.20%)_Space_16.5_MB_(62.80%) public class Solution { public func longestPalindrome(_ s: String) -> String { diff --git a/src/main/swift/g0001_0100/s0006_zigzag_conversion/Solution.swift b/src/main/swift/g0001_0100/s0006_zigzag_conversion/Solution.swift index 92804e4b..05ab4a93 100644 --- a/src/main/swift/g0001_0100/s0006_zigzag_conversion/Solution.swift +++ b/src/main/swift/g0001_0100/s0006_zigzag_conversion/Solution.swift @@ -1,4 +1,5 @@ -// #Medium #String #2024_06_19_Time_26_ms_(72.18%)_Space_16.6_MB_(44.74%) +// #Medium #String #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(n) +// #2024_06_19_Time_26_ms_(72.18%)_Space_16.6_MB_(44.74%) class Solution { func convert(_ s: String, _ numRows: Int) -> String { diff --git a/src/main/swift/g0001_0100/s0007_reverse_integer/Solution.swift b/src/main/swift/g0001_0100/s0007_reverse_integer/Solution.swift index fbf3a3f2..8ef06095 100644 --- a/src/main/swift/g0001_0100/s0007_reverse_integer/Solution.swift +++ b/src/main/swift/g0001_0100/s0007_reverse_integer/Solution.swift @@ -1,4 +1,4 @@ -// #Medium #Top_Interview_Questions #Math #Udemy_Integers +// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Big_O_Time_O(log10(x))_Space_O(1) // #2024_06_18_Time_0_ms_(100.00%)_Space_15.3_MB_(69.27%) class Solution { diff --git a/src/main/swift/g0001_0100/s0008_string_to_integer_atoi/Solution.swift b/src/main/swift/g0001_0100/s0008_string_to_integer_atoi/Solution.swift index 291b317d..5cd2a46f 100644 --- a/src/main/swift/g0001_0100/s0008_string_to_integer_atoi/Solution.swift +++ b/src/main/swift/g0001_0100/s0008_string_to_integer_atoi/Solution.swift @@ -1,4 +1,5 @@ -// #Medium #Top_Interview_Questions #String #2024_06_18_Time_0_ms_(100.00%)_Space_16.5_MB_(45.57%) +// #Medium #Top_Interview_Questions #String #Big_O_Time_O(n)_Space_O(n) +// #2024_06_18_Time_0_ms_(100.00%)_Space_16.5_MB_(45.57%) class Solution { func myAtoi(_ str: String) -> Int { diff --git a/src/main/swift/g0001_0100/s0009_palindrome_number/Solution.swift b/src/main/swift/g0001_0100/s0009_palindrome_number/Solution.swift index 82833404..3fa10a1f 100644 --- a/src/main/swift/g0001_0100/s0009_palindrome_number/Solution.swift +++ b/src/main/swift/g0001_0100/s0009_palindrome_number/Solution.swift @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2024_06_18_Time_12_ms_(94.81%)_Space_15.6_MB_(58.39%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math #Big_O_Time_O(log10(x))_Space_O(1) +// #2024_06_18_Time_12_ms_(94.81%)_Space_15.6_MB_(58.39%) class Solution { func isPalindrome(_ x: Int) -> Bool { diff --git a/src/main/swift/g0001_0100/s0011_container_with_most_water/Solution.swift b/src/main/swift/g0001_0100/s0011_container_with_most_water/Solution.swift index 8f9a7104..99d95a2c 100644 --- a/src/main/swift/g0001_0100/s0011_container_with_most_water/Solution.swift +++ b/src/main/swift/g0001_0100/s0011_container_with_most_water/Solution.swift @@ -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_18_Time_204_ms_(98.62%)_Space_19.4_MB_(60.00%) +// #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_18_Time_204_ms_(98.62%)_Space_19.4_MB_(60.00%) class Solution { func maxArea(_ height: [Int]) -> Int { diff --git a/src/main/swift/g0001_0100/s0015_3sum/Solution.swift b/src/main/swift/g0001_0100/s0015_3sum/Solution.swift index 317db6a1..423f503d 100644 --- a/src/main/swift/g0001_0100/s0015_3sum/Solution.swift +++ b/src/main/swift/g0001_0100/s0015_3sum/Solution.swift @@ -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_18_Time_129_ms_(99.77%)_Space_20.6_MB_(57.21%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2024_06_18_Time_129_ms_(99.77%)_Space_20.6_MB_(57.21%) class Solution { func threeSum(_ nums: [Int]) -> [[Int]] { diff --git a/src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.swift b/src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.swift index 6713d7fd..a75f6d40 100644 --- a/src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.swift +++ b/src/main/swift/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.swift @@ -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_18_Time_0_ms_(100.00%)_Space_16.3_MB_(72.66%) +// #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_18_Time_0_ms_(100.00%)_Space_16.3_MB_(72.66%) class Solution { func letterCombinations(_ digits: String) -> [String] { diff --git a/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.swift b/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.swift index 425360ea..9fef3bbd 100644 --- a/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.swift +++ b/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.swift @@ -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_18_Time_0_ms_(100.00%)_Space_15.5_MB_(48.03%) +// #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_18_Time_0_ms_(100.00%)_Space_15.5_MB_(48.03%) /** * Definition for singly-linked list. @@ -13,20 +13,20 @@ * } */ class Solution { - func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? { - guard ((head?.next) != nil), n > 0 else {return nil} + func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? { + guard ((head?.next) != nil), n > 0 else {return nil} var count = 0 - var current = head + var current = head while let currentNode = current{ count += 1 current = currentNode.next - } + } current = head - count = count - n + 1 - var prev: ListNode? - while let currentNode = current { - count -= 1 - if count == 0 { + count = count - n + 1 + var prev: ListNode? + while let currentNode = current { + count -= 1 + if count == 0 { if prev == nil { current = current?.next return current @@ -34,10 +34,10 @@ class Solution { prev?.next = current?.next } break - } + } prev = current - current = current?.next - } - return head + current = current?.next + } + return head } } diff --git a/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md b/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md index 7a948016..e79f3a9f 100644 --- a/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md +++ b/src/main/swift/g0001_0100/s0019_remove_nth_node_from_end_of_list/readme.md @@ -49,20 +49,20 @@ Here's the implementation: ```swift class Solution { - func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? { - guard ((head?.next) != nil), n > 0 else {return nil} + func removeNthFromEnd(_ head: ListNode?, _ n: Int) -> ListNode? { + guard ((head?.next) != nil), n > 0 else {return nil} var count = 0 - var current = head + var current = head while let currentNode = current{ count += 1 current = currentNode.next - } + } current = head - count = count - n + 1 - var prev: ListNode? - while let currentNode = current { - count -= 1 - if count == 0 { + count = count - n + 1 + var prev: ListNode? + while let currentNode = current { + count -= 1 + if count == 0 { if prev == nil { current = current?.next return current @@ -70,11 +70,11 @@ class Solution { prev?.next = current?.next } break - } + } prev = current - current = current?.next - } - return head + current = current?.next + } + return head } } ``` diff --git a/src/main/swift/g0001_0100/s0020_valid_parentheses/Solution.swift b/src/main/swift/g0001_0100/s0020_valid_parentheses/Solution.swift index 7cdf4266..ab404956 100644 --- a/src/main/swift/g0001_0100/s0020_valid_parentheses/Solution.swift +++ b/src/main/swift/g0001_0100/s0020_valid_parentheses/Solution.swift @@ -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_18_Time_0_ms_(100.00%)_Space_16.3_MB_(43.79%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2024_06_18_Time_0_ms_(100.00%)_Space_16.3_MB_(43.79%) class Solution { func isValid(_ s: String) -> Bool { diff --git a/src/main/swift/g0001_0100/s0021_merge_two_sorted_lists/Solution.swift b/src/main/swift/g0001_0100/s0021_merge_two_sorted_lists/Solution.swift index cb50c26a..1f012a63 100644 --- a/src/main/swift/g0001_0100/s0021_merge_two_sorted_lists/Solution.swift +++ b/src/main/swift/g0001_0100/s0021_merge_two_sorted_lists/Solution.swift @@ -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_18_Time_3_ms_(96.41%)_Space_15.9_MB_(6.39%) +// #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_18_Time_3_ms_(96.41%)_Space_15.9_MB_(6.39%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0001_0100/s0022_generate_parentheses/Solution.swift b/src/main/swift/g0001_0100/s0022_generate_parentheses/Solution.swift index afae9025..94a4625d 100644 --- a/src/main/swift/g0001_0100/s0022_generate_parentheses/Solution.swift +++ b/src/main/swift/g0001_0100/s0022_generate_parentheses/Solution.swift @@ -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_19_Time_4_ms_(93.36%)_Space_16.3_MB_(33.02%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2024_06_19_Time_4_ms_(93.36%)_Space_16.3_MB_(33.02%) class Solution { func generateParenthesis(_ n: Int) -> [String] { diff --git a/src/main/swift/g0001_0100/s0023_merge_k_sorted_lists/Solution.swift b/src/main/swift/g0001_0100/s0023_merge_k_sorted_lists/Solution.swift index 80710cc8..d93adb85 100644 --- a/src/main/swift/g0001_0100/s0023_merge_k_sorted_lists/Solution.swift +++ b/src/main/swift/g0001_0100/s0023_merge_k_sorted_lists/Solution.swift @@ -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_19_Time_25_ms_(94.57%)_Space_17.3_MB_(6.09%) +// #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_19_Time_25_ms_(94.57%)_Space_17.3_MB_(6.09%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.swift b/src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.swift index c9756a5a..c4247804 100644 --- a/src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.swift +++ b/src/main/swift/g0001_0100/s0025_reverse_nodes_in_k_group/Solution.swift @@ -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_19_Time_12_ms_(87.05%)_Space_15.9_MB_(48.20%) /** diff --git a/src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.swift b/src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.swift index a514459c..038000b4 100644 --- a/src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.swift +++ b/src/main/swift/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.swift @@ -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_19_Time_3_ms_(96.38%)_Space_15.5_MB_(64.61%) public class Solution { diff --git a/src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.swift b/src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.swift index ba007af2..7a036506 100644 --- a/src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.swift +++ b/src/main/swift/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.swift @@ -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_19_Time_11_ms_(92.41%)_Space_16.9_MB_(58.09%) +// #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_19_Time_11_ms_(92.41%)_Space_16.9_MB_(58.09%) public class Solution { public func searchRange(_ nums: [Int], _ target: Int) -> [Int] { diff --git a/src/main/swift/g0001_0100/s0035_search_insert_position/Solution.swift b/src/main/swift/g0001_0100/s0035_search_insert_position/Solution.swift index 1848c674..d5ca479a 100644 --- a/src/main/swift/g0001_0100/s0035_search_insert_position/Solution.swift +++ b/src/main/swift/g0001_0100/s0035_search_insert_position/Solution.swift @@ -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_19_Time_6_ms_(97.35%)_Space_15.5_MB_(88.56%) public class Solution { diff --git a/src/main/swift/g0001_0100/s0039_combination_sum/Solution.swift b/src/main/swift/g0001_0100/s0039_combination_sum/Solution.swift index 3f5ff9f6..58aac0ee 100644 --- a/src/main/swift/g0001_0100/s0039_combination_sum/Solution.swift +++ b/src/main/swift/g0001_0100/s0039_combination_sum/Solution.swift @@ -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_19_Time_8_ms_(90.77%)_Space_16_MB_(55.65%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2024_06_19_Time_8_ms_(90.77%)_Space_16_MB_(55.65%) public class Solution { public func combinationSum(_ coins: [Int], _ amount: Int) -> [[Int]] { diff --git a/src/main/swift/g0001_0100/s0042_trapping_rain_water/Solution.swift b/src/main/swift/g0001_0100/s0042_trapping_rain_water/Solution.swift index 429f6128..4b3d9fbd 100644 --- a/src/main/swift/g0001_0100/s0042_trapping_rain_water/Solution.swift +++ b/src/main/swift/g0001_0100/s0042_trapping_rain_water/Solution.swift @@ -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_23_Time_24_ms_(94.11%)_Space_16.2_MB_(12.42%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_23_Time_24_ms_(94.11%)_Space_16.2_MB_(12.42%) class Solution { func trap(_ height: [Int]) -> Int { diff --git a/src/main/swift/g0001_0100/s0045_jump_game_ii/Solution.swift b/src/main/swift/g0001_0100/s0045_jump_game_ii/Solution.swift index 32dad06a..b8ad42cd 100644 --- a/src/main/swift/g0001_0100/s0045_jump_game_ii/Solution.swift +++ b/src/main/swift/g0001_0100/s0045_jump_game_ii/Solution.swift @@ -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_23_Time_25_ms_(98.10%)_Space_15.7_MB_(75.63%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_23_Time_25_ms_(98.10%)_Space_15.7_MB_(75.63%) public class Solution { public func jump(_ nums: [Int]) -> Int { diff --git a/src/main/swift/g0001_0100/s0046_permutations/Solution.swift b/src/main/swift/g0001_0100/s0046_permutations/Solution.swift index 5336e02e..2c3d882c 100644 --- a/src/main/swift/g0001_0100/s0046_permutations/Solution.swift +++ b/src/main/swift/g0001_0100/s0046_permutations/Solution.swift @@ -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_23_Time_8_ms_(86.06%)_Space_15.9_MB_(93.82%) public class Solution { diff --git a/src/main/swift/g0001_0100/s0048_rotate_image/Solution.swift b/src/main/swift/g0001_0100/s0048_rotate_image/Solution.swift index 07ab37a7..dcc50b53 100644 --- a/src/main/swift/g0001_0100/s0048_rotate_image/Solution.swift +++ b/src/main/swift/g0001_0100/s0048_rotate_image/Solution.swift @@ -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_23_Time_0_ms_(100.00%)_Space_15.9_MB_(65.50%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2024_06_23_Time_0_ms_(100.00%)_Space_15.9_MB_(65.50%) public class Solution { public func rotate(_ matrix: inout [[Int]]) { diff --git a/src/main/swift/g0001_0100/s0049_group_anagrams/Solution.swift b/src/main/swift/g0001_0100/s0049_group_anagrams/Solution.swift index 52c09c73..1296a5b5 100644 --- a/src/main/swift/g0001_0100/s0049_group_anagrams/Solution.swift +++ b/src/main/swift/g0001_0100/s0049_group_anagrams/Solution.swift @@ -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_23_Time_67_ms_(84.64%)_Space_18.6_MB_(43.89%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2024_06_23_Time_67_ms_(84.64%)_Space_18.6_MB_(43.89%) public class Solution { public func groupAnagrams(_ strs: [String]) -> [[String]] { diff --git a/src/main/swift/g0001_0100/s0053_maximum_subarray/Solution.swift b/src/main/swift/g0001_0100/s0053_maximum_subarray/Solution.swift index 773786b4..d1de5792 100644 --- a/src/main/swift/g0001_0100/s0053_maximum_subarray/Solution.swift +++ b/src/main/swift/g0001_0100/s0053_maximum_subarray/Solution.swift @@ -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_23_Time_281_ms_(98.21%)_Space_20.2_MB_(6.94%) public class Solution { diff --git a/src/main/swift/g0001_0100/s0055_jump_game/Solution.swift b/src/main/swift/g0001_0100/s0055_jump_game/Solution.swift index ec592f8e..ce2e7ae7 100644 --- a/src/main/swift/g0001_0100/s0055_jump_game/Solution.swift +++ b/src/main/swift/g0001_0100/s0055_jump_game/Solution.swift @@ -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_23_Time_132_ms_(89.47%)_Space_15.5_MB_(85.96%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_23_Time_132_ms_(89.47%)_Space_15.5_MB_(85.96%) public class Solution { public func canJump(_ nums: [Int]) -> Bool { diff --git a/src/main/swift/g0001_0100/s0056_merge_intervals/Solution.swift b/src/main/swift/g0001_0100/s0056_merge_intervals/Solution.swift index 8982b51a..144a66cc 100644 --- a/src/main/swift/g0001_0100/s0056_merge_intervals/Solution.swift +++ b/src/main/swift/g0001_0100/s0056_merge_intervals/Solution.swift @@ -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_23_Time_52_ms_(99.13%)_Space_17.8_MB_(32.24%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2024_06_23_Time_52_ms_(99.13%)_Space_17.8_MB_(32.24%) class Solution { func merge(_ intervals: [[Int]]) -> [[Int]] { diff --git a/src/main/swift/g0001_0100/s0062_unique_paths/Solution.swift b/src/main/swift/g0001_0100/s0062_unique_paths/Solution.swift index 52b508e5..0d5c0c0f 100644 --- a/src/main/swift/g0001_0100/s0062_unique_paths/Solution.swift +++ b/src/main/swift/g0001_0100/s0062_unique_paths/Solution.swift @@ -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_24_Time_0_ms_(100.00%)_Space_15.4_MB_(70.05%) +// #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_24_Time_0_ms_(100.00%)_Space_15.4_MB_(70.05%) public class Solution { public func uniquePaths(_ m: Int, _ n: Int) -> Int { diff --git a/src/main/swift/g0001_0100/s0064_minimum_path_sum/Solution.swift b/src/main/swift/g0001_0100/s0064_minimum_path_sum/Solution.swift index d5b12567..044a0454 100644 --- a/src/main/swift/g0001_0100/s0064_minimum_path_sum/Solution.swift +++ b/src/main/swift/g0001_0100/s0064_minimum_path_sum/Solution.swift @@ -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_24_Time_17_ms_(92.63%)_Space_16_MB_(21.05%) +// #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_24_Time_17_ms_(92.63%)_Space_16_MB_(21.05%) class Solution { func minPathSum(_ grid: [[Int]]) -> Int { diff --git a/src/main/swift/g0001_0100/s0070_climbing_stairs/Solution.swift b/src/main/swift/g0001_0100/s0070_climbing_stairs/Solution.swift index a0294384..4286c104 100644 --- a/src/main/swift/g0001_0100/s0070_climbing_stairs/Solution.swift +++ b/src/main/swift/g0001_0100/s0070_climbing_stairs/Solution.swift @@ -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_24_Time_0_ms_(100.00%)_Space_15.5_MB_(40.57%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #Big_O_Time_O(n)_Space_O(n) #2024_06_24_Time_0_ms_(100.00%)_Space_15.5_MB_(40.57%) public class Solution { public func climbStairs(_ n: Int) -> Int { diff --git a/src/main/swift/g0001_0100/s0072_edit_distance/Solution.swift b/src/main/swift/g0001_0100/s0072_edit_distance/Solution.swift index 6864041e..a26ad1b7 100644 --- a/src/main/swift/g0001_0100/s0072_edit_distance/Solution.swift +++ b/src/main/swift/g0001_0100/s0072_edit_distance/Solution.swift @@ -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_24_Time_9_ms_(77.98%)_Space_18.1_MB_(46.79%) class Solution { diff --git a/src/main/swift/g0001_0100/s0073_set_matrix_zeroes/Solution.swift b/src/main/swift/g0001_0100/s0073_set_matrix_zeroes/Solution.swift index 070a2bf4..6d399c9d 100644 --- a/src/main/swift/g0001_0100/s0073_set_matrix_zeroes/Solution.swift +++ b/src/main/swift/g0001_0100/s0073_set_matrix_zeroes/Solution.swift @@ -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_24_Time_52_ms_(86.73%)_Space_16.8_MB_(16.81%) class Solution { diff --git a/src/main/swift/g0001_0100/s0074_search_a_2d_matrix/Solution.swift b/src/main/swift/g0001_0100/s0074_search_a_2d_matrix/Solution.swift index 6a884df9..60f37d33 100644 --- a/src/main/swift/g0001_0100/s0074_search_a_2d_matrix/Solution.swift +++ b/src/main/swift/g0001_0100/s0074_search_a_2d_matrix/Solution.swift @@ -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_24_Time_8_ms_(89.33%)_Space_15.6_MB_(26.67%) class Solution { diff --git a/src/main/swift/g0001_0100/s0076_minimum_window_substring/Solution.swift b/src/main/swift/g0001_0100/s0076_minimum_window_substring/Solution.swift index 1400c1b4..77c053d8 100644 --- a/src/main/swift/g0001_0100/s0076_minimum_window_substring/Solution.swift +++ b/src/main/swift/g0001_0100/s0076_minimum_window_substring/Solution.swift @@ -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_24_Time_41_ms_(94.94%)_Space_18.6_MB_(9.70%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2024_06_24_Time_41_ms_(94.94%)_Space_18.6_MB_(9.70%) class Solution { func minWindow(_ s: String, _ t: String) -> String { diff --git a/src/main/swift/g0001_0100/s0079_word_search/Solution.swift b/src/main/swift/g0001_0100/s0079_word_search/Solution.swift index 650540f2..eb40b100 100644 --- a/src/main/swift/g0001_0100/s0079_word_search/Solution.swift +++ b/src/main/swift/g0001_0100/s0079_word_search/Solution.swift @@ -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_24_Time_162_ms_(96.28%)_Space_16.3_MB_(46.10%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_06_24_Time_162_ms_(96.28%)_Space_16.3_MB_(46.10%) class Solution { func exist(_ board: [[Character]], _ word: String) -> Bool { diff --git a/src/main/swift/g0001_0100/s0098_validate_binary_search_tree/Solution.swift b/src/main/swift/g0001_0100/s0098_validate_binary_search_tree/Solution.swift index 2f3de25c..e06ee35d 100644 --- a/src/main/swift/g0001_0100/s0098_validate_binary_search_tree/Solution.swift +++ b/src/main/swift/g0001_0100/s0098_validate_binary_search_tree/Solution.swift @@ -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_25_Time_14_ms_(93.62%)_Space_16_MB_(84.87%) /** diff --git a/src/main/swift/g0101_0200/s0101_symmetric_tree/Solution.swift b/src/main/swift/g0101_0200/s0101_symmetric_tree/Solution.swift index 094ac010..59bc357c 100644 --- a/src/main/swift/g0101_0200/s0101_symmetric_tree/Solution.swift +++ b/src/main/swift/g0101_0200/s0101_symmetric_tree/Solution.swift @@ -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_25_Time_4_ms_(87.54%)_Space_15.5_MB_(35.61%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2024_06_25_Time_4_ms_(87.54%)_Space_15.5_MB_(35.61%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.swift b/src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.swift index 0602e763..00f5973d 100644 --- a/src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.swift +++ b/src/main/swift/g0101_0200/s0102_binary_tree_level_order_traversal/Solution.swift @@ -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_25_Time_7_ms_(93.85%)_Space_16.4_MB_(73.33%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2024_06_25_Time_7_ms_(93.85%)_Space_16.4_MB_(73.33%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.swift b/src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.swift index 337d56c1..25d5770e 100644 --- a/src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.swift +++ b/src/main/swift/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.swift @@ -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_25_Time_6_ms_(98.43%)_Space_16.1_MB_(15.47%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H) +// #2024_06_25_Time_6_ms_(98.43%)_Space_16.1_MB_(15.47%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.swift b/src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.swift index dbdf8e45..a89db6fd 100644 --- a/src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.swift +++ b/src/main/swift/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.swift @@ -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_25_Time_9_ms_(93.01%)_Space_16.7_MB_(77.29%) +// #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_25_Time_9_ms_(93.01%)_Space_16.7_MB_(77.29%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.swift b/src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.swift index 49916d0b..88d87cf0 100644 --- a/src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.swift +++ b/src/main/swift/g0101_0200/s0114_flatten_binary_tree_to_linked_list/Solution.swift @@ -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_25_Time_0_ms_(100.00%)_Space_16_MB_(77.78%) /** diff --git a/src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.swift b/src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.swift index 1529a27e..ae08e3aa 100644 --- a/src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.swift +++ b/src/main/swift/g0101_0200/s0121_best_time_to_buy_and_sell_stock/Solution.swift @@ -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_25_Time_274_ms_(88.04%)_Space_19_MB_(73.18%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2024_06_25_Time_274_ms_(88.04%)_Space_19_MB_(73.18%) class Solution { func maxProfit(_ prices: [Int]) -> Int { diff --git a/src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.swift b/src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.swift index 4cef6921..be56a5e3 100644 --- a/src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.swift +++ b/src/main/swift/g0101_0200/s0124_binary_tree_maximum_path_sum/Solution.swift @@ -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_27_Time_28_ms_(98.45%)_Space_17.1_MB_(67.36%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2024_06_27_Time_28_ms_(98.45%)_Space_17.1_MB_(67.36%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0101_0200/s0128_longest_consecutive_sequence/Solution.swift b/src/main/swift/g0101_0200/s0128_longest_consecutive_sequence/Solution.swift index fd0255fc..dc5a3f3d 100644 --- a/src/main/swift/g0101_0200/s0128_longest_consecutive_sequence/Solution.swift +++ b/src/main/swift/g0101_0200/s0128_longest_consecutive_sequence/Solution.swift @@ -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_27_Time_225_ms_(94.82%)_Space_21_MB_(31.47%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2024_06_27_Time_225_ms_(94.82%)_Space_21_MB_(31.47%) class Solution { func longestConsecutive(_ nums: [Int]) -> Int { diff --git a/src/main/swift/g0101_0200/s0136_single_number/Solution.swift b/src/main/swift/g0101_0200/s0136_single_number/Solution.swift index e0abcbb8..2ecd64ed 100644 --- a/src/main/swift/g0101_0200/s0136_single_number/Solution.swift +++ b/src/main/swift/g0101_0200/s0136_single_number/Solution.swift @@ -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_27_Time_35_ms_(99.24%)_Space_15.8_MB_(80.95%) class Solution { diff --git a/src/main/swift/g0101_0200/s0138_copy_list_with_random_pointer/Solution.swift b/src/main/swift/g0101_0200/s0138_copy_list_with_random_pointer/Solution.swift index cc573609..607243fa 100644 --- a/src/main/swift/g0101_0200/s0138_copy_list_with_random_pointer/Solution.swift +++ b/src/main/swift/g0101_0200/s0138_copy_list_with_random_pointer/Solution.swift @@ -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_27_Time_13_ms_(98.58%)_Space_17.6_MB_(53.77%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2024_06_27_Time_13_ms_(98.58%)_Space_17.6_MB_(53.77%) /** * Definition for a Node. diff --git a/src/main/swift/g0101_0200/s0139_word_break/Solution.swift b/src/main/swift/g0101_0200/s0139_word_break/Solution.swift index b44047c0..73393bab 100644 --- a/src/main/swift/g0101_0200/s0139_word_break/Solution.swift +++ b/src/main/swift/g0101_0200/s0139_word_break/Solution.swift @@ -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_27_Time_3_ms_(95.73%)_Space_16.4_MB_(60.50%) +// #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_27_Time_3_ms_(95.73%)_Space_16.4_MB_(60.50%) class Solution { func wordBreak(_ s: String, _ wordDict: [String]) -> Bool { diff --git a/src/main/swift/g0101_0200/s0141_linked_list_cycle/Solution.swift b/src/main/swift/g0101_0200/s0141_linked_list_cycle/Solution.swift index e591f4ee..bd50cbcd 100644 --- a/src/main/swift/g0101_0200/s0141_linked_list_cycle/Solution.swift +++ b/src/main/swift/g0101_0200/s0141_linked_list_cycle/Solution.swift @@ -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_27_Time_21_ms_(98.35%)_Space_16_MB_(82.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_06_27_Time_21_ms_(98.35%)_Space_16_MB_(82.04%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0101_0200/s0146_lru_cache/LRUCache.swift b/src/main/swift/g0101_0200/s0146_lru_cache/LRUCache.swift index 466c284f..25a29bea 100644 --- a/src/main/swift/g0101_0200/s0146_lru_cache/LRUCache.swift +++ b/src/main/swift/g0101_0200/s0146_lru_cache/LRUCache.swift @@ -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_27_Time_673_ms_(99.77%)_Space_33.4_MB_(73.43%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2024_06_27_Time_673_ms_(99.77%)_Space_33.4_MB_(73.43%) class LRUCache { private class LruCacheNode { diff --git a/src/main/swift/g0101_0200/s0148_sort_list/Solution.swift b/src/main/swift/g0101_0200/s0148_sort_list/Solution.swift index 0818d899..31cbb7dc 100644 --- a/src/main/swift/g0101_0200/s0148_sort_list/Solution.swift +++ b/src/main/swift/g0101_0200/s0148_sort_list/Solution.swift @@ -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_27_Time_166_ms_(100.00%)_Space_22.4_MB_(5.26%) +// #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_27_Time_166_ms_(100.00%)_Space_22.4_MB_(5.26%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.swift b/src/main/swift/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.swift index ac76c8bc..5a75784f 100644 --- a/src/main/swift/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.swift +++ b/src/main/swift/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.swift @@ -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_28_Time_3_ms_(95.89%)_Space_15.5_MB_(81.96%) +// #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_28_Time_3_ms_(95.89%)_Space_15.5_MB_(81.96%) class Solution { func findMin(_ nums: [Int]) -> Int { diff --git a/src/main/swift/g0101_0200/s0155_min_stack/MinStack.swift b/src/main/swift/g0101_0200/s0155_min_stack/MinStack.swift index 6314bdc2..4025a52b 100644 --- a/src/main/swift/g0101_0200/s0155_min_stack/MinStack.swift +++ b/src/main/swift/g0101_0200/s0155_min_stack/MinStack.swift @@ -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_28_Time_34_ms_(95.89%)_Space_17.6_MB_(18.08%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2024_06_28_Time_34_ms_(95.89%)_Space_17.6_MB_(18.08%) class MinStack { private class Node { diff --git a/src/main/swift/g0101_0200/s0169_majority_element/Solution.swift b/src/main/swift/g0101_0200/s0169_majority_element/Solution.swift index 336c07d9..52e8e758 100644 --- a/src/main/swift/g0101_0200/s0169_majority_element/Solution.swift +++ b/src/main/swift/g0101_0200/s0169_majority_element/Solution.swift @@ -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_28_Time_38_ms_(96.59%)_Space_16.9_MB_(85.84%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2024_06_28_Time_38_ms_(96.59%)_Space_16.9_MB_(85.84%) class Solution { func majorityElement(_ arr: [Int]) -> Int { diff --git a/src/main/swift/g0101_0200/s0189_rotate_array/Solution.swift b/src/main/swift/g0101_0200/s0189_rotate_array/Solution.swift index b80480bc..f43e225d 100644 --- a/src/main/swift/g0101_0200/s0189_rotate_array/Solution.swift +++ b/src/main/swift/g0101_0200/s0189_rotate_array/Solution.swift @@ -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_28_Time_118_ms_(91.36%)_Space_22.9_MB_(98.87%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2024_06_28_Time_118_ms_(91.36%)_Space_22.9_MB_(98.87%) class Solution { func rotate(_ nums: inout [Int], _ k: Int) { diff --git a/src/main/swift/g0101_0200/s0198_house_robber/Solution.swift b/src/main/swift/g0101_0200/s0198_house_robber/Solution.swift index 35cf1362..14815cf4 100644 --- a/src/main/swift/g0101_0200/s0198_house_robber/Solution.swift +++ b/src/main/swift/g0101_0200/s0198_house_robber/Solution.swift @@ -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_28_Time_0_ms_(100.00%)_Space_15.6_MB_(25.32%) +// #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_28_Time_0_ms_(100.00%)_Space_15.6_MB_(25.32%) class Solution { func rob(_ nums: [Int]) -> Int { diff --git a/src/main/swift/g0101_0200/s0200_number_of_islands/Solution.swift b/src/main/swift/g0101_0200/s0200_number_of_islands/Solution.swift index 2cde1d5f..6b110e4f 100644 --- a/src/main/swift/g0101_0200/s0200_number_of_islands/Solution.swift +++ b/src/main/swift/g0101_0200/s0200_number_of_islands/Solution.swift @@ -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_07_04_Time_152_ms_(70.92%)_Space_19.2_MB_(44.62%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2024_07_04_Time_152_ms_(70.92%)_Space_19.2_MB_(44.62%) class Solution { func numIslands(_ grid: [[Character]]) -> Int { diff --git a/src/main/swift/g0201_0300/s0206_reverse_linked_list/Solution.swift b/src/main/swift/g0201_0300/s0206_reverse_linked_list/Solution.swift index 5343f6d3..570e6d92 100644 --- a/src/main/swift/g0201_0300/s0206_reverse_linked_list/Solution.swift +++ b/src/main/swift/g0201_0300/s0206_reverse_linked_list/Solution.swift @@ -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_28_Time_4_ms_(89.47%)_Space_16_MB_(24.52%) +// #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_28_Time_4_ms_(89.47%)_Space_16_MB_(24.52%) /** * Definition for singly-linked list. diff --git a/src/main/swift/g0201_0300/s0207_course_schedule/Solution.swift b/src/main/swift/g0201_0300/s0207_course_schedule/Solution.swift index 4c1f68f3..0986321b 100644 --- a/src/main/swift/g0201_0300/s0207_course_schedule/Solution.swift +++ b/src/main/swift/g0201_0300/s0207_course_schedule/Solution.swift @@ -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_28_Time_30_ms_(92.23%)_Space_15.6_MB_(98.23%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2024_06_28_Time_30_ms_(92.23%)_Space_15.6_MB_(98.23%) class Solution { private let WHITE = 0 diff --git a/src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree/Trie.swift b/src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree/Trie.swift index 88188343..08ad4002 100644 --- a/src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree/Trie.swift +++ b/src/main/swift/g0201_0300/s0208_implement_trie_prefix_tree/Trie.swift @@ -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_28_Time_131_ms_(97.26%)_Space_21.2_MB_(91.78%) diff --git a/src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.swift b/src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.swift index d8f1a40a..44d886dc 100644 --- a/src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.swift +++ b/src/main/swift/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.swift @@ -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_30_Time_225_ms_(82.41%)_Space_19.6_MB_(37.22%) class Solution { diff --git a/src/main/swift/g0201_0300/s0221_maximal_square/Solution.swift b/src/main/swift/g0201_0300/s0221_maximal_square/Solution.swift index 24622766..3d8ccf03 100644 --- a/src/main/swift/g0201_0300/s0221_maximal_square/Solution.swift +++ b/src/main/swift/g0201_0300/s0221_maximal_square/Solution.swift @@ -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_07_01_Time_350_ms_(93.48%)_Space_18.3_MB_(82.61%) +// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n) +// #2024_07_01_Time_350_ms_(93.48%)_Space_18.3_MB_(82.61%) class Solution { func maximalSquare(_ matrix: [[Character]]) -> Int { diff --git a/src/main/swift/g0201_0300/s0226_invert_binary_tree/Solution.swift b/src/main/swift/g0201_0300/s0226_invert_binary_tree/Solution.swift index 2cc93a05..c6190f86 100644 --- a/src/main/swift/g0201_0300/s0226_invert_binary_tree/Solution.swift +++ b/src/main/swift/g0201_0300/s0226_invert_binary_tree/Solution.swift @@ -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_07_01_Time_0_ms_(100.00%)_Space_15.8_MB_(77.75%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2024_07_01_Time_0_ms_(100.00%)_Space_15.8_MB_(77.75%) /** * Definition for a binary tree node. diff --git a/src/main/swift/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.swift b/src/main/swift/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.swift index bb07d1b1..4afac348 100644 --- a/src/main/swift/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.swift +++ b/src/main/swift/g0201_0300/s0230_kth_smallest_element_in_a_bst/Solution.swift @@ -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_07_01_Time_20_ms_(97.99%)_Space_16.5_MB_(68.46%) /** diff --git a/src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.swift b/src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.swift index db55a544..1066d4c6 100644 --- a/src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.swift +++ b/src/main/swift/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.swift @@ -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_07_01_Time_23_ms_(96.47%)_Space_17.4_MB_(55.16%) /** diff --git a/src/main/swift/g0201_0300/s0238_product_of_array_except_self/Solution.swift b/src/main/swift/g0201_0300/s0238_product_of_array_except_self/Solution.swift index 8fa57976..0f36de23 100644 --- a/src/main/swift/g0201_0300/s0238_product_of_array_except_self/Solution.swift +++ b/src/main/swift/g0201_0300/s0238_product_of_array_except_self/Solution.swift @@ -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_07_01_Time_150_ms_(91.75%)_Space_24.8_MB_(93.84%) class Solution { diff --git a/src/main/swift/g0201_0300/s0283_move_zeroes/Solution.swift b/src/main/swift/g0201_0300/s0283_move_zeroes/Solution.swift index e5498cc0..61c24769 100644 --- a/src/main/swift/g0201_0300/s0283_move_zeroes/Solution.swift +++ b/src/main/swift/g0201_0300/s0283_move_zeroes/Solution.swift @@ -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_07_01_Time_82_ms_(95.43%)_Space_17.1_MB_(33.52%) +// #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_07_01_Time_82_ms_(95.43%)_Space_17.1_MB_(33.52%) class Solution { func moveZeroes(_ nums: inout [Int]) { diff --git a/src/main/swift/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.swift b/src/main/swift/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.swift index c0f433a0..19eddcd6 100644 --- a/src/main/swift/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.swift +++ b/src/main/swift/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.swift @@ -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_07_02_Time_671_ms_(91.08%)_Space_22.7_MB_(68.15%) +// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n) +// #2024_07_02_Time_671_ms_(91.08%)_Space_22.7_MB_(68.15%) import HeapModule diff --git a/src/main/swift/g0201_0300/s0300_longest_increasing_subsequence/Solution.swift b/src/main/swift/g0201_0300/s0300_longest_increasing_subsequence/Solution.swift index 522313d1..67a1ec2f 100644 --- a/src/main/swift/g0201_0300/s0300_longest_increasing_subsequence/Solution.swift +++ b/src/main/swift/g0201_0300/s0300_longest_increasing_subsequence/Solution.swift @@ -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_07_02_Time_8_ms_(100.00%)_Space_15.5_MB_(61.14%) class Solution { diff --git a/src/main/swift/g0301_0400/s0322_coin_change/Solution.swift b/src/main/swift/g0301_0400/s0322_coin_change/Solution.swift index 4b82239e..dd344882 100644 --- a/src/main/swift/g0301_0400/s0322_coin_change/Solution.swift +++ b/src/main/swift/g0301_0400/s0322_coin_change/Solution.swift @@ -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_07_02_Time_9_ms_(94.72%)_Space_15.5_MB_(61.62%) class Solution { diff --git a/src/main/swift/g0301_0400/s0338_counting_bits/Solution.swift b/src/main/swift/g0301_0400/s0338_counting_bits/Solution.swift index eb33b88a..c4110012 100644 --- a/src/main/swift/g0301_0400/s0338_counting_bits/Solution.swift +++ b/src/main/swift/g0301_0400/s0338_counting_bits/Solution.swift @@ -1,5 +1,6 @@ -// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2024_07_02_Time_31_ms_(90.56%)_Space_20.7_MB_(98.89%) +// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation +// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num) +// #2024_07_02_Time_31_ms_(90.56%)_Space_20.7_MB_(98.89%) class Solution { func countBits(_ n: Int) -> [Int] { diff --git a/src/main/swift/g0301_0400/s0394_decode_string/Solution.swift b/src/main/swift/g0301_0400/s0394_decode_string/Solution.swift index 9677898e..f05336d2 100644 --- a/src/main/swift/g0301_0400/s0394_decode_string/Solution.swift +++ b/src/main/swift/g0301_0400/s0394_decode_string/Solution.swift @@ -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_07_02_Time_0_ms_(100.00%)_Space_16.5_MB_(23.23%) +// #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_07_02_Time_0_ms_(100.00%)_Space_16.5_MB_(23.23%) class Solution { private var i = 0 diff --git a/src/main/swift/g0401_0500/s0437_path_sum_iii/Solution.swift b/src/main/swift/g0401_0500/s0437_path_sum_iii/Solution.swift index 2cc86408..9dfa47c8 100644 --- a/src/main/swift/g0401_0500/s0437_path_sum_iii/Solution.swift +++ b/src/main/swift/g0401_0500/s0437_path_sum_iii/Solution.swift @@ -1,4 +1,5 @@ -// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n) +// #Medium #Top_100_Liked_Questions #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_07_02_Time_13_ms_(94.74%)_Space_16.5_MB_(14.91%) /** diff --git a/src/main/swift/g0701_0800/s0739_daily_temperatures/Solution.swift b/src/main/swift/g0701_0800/s0739_daily_temperatures/Solution.swift index 3a6a3644..389a6a1b 100644 --- a/src/main/swift/g0701_0800/s0739_daily_temperatures/Solution.swift +++ b/src/main/swift/g0701_0800/s0739_daily_temperatures/Solution.swift @@ -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_07_03_Time_535_ms_(99.24%)_Space_26.9_MB_(19.32%) +// #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_07_03_Time_535_ms_(99.24%)_Space_26.9_MB_(19.32%) class Solution { func dailyTemperatures(_ temperatures: [Int]) -> [Int] { diff --git a/src/main/swift/g0701_0800/s0763_partition_labels/Solution.swift b/src/main/swift/g0701_0800/s0763_partition_labels/Solution.swift index 2895b478..71fc11df 100644 --- a/src/main/swift/g0701_0800/s0763_partition_labels/Solution.swift +++ b/src/main/swift/g0701_0800/s0763_partition_labels/Solution.swift @@ -1,5 +1,6 @@ -// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String -// #Big_O_Time_O(n)_Space_O(1) #2024_07_03_Time_2_ms_(100.00%)_Space_16.4_MB_(73.85%) +// #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_07_03_Time_2_ms_(100.00%)_Space_16.4_MB_(73.85%) class Solution { func partitionLabels(_ s: String) -> [Int] { diff --git a/src/main/swift/g1101_1200/s1143_longest_common_subsequence/Solution.swift b/src/main/swift/g1101_1200/s1143_longest_common_subsequence/Solution.swift index 023030c9..ff08aacd 100644 --- a/src/main/swift/g1101_1200/s1143_longest_common_subsequence/Solution.swift +++ b/src/main/swift/g1101_1200/s1143_longest_common_subsequence/Solution.swift @@ -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_07_03_Time_12_ms_(98.60%)_Space_16.1_MB_(98.60%) diff --git a/src/main/ts/g0001_0100/s0001_two_sum/solution.ts b/src/main/ts/g0001_0100/s0001_two_sum/solution.ts index 53bdeafa..e344a0d6 100644 --- a/src/main/ts/g0001_0100/s0001_two_sum/solution.ts +++ b/src/main/ts/g0001_0100/s0001_two_sum/solution.ts @@ -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) -// #2023_09_28_Time_54_ms_(91.72%)_Space_45.5_MB_(22.26%) +// #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_03_22_Time_1_ms_(89.70%)_Space_59.39_MB_(8.75%) function twoSum(nums: number[], target: number): number[] { const indexMap: Map = new Map() 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 36723860..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 @@ -1,10 +1,11 @@ // #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_09_28_Time_92_ms_(77.86%)_Space_48_MB_(69.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 #2025_03_22_Time_2_ms_(95.82%)_Space_62.80_MB_(21.07%) import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts b/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts index 595d1d08..c5514ebb 100644 --- a/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts +++ b/src/main/ts/g0001_0100/s0003_longest_substring_without_repeating_characters/solution.ts @@ -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_09_28_Time_65_ms_(90.77%)_Space_44.9_MB_(95.29%) +// #Top_Interview_150_Sliding_Window #Big_O_Time_O(n)_Space_O(1) #AI_can_be_used_to_solve_the_task +// #2025_03_22_Time_3_ms_(96.91%)_Space_59.12_MB_(43.55%) function lengthOfLongestSubstring(s: string): number { const lastIndices: number[] = new Array(256).fill(-1) diff --git a/src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts b/src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts index fdbf3ebc..516e7f32 100644 --- a/src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts +++ b/src/main/ts/g0001_0100/s0004_median_of_two_sorted_arrays/solution.ts @@ -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_08_26_Time_86_ms_(92.15%)_Space_48.3_MB_(59.73%) +// #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_03_22_Time_3_ms_(82.74%)_Space_59.34_MB_(44.01%) function findMedianSortedArrays(nums1: number[], nums2: number[]): number { const nums = nums1.concat(nums2) diff --git a/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts b/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts index c76fac1c..6b126287 100644 --- a/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts +++ b/src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts @@ -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_09_28_Time_68_ms_(95.34%)_Space_44.5_MB_(96.58%) +// #Dynamic_Programming_I_Day_17 #Udemy_Strings #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(n)_Space_O(n) #2025_03_22_Time_8_ms_(99.14%)_Space_59.13_MB_(33.28%) function longestPalindrome(s: string): string { const newStr: string[] = new Array(s.length * 2 + 1) diff --git a/src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts b/src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts index a1aab883..8e48ed83 100644 --- a/src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts +++ b/src/main/ts/g0001_0100/s0006_zigzag_conversion/solution.ts @@ -1,4 +1,5 @@ -// #Medium #String #2023_08_26_Time_64_ms_(95.38%)_Space_47.3_MB_(64.49%) +// #Medium #String #Top_Interview_150_Array/String +// #2025_03_22_Time_2_ms_(99.08%)_Space_60.88_MB_(31.04%) function convert(s: string, numRows: number): string { if (numRows < 2) { diff --git a/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts b/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts index 89e54630..a714b352 100644 --- a/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts +++ b/src/main/ts/g0001_0100/s0007_reverse_integer/solution.ts @@ -1,5 +1,5 @@ // #Medium #Top_Interview_Questions #Math #Udemy_Integers -// #2023_08_25_Time_56_ms_(95.68%)_Space_43.8_MB_(99.70%) +// #2025_03_22_Time_53_ms_(83.14%)_Space_58.56_MB_(6.02%) function reverse(x: number): number { let remaining = Math.abs(x) diff --git a/src/main/ts/g0001_0100/s0008_string_to_integer_atoi/solution.ts b/src/main/ts/g0001_0100/s0008_string_to_integer_atoi/solution.ts index ceb4dcdd..fd808519 100644 --- a/src/main/ts/g0001_0100/s0008_string_to_integer_atoi/solution.ts +++ b/src/main/ts/g0001_0100/s0008_string_to_integer_atoi/solution.ts @@ -1,4 +1,4 @@ -// #Medium #Top_Interview_Questions #String #2023_08_25_Time_56_ms_(99.01%)_Space_44_MB_(98.27%) +// #Medium #Top_Interview_Questions #String #2025_03_22_Time_1_ms_(90.14%)_Space_58.06_MB_(42.36%) function myAtoi(s: string): number { s = s.trim() diff --git a/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts b/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts index 117a8049..0d315e29 100644 --- a/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts +++ b/src/main/ts/g0001_0100/s0009_palindrome_number/solution.ts @@ -1,4 +1,5 @@ -// #Easy #Math #Udemy_Integers #2023_08_25_Time_137_ms_(88.64%)_Space_50.5_MB_(99.43%) +// #Easy #Math #Udemy_Integers #Top_Interview_150_Math +// #2025_03_22_Time_3_ms_(99.14%)_Space_64.18_MB_(50.40%) function isPalindrome(x: number): boolean { if (x < 0) { diff --git a/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts b/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts index fed1d99d..05cfa013 100644 --- a/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts +++ b/src/main/ts/g0001_0100/s0010_regular_expression_matching/solution.ts @@ -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_08_25_Time_69_ms_(92.65%)_Space_45.9_MB_(50.61%) +// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_03_22_Time_5_ms_(90.44%)_Space_59.10_MB_(22.68%) function isMatch(s: string, p: string): boolean { // NOSONAR const result = new Array(s.length + 1) 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 f4c6efbd..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 #Big_O_Time_O(n)_Space_O(1) -// #2023_08_28_Time_57_ms_(98.23%)_Space_50.9_MB_(84.15%) +// #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/s0015_3sum/solution.ts b/src/main/ts/g0001_0100/s0015_3sum/solution.ts index 67fdc8bf..e4ad9bde 100644 --- a/src/main/ts/g0001_0100/s0015_3sum/solution.ts +++ b/src/main/ts/g0001_0100/s0015_3sum/solution.ts @@ -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_08_28_Time_148_ms_(92.62%)_Space_59.1_MB_(70.24%) +// #Top_Interview_150_Two_Pointers #Big_O_Time_O(n*log(n))_Space_O(n^2) +// #2025_03_22_Time_30_ms_(91.56%)_Space_74.61_MB_(11.14%) function threeSum(nums: number[]): number[][] { //NOSONAR nums.sort((a, b) => a - b) 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 fea016e9..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,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_08_28_Time_52_ms_(79.11%)_Space_43.7_MB_(37.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) +// #2025_03_22_Time_0_ms_(100.00%)_Space_56.27_MB_(8.55%) function letterCombinations(digits: string): string[] { if (digits.length === 0) { diff --git a/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts b/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts index b4708229..ce4f3632 100644 --- a/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts +++ b/src/main/ts/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.ts @@ -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_08_28_Time_54_ms_(87.87%)_Space_44.7_MB_(49.30%) +// #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_03_22_Time_0_ms_(100.00%)_Space_58.00_MB_(13.12%) import { ListNode } from '../../com_github_leetcode/listnode' diff --git a/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts b/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts index 4f064065..cdf4b2a1 100644 --- a/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts +++ b/src/main/ts/g0001_0100/s0020_valid_parentheses/solution.ts @@ -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_08_28_Time_50_ms_(95.90%)_Space_43.5_MB_(83.27%) +// #Data_Structure_I_Day_9_Stack_Queue #Udemy_Strings #Top_Interview_150_Stack +// #Big_O_Time_O(n)_Space_O(n) #2025_03_22_Time_1_ms_(86.85%)_Space_59.18_MB_(9.27%) function isValid(s: string): boolean { const stack: string[] = [] diff --git a/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts b/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts index 284ba473..d2df4082 100644 --- a/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts +++ b/src/main/ts/g0001_0100/s0021_merge_two_sorted_lists/solution.ts @@ -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_08_29_Time_59_ms_(86.77%)_Space_44_MB_(98.03%) +// #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_03_22_Time_1_ms_(51.21%)_Space_59.28_MB_(6.60%) import { ListNode } from '../../com_github_leetcode/listnode' diff --git a/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts b/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts index 9db8687e..672ffd67 100644 --- a/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts +++ b/src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts @@ -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_08_29_Time_60_ms_(62.03%)_Space_45.6_MB_(21.59%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n) +// #2025_03_22_Time_1_ms_(72.82%)_Space_56.97_MB_(44.53%) function generateParenthesis(n: number): string[] { const sb: 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 b94cc7a5..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 @@ -1,10 +1,10 @@ // #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_10_09_Time_76_ms_(94.52%)_Space_47.9_MB_(84.35%) +// #Divide_and_Conquer #Merge_Sort #Top_Interview_150_Divide_and_Conquer +// #Big_O_Time_O(k*n*log(k))_Space_O(log(k)) #2025_03_22_Time_4_ms_(97.65%)_Space_64.08_MB_(30.06%) import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts b/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts index 71f3454a..959f4488 100644 --- a/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts +++ b/src/main/ts/g0001_0100/s0024_swap_nodes_in_pairs/solution.ts @@ -1,6 +1,6 @@ // #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_08_29_Time_59_ms_(62.67%)_Space_44.7_MB_(26.03%) +// #2025_03_22_Time_0_ms_(100.00%)_Space_56.52_MB_(6.71%) /** * Definition for singly-linked list. diff --git a/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts b/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts index 9f78202d..79a44add 100644 --- a/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts +++ b/src/main/ts/g0001_0100/s0025_reverse_nodes_in_k_group/solution.ts @@ -1,6 +1,6 @@ // #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_08_29_Time_74_ms_(66.83%)_Space_46.1_MB_(94.47%) +// #Udemy_Linked_List #Top_Interview_150_Linked_List #Big_O_Time_O(n)_Space_O(k) +// #2025_03_22_Time_0_ms_(100.00%)_Space_60.66_MB_(27.50%) /** * Definition for singly-linked list. 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 966dff2b..3723344f 100644 --- a/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts +++ b/src/main/ts/g0001_0100/s0031_next_permutation/solution.ts @@ -1,20 +1,19 @@ // #Medium #Top_100_Liked_Questions #Array #Two_Pointers #Big_O_Time_O(n)_Space_O(1) -// #2023_09_26_Time_47_ms_(99.30%)_Space_45_MB_(20.98%) +// #2025_03_22_Time_0_ms_(100.00%)_Space_58.80_MB_(7.83%) /* Do not return anything, modify nums in-place instead. */ 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/s0032_longest_valid_parentheses/solution.ts b/src/main/ts/g0001_0100/s0032_longest_valid_parentheses/solution.ts index 69b2a24d..d210153f 100644 --- a/src/main/ts/g0001_0100/s0032_longest_valid_parentheses/solution.ts +++ b/src/main/ts/g0001_0100/s0032_longest_valid_parentheses/solution.ts @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #String #Dynamic_Programming #Stack #Big_O_Time_O(n)_Space_O(1) -// #2023_09_26_Time_56_ms_(89.31%)_Space_43.9_MB_(100.00%) +// #2025_03_22_Time_3_ms_(71.05%)_Space_58.66_MB_(24.21%) function longestValidParentheses(s: string): number { let open = 0 diff --git a/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts b/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts index 4ec9c9c2..d2234e11 100644 --- a/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts +++ b/src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts @@ -1,7 +1,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) -// #2023_09_27_Time_43_ms_(98.54%)_Space_44.3_MB_(31.85%) +// #Udemy_Binary_Search #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_03_22_Time_0_ms_(100.00%)_Space_56.20_MB_(19.74%) function search(nums: number[], target: number): number { //NOSONAR let lowEnd: number = 0 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 32557da8..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 @@ -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_09_27_Time_45_ms_(98.05%)_Space_44.5_MB_(54.86%) +// #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_03_22_Time_0_ms_(100.00%)_Space_57.18_MB_(12.18%) function searchRange(nums: number[], target: number): number[] { //NOSONAR let first = -1 @@ -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/s0035_search_insert_position/solution.ts b/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts index 7aee8a49..f1ec2351 100644 --- a/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts +++ b/src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts @@ -1,6 +1,6 @@ // #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) -// #2023_09_27_Time_51_ms_(80.95%)_Space_44.6_MB_(16.67%) +// #Binary_Search_I_Day_2 #Top_Interview_150_Binary_Search #Big_O_Time_O(log_n)_Space_O(1) +// #2025_03_22_Time_0_ms_(100.00%)_Space_56.30_MB_(12.51%) function searchInsert(nums: number[], target: number): number { let left = 0 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 fab12ba2..c518fdfb 100644 --- a/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts +++ b/src/main/ts/g0001_0100/s0039_combination_sum/solution.ts @@ -1,11 +1,11 @@ // #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_09_29_Time_65_ms_(86.86%)_Space_45.8_MB_(75.98%) +// #Top_Interview_150_Backtracking #Big_O_Time_O(2^n)_Space_O(n+2^n) +// #2025_03_22_Time_1_ms_(98.17%)_Space_61.61_MB_(21.40%) 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/s0041_first_missing_positive/solution.ts b/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts index c2965b2f..2b742a76 100644 --- a/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts +++ b/src/main/ts/g0001_0100/s0041_first_missing_positive/solution.ts @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays -// #Big_O_Time_O(n)_Space_O(n) #2023_09_29_Time_55_ms_(98.51%)_Space_49.8_MB_(60.20%) +// #Big_O_Time_O(n)_Space_O(n) #2025_03_23_Time_1_ms_(99.11%)_Space_65.96_MB_(40.18%) function firstMissingPositive(nums: number[]): number { let i = 0 diff --git a/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts b/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts index c65df740..5f5e5c04 100644 --- a/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts +++ b/src/main/ts/g0001_0100/s0042_trapping_rain_water/solution.ts @@ -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_09_30_Time_46_ms_(99.52%)_Space_44.4_MB_(97.58%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_57.78_MB_(55.13%) function trap(height: number[]): number { let result = 0 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 ca063608..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 @@ -1,41 +1,24 @@ // #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_09_30_Time_50_ms_(95.93%)_Space_44.9_MB_(65.88%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_03_23_Time_1_ms_(84.27%)_Space_58.46_MB_(28.93%) -function jump(nums: number[]): number { //NOSONAR - let minJmp = new Array(nums.length) - if (nums.length === 1) return 0 - let prevIndex = 0 - minJmp[prevIndex] = 0 - while (prevIndex < nums.length - 1) { - let nextMaxJmpTo = nums[prevIndex] + prevIndex - let prevIndexJmp = minJmp[prevIndex] - - let farthestJumpVal = -1 - let farthestJumpIndex = -1 - for (let i = nextMaxJmpTo; ; i--) { - if (i >= nums.length) { - continue - } - if (i === nums.length - 1) { - return prevIndexJmp + 1 - } - if (minJmp[i] != undefined) { +function jump(nums: number[]): number { + let minJump = 0, + farthest = 0, + currentEnd = 0 + for (let i = 0; i < nums.length - 1; i++) { + farthest = Math.max(farthest, i + nums[i]) + // If we've reached the end of the current jump range + if (i === currentEnd) { + minJump++ + currentEnd = farthest + if (currentEnd >= nums.length - 1) { break } - minJmp[i] = prevIndexJmp + 1 - let curmaxTo = nums[i] + i - if (farthestJumpVal < curmaxTo) { - farthestJumpVal = curmaxTo - farthestJumpIndex = i - } - } - if (farthestJumpIndex === -1) { - return -1 } - prevIndex = farthestJumpIndex } - return minJmp[nums.length - 1] + return minJump } export { jump } diff --git a/src/main/ts/g0001_0100/s0046_permutations/solution.ts b/src/main/ts/g0001_0100/s0046_permutations/solution.ts index 2a973978..2cef51a1 100644 --- a/src/main/ts/g0001_0100/s0046_permutations/solution.ts +++ b/src/main/ts/g0001_0100/s0046_permutations/solution.ts @@ -1,7 +1,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!) -// #2023_09_30_Time_56_ms_(96.26%)_Space_45.7_MB_(55.35%) +// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!) +// #2025_03_23_Time_1_ms_(84.44%)_Space_60.84_MB_(26.93%) function permute(nums: number[]): number[][] { const result: number[][] = [] diff --git a/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts b/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts index 8309b393..7f7feac6 100644 --- a/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts +++ b/src/main/ts/g0001_0100/s0048_rotate_image/solution.ts @@ -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_09_30_Time_45_ms_(95.31%)_Space_44.4_MB_(48.24%) +// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_57.37_MB_(17.79%) /* Do not return anything, modify matrix in-place instead. diff --git a/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts b/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts index 0e7e54df..8df43fb2 100644 --- a/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts +++ b/src/main/ts/g0001_0100/s0049_group_anagrams/solution.ts @@ -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_09_30_Time_93_ms_(97.29%)_Space_52_MB_(99.08%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n) +// #2025_03_23_Time_27_ms_(78.99%)_Space_68.93_MB_(28.40%) function groupAnagrams(strs: string[]): string[][] { if (strs.length === 1) return [strs] diff --git a/src/main/ts/g0001_0100/s0051_n_queens/solution.ts b/src/main/ts/g0001_0100/s0051_n_queens/solution.ts index 1d423f34..e89d7fef 100644 --- a/src/main/ts/g0001_0100/s0051_n_queens/solution.ts +++ b/src/main/ts/g0001_0100/s0051_n_queens/solution.ts @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N) -// #2023_09_30_Time_57_ms_(93.84%)_Space_45_MB_(83.56%) +// #2025_03_23_Time_6_ms_(95.85%)_Space_59.90_MB_(33.61%) function solveNQueens(n: number): string[][] { const result: string[][] = [] diff --git a/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts b/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts index 7e5d91da..1ab9566f 100644 --- a/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts +++ b/src/main/ts/g0001_0100/s0053_maximum_subarray/solution.ts @@ -1,7 +1,7 @@ -// #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) -// #2023_09_30_Time_66_ms_(90.36%)_Space_51.9_MB_(80.92%) +// #Udemy_Famous_Algorithm #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_65.50_MB_(44.96%) function maxSubArray(nums: number[]): number { let curSum: number = nums[0] diff --git a/src/main/ts/g0001_0100/s0055_jump_game/solution.ts b/src/main/ts/g0001_0100/s0055_jump_game/solution.ts index 90097bb1..c38b2fa6 100644 --- a/src/main/ts/g0001_0100/s0055_jump_game/solution.ts +++ b/src/main/ts/g0001_0100/s0055_jump_game/solution.ts @@ -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_09_30_Time_58_ms_(91.95%)_Space_47.4_MB_(70.79%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_59.92_MB_(51.18%) function canJump(nums: number[]): boolean { let availableSteps = nums[0] diff --git a/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts b/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts index e67357b5..7d4e91b4 100644 --- a/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts +++ b/src/main/ts/g0001_0100/s0056_merge_intervals/solution.ts @@ -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_10_01_Time_84_ms_(92.06%)_Space_49.9_MB_(69.16%) +// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n) +// #2025_03_23_Time_7_ms_(87.99%)_Space_66.00_MB_(36.16%) function merge(intervals: number[][]): number[][] { let result = [] 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 241091f4..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,19 +1,18 @@ // #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_10_01_Time_40_ms_(98.97%)_Space_42.8_MB_(72.52%) +// #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 { - const factorialize = (x: number) => { - if (x <= 1) return 1 - let res = x - while (x > 1) { - x-- - res *= x + let aboveRow = Array(n).fill(1) + for (let row = 1; row < m; row++) { + let currentRow = Array(n).fill(1) + for (let col = 1; col < n; col++) { + currentRow[col] = currentRow[col - 1] + aboveRow[col] } - return res + aboveRow = currentRow } - return factorialize(m + n - 2) / factorialize(m - 1) / factorialize(n - 1) + return aboveRow[n - 1] } export { uniquePaths } diff --git a/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts b/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts index 2948ef7e..82b84c84 100644 --- a/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts +++ b/src/main/ts/g0001_0100/s0064_minimum_path_sum/solution.ts @@ -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_10_01_Time_48_ms_(99.67%)_Space_44.5_MB_(90.16%) +// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP +// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_03_23_Time_4_ms_(70.73%)_Space_59.31_MB_(26.29%) function minPathSum(grid: number[][]): number { let [m, n] = [grid.length, grid[0].length] 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 93347d75..305252fe 100644 --- a/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts +++ b/src/main/ts/g0001_0100/s0070_climbing_stairs/solution.ts @@ -1,12 +1,18 @@ // #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_10_01_Time_44_ms_(94.58%)_Space_42.4_MB_(73.09%) +// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP +// #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/readme.md b/src/main/ts/g0001_0100/s0072_edit_distance/readme.md index fbd054c9..75d48eda 100644 --- a/src/main/ts/g0001_0100/s0072_edit_distance/readme.md +++ b/src/main/ts/g0001_0100/s0072_edit_distance/readme.md @@ -1,6 +1,6 @@ 72\. Edit Distance -Hard +Medium Given two strings `word1` and `word2`, return _the minimum number of operations required to convert `word1` to `word2`_. 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 58e4c6b8..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,14 +1,16 @@ -// #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) -// #2023_10_01_Time_68_ms_(95.20%)_Space_47.3_MB_(78.40%) +// #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%) function minDistance(word1: string, word2: string): number { const memo: number[][] = new Array(word1.length + 1).fill(0).map((_) => []) 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/s0073_set_matrix_zeroes/solution.ts b/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts index 15009210..dde26bbb 100644 --- a/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts +++ b/src/main/ts/g0001_0100/s0073_set_matrix_zeroes/solution.ts @@ -1,6 +1,6 @@ // #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) -// #2023_10_01_Time_61_ms_(97.66%)_Space_45.9_MB_(30.73%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1) +// #2025_03_23_Time_4_ms_(50.63%)_Space_61.42_MB_(6.15%) /* Do not return anything, modify matrix in-place instead. diff --git a/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts b/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts index f0a582f9..3e684a75 100644 --- a/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts +++ b/src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts @@ -1,7 +1,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) -// #2023_10_01_Time_45_ms_(96.82%)_Space_44.3_MB_(43.77%) +// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_54.50_MB_(46.86%) function searchMatrix(matrix: number[][], target: number): boolean { const [m, n] = [matrix.length, matrix[0].length] diff --git a/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts b/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts index 5e3173e7..deadd9fd 100644 --- a/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts +++ b/src/main/ts/g0001_0100/s0075_sort_colors/solution.ts @@ -1,6 +1,6 @@ // #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) -// #2023_10_02_Time_43_ms_(97.41%)_Space_42.5_MB_(85.34%) +// #2025_03_23_Time_0_ms_(100.00%)_Space_56.04_MB_(26.80%) const sortColors = (nums: number[]) => { let i = 0 diff --git a/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts b/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts index 10e234f3..c069ae15 100644 --- a/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts +++ b/src/main/ts/g0001_0100/s0076_minimum_window_substring/solution.ts @@ -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_10_02_Time_82_ms_(82.17%)_Space_46.2_MB_(81.89%) +// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window +// #Big_O_Time_O(s.length())_Space_O(1) #2025_03_23_Time_20_ms_(90.35%)_Space_58.72_MB_(57.91%) function minWindow(s: string, t: string): string { //NOSONAR const map: Map = new Map() diff --git a/src/main/ts/g0001_0100/s0078_subsets/solution.ts b/src/main/ts/g0001_0100/s0078_subsets/solution.ts index 39715040..5a9c3617 100644 --- a/src/main/ts/g0001_0100/s0078_subsets/solution.ts +++ b/src/main/ts/g0001_0100/s0078_subsets/solution.ts @@ -1,10 +1,12 @@ // #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) #2023_10_02_Time_50_ms_(94.61%)_Space_44.8_MB_(75.83%) +// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_03_23_Time_0_ms_(100.00%)_Space_58.49_MB_(41.68%) -const subsets = (nums: number[]): number[][] => { +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 d76d6438..e6f40c40 100644 --- a/src/main/ts/g0001_0100/s0079_word_search/solution.ts +++ b/src/main/ts/g0001_0100/s0079_word_search/solution.ts @@ -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_10_03_Time_327_ms_(95.78%)_Space_43.4_MB_(84.98%) +// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking +// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_03_23_Time_243_ms_(85.30%)_Space_56.58_MB_(58.26%) function exist(board: string[][], word: string): boolean { if (word.length === 0) return false @@ -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/s0084_largest_rectangle_in_histogram/solution.ts b/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts index 9b6c6712..634843d3 100644 --- a/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts +++ b/src/main/ts/g0001_0100/s0084_largest_rectangle_in_histogram/solution.ts @@ -1,5 +1,5 @@ // #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack -// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2023_10_03_Time_78_ms_(92.44%)_Space_56.8_MB_(85.29%) +// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_03_23_Time_15_ms_(72.81%)_Space_72.66_MB_(37.28%) function largestRectangleArea(heights: number[]): number { let stack = [] 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 6bf7b208..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 @@ -1,10 +1,10 @@ // #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) -// #2023_10_03_Time_45_ms_(97.30%)_Space_42.9_MB_(96.73%) +// #2025_03_23_Time_0_ms_(100.00%)_Space_54.69_MB_(46.13%) 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/s0096_unique_binary_search_trees/solution.ts b/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts index c129e65d..39753dce 100644 --- a/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts +++ b/src/main/ts/g0001_0100/s0096_unique_binary_search_trees/solution.ts @@ -1,6 +1,6 @@ -// #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) -// #2023_10_03_Time_45_ms_(96.00%)_Space_42.9_MB_(25.33%) +// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree +// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1) +// #2025_03_23_Time_0_ms_(100.00%)_Space_55.21_MB_(33.33%) function numTrees(n: number): number { const uniqueCount = new Array(n + 1).fill(0) 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 3e277a4c..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 @@ -1,14 +1,33 @@ // #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)) -// #2023_10_03_Time_51_ms_(98.35%)_Space_47.3_MB_(61.68%) +// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_03_23_Time_0_ms_(100.00%)_Space_60.76_MB_(21.74%) 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 8c4b1099..ebb30654 100644 --- a/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts +++ b/src/main/ts/g0101_0200/s0101_symmetric_tree/solution.ts @@ -1,10 +1,11 @@ // #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_10_04_Time_49_ms_(98.54%)_Space_45_MB_(59.02%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N)) +// #2025_03_23_Time_0_ms_(100.00%)_Space_58.35_MB_(25.66%) import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number @@ -18,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 c7ad9229..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 @@ -1,10 +1,11 @@ // #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_10_04_Time_60_ms_(97.47%)_Space_47_MB_(77.89%) +// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N) +// #2025_03_23_Time_0_ms_(100.00%)_Space_59.70_MB_(51.83%) import { TreeNode } from '../../com_github_leetcode/treenode' -/* +/** * Definition for a binary tree node. * class TreeNode { * val: number @@ -18,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) { @@ -27,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 0956744e..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,11 +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 -// #Big_O_Time_O(N)_Space_O(H) #2023_10_04_Time_51_ms_(97.14%)_Space_46.1_MB_(68.29%) +// #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 2489097a..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 @@ -1,10 +1,10 @@ // #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_10_04_Time_65_ms_(96.47%)_Space_45.9_MB_(80.00%) +// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_03_26_Time_2_ms_(93.38%)_Space_60.17_MB_(76.57%) 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 449dae4e..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 @@ -1,10 +1,10 @@ // #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) -// #2023_10_04_Time_55_ms_(90.66%)_Space_45.8_MB_(12.11%) +// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N) +// #2025_03_26_Time_0_ms_(100.00%)_Space_58.93_MB_(15.60%) 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/s0121_best_time_to_buy_and_sell_stock/solution.ts b/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts index b91860d1..e55644fe 100644 --- a/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts +++ b/src/main/ts/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.ts @@ -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_10_05_Time_56_ms_(99.56%)_Space_52.3_MB_(13.22%) +// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1) +// #2025_03_26_Time_1_ms_(96.44%)_Space_65.83_MB_(26.02%) function maxProfit(prices: number[]): number { let buyPrice = prices[0] 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 923d6dbd..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 @@ -1,10 +1,10 @@ // #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_10_05_Time_61_ms_(96.73%)_Space_51.2_MB_(97.45%) +// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General +// #Big_O_Time_O(N)_Space_O(N) #2025_03_26_Time_2_ms_(71.11%)_Space_65.59_MB_(42.96%) 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 aa556768..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 @@ -1,17 +1,21 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find -// #Big_O_Time_O(N_log_N)_Space_O(1) #2023_10_05_Time_92_ms_(93.69%)_Space_64_MB_(30.13%) +// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1) +// #2025_03_26_Time_34_ms_(90.07%)_Space_82.70_MB_(18.54%) function longestConsecutive(nums: number[]): number { - const set = new Set(nums) - let max = 0 - for (const num of nums) { - if (set.has(num + 1)) continue - let counter = 1, - current = num - while (set.has(--current)) counter++ - max = Math.max(counter, max) + let sset = new Set(nums) + 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)) { + len += 1 + } + maxLen = Math.max(maxLen, len) + } } - return max + return maxLen } export { longestConsecutive } diff --git a/src/main/ts/g0101_0200/s0131_palindrome_partitioning/solution.ts b/src/main/ts/g0101_0200/s0131_palindrome_partitioning/solution.ts index 32dca7c6..406ce3d7 100644 --- a/src/main/ts/g0101_0200/s0131_palindrome_partitioning/solution.ts +++ b/src/main/ts/g0101_0200/s0131_palindrome_partitioning/solution.ts @@ -1,6 +1,6 @@ // #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming // #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N) -// #2023_10_05_Time_203_ms_(99.22%)_Space_81.9_MB_(42.19%) +// #2025_03_26_Time_13_ms_(94.96%)_Space_82.19_MB_(40.76%) function partition(s: string): string[][] { const ans: string[][] = [] 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 4f569f03c..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,6 +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 -// #Big_O_Time_O(N)_Space_O(1) #2023_10_05_Time_56_ms_(85.48%)_Space_45.6_MB_(63.32%) +// #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 cabd0ff3..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 @@ -1,10 +1,10 @@ // #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_10_06_Time_52_ms_(88.27%)_Space_44.7_MB_(72.42%) +// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(N) #2025_03_26_Time_49_ms_(72.42%)_Space_55.82_MB_(59.25%) 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 00ccbdc1..9088d597 100644 --- a/src/main/ts/g0101_0200/s0139_word_break/solution.ts +++ b/src/main/ts/g0101_0200/s0139_word_break/solution.ts @@ -1,18 +1,22 @@ // #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_10_06_Time_56_ms_(88.44%)_Space_44.1_MB_(93.39%) +// #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_03_26_Time_4_ms_(76.41%)_Space_58.68_MB_(22.70%) 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 56e2c6bc..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 @@ -1,10 +1,10 @@ // #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_10_06_Time_59_ms_(93.37%)_Space_45.2_MB_(76.28%) +// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_47_ms_(89.37%)_Space_58.35_MB_(35.02%) 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 645027c6..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 @@ -1,10 +1,10 @@ // #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) #2023_10_06_Time_59_ms_(94.39%)_Space_45.5_MB_(60.71%) +// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_51_ms_(76.99%)_Space_59.02_MB_(13.39%) 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/s0146_lru_cache/solution.ts b/src/main/ts/g0101_0200/s0146_lru_cache/solution.ts index 76159e65..9730a722 100644 --- a/src/main/ts/g0101_0200/s0146_lru_cache/solution.ts +++ b/src/main/ts/g0101_0200/s0146_lru_cache/solution.ts @@ -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_10_06_Time_473_ms_(94.72%)_Space_125.1_MB_(69.62%) +// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List +// #Big_O_Time_O(1)_Space_O(capacity) #2025_03_26_Time_97_ms_(81.52%)_Space_108.56_MB_(48.32%) interface ICacheNode { key: number 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 4151a304..75067693 100644 --- a/src/main/ts/g0101_0200/s0148_sort_list/solution.ts +++ b/src/main/ts/g0101_0200/s0148_sort_list/solution.ts @@ -1,10 +1,10 @@ // #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_10_08_Time_141_ms_(97.14%)_Space_71.9_MB_(47.35%) +// #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_03_26_Time_36_ms_(44.94%)_Space_86.58_MB_(5.99%) 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/s0152_maximum_product_subarray/solution.ts b/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts index 111705f4..64b02b91 100644 --- a/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts +++ b/src/main/ts/g0101_0200/s0152_maximum_product_subarray/solution.ts @@ -1,6 +1,6 @@ // #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) #2023_10_08_Time_53_ms_(87.50%)_Space_44.6_MB_(63.86%) +// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_0_ms_(100.00%)_Space_58.34_MB_(23.08%) function maxProduct(nums: number[]): number { let cMin = 1 diff --git a/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts b/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts index c8c4ea3b..379c4029 100644 --- a/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts +++ b/src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts @@ -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_10_08_Time_42_ms_(98.87%)_Space_42.9_MB_(84.75%) +// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search +// #Big_O_Time_O(log_N)_Space_O(log_N) #2025_03_26_Time_0_ms_(100.00%)_Space_55.42_MB_(40.88%) function findMin(nums: number[]): number { return Math.min(...nums) diff --git a/src/main/ts/g0101_0200/s0155_min_stack/solution.ts b/src/main/ts/g0101_0200/s0155_min_stack/solution.ts index 9912e0f8..9c29aa2a 100644 --- a/src/main/ts/g0101_0200/s0155_min_stack/solution.ts +++ b/src/main/ts/g0101_0200/s0155_min_stack/solution.ts @@ -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_10_08_Time_84_ms_(92.72%)_Space_51.8_MB_(30.46%) +// #Udemy_Design #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N) +// #2025_03_26_Time_5_ms_(99.10%)_Space_65.70_MB_(50.04%) class MinStack { stack: number[] 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 7c4e9901..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 @@ -1,10 +1,10 @@ // #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) -// #2023_10_08_Time_67_ms_(93.58%)_Space_50.8_MB_(40.54%) +// #2025_03_26_Time_65_ms_(72.36%)_Space_63.62_MB_(41.12%) import { ListNode } from '../../com_github_leetcode/listnode' -/* +/** * Definition for singly-linked list. * class ListNode { * val: number diff --git a/src/main/ts/g0101_0200/s0169_majority_element/solution.ts b/src/main/ts/g0101_0200/s0169_majority_element/solution.ts index e394d696..ad4b8843 100644 --- a/src/main/ts/g0101_0200/s0169_majority_element/solution.ts +++ b/src/main/ts/g0101_0200/s0169_majority_element/solution.ts @@ -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_10_09_Time_50_ms_(96.16%)_Space_46.1_MB_(46.90%) +// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1) +// #2025_03_26_Time_0_ms_(100.00%)_Space_60.31_MB_(17.26%) function majorityElement(arr: number[]): number { let count = 1 diff --git a/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts b/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts index b6c7b1e0..f645bc78 100644 --- a/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts +++ b/src/main/ts/g0101_0200/s0189_rotate_array/solution.ts @@ -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_10_09_Time_75_ms_(97.25%)_Space_52_MB_(63.34%) +// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String +// #Big_O_Time_O(n)_Space_O(1) #2025_03_26_Time_1_ms_(86.17%)_Space_64.71_MB_(43.34%) /* Do not return anything, modify nums in-place instead. 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 6b1c4368..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,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_10_09_Time_51_ms_(77.29%)_Space_42.7_MB_(62.58%) +// #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%) function rob(nums: number[]): number { const n = nums.length diff --git a/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts b/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts index db5cfb09..87b9e953 100644 --- a/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts +++ b/src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts @@ -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_10_09_Time_61_ms_(96.71%)_Space_44.5_MB_(99.30%) +// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N) +// #2025_03_26_Time_57_ms_(93.94%)_Space_59.21_MB_(64.22%) function numIslands(grid: string[][]): number { let islands = 0 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 513c8c4d..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) -// #2023_10_09_Time_51_ms_(92.87%)_Space_44.3_MB_(96.03%) +// #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 db5be9f1..1b23ff34 100644 --- a/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts +++ b/src/main/ts/g0201_0300/s0207_course_schedule/solution.ts @@ -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_10_09_Time_68_ms_(70.14%)_Space_47.7_MB_(73.55%) +// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General +// #Big_O_Time_O(N)_Space_O(N) #2025_03_26_Time_11_ms_(81.08%)_Space_62.76_MB_(51.00%) const WHITE = 0 const GRAY = 1 @@ -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 aafabc93..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,7 +1,7 @@ // #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_10_09_Time_168_ms_(80.99%)_Space_79.5_MB_(14.46%) +// #2025_03_26_Time_48_ms_(63.95%)_Space_81.97_MB_(12.22%) class TrieNode { children: TrieNode[] 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 bc2ec151..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,10 +1,20 @@ // #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)) #2023_10_09_Time_148_ms_(54.45%)_Space_51.5_MB_(73.60%) +// #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 { - nums.sort((prev, next) => next - prev) - return nums[k - 1] + const countingLen = 2e4 + 1 + const counting = new Int32Array(countingLen) + for (const num of nums) { + counting[num + 1e4]++ + } + for (let i = countingLen - 1; i >= 0; i--) { + k -= counting[i] + if (k <= 0) { + return i - 1e4 + } + } } export { findKthLargest } diff --git a/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts b/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts index 10aa2ceb..81cafc96 100644 --- a/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts +++ b/src/main/ts/g0201_0300/s0221_maximal_square/solution.ts @@ -1,6 +1,6 @@ -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix -// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n) -// #2023_10_09_Time_83_ms_(79.70%)_Space_50.2_MB_(56.39%) +// #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_03_28_Time_18_ms_(59.02%)_Space_66.03_MB_(29.27%) function maximalSquare(matrix: string[][]): number { const m = matrix.length diff --git a/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts b/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts index 4f1b49cd..48871331 100644 --- a/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts +++ b/src/main/ts/g0201_0300/s0226_invert_binary_tree/solution.ts @@ -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_10_09_Time_52_ms_(81.65%)_Space_44.2_MB_(79.49%) +// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n) +// #2025_03_28_Time_0_ms_(100.00%)_Space_55.85_MB_(47.98%) function invertTree(root: TreeNode | null): TreeNode | null { if (root === null) { 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 c40c6329..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 @@ -1,8 +1,9 @@ -// #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_10_09_Time_54_ms_(97.22%)_Space_47.7_MB_(99.80%) +// #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_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 32ca9bec..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 @@ -1,8 +1,8 @@ -// #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) -// #2023_10_09_Time_96_ms_(95.67%)_Space_72.8_MB_(87.01%) +// #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_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 4d770b31..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 #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) -// #2023_10_09_Time_59_ms_(96.11%)_Space_52.8_MB_(24.18%) +// #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_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 cded71d5..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 #Top_Interview_Questions #Array #Prefix_Sum -// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n) -// #2023_10_09_Time_89_ms_(64.48%)_Space_55.4_MB_(36.71%) +// #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/s0239_sliding_window_maximum/solution.ts b/src/main/ts/g0201_0300/s0239_sliding_window_maximum/solution.ts index 4d38555e..5f944d08 100644 --- a/src/main/ts/g0201_0300/s0239_sliding_window_maximum/solution.ts +++ b/src/main/ts/g0201_0300/s0239_sliding_window_maximum/solution.ts @@ -1,6 +1,6 @@ -// #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) -// #2023_10_06_Time_216_ms_(99.50%)_Space_71.4_MB_(89.85%) +// #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_03_28_Time_26_ms_(99.07%)_Space_86.22_MB_(58.38%) function maxSlidingWindow(nums: number[], k: number): number[] { const result: number[] = [] diff --git a/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts b/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts index ee066065..beef395c 100644 --- a/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts +++ b/src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts @@ -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_10_06_Time_58_ms_(64.44%)_Space_45.6_MB_(50.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) +// #2025_03_28_Time_42_ms_(94.61%)_Space_58.52_MB_(36.53%) function searchMatrix(matrix: number[][], target: number): boolean { let r: number = 0 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 98ef3364..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 #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_10_06_Time_71_ms_(91.63%)_Space_47.2_MB_(57.52%) +// #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/g0201_0300/s0287_find_the_duplicate_number/solution.ts b/src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts index 02a43b77..9bcd4eeb 100644 --- a/src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts +++ b/src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts @@ -1,6 +1,6 @@ -// #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) -// #2023_10_06_Time_60_ms_(98.11%)_Space_53.5_MB_(50.00%) +// #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_03_28_Time_5_ms_(88.65%)_Space_67.23_MB_(32.75%) function findDuplicate(nums: number[]): number { const arr: number[] = new Array(nums.length + 1).fill(0) diff --git a/src/main/ts/g0201_0300/s0295_find_median_from_data_stream/solution.ts b/src/main/ts/g0201_0300/s0295_find_median_from_data_stream/solution.ts index d429c85f..99e79e22 100644 --- a/src/main/ts/g0201_0300/s0295_find_median_from_data_stream/solution.ts +++ b/src/main/ts/g0201_0300/s0295_find_median_from_data_stream/solution.ts @@ -1,6 +1,6 @@ -// #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) -// #2023_10_13_Time_335_ms_(99.44%)_Space_96.8_MB_(69.49%) +// #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_03_28_Time_106_ms_(92.31%)_Space_94.21_MB_(5.43%) class Heap { private heap: number[] diff --git a/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts b/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts index 742db90e..c45a8f5c 100644 --- a/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts +++ b/src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts @@ -1,7 +1,7 @@ -// #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) -// #2023_10_04_Time_57_ms_(93.75%)_Space_45_MB_(33.55%) +// #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_03_28_Time_6_ms_(84.68%)_Space_58.13_MB_(39.69%) function lengthOfLIS(nums: number[]): number { if (nums === null || nums.length === 0) { diff --git a/src/main/ts/g0301_0400/s0322_coin_change/solution.ts b/src/main/ts/g0301_0400/s0322_coin_change/solution.ts index d91f8c61..c9cc931f 100644 --- a/src/main/ts/g0301_0400/s0322_coin_change/solution.ts +++ b/src/main/ts/g0301_0400/s0322_coin_change/solution.ts @@ -1,7 +1,7 @@ -// #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) -// #2023_10_04_Time_85_ms_(86.14%)_Space_47.7_MB_(84.40%) +// #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_03_28_Time_27_ms_(89.42%)_Space_61.11_MB_(55.40%) function coinChange(coins: number[], amount: number): number { const dp: number[] = new Array(amount + 1).fill(0) 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 8ff56ee7..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 #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation -// #Big_O_Time_O(num)_Space_O(num) #2023_10_04_Time_69_ms_(86.81%)_Space_49_MB_(78.01%) +// #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/s0347_top_k_frequent_elements/solution.ts b/src/main/ts/g0301_0400/s0347_top_k_frequent_elements/solution.ts index ee32d6ec..d925d9e5 100644 --- a/src/main/ts/g0301_0400/s0347_top_k_frequent_elements/solution.ts +++ b/src/main/ts/g0301_0400/s0347_top_k_frequent_elements/solution.ts @@ -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_10_04_Time_62_ms_(87.48%)_Space_45.6_MB_(67.84%) +// #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_03_28_Time_7_ms_(87.13%)_Space_59.57_MB_(56.27%) function topKFrequent(nums: number[], k: number): number[] { let elementCount = new Array(nums.length) 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 6adb121e..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) #2023_10_04_Time_51_ms_(81.02%)_Space_43_MB_(55.52%) +// #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/s0416_partition_equal_subset_sum/solution.ts b/src/main/ts/g0401_0500/s0416_partition_equal_subset_sum/solution.ts index 5ad63754..aa05ea46 100644 --- a/src/main/ts/g0401_0500/s0416_partition_equal_subset_sum/solution.ts +++ b/src/main/ts/g0401_0500/s0416_partition_equal_subset_sum/solution.ts @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming -// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2023_09_30_Time_91_ms_(74.38%)_Space_44.7_MB_(83.25%) +// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_03_28_Time_33_ms_(93.24%)_Space_59.12_MB_(71.50%) function canPartition(nums: number[]): boolean { let sums: number = 0 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 9a2b73bb..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 #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree -// #Big_O_Time_O(n)_Space_O(n) #2023_09_30_Time_68_ms_(86.71%)_Space_47.3_MB_(98.10%) +// #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/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts b/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts index 4b72af78..6cd3d9bf 100644 --- a/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts +++ b/src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts @@ -1,7 +1,7 @@ // #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) -// #2023_09_30_Time_69_ms_(96.69%)_Space_46.1_MB_(80.99%) +// #2025_03_28_Time_8_ms_(97.80%)_Space_59.42_MB_(72.16%) function findAnagrams(s: string, p: string): number[] { const map: number[] = new Array(26).fill(0) diff --git a/src/main/ts/g0401_0500/s0494_target_sum/solution.ts b/src/main/ts/g0401_0500/s0494_target_sum/solution.ts index c6fe3222..0e087306 100644 --- a/src/main/ts/g0401_0500/s0494_target_sum/solution.ts +++ b/src/main/ts/g0401_0500/s0494_target_sum/solution.ts @@ -1,6 +1,5 @@ -// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Backtracking -// #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) -// #2023_09_30_Time_77_ms_(81.99%)_Space_48.3_MB_(62.73%) +// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s)) +// #2025_03_28_Time_24_ms_(83.43%)_Space_63.15_MB_(21.89%) function findTargetSumWays(nums: number[], s: number): number { let sum: number = 0 diff --git a/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts b/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts index db0215c0..1480bfa4 100644 --- a/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts +++ b/src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts @@ -1,6 +1,6 @@ // #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) -// #2023_09_30_Time_61_ms_(80.89%)_Space_47.4_MB_(18.15%) +// #2025_03_28_Time_1_ms_(87.16%)_Space_63.47_MB_(59.51%) function diameterOfBinaryTree(root: TreeNode | null): number { let ans = 0 diff --git a/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts b/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts index 831ff8d5..3ccaa10b 100644 --- a/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts +++ b/src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts @@ -1,5 +1,5 @@ // #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array -// #Big_O_Time_O(n)_Space_O(n) #2023_09_30_Time_70_ms_(92.45%)_Space_52.7_MB_(27.70%) +// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_14_ms_(87.34%)_Space_67.32_MB_(18.02%) function subarraySum(nums: number[], k: number): number { let tempSum: number = 0 diff --git a/src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts b/src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts index e97f100c..e4fc2abb 100644 --- a/src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts +++ b/src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts @@ -1,5 +1,5 @@ -// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) -// #2023_09_30_Time_60_ms_(89.76%)_Space_43_MB_(93.98%) +// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n) +// #2025_03_28_Time_5_ms_(100.00%)_Space_56.80_MB_(51.20%) function expand(a: string[], l: number, r: number, res: number[]): void { while (l >= 0 && r < a.length) { 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 77f9d78c..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) #2023_09_30_Time_194_ms_(97.36%)_Space_66.2_MB_(69.52%) +// #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/g0701_0800/s0763_partition_labels/solution.ts b/src/main/ts/g0701_0800/s0763_partition_labels/solution.ts index 2cdf78fd..a9fdb0e7 100644 --- a/src/main/ts/g0701_0800/s0763_partition_labels/solution.ts +++ b/src/main/ts/g0701_0800/s0763_partition_labels/solution.ts @@ -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_09_30_Time_54_ms_(94.74%)_Space_45.2_MB_(56.58%) +// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String +// #Big_O_Time_O(n)_Space_O(1) #2025_03_28_Time_4_ms_(86.89%)_Space_58.06_MB_(34.43%) function partitionLabels(s: string): number[] { const map = new Map() 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 ddfcd36e..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,7 +1,7 @@ -// #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_09_30_Time_94_ms_(80.56%)_Space_73.5_MB_(53.24%) +// #2025_03_28_Time_50_ms_(69.40%)_Space_85.72_MB_(16.94%) function longestCommonSubsequence(text1: string, text2: string): number { const n: number = text1.length