Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/poseidon-code/neetcode-solutions
C++ / Go / Python / Java Solutions for problems in https://neetcode.io
https://github.com/poseidon-code/neetcode-solutions
cpp go java leetcode neetcode python solutions
Last synced: 2 months ago
JSON representation
C++ / Go / Python / Java Solutions for problems in https://neetcode.io
- Host: GitHub
- URL: https://github.com/poseidon-code/neetcode-solutions
- Owner: poseidon-code
- Created: 2022-07-20T17:00:39.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2024-06-01T15:43:34.000Z (8 months ago)
- Last Synced: 2024-06-01T17:55:21.705Z (8 months ago)
- Topics: cpp, go, java, leetcode, neetcode, python, solutions
- Language: Java
- Homepage:
- Size: 765 KB
- Stars: 4
- Watchers: 2
- Forks: 2
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Arrays & Hashing
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 217 | Easy | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [C++](./01-arrays_%26_hashing/00217-Contains_Duplicate/00217-contains_duplicate.cpp) • [Go](./01-arrays_%26_hashing/00217-Contains_Duplicate/00217-contains_duplicate.go) • [Java](./01-arrays_%26_hashing/00217-Contains_Duplicate/00217-contains_duplicate.java) • [Python](./01-arrays_%26_hashing/00217-Contains_Duplicate/00217-contains_duplicate.py) |
| 242 | Easy | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [C++](./01-arrays_%26_hashing/00242-Valid_Anagram/00242-valid_anagram.cpp) • [Go](./01-arrays_%26_hashing/00242-Valid_Anagram/00242-valid_anagram.go) • [Java](./01-arrays_%26_hashing/00242-Valid_Anagram/00242-valid_anagram.java) • [Python](./01-arrays_%26_hashing/00242-Valid_Anagram/00242-valid_anagram.py) |
| 1 | Easy | [Two Sum](https://leetcode.com/problems/two-sum/) | [C++](./01-arrays_%26_hashing/00001-Two_Sum/00001-two_sum.cpp) • [Go](./01-arrays_%26_hashing/00001-Two_Sum/00001-two_sum.go) • [Java](./01-arrays_%26_hashing/00001-Two_Sum/00001-two_sum.java) • [Python](./01-arrays_%26_hashing/00001-Two_Sum/00001-two_sum.py) |
| 49 | Medium | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [C++](./01-arrays_%26_hashing/00049-Group_Anagrams/00049-group_anagrams.cpp) • [Go](./01-arrays_%26_hashing/00049-Group_Anagrams/00049-group_anagrams.go) • [Java](./01-arrays_%26_hashing/00049-Group_Anagrams/00049-group_anagrams.java) • [Python](./01-arrays_%26_hashing/00049-Group_Anagrams/00049-group_anagrams.py) |
| 347 | Medium | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [C++](./01-arrays_%26_hashing/00347-Top_K_Frequent_Elements/00347-top_k_frequent_elements.cpp) • [Go](./01-arrays_%26_hashing/00347-Top_K_Frequent_Elements/00347-top_k_frequent_elements.go) • [Java](./01-arrays_%26_hashing/00347-Top_K_Frequent_Elements/00347-top_k_frequent_elements.java) • [Python](./01-arrays_%26_hashing/00347-Top_K_Frequent_Elements/00347-top_k_frequent_elements.py) |
| 238 | Medium | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [C++](./01-arrays_%26_hashing/00238-Product_of_Array_Except_Self/00238-product_of_array_except_self.cpp) • [Go](./01-arrays_%26_hashing/00238-Product_of_Array_Except_Self/00238-product_of_array_except_self.go) • [Java](./01-arrays_%26_hashing/00238-Product_of_Array_Except_Self/00238-product_of_array_except_self.java) • [Python](./01-arrays_%26_hashing/00238-Product_of_Array_Except_Self/00238-product_of_array_except_self.py) |
| 36 | Medium | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/) | [C++](./01-arrays_%26_hashing/00036-Valid-Sudoku/00036-valid_sudoku.cpp) • [Go](./01-arrays_%26_hashing/00036-Valid-Sudoku/00036-valid_sudoku.go) • [Java](./01-arrays_%26_hashing/00036-Valid-Sudoku/00036-valid_sudoku.java) • [Python](./01-arrays_%26_hashing/00036-Valid-Sudoku/00036-valid_sudoku.py) |
| 128 | Medium | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [C++](./01-arrays_%26_hashing/00128-Longest_Consecutive_Sequence/00128-longest_consecutive_sequence.cpp) • [Go](./01-arrays_%26_hashing/00128-Longest_Consecutive_Sequence/00128-longest_consecutive_sequence.go) • [Java](./01-arrays_%26_hashing/00128-Longest_Consecutive_Sequence/00128-longest_consecutive_sequence.java) • [Python](./01-arrays_%26_hashing/00128-Longest_Consecutive_Sequence/00128-longest_consecutive_sequence.py) |
## Two Pointers
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 125 | Easy | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [C++](./02-two_pointers/00125-Valid_Palindrome/00125-valid_palindrome.cpp) • [Go](./02-two_pointers/00125-Valid_Palindrome/00125-valid_palindrome.go) • [Java](./02-two_pointers/00125-Valid_Palindrome/00125-valid_palindrome.java) • [Python](./02-two_pointers/00125-Valid_Palindrome/00125-valid_palindrome.py) |
| 167 | Medium | [Two Sum II](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/) | [C++](./02-two_pointers/00167-Two_Sum_II/00167-two_sum_II.cpp) • [Go](./02-two_pointers/00167-Two_Sum_II/00167-two_sum_II.go) • [Java](./02-two_pointers/00167-Two_Sum_II/00167-two_sum_II.java) • [Python](./02-two_pointers/00167-Two_Sum_II/00167-two_sum_II.py) |
| 15 | Medium | [3Sum](https://leetcode.com/problems/3sum/) | [C++](./02-two_pointers/00015-3Sum/00015-3sum.cpp) • [Go](./02-two_pointers/00015-3Sum/00015-3sum.go) • [Java](./02-two_pointers/00015-3Sum/00015-3sum.java) • [Python](./02-two_pointers/00015-3Sum/00015-3sum.py) |
| 11 | Medium | [Container with Most Water](https://leetcode.com/problems/container-with-most-water/) | [C++](./02-two_pointers/00011-Container_with_Most_Water/00011-container_with_most_water.cpp) • [Go](./02-two_pointers/00011-Container_with_Most_Water/00011-container_with_most_water.go) • [Java](./02-two_pointers/00011-Container_with_Most_Water/00011-container_with_most_water.java) • [Python](./02-two_pointers/00011-Container_with_Most_Water/00011-container_with_most_water.py) |
| 42 | Hard | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [C++](./02-two_pointers/00042-Trapping_Rain_Water/00042-trapping_rain_water.cpp) • [Go](./02-two_pointers/00042-Trapping_Rain_Water/00042-trapping_rain_water.go) • [Java](./02-two_pointers/00042-Trapping_Rain_Water/00042-trapping_rain_water.java) • [Python](./02-two_pointers/00042-Trapping_Rain_Water/00042-trapping_rain_water.py) |
## Sliding Window
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ------------------------------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| 121 | Easy | [Best Time to Buy & Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [C++](./03-sliding_window/00121-Best_Time_to_Buy_%26_Sell_Stock/00121-best_time_to_buy_%26_sell_stock.cpp) • [Go](./03-sliding_window/00121-Best_Time_to_Buy_%26_Sell_Stock/00121-best_time_to_buy_%26_sell_stock.go) • [Java](./03-sliding_window/00121-Best_Time_to_Buy_%26_Sell_Stock/00121-best_time_to_buy_%26_sell_stock.java) • [Python](./03-sliding_window/00121-Best_Time_to_Buy_%26_Sell_Stock/00121-best_time_to_buy_%26_sell_stock.py) |
| 3 | Medium | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [C++](./03-sliding_window/00003-Longest_Substring_Without_Repeating_Characters/00003-longest_substring_without_repeating_characters.cpp) • [Go](./03-sliding_window/00003-Longest_Substring_Without_Repeating_Characters/00003-longest_substring_without_repeating_characters.go) • [Java](./03-sliding_window/00003-Longest_Substring_Without_Repeating_Characters/00003-longest_substring_without_repeating_characters.java) • [Python](./03-sliding_window/00003-Longest_Substring_Without_Repeating_Characters/00003-longest_substring_without_repeating_characters.py) |
| 424 | Medium | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [C++](./03-sliding_window/00424-Longest_Repeating_Character_Replacement/00424-longest_repeating_character_replacement.cpp) • [Go](./03-sliding_window/00424-Longest_Repeating_Character_Replacement/00424-longest_repeating_character_replacement.go) • [Java](./03-sliding_window/00424-Longest_Repeating_Character_Replacement/00424-longest_repeating_character_replacement.java) • [Python](./03-sliding_window/00424-Longest_Repeating_Character_Replacement/00424-longest_repeating_character_replacement.py) |
| 567 | Medium | [Permutation in String](https://leetcode.com/problems/permutation-in-string/) | [C++](./03-sliding_window/00567-Permutation_in_String/00567-permutation_in_string.cpp) • [Go](./03-sliding_window/00567-Permutation_in_String/00567-permutation_in_string.go) • [Java](./03-sliding_window/00567-Permutation_in_String/00567-permutation_in_string.java) • [Python](./03-sliding_window/00567-Permutation_in_String/00567-permutation_in_string.py) |
| 76 | Hard | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [C++](./03-sliding_window/00076-Minimum_Window_Substring/00076-minimum_window_substring.cpp) • [Go](./03-sliding_window/00076-Minimum_Window_Substring/00076-minimum_window_substring.go) • [Java](./03-sliding_window/00076-Minimum_Window_Substring/00076-minimum_window_substring.java) • [Python](./03-sliding_window/00076-Minimum_Window_Substring/00076-minimum_window_substring.py) |
| 239 | Hard | [Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/) | [C++](./03-sliding_window/00239-Sliding_Window_Maximum/00239-sliding_window_maximum.cpp) • [Go](./03-sliding_window/00239-Sliding_Window_Maximum/00239-sliding_window_maximum.go) • [Java](./03-sliding_window/00239-Sliding_Window_Maximum/00239-sliding_window_maximum.java) • [Python](./03-sliding_window/00239-Sliding_Window_Maximum/00239-sliding_window_maximum.py) |
## Stack
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | --------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 20 | Easy | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [C++](./04-stack/00020-Valid_Parentheses/00020-valid_parentheses.cpp) • [Go](./04-stack/00020-Valid_Parentheses/00020-valid_parentheses.go) • [Java](./04-stack/00020-Valid_Parentheses/00020-valid_parentheses.java) • [Python](./04-stack/00020-Valid_Parentheses/00020-valid_parentheses.py) |
| 155 | Medium | [Min Stack](https://leetcode.com/problems/min-stack/) | [C++](./04-stack/00155-Min_Stack/00155-min_stack.cpp) • [Go](./04-stack/00155-Min_Stack/00155-min_stack.go) • [Java](./04-stack/00155-Min_Stack/00155-min_stack.java) • [Python](./04-stack/00155-Min_Stack/00155-min_stack.py) |
| 150 | Medium | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) | [C++](./04-stack/00150-Evaluate_Reverse_Polish_Notation/00150-evaluate_reverse_polish_notation.cpp) • [Go](./04-stack/00150-Evaluate_Reverse_Polish_Notation/00150-evaluate_reverse_polish_notation.go) • [Java](./04-stack/00150-Evaluate_Reverse_Polish_Notation/00150-evaluate_reverse_polish_notation.java) • [Python](./04-stack/00150-Evaluate_Reverse_Polish_Notation/00150-evaluate_reverse_polish_notation.py) |
| 22 | Medium | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [C++](./04-stack/00022-Generate_Parentheses/00022-generate_parentheses.cpp) • [Go](./04-stack/00022-Generate_Parentheses/00022-generate_parentheses.go) • [Java](./04-stack/00022-Generate_Parentheses/00022-generate_parentheses.java) • [Python](./04-stack/00022-Generate_Parentheses/00022-generate_parentheses.py) |
| 739 | Medium | [Daily Temperatures](https://leetcode.com/problems/daily-temperatures/) | [C++](./04-stack/00739-Daily_Temperatures/00739-daily_temperatures.cpp) • [Go](./04-stack/00739-Daily_Temperatures/00739-daily_temperatures.go) • [Java](./04-stack/00739-Daily_Temperatures/00739-daily_temperatures.java) • [Python](./04-stack/00739-Daily_Temperatures/00739-daily_temperatures.py) |
| 853 | Medium | [Car Fleet](https://leetcode.com/problems/car-fleet/) | [C++](./04-stack/00853-Car_Fleet/00853-car_fleet.cpp) • [Go](./04-stack/00853-Car_Fleet/00853-car_fleet.go) • [Java](./04-stack/00853-Car_Fleet/00853-car_fleet.java) • [Python](./04-stack/00853-Car_Fleet/00853-car_fleet.py) |
| 84 | Hard | [Largest Rectangle in Histogram](https://leetcode.com/problems/largest-rectangle-in-histogram/) | [C++](./04-stack/00084-Largest_Rectangle_in_Histogram/00084-largest_rectangle_in_histogram.cpp) • [Go](./04-stack/00084-Largest_Rectangle_in_Histogram/00084-largest_rectangle_in_histogram.go) • [Java](./04-stack/00084-Largest_Rectangle_in_Histogram/00084-largest_rectangle_in_histogram.java) • [Python](./04-stack/00084-Largest_Rectangle_in_Histogram/00084-largest_rectangle_in_histogram.py) |
## Binary Search
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ----------------------------------------------------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ |
| 704 | Easy | [Binary Search](https://leetcode.com/problems/binary-search/) | [C++](./05-binary_search/00704-Binary_Search/00704-binary_search.cpp) • [Go](./05-binary_search/00704-Binary_Search/00704-binary_search.go) • [Java](./05-binary_search/00704-Binary_Search/00704-binary_search.java) • [Python](./05-binary_search/00704-Binary_Search/00704-binary_search.py) |
| 74 | Medium | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix/) | [C++](./05-binary_search/00074-Search_a_2D_Matrix/00074-search_a_2D_matrix.cpp) • [Go](./05-binary_search/00074-Search_a_2D_Matrix/00074-search_a_2D_matrix.go) • [Java](./05-binary_search/00074-Search_a_2D_Matrix/00074-search_a_2D_matrix.java) • [Python](./05-binary_search/00074-Search_a_2D_Matrix/00074-search_a_2D_matrix.py) |
| 875 | Medium | [Koko Eating Bananas](https://leetcode.com/problems/koko-eating-bananas/) | [C++](./05-binary_search/00875-Koko_Eating_Bananas/00875-koko_eating_bananas.cpp) • [Go](./05-binary_search/00875-Koko_Eating_Bananas/00875-koko_eating_bananas.go) • [Java](./05-binary_search/00875-Koko_Eating_Bananas/00875-koko_eating_bananas.java) • [Python](./05-binary_search/00875-Koko_Eating_Bananas/00875-koko_eating_bananas.py) |
| 33 | Medium | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [C++](./05-binary_search/00033-Search_in_Rotated_Sorted_Array/00033-search_in_rotated_sorted_array.cpp) • [Go](./05-binary_search/00033-Search_in_Rotated_Sorted_Array/00033-search_in_rotated_sorted_array.go) • [Java](./05-binary_search/00033-Search_in_Rotated_Sorted_Array/00033-search_in_rotated_sorted_array.java) • [Python](./05-binary_search/00033-Search_in_Rotated_Sorted_Array/00033-search_in_rotated_sorted_array.py) |
| 153 | Medium | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [C++](./05-binary_search/00153-Find_Minimum_in_Rotated_Sorted_Array/00153-find_minimum_in_rotated_sorted_array.cpp) • [Go](./05-binary_search/00153-Find_Minimum_in_Rotated_Sorted_Array/00153-find_minimum_in_rotated_sorted_array.go) • [Java](./05-binary_search/00153-Find_Minimum_in_Rotated_Sorted_Array/00153-find_minimum_in_rotated_sorted_array.java) • [Python](./05-binary_search/00153-Find_Minimum_in_Rotated_Sorted_Array/00153-find_minimum_in_rotated_sorted_array.py) |
| 981 | Medium | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store/) | [C++](./05-binary_search/00981-Time_Based_Key-Value_Store/00981-time_based_key-value_store.cpp) • [Go](./05-binary_search/00981-Time_Based_Key-Value_Store/00981-time_based_key-value_store.go) • [Java](./05-binary_search/00981-Time_Based_Key-Value_Store/00981-time_based_key-value_store.java) • [Python](./05-binary_search/00981-Time_Based_Key-Value_Store/00981-time_based_key-value_store.py) |
| 4 | Hard | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [C++](./05-binary_search/00004-Median_of_Two_Sorted_Arrays/00004-median_of_two_sorted_arrays.cpp) • [Go](./05-binary_search/00004-Median_of_Two_Sorted_Arrays/00004-median_of_two_sorted_arrays.go) • [Java](./05-binary_search/00004-Median_of_Two_Sorted_Arrays/00004-median_of_two_sorted_arrays.java) • [Python](./05-binary_search/00004-Median_of_Two_Sorted_Arrays/00004-median_of_two_sorted_arrays.py) |
## Linked List
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | --------------------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 206 | Easy | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/) | [C++](./06-linked_list/00206-Reverse_Linked_List/00206-reverse_linked_list.cpp) • [Go](./06-linked_list/00206-Reverse_Linked_List/00206-reverse_linked_list.go) • [Java](./06-linked_list/00206-Reverse_Linked_List/00206-reverse_linked_list.java) • [Python](./06-linked_list/00206-Reverse_Linked_List/00206-reverse_linked_list.py) |
| 21 | Easy | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [C++](./06-linked_list/00021-Merge_Two_Sorted_Lists/00021-merge_two_sorted_lists.cpp) • [Go](./06-linked_list/00021-Merge_Two_Sorted_Lists/00021-merge_two_sorted_lists.go) • [Java](./06-linked_list/00021-Merge_Two_Sorted_Lists/00021-merge_two_sorted_lists.java) • [Python](./06-linked_list/00021-Merge_Two_Sorted_Lists/00021-merge_two_sorted_lists.py) |
| 141 | Easy | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [C++](./06-linked_list/00141-Linked_List_Cycle/00141-linked_list_cycle.cpp) • [Go](./06-linked_list/00141-Linked_List_Cycle/00141-linked_list_cycle.go) • [Java](./06-linked_list/00141-Linked_List_Cycle/00141-linked_list_cycle.java) • [Python](./06-linked_list/00141-Linked_List_Cycle/00141-linked_list_cycle.py) |
| 143 | Medium | [Reorder List](https://leetcode.com/problems/reorder-list/) | [C++](./06-linked_list/00143-Reorder_List/00143-reorder_list.cpp) • [Go](./06-linked_list/00143-Reorder_List/00143-reorder_list.go) • [Java](./06-linked_list/00143-Reorder_List/00143-reorder_list.java) • [Python](./06-linked_list/00143-Reorder_List/00143-reorder_list.py) |
| 19 | Medium | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [C++](./06-linked_list/00019-Remove_Nth_Node_From_End_of_List/00019-remove_nth_node_from_end_of_list.cpp) • [Go](./06-linked_list/00019-Remove_Nth_Node_From_End_of_List/00019-remove_nth_node_from_end_of_list.go) • [Java](./06-linked_list/00019-Remove_Nth_Node_From_End_of_List/00019-remove_nth_node_from_end_of_list.java) • [Python](./06-linked_list/00019-Remove_Nth_Node_From_End_of_List/00019-remove_nth_node_from_end_of_list.py) |
| 2 | Medium | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [C++](./06-linked_list/00002-Add_Two_Numbers/00002-add_two_numbers.cpp) • [Go](./06-linked_list/00002-Add_Two_Numbers/00002-add_two_numbers.go) • [Java](./06-linked_list/00002-Add_Two_Numbers/00002-add_two_numbers.java) • [Python](./06-linked_list/00002-Add_Two_Numbers/00002-add_two_numbers.py) |
| 287 | Medium | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [C++](./06-linked_list/00287-Find_The_Duplicate_Number/00287-find_the_duplicate_number.cpp) • [Go](./06-linked_list/00287-Find_The_Duplicate_Number/00287-find_the_duplicate_number.go) • [Java](./06-linked_list/00287-Find_The_Duplicate_Number/00287-find_the_duplicate_number.java) • [Python](./06-linked_list/00287-Find_The_Duplicate_Number/00287-find_the_duplicate_number.py) |
| 146 | Medium | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [C++](./06-linked_list/00146-LRU_Cache/00146-LRU_cache.cpp) • [Go](./06-linked_list/00146-LRU_Cache/00146-LRU_cache.go) • [Java](./06-linked_list/00146-LRU_Cache/00146-LRU_cache.java) • [Python](./06-linked_list/00146-LRU_Cache/00146-LRU_cache.py) |
| 23 | Hard | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [C++](./06-linked_list/00023-Merge_k_Sorted_Lists/00023-merge_k_sorted_lists.cpp) • [Go](./06-linked_list/00023-Merge_k_Sorted_Lists/00023-merge_k_sorted_lists.go) • [Java](./06-linked_list/00023-Merge_k_Sorted_Lists/00023-merge_k_sorted_lists.java) • [Python](./06-linked_list/00023-Merge_k_Sorted_Lists/00023-merge_k_sorted_lists.py) |
| 25 | Hard | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [C++](./06-linked_list/00025-Reverse_Nodes_In_K_Group/00025-reverse_nodes_in_k_group.cpp) • [Go](./06-linked_list/00025-Reverse_Nodes_In_K_Group/00025-reverse_nodes_in_k_group.go) • [Java](./06-linked_list/00025-Reverse_Nodes_In_K_Group/00025-reverse_nodes_in_k_group.java) • [Python](./06-linked_list/00025-Reverse_Nodes_In_K_Group/00025-reverse_nodes_in_k_group.py) |
## Trees
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ---------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 226 | Easy | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [C++](./07-trees/00226-Invert_Binary_Tree/00226-invert_binary_tree.cpp) • [Go](./07-trees/00226-Invert_Binary_Tree/00226-invert_binary_tree.go) • [Java](./07-trees/00226-Invert_Binary_Tree/00226-invert_binary_tree.java) • [Python](./07-trees/00226-Invert_Binary_Tree/00226-invert_binary_tree.py) |
| 104 | Easy | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [C++](./07-trees/00104-Maximum_Depth_Of_Binary_Tree/00104-maximum_depth_of_binary_tree.cpp) • [Go](./07-trees/00104-Maximum_Depth_Of_Binary_Tree/00104-maximum_depth_of_binary_tree.go) • [Java](./07-trees/00104-Maximum_Depth_Of_Binary_Tree/00104-maximum_depth_of_binary_tree.java) • [Python](./07-trees/00104-Maximum_Depth_Of_Binary_Tree/00104-maximum_depth_of_binary_tree.py) |
| 543 | Easy | [Diameter of Binary Tree](https://leetcode.com/problems/diameter-of-binary-tree/) | [C++](./07-trees/00543-Diameter_Of_Binary_Tree/00543-diameter_of_binary_tree.cpp) • [Go](./07-trees/00543-Diameter_Of_Binary_Tree/00543-diameter_of_binary_tree.go) • [Java](./07-trees/00543-Diameter_Of_Binary_Tree/00543-diameter_of_binary_tree.java) • [Python](./07-trees/00543-Diameter_Of_Binary_Tree/00543-diameter_of_binary_tree.py) |
| 110 | Easy | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [C++](./07-trees/00110-Balanced_Binary_Tree/00110-balanced_binary_tree.cpp) • [Go](./07-trees/00110-Balanced_Binary_Tree/00110-balanced_binary_tree.go) • [Java](./07-trees/00110-Balanced_Binary_Tree/00110-balanced_binary_tree.java) • [Python](./07-trees/00110-Balanced_Binary_Tree/00110-balanced_binary_tree.py) |
| 100 | Easy | [Same Tree](https://leetcode.com/problems/same-tree/) | [C++](./07-trees/00100-Same_Tree/00100-same_tree.cpp) • [Go](./07-trees/00100-Same_Tree/00100-same_tree.go) • [Java](./07-trees/00100-Same_Tree/00100-same_tree.java) • [Python](./07-trees/00100-Same_Tree/00100-same_tree.py) |
| 572 | Easy | [Subtree Of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | [C++](./07-trees/00572-Subtree_Of_Another_Tree/00572-subtree_of_another_tree.cpp) • [Go](./07-trees/00572-Subtree_Of_Another_Tree/00572-subtree_of_another_tree.go) • [Java](./07-trees/00572-Subtree_Of_Another_Tree/00572-subtree_of_another_tree.java) • [Python](./07-trees/00572-Subtree_Of_Another_Tree/00572-subtree_of_another_tree.py) |
| 235 | Medium | [Lowest Common Ancestor Of A Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [C++](./07-trees/00235-Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/00235-lowest_common_ancestor_of_a_binary_search_tree.cpp) • [Go](./07-trees/00235-Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/00235-lowest_common_ancestor_of_a_binary_search_tree.go) • [Java](./07-trees/00235-Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/00235-lowest_common_ancestor_of_a_binary_search_tree.java) • [Python](./07-trees/00235-Lowest_Common_Ancestor_Of_A_Binary_Search_Tree/00235-lowest_common_ancestor_of_a_binary_search_tree.py) |
| 102 | Medium | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [C++](./07-trees/00102-Binary_Tree_Level_Order_Traversal/00102-binary_tree_level_order_traversal.cpp) • [Go](./07-trees/00102-Binary_Tree_Level_Order_Traversal/00102-binary_tree_level_order_traversal.go) • [Java](./07-trees/00102-Binary_Tree_Level_Order_Traversal/00102-binary_tree_level_order_traversal.java) • [Python](./07-trees/00102-Binary_Tree_Level_Order_Traversal/00102-binary_tree_level_order_traversal.py) |
| 199 | Medium | [Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/) | [C++](.\07-trees\00199-Binary_Tree_Right_Side_View\00199-binary_tree_right_side_view.cpp) • [Go](.\07-trees\00199-Binary_Tree_Right_Side_View\00199-binary_tree_right_side_view.go) • [Java](.\07-trees\00199-Binary_Tree_Right_Side_View\00199-binary_tree_right_side_view.java) • [Python](.\07-trees\00199-Binary_Tree_Right_Side_View\00199-binary_tree_right_side_view.py) |
| 1448 | Medium | [Count Good Nodes In Binary Tree](https://leetcode.com/problems/count-good-nodes-in-binary-tree/) | [C++](./07-trees/01448-Count_Good_Nodes_In_Binary_Tree/01448-count_good_nodes_in_binary_tree.cpp) • [Go](./07-trees/01448-Count_Good_Nodes_In_Binary_Tree/01448-count_good_nodes_in_binary_tree.go) • [Java](./07-trees/01448-Count_Good_Nodes_In_Binary_Tree/01448-count_good_nodes_in_binary_tree.java) • [Python](./07-trees/01448-Count_Good_Nodes_In_Binary_Tree/01448-count_good_nodes_in_binary_tree.py) |
| 98 | Medium | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [C++](./07-trees/00098-Validate_Binary_Search_Tree/00098-validate_binary_search_tree.cpp) • [Go](./07-trees/00098-Validate_Binary_Search_Tree/00098-validate_binary_search_tree.go) • [Java](./07-trees/00098-Validate_Binary_Search_Tree/00098-validate_binary_search_tree.java) • [Python](./07-trees/00098-Validate_Binary_Search_Tree/00098-validate_binary_search_tree.py) |
| 230 | Medium | [Kth Smallest Element In A Bst](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [C++](./07-trees/00230-Kth_Smallest_Element_In_A_Bst/00230-kth_smallest_element_in_a_bst.cpp) • [Go](./07-trees/00230-Kth_Smallest_Element_In_A_Bst/00230-kth_smallest_element_in_a_bst.go) • [Java](./07-trees/00230-Kth_Smallest_Element_In_A_Bst/00230-kth_smallest_element_in_a_bst.java) • [Python](./07-trees/00230-Kth_Smallest_Element_In_A_Bst/00230-kth_smallest_element_in_a_bst.py) |
| 105 | Medium | [Construct Binary Tree From Preorder And Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [C++](./07-trees/00105-Construct_Binary_Tree_From_Preorder_And_Inorder_Traversal/00105-construct_binary_tree_from_preorder_and_inorder_traversal.cpp) • [Go](./07-trees/00105-Construct_Binary_Tree_From_Preorder_And_Inorder_Traversal/00105-construct_binary_tree_from_preorder_and_inorder_traversal.go) • [Java](./07-trees/00105-Construct_Binary_Tree_From_Preorder_And_Inorder_Traversal/00105-construct_binary_tree_from_preorder_and_inorder_traversal.java) • [Python](./07-trees/00105-Construct_Binary_Tree_From_Preorder_And_Inorder_Traversal/00105-construct_binary_tree_from_preorder_and_inorder_traversal.py) |
| 124 | Hard | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum) | [C++](./07-trees/00124-Binary_Tree_Maximum_Path_Sum/00124-binary_tree_maximum_path_sum.cpp) • [Go](./07-trees/00124-Binary_Tree_Maximum_Path_Sum/00124-binary_tree_maximum_path_sum.go) • [Java](./07-trees/00124-Binary_Tree_Maximum_Path_Sum/00124-binary_tree_maximum_path_sum.java) • [Python](./07-trees/00124-Binary_Tree_Maximum_Path_Sum/00124-binary_tree_maximum_path_sum.py) |
## Tries
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ----------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 208 | Medium | [Implement Trie Prefix Tree](https://leetcode.com/problems/implement-trie-prefix-tree) | [C++](./08-tries/00208-Implement_Trie_Prefix_Tree/00208-implement_trie_prefix_tree.cpp) • [Go](./08-tries/00208-Implement_Trie_Prefix_Tree/00208-implement_trie_prefix_tree.go) • [Java](./08-tries/00208-Implement_Trie_Prefix_Tree/00208-implement_trie_prefix_tree.java) • [Python](./08-tries/00208-Implement_Trie_Prefix_Tree/00208-implement_trie_prefix_tree.py) |
| 211 | Medium | [Design Add And Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure/) | [C++](./08-tries/00211-Design_Add_And_Search_Words_Data_Structure/00211-design_add_and_search_words_data_structure.cpp) • [Go](./08-tries/00211-Design_Add_And_Search_Words_Data_Structure/00211-design_add_and_search_words_data_structure.go) • [Java](./08-tries/00211-Design_Add_And_Search_Words_Data_Structure/00211-design_add_and_search_words_data_structure.java) • [Python](./08-tries/00211-Design_Add_And_Search_Words_Data_Structure/00211-design_add_and_search_words_data_structure.py) |
| 212 | Hard | [Word Search Ii](https://leetcode.com/problems/word-search-ii/) | [C++](./08-tries/00212-Word_Search_II/00212-word_search_ii.cpp) • [Go](./08-tries/00212-Word_Search_II/00212-word_search_ii.go) • [Java](./08-tries/00212-Word_Search_II/00212-word_search_ii.java) • [Python](./08-tries/00212-Word_Search_II/00212-word_search_ii.py) |
## Backtracking
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ------------------------------------------------------------------------------------------------------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 78 | Medium | [Subsets](https://leetcode.com/problems/subsets/) | [C++](./09-backtracking/00078-Subsets/00078-subsets.cpp) • [Go](./09-backtracking/00078-Subsets/00078-subsets.go) • [Java](./09-backtracking/00078-Subsets/00078-subsets.java) • [Python](./09-backtracking/00078-Subsets/00078-subsets.py) |
| 39 | Medium | [Combination Sum](https://leetcode.com/problems/combination-sum/) | [C++](./09-backtracking/00039-Combination_Sum/00039-combination_sum.cpp) • [Go](./09-backtracking/00039-Combination_Sum/00039-combination_sum.go) • [Java](./09-backtracking/00039-Combination_Sum/00039-combination_sum.java) • [Python](./09-backtracking/00039-Combination_Sum/00039-combination_sum.py) |
| 46 | Medium | [Permutations](https://leetcode.com/problems/permutations/) | [C++](./09-backtracking/00046-Permutations/00046-permutations.cpp) • [Go](./09-backtracking/00046-Permutations/00046-permutations.go) • [Java](./09-backtracking/00046-Permutations/00046-permutations.java) • [Python](./09-backtracking/00046-Permutations/00046-permutations.py) |
| 90 | Medium | [Subsets II](https://leetcode.com/problems/subsets-II) | [C++](./09-backtracking/00090-Subsets_II/00090-subsets_II.cpp) • [Go](./09-backtracking/00090-Subsets_II/00090-subsets_II.go) • [Java](./09-backtracking/00090-Subsets_II/00090-subsets_II.java) • [Python](./09-backtracking/00090-Subsets_II/00090-subsets_II.py) |
| 40 | Medium | [Combination Sum II](https://leetcode.com/problems/combination-sum-II) | [C++](./09-backtracking/00040-Combination_Sum_II/00040-combination_sum_II.cpp) • [Go](./09-backtracking/00040-Combination_Sum_II/00040-combination_sum_II.go) • [Java](./09-backtracking/00040-Combination_Sum_II/00040-combination_sum_II.java) • [Python](./09-backtracking/00040-Combination_Sum_II/00040-combination_sum_II.py) |
| 79 | Medium | [Word Search](https://leetcode.com/problems/word-search) | [C++](./09-backtracking/00079-Word_Search/00079-word_search.cpp) • [Go](./09-backtracking/00079-Word_Search/00079-word_search.go) • [Java](./09-backtracking/00079-Word_Search/00079-word_search.java) • [Python](./09-backtracking/00079-Word_Search/00079-word_search.py) |
| 131 | Medium | [Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning) | [C++](./09-backtracking/00131-Palindrome_Partitioning/00131-palindrome_partitioning.cpp) • [Go](./09-backtracking/00131-Palindrome_Partitioning/00131-palindrome_partitioning.go) • [Java](./09-backtracking/00131-Palindrome_Partitioning/00131-palindrome_partitioning.java) • [Python](./09-backtracking/00131-Palindrome_Partitioning/00131-palindrome_partitioning.py) |
| 17 | Medium | [Letter Combinations Of A Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | [C++](./09-backtracking/00017-Letter_Combinations_Of_A_Phone_Number/00017-letter_combinations_of_a_phone_number.cpp) • [Go](./09-backtracking/00017-Letter_Combinations_Of_A_Phone_Number/00017-letter_combinations_of_a_phone_number.go) • [Java](./09-backtracking/00017-Letter_Combinations_Of_A_Phone_Number/00017-letter_combinations_of_a_phone_number.java) • [Python](./09-backtracking/00017-Letter_Combinations_Of_A_Phone_Number/00017-letter_combinations_of_a_phone_number.py) |
| 51 | Hard | [N Queens](https://leetcode.com/problems/n-queens) | [C++](./09-backtracking/00051-N_Queens/00051-n_queens.cpp) • [Go](./09-backtracking/00051-N_Queens/00051-n_queens.go) • [Java](./09-backtracking/00051-N_Queens/00051-n_queens.java) • [Python](./09-backtracking/00051-N_Queens/00051-n_queens.py) |
## Heap
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ------------------------------------------------------------------------------------------------ | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 703 | Easy | [Kth Largest Element In A Stream](https://leetcode.com/problems/kth-largest-element-in-a-stream) | [C++](./10-heap/00703-Kth_Largest_Element_In_A_Stream/00703-kth_largest_element_in_a_stream.cpp) • [Go](./10-heap/00703-Kth_Largest_Element_In_A_Stream/00703-kth_largest_element_in_a_stream.go) • [Java](./10-heap/00703-Kth_Largest_Element_In_A_Stream/00703-kth_largest_element_in_a_stream.java) • [Python](./10-heap/00703-Kth_Largest_Element_In_A_Stream/00703-kth_largest_element_in_a_stream.py) |
| 1064 | Easy | [Last Stone Weight](https://leetcode.com/problems/last-stone-weight) | [C++](./10-heap/01064-Last_Stone_Weight/01064-last_stone_weight.cpp) • [Go](./10-heap/01064-Last_Stone_Weight/01064-last_stone_weight.go) • [Java](./10-heap/01064-Last_Stone_Weight/01064-last_stone_weight.java) • [Python](./10-heap/01064-Last_Stone_Weight/01064-last_stone_weight.py) |
| 973 | Medium | [K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin) | [C++](./10-heap/00973-K_Closest_Points_To_Origin/00973-k_closest_points_to_origin.cpp) • [Go](./10-heap/00973-K_Closest_Points_To_Origin/00973-k_closest_points_to_origin.go) • [Java](./10-heap/00973-K_Closest_Points_To_Origin/00973-k_closest_points_to_origin.java) • [Python](./10-heap/00973-K_Closest_Points_To_Origin/00973-k_closest_points_to_origin.py) |
| 215 | Medium | [Kth Largest Element In An Array](https://leetcode.com/problems/kth-largest-element-in-an-array) | [C++](./10-heap/00215-Kth_Largest_Element_In_An_Array/00215-kth_largest_element_in_an_array.cpp) • [Go](./10-heap/00215-Kth_Largest_Element_In_An_Array/00215-kth_largest_element_in_an_array.go) • [Java](./10-heap/00215-Kth_Largest_Element_In_An_Array/00215-kth_largest_element_in_an_array.java) • [Python](./10-heap/00215-Kth_Largest_Element_In_An_Array/00215-kth_largest_element_in_an_array.py) |
| 621 | Medium | [Task Scheduler](https://leetcode.com/problems/task-scheduler) | [C++](./10-heap/00621-Task_Scheduler/00621-task_scheduler.cpp) • [Go](./10-heap/00621-Task_Scheduler/00621-task_scheduler.go) • [Java](./10-heap/00621-Task_Scheduler/00621-task_scheduler.java) • [Python](./10-heap/00621-Task_Scheduler/00621-task_scheduler.py) |
| 355 | Medium | [Design Twitter](https://leetcode.com/problems/design-twitter) | [C++](./10-heap/00355-Design_Twitter/00355-design_twitter.cpp) • [Go](./10-heap/00355-Design_Twitter/00355-design_twitter.go) • [Java](./10-heap/00355-Design_Twitter/00355-design_twitter.java) • [Python](./10-heap/00355-Design_Twitter/00355-design_twitter.py) |
| 295 | Hard | [Find Median From Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | [C++](./10-heap/00295-Find_Median_From_Data_Stream/00295-find_median_from_data_stream.cpp) • [Go](./10-heap/00295-Find_Median_From_Data_Stream/00295-find_median_from_data_stream.go) • [Java](./10-heap/00295-Find_Median_From_Data_Stream/00295-find_median_from_data_stream.java) • [Python](./10-heap/00295-Find_Median_From_Data_Stream/00295-find_median_from_data_stream.py) |
## Graph
| LeetCode ID | Difficulty | Problem | Solutions |
| ----------- | ---------- | ---------------------------------------------------------------------- | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
| 200 | Medium | [Number Of Islands](https://leetcode.com/problems/number-of-islands/) | [C++](./11-graph/00200-Number_Of_Islands/00200-number_of_islands.cpp) • [Go](./11-graph/00200-Number_Of_Islands/00200-number_of_islands.go) • [Java](./11-graph/00200-Number_Of_Islands/00200-number_of_islands.java) • [Python](./11-graph/00200-Number_Of_Islands/00200-number_of_islands.py) |
| 695 | Medium | [Max Area Of Island](https://leetcode.com/problems/max-area-of-island) | [C++](./11-graph/00695-Max_Area_Of_Island/00695-max_area_of_island.cpp) • [Go](./11-graph/00695-Max_Area_Of_Island/00695-max_area_of_island.go) • [Java](./11-graph/00695-Max_Area_Of_Island/00695-max_area_of_island.java) • [Python](./11-graph/00695-Max_Area_Of_Island/00695-max_area_of_island.py) |