Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/illuz/leetcode
(229 / 280) [中文|English] Solutions and notes of LEETCODE using C++/Java/Python/Sql/Shell Script.
https://github.com/illuz/leetcode
leetcode leetcode-solutions
Last synced: about 2 months ago
JSON representation
(229 / 280) [中文|English] Solutions and notes of LEETCODE using C++/Java/Python/Sql/Shell Script.
- Host: GitHub
- URL: https://github.com/illuz/leetcode
- Owner: illuz
- License: gpl-2.0
- Created: 2014-11-26T10:47:31.000Z (about 10 years ago)
- Default Branch: master
- Last Pushed: 2017-10-14T07:39:28.000Z (about 7 years ago)
- Last Synced: 2024-07-31T22:42:47.271Z (4 months ago)
- Topics: leetcode, leetcode-solutions
- Language: C++
- Homepage:
- Size: 700 KB
- Stars: 761
- Watchers: 78
- Forks: 288
- Open Issues: 0
-
Metadata Files:
- Readme: readme.md
- License: LICENSE
Awesome Lists containing this project
- awesome-leetcode - illuz/Leetcode
README
LeetCode Solutions by illuz
===
Updating....
My stupid [**How to LeetCode**](./how-to-leetcode.md).
This is my leetcode solution folder. :)
Language: **C++/Java/Python/Sql/Shell Script**
*If there was something wrong, can contact me at iilluzen in google's email.*
---
### Links:
[Leetcode Algorithms Problems](https://leetcode.com/problemset/algorithms/)
[Leetcode Database Problems](https://leetcode.com/problemset/database/)
[Leetcode Shell Problems](https://leetcode.com/problemset/shell/)
---
### Problems
There are 333 problems (54 problems for a fee).
I have solved 229 / 279 problems.=w=
| \# | Problems | Solutions | Note |
|----|----------|-----------|------|
| 001 | [001.Two_Sum](https://leetcode.com/problems/Two-Sum/) | [Java Python C++](./solutions/001.Two_Sum) | [Notes](./solutions/001.Two_Sum) |
| 002 | [002.Add_Two_Numbers](https://leetcode.com/problems/Add-Two-Numbers/) | [C++ Python Java](./solutions/002.Add_Two_Numbers) | [Notes](./solutions/002.Add_Two_Numbers) |
| 003 | [003.Longest_Substring_Without_Repeat...](https://leetcode.com/problems/Longest-Substring-Without-Repeating-Characters/) | [Java Python C++](./solutions/003.Longest_Substring_Without_Repeating_Characters) | [Notes](./solutions/003.Longest_Substring_Without_Repeating_Characters) |
| 004 | [004.Median_of_Two_Sorted_Arrays](https://leetcode.com/problems/Median-of-Two-Sorted-Arrays/) | [Java Python C++](./solutions/004.Median_of_Two_Sorted_Arrays) | [Notes](./solutions/004.Median_of_Two_Sorted_Arrays) |
| 005 | [005.Longest_Palindromic_Substring](https://leetcode.com/problems/Longest-Palindromic-Substring/) | [Java Python C++](./solutions/005.Longest_Palindromic_Substring) | [Notes](./solutions/005.Longest_Palindromic_Substring) |
| 006 | [006.ZigZag_Conversion](https://leetcode.com/problems/ZigZag-Conversion/) | [C++ Python Java](./solutions/006.ZigZag_Conversion) | [Notes](./solutions/006.ZigZag_Conversion) |
| 007 | [007.Reverse_Integer](https://leetcode.com/problems/Reverse-Integer/) | [C++ Python Java](./solutions/007.Reverse_Integer) | [Notes](./solutions/007.Reverse_Integer) |
| 008 | [008.String_to_Integer](https://leetcode.com/problems/String-to-Integer/) | [C++ Python Java](./solutions/008.String_to_Integer) | [Notes](./solutions/008.String_to_Integer) |
| 009 | [009.Palindrome_Number](https://leetcode.com/problems/Palindrome-Number/) | [Java Python C++](./solutions/009.Palindrome_Number) | [Notes](./solutions/009.Palindrome_Number) |
| 010 | [010.Regular_Expression_Matching](https://leetcode.com/problems/Regular-Expression-Matching/) | [C++ Python Java](./solutions/010.Regular_Expression_Matching) | [Notes](./solutions/010.Regular_Expression_Matching) |
| 011 | [011.Container_With_Most_Water](https://leetcode.com/problems/Container-With-Most-Water/) | [Java Python C++](./solutions/011.Container_With_Most_Water) | [Notes](./solutions/011.Container_With_Most_Water) |
| 012 | [012.Integer_to_Roman](https://leetcode.com/problems/Integer-to-Roman/) | [Java Python C++](./solutions/012.Integer_to_Roman) | [Notes](./solutions/012.Integer_to_Roman) |
| 013 | [013.Roman_to_Integer](https://leetcode.com/problems/Roman-to-Integer/) | [Java Python C++](./solutions/013.Roman_to_Integer) | [Notes](./solutions/013.Roman_to_Integer) |
| 014 | [014.Longest_Common_Prefix](https://leetcode.com/problems/Longest-Common-Prefix/) | [C++ Python Java](./solutions/014.Longest_Common_Prefix) | [Notes](./solutions/014.Longest_Common_Prefix) |
| 015 | [015.3Sum](https://leetcode.com/problems/3Sum/) | [C++ Python Java](./solutions/015.3Sum) | [Notes](./solutions/015.3Sum) |
| 016 | [016.3Sum_Closest](https://leetcode.com/problems/3Sum-Closest/) | [C++ Python Java](./solutions/016.3Sum_Closest) | [Notes](./solutions/016.3Sum_Closest) |
| 017 | [017.Letter_Combinations_of_a_Phone_Number](https://leetcode.com/problems/Letter-Combinations-of-a-Phone-Number/) | [C++ Python Java](./solutions/017.Letter_Combinations_of_a_Phone_Number) | [Notes](./solutions/017.Letter_Combinations_of_a_Phone_Number) |
| 018 | [018.4Sum](https://leetcode.com/problems/4Sum/) | [C++ Python Java](./solutions/018.4Sum) | [Notes](./solutions/018.4Sum) |
| 019 | [019.Remove_Nth_Node_From_End_of_List](https://leetcode.com/problems/Remove-Nth-Node-From-End-of-List/) | [Python C++](./solutions/019.Remove_Nth_Node_From_End_of_List) | [Notes](./solutions/019.Remove_Nth_Node_From_End_of_List) |
| 020 | [020.Valid_Parentheses](https://leetcode.com/problems/Valid-Parentheses/) | [C++ Python Java](./solutions/020.Valid_Parentheses) | [Notes](./solutions/020.Valid_Parentheses) |
| 021 | [021.Merge_Two_Sorted_Lists](https://leetcode.com/problems/Merge-Two-Sorted-Lists/) | [Python C++](./solutions/021.Merge_Two_Sorted_Lists) | [Notes](./solutions/021.Merge_Two_Sorted_Lists) |
| 022 | [022.Generate_Parentheses](https://leetcode.com/problems/Generate-Parentheses/) | [C++ Python Java](./solutions/022.Generate_Parentheses) | [Notes](./solutions/022.Generate_Parentheses) |
| 023 | [023.Merge_k_Sorted_Lists](https://leetcode.com/problems/Merge-k-Sorted-Lists/) | [Java Python C++](./solutions/023.Merge_k_Sorted_Lists) | [Notes](./solutions/023.Merge_k_Sorted_Lists) |
| 024 | [024.Swap_Nodes_in_Pairs](https://leetcode.com/problems/Swap-Nodes-in-Pairs/) | [Python C++](./solutions/024.Swap_Nodes_in_Pairs) | [Notes](./solutions/024.Swap_Nodes_in_Pairs) |
| 025 | [025.Reverse_Nodes_in_k-Group](https://leetcode.com/problems/Reverse-Nodes-in-k-Group/) | [Java C++](./solutions/025.Reverse_Nodes_in_k-Group) | [Notes](./solutions/025.Reverse_Nodes_in_k-Group) |
| 026 | [026.Remove_Duplicates_from_Sorted_Array](https://leetcode.com/problems/Remove-Duplicates-from-Sorted-Array/) | [C++](./solutions/026.Remove_Duplicates_from_Sorted_Array) | [Notes](./solutions/026.Remove_Duplicates_from_Sorted_Array) |
| 027 | [027.Remove_Element](https://leetcode.com/problems/Remove-Element/) | [C++](./solutions/027.Remove_Element) | [Notes](./solutions/027.Remove_Element) |
| 028 | [028.Implement_strStr()](https://leetcode.com/problems/Implement-strStr/) | [Python C++](./solutions/028.Implement_strStr()) | [Notes](./solutions/028.Implement_strStr()) |
| 029 | [029.Divide_Two_Integers](https://leetcode.com/problems/Divide-Two-Integers/) | [Python C++](./solutions/029.Divide_Two_Integers) | [Notes](./solutions/029.Divide_Two_Integers) |
| 030 | [030.Substring_with_Concatenation_of_...](https://leetcode.com/problems/Substring-with-Concatenation-of-All-Words/) | [C++ Java](./solutions/030.Substring_with_Concatenation_of_All_Words) | [Notes](./solutions/030.Substring_with_Concatenation_of_All_Words) |
| 031 | [031.Next_Permutation](https://leetcode.com/problems/Next-Permutation/) | [Python C++](./solutions/031.Next_Permutation) | [Notes](./solutions/031.Next_Permutation) |
| 032 | [032.Longest_Valid_Parentheses](https://leetcode.com/problems/Longest-Valid-Parentheses/) | [C++](./solutions/032.Longest_Valid_Parentheses) | [Notes](./solutions/032.Longest_Valid_Parentheses) |
| 033 | [033.Search_in_Rotated_Sorted_Array](https://leetcode.com/problems/Search-in-Rotated-Sorted-Array/) | [C++](./solutions/033.Search_in_Rotated_Sorted_Array) | [Notes](./solutions/033.Search_in_Rotated_Sorted_Array) |
| 034 | [034.Search_for_a_Range](https://leetcode.com/problems/Search-for-a-Range/) | [Java C++](./solutions/034.Search_for_a_Range) | [Notes](./solutions/034.Search_for_a_Range) |
| 035 | [035.Search_Insert_Position](https://leetcode.com/problems/Search-Insert-Position/) | [C++](./solutions/035.Search_Insert_Position) | [Notes](./solutions/035.Search_Insert_Position) |
| 036 | [036.Valid_Sudoku](https://leetcode.com/problems/Valid-Sudoku/) | [C++](./solutions/036.Valid_Sudoku) | [Notes](./solutions/036.Valid_Sudoku) |
| 037 | [037.Sudoku_Solver](https://leetcode.com/problems/Sudoku-Solver/) | [C++](./solutions/037.Sudoku_Solver) | [Notes](./solutions/037.Sudoku_Solver) |
| 038 | [038.Count_and_Say](https://leetcode.com/problems/Count-and-Say/) | [Python C++](./solutions/038.Count_and_Say) | [Notes](./solutions/038.Count_and_Say) |
| 039 | [039.Combination_Sum](https://leetcode.com/problems/Combination-Sum/) | [C++](./solutions/039.Combination_Sum) | [Notes](./solutions/039.Combination_Sum) |
| 040 | [040.Combination_Sum_II](https://leetcode.com/problems/Combination-Sum-II/) | [C++](./solutions/040.Combination_Sum_II) | [Notes](./solutions/040.Combination_Sum_II) |
| 041 | [041.First_Missing_Positive](https://leetcode.com/problems/First-Missing-Positive/) | [C++](./solutions/041.First_Missing_Positive) | Coming soon |
| 042 | [042.Trapping_Rain_Water](https://leetcode.com/problems/Trapping-Rain-Water/) | [C++](./solutions/042.Trapping_Rain_Water) | Coming soon |
| 043 | [043.Multiply_Strings](https://leetcode.com/problems/Multiply-Strings/) | [C++](./solutions/043.Multiply_Strings) | Coming soon |
| 044 | [044.Wildcard_Matching](https://leetcode.com/problems/Wildcard-Matching/) | [C++](./solutions/044.Wildcard_Matching) | Coming soon |
| 045 | [045.Jump_Game_II](https://leetcode.com/problems/Jump-Game-II/) | [C++](./solutions/045.Jump_Game_II) | Coming soon |
| 046 | [046.Permutations](https://leetcode.com/problems/Permutations/) | [C++](./solutions/046.Permutations) | Coming soon |
| 047 | [047.Permutations_II](https://leetcode.com/problems/Permutations-II/) | [C++](./solutions/047.Permutations_II) | Coming soon |
| 048 | [048.Rotate_Image](https://leetcode.com/problems/Rotate-Image/) | [C++](./solutions/048.Rotate_Image) | Coming soon |
| 049 | [049.Anagrams](https://leetcode.com/problems/Anagrams/) | [C++](./solutions/049.Anagrams) | Coming soon |
| 050 | [050.Pow(x,_n)](https://leetcode.com/problems/Powx,-n/) | [C++](./solutions/050.Pow(x,_n)) | Coming soon |
| 051 | [051.N-Queens](https://leetcode.com/problems/N-Queens/) | [C++ Python Java](./solutions/051.N-Queens) | Coming soon |
| 052 | [052.N-Queens_II](https://leetcode.com/problems/N-Queens-II/) | [C++ Python Java](./solutions/052.N-Queens_II) | Coming soon |
| 053 | [053.Maximum_Subarray](https://leetcode.com/problems/Maximum-Subarray/) | [C++](./solutions/053.Maximum_Subarray) | Coming soon |
| 054 | [054.Spiral_Matrix](https://leetcode.com/problems/Spiral-Matrix/) | [C++](./solutions/054.Spiral_Matrix) | Coming soon |
| 055 | [055.Jump_Game](https://leetcode.com/problems/Jump-Game/) | [C++](./solutions/055.Jump_Game) | Coming soon |
| 056 | [056.Merge_Intervals](https://leetcode.com/problems/Merge-Intervals/) | [C++](./solutions/056.Merge_Intervals) | Coming soon |
| 057 | [057.Insert_Interval](https://leetcode.com/problems/Insert-Interval/) | [C++](./solutions/057.Insert_Interval) | Coming soon |
| 058 | [058.Length_of_Last_Word](https://leetcode.com/problems/Length-of-Last-Word/) | [C++](./solutions/058.Length_of_Last_Word) | Coming soon |
| 059 | [059.Spiral_Matrix_II](https://leetcode.com/problems/Spiral-Matrix-II/) | [C++](./solutions/059.Spiral_Matrix_II) | Coming soon |
| 060 | [060.Permutation_Sequence](https://leetcode.com/problems/Permutation-Sequence/) | [C++](./solutions/060.Permutation_Sequence) | Coming soon |
| 061 | [061.Rotate_List](https://leetcode.com/problems/Rotate-List/) | [C++](./solutions/061.Rotate_List) | Coming soon |
| 062 | [062.Unique_Paths](https://leetcode.com/problems/Unique-Paths/) | [C++](./solutions/062.Unique_Paths) | Coming soon |
| 063 | [063.Unique_Paths_II](https://leetcode.com/problems/Unique-Paths-II/) | [C++](./solutions/063.Unique_Paths_II) | Coming soon |
| 064 | [064.Minimum_Path_Sum](https://leetcode.com/problems/Minimum-Path-Sum/) | [C++](./solutions/064.Minimum_Path_Sum) | Coming soon |
| 065 | [065.Valid_Number](https://leetcode.com/problems/Valid-Number/) | [Java Python C++](./solutions/065.Valid_Number) | Coming soon |
| 066 | [066.Plus_One](https://leetcode.com/problems/Plus-One/) | [C++](./solutions/066.Plus_One) | Coming soon |
| 067 | [067.Add_Binary](https://leetcode.com/problems/Add-Binary/) | [C++](./solutions/067.Add_Binary) | Coming soon |
| 068 | [068.Text_Justification](https://leetcode.com/problems/Text-Justification/) | [C++ Python Java](./solutions/068.Text_Justification) | [Notes](./solutions/068.Text_Justification) |
| 069 | [069.Sqrt(x)](https://leetcode.com/problems/Sqrtx/) | [C++ Python Java](./solutions/069.Sqrt(x)) | Coming soon |
| 070 | [070.Climbing_Stairs](https://leetcode.com/problems/Climbing-Stairs/) | [C++](./solutions/070.Climbing_Stairs) | Coming soon |
| 071 | [071.Simplify_Path](https://leetcode.com/problems/Simplify-Path/) | [C++ Python Java](./solutions/071.Simplify_Path) | Coming soon |
| 072 | [072.Edit_Distance](https://leetcode.com/problems/Edit-Distance/) | [C++](./solutions/072.Edit_Distance) | Coming soon |
| 073 | [073.Set_Matrix_Zeroes](https://leetcode.com/problems/Set-Matrix-Zeroes/) | [C++](./solutions/073.Set_Matrix_Zeroes) | Coming soon |
| 074 | [074.Search_a_2D_Matrix](https://leetcode.com/problems/Search-a-2D-Matrix/) | [C++](./solutions/074.Search_a_2D_Matrix) | Coming soon |
| 075 | [075.Sort_Colors](https://leetcode.com/problems/Sort-Colors/) | [C++](./solutions/075.Sort_Colors) | Coming soon |
| 076 | [076.Minimum_Window_Substring](https://leetcode.com/problems/Minimum-Window-Substring/) | [C++](./solutions/076.Minimum_Window_Substring) | [Notes](./solutions/076.Minimum_Window_Substring) |
| 077 | [077.Combinations](https://leetcode.com/problems/Combinations/) | [C++](./solutions/077.Combinations) | Coming soon |
| 078 | [078.Subsets](https://leetcode.com/problems/Subsets/) | [Java Python C++](./solutions/078.Subsets) | Coming soon |
| 079 | [079.Word_Search](https://leetcode.com/problems/Word-Search/) | [C++](./solutions/079.Word_Search) | Coming soon |
| 080 | [080.Remove_Duplicates_from_Sorted_Array_II](https://leetcode.com/problems/Remove-Duplicates-from-Sorted-Array-II/) | [C++](./solutions/080.Remove_Duplicates_from_Sorted_Array_II) | Coming soon |
| 081 | [081.Search_in_Rotated_Sorted_Array_II](https://leetcode.com/problems/Search-in-Rotated-Sorted-Array-II/) | [C++](./solutions/081.Search_in_Rotated_Sorted_Array_II) | Coming soon |
| 082 | [082.Remove_Duplicates_from_Sorted_List_II](https://leetcode.com/problems/Remove-Duplicates-from-Sorted-List-II/) | [C++](./solutions/082.Remove_Duplicates_from_Sorted_List_II) | Coming soon |
| 083 | [083.Remove_Duplicates_from_Sorted_List](https://leetcode.com/problems/Remove-Duplicates-from-Sorted-List/) | [C++](./solutions/083.Remove_Duplicates_from_Sorted_List) | Coming soon |
| 084 | [084.Largest_Rectangle_in_Histogram](https://leetcode.com/problems/Largest-Rectangle-in-Histogram/) | [Java C++](./solutions/084.Largest_Rectangle_in_Histogram) | [Notes](./solutions/084.Largest_Rectangle_in_Histogram) |
| 085 | [085.Maximal_Rectangle](https://leetcode.com/problems/Maximal-Rectangle/) | [Java C++](./solutions/085.Maximal_Rectangle) | [Notes](./solutions/085.Maximal_Rectangle) |
| 086 | [086.Partition_List](https://leetcode.com/problems/Partition-List/) | [C++ Python Java](./solutions/086.Partition_List) | Coming soon |
| 087 | [087.Scramble_String](https://leetcode.com/problems/Scramble-String/) | [C++ Python Java](./solutions/087.Scramble_String) | [Notes](./solutions/087.Scramble_String) |
| 088 | [088.Merge_Sorted_Array](https://leetcode.com/problems/Merge-Sorted-Array/) | [C++](./solutions/088.Merge_Sorted_Array) | Coming soon |
| 089 | [089.Gray_Code](https://leetcode.com/problems/Gray-Code/) | [C++ Python Java](./solutions/089.Gray_Code) | Coming soon |
| 090 | [090.Subsets_II](https://leetcode.com/problems/Subsets-II/) | [C++ Python Java](./solutions/090.Subsets_II) | Coming soon |
| 091 | [091.Decode_Ways](https://leetcode.com/problems/Decode-Ways/) | [Java Python C++](./solutions/091.Decode_Ways) | Coming soon |
| 092 | [092.Reverse_Linked_List_II](https://leetcode.com/problems/Reverse-Linked-List-II/) | [C++](./solutions/092.Reverse_Linked_List_II) | Coming soon |
| 093 | [093.Restore_IP_Addresses](https://leetcode.com/problems/Restore-IP-Addresses/) | [C++ Python Java](./solutions/093.Restore_IP_Addresses) | [Notes](./solutions/093.Restore_IP_Addresses) |
| 094 | [094.Binary_Tree_Inorder_Traversal](https://leetcode.com/problems/Binary-Tree-Inorder-Traversal/) | [C++](./solutions/094.Binary_Tree_Inorder_Traversal) | Coming soon |
| 095 | [095.Unique_Binary_Search_Trees](https://leetcode.com/problems/Unique-Binary-Search-Trees/) | [C++](./solutions/095.Unique_Binary_Search_Trees) | [Notes](./solutions/095.Unique_Binary_Search_Trees) |
| 096 | [096.Unique_Binary_Search_Trees_II](https://leetcode.com/problems/Unique-Binary-Search-Trees-II/) | [C++](./solutions/096.Unique_Binary_Search_Trees_II) | [Notes](./solutions/096.Unique_Binary_Search_Trees_II) |
| 097 | [097.Interleaving_String](https://leetcode.com/problems/Interleaving-String/) | [Java C++](./solutions/097.Interleaving_String) | [Notes](./solutions/097.Interleaving_String) |
| 098 | [098.Validate_Binary_Search_Tree](https://leetcode.com/problems/Validate-Binary-Search-Tree/) | [Java Python C++](./solutions/098.Validate_Binary_Search_Tree) | [Notes](./solutions/098.Validate_Binary_Search_Tree) |
| 099 | [099.Recover_Binary_Search_Tree](https://leetcode.com/problems/Recover-Binary-Search-Tree/) | [Python C++](./solutions/099.Recover_Binary_Search_Tree) | [Notes](./solutions/099.Recover_Binary_Search_Tree) |
| 100 | [100.Same_Tree](https://leetcode.com/problems/Same-Tree/) | [C++](./solutions/100.Same_Tree) | Coming soon |
| 101 | [101.Symmetric_Tree](https://leetcode.com/problems/Symmetric-Tree/) | [C++](./solutions/101.Symmetric_Tree) | Coming soon |
| 102 | [102.Binary_Tree_Level_Order_Traversal](https://leetcode.com/problems/Binary-Tree-Level-Order-Traversal/) | [Python C++](./solutions/102.Binary_Tree_Level_Order_Traversal) | [Notes](./solutions/102.Binary_Tree_Level_Order_Traversal) |
| 103 | [103.Binary_Tree_Zigzag_Level_Order_Traversal](https://leetcode.com/problems/Binary-Tree-Zigzag-Level-Order-Traversal/) | [Python C++](./solutions/103.Binary_Tree_Zigzag_Level_Order_Traversal) | [Notes](./solutions/103.Binary_Tree_Zigzag_Level_Order_Traversal) |
| 104 | [104.Maximum_Depth_of_Binary_Tree](https://leetcode.com/problems/Maximum-Depth-of-Binary-Tree/) | [C++](./solutions/104.Maximum_Depth_of_Binary_Tree) | Coming soon |
| 105 | [105.Construct_Binary_Tree_from_Preor...](https://leetcode.com/problems/Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal/) | [C++](./solutions/105.Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal) | [Notes](./solutions/105.Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal) |
| 106 | [106.Construct_Binary_Tree_from_Inord...](https://leetcode.com/problems/Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal/) | [C++](./solutions/106.Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal) | [Notes](./solutions/106.Construct_Binary_Tree_from_Inorder_and_Postorder_Traversal) |
| 107 | [107.Binary_Tree_Level_Order_Traversal_II](https://leetcode.com/problems/Binary-Tree-Level-Order-Traversal-II/) | [Python C++](./solutions/107.Binary_Tree_Level_Order_Traversal_II) | [Notes](./solutions/107.Binary_Tree_Level_Order_Traversal_II) |
| 108 | [108.Convert_Sorted_Array_to_Binary_S...](https://leetcode.com/problems/Convert-Sorted-Array-to-Binary-Search-Tree/) | [C++](./solutions/108.Convert_Sorted_Array_to_Binary_Search_Tree) | [Notes](./solutions/108.Convert_Sorted_Array_to_Binary_Search_Tree) |
| 109 | [109.Convert_Sorted_List_to_Binary_Se...](https://leetcode.com/problems/Convert-Sorted-List-to-Binary-Search-Tree/) | [Python C++](./solutions/109.Convert_Sorted_List_to_Binary_Search_Tree) | [Notes](./solutions/109.Convert_Sorted_List_to_Binary_Search_Tree) |
| 110 | [110.Balanced_Binary_Tree](https://leetcode.com/problems/Balanced-Binary-Tree/) | [C++](./solutions/110.Balanced_Binary_Tree) | Coming soon |
| 111 | [111.Minimum_Depth_of_Binary_Tree](https://leetcode.com/problems/Minimum-Depth-of-Binary-Tree/) | [C++](./solutions/111.Minimum_Depth_of_Binary_Tree) | Coming soon |
| 112 | [112.Path_Sum](https://leetcode.com/problems/Path-Sum/) | [C++](./solutions/112.Path_Sum) | Coming soon |
| 113 | [113.Path_Sum_II](https://leetcode.com/problems/Path-Sum-II/) | [Java Python C++](./solutions/113.Path_Sum_II) | Coming soon |
| 114 | [114.Flatten_Binary_Tree_to_Linked_List](https://leetcode.com/problems/Flatten-Binary-Tree-to-Linked-List/) | [Java C++](./solutions/114.Flatten_Binary_Tree_to_Linked_List) | [Notes](./solutions/114.Flatten_Binary_Tree_to_Linked_List) |
| 115 | [115.Distinct_Subsequences](https://leetcode.com/problems/Distinct-Subsequences/) | [Python C++](./solutions/115.Distinct_Subsequences) | [Notes](./solutions/115.Distinct_Subsequences) |
| 116 | [116.Populating_Next_Right_Pointers_i...](https://leetcode.com/problems/Populating-Next-Right-Pointers-in-Each-Node/) | [C++ Python Java](./solutions/116.Populating_Next_Right_Pointers_in_Each_Node) | Coming soon |
| 117 | [117.Populating_Next_Right_Pointers_i...](https://leetcode.com/problems/Populating-Next-Right-Pointers-in-Each-Node-II/) | [C++ Python Java](./solutions/117.Populating_Next_Right_Pointers_in_Each_Node_II) | Coming soon |
| 118 | [118.Pascal's_Triangle](https://leetcode.com/problems/Pascals-Triangle/) | [C++](./solutions/118.Pascal's_Triangle) | Coming soon |
| 119 | [119.Pascal's_Triangle_II](https://leetcode.com/problems/Pascals-Triangle-II/) | [C++](./solutions/119.Pascal's_Triangle_II) | Coming soon |
| 120 | [120.Triangle](https://leetcode.com/problems/Triangle/) | [Java Python C++](./solutions/120.Triangle) | Coming soon |
| 121 | [121.Best_Time_to_Buy_and_Sell_Stock](https://leetcode.com/problems/Best-Time-to-Buy-and-Sell-Stock/) | [Python C++](./solutions/121.Best_Time_to_Buy_and_Sell_Stock) | [Notes](./solutions/121.Best_Time_to_Buy_and_Sell_Stock) |
| 122 | [122.Best_Time_to_Buy_and_Sell_Stock_II](https://leetcode.com/problems/Best-Time-to-Buy-and-Sell-Stock-II/) | [Python C++](./solutions/122.Best_Time_to_Buy_and_Sell_Stock_II) | [Notes](./solutions/122.Best_Time_to_Buy_and_Sell_Stock_II) |
| 123 | [123.Best_Time_to_Buy_and_Sell_Stock_III](https://leetcode.com/problems/Best-Time-to-Buy-and-Sell-Stock-III/) | [Python C++](./solutions/123.Best_Time_to_Buy_and_Sell_Stock_III) | [Notes](./solutions/123.Best_Time_to_Buy_and_Sell_Stock_III) |
| 124 | [124.Binary_Tree_Maximum_Path_Sum](https://leetcode.com/problems/Binary-Tree-Maximum-Path-Sum/) | [Python C++](./solutions/124.Binary_Tree_Maximum_Path_Sum) | [Notes](./solutions/124.Binary_Tree_Maximum_Path_Sum) |
| 125 | [125.Valid_Palindrome](https://leetcode.com/problems/Valid-Palindrome/) | [C++](./solutions/125.Valid_Palindrome) | Coming soon |
| 126 | [126.Word_Ladder](https://leetcode.com/problems/Word-Ladder/) | [Python C++](./solutions/126.Word_Ladder) | [Notes](./solutions/126.Word_Ladder) |
| 126 | [126.Word_Ladder_II](https://leetcode.com/problems/Word-Ladder-II/) | [](./solutions/126.Word_Ladder_II) | Coming soon |
| 127 | [127.Word_Ladder](https://leetcode.com/problems/Word-Ladder/) | [](./solutions/127.Word_Ladder) | Coming soon |
| 128 | [128.Longest_Consecutive_Sequence](https://leetcode.com/problems/Longest-Consecutive-Sequence/) | [](./solutions/128.Longest_Consecutive_Sequence) | Coming soon |
| 129 | [129.Sum_Root_to_Leaf_Numbers](https://leetcode.com/problems/Sum-Root-to-Leaf-Numbers/) | [C++](./solutions/129.Sum_Root_to_Leaf_Numbers) | Coming soon |
| 130 | [130.Surrounded_Regions](https://leetcode.com/problems/Surrounded-Regions/) | [C++](./solutions/130.Surrounded_Regions) | [Notes](./solutions/130.Surrounded_Regions) |
| 131 | [131.Palindrome_Partitioning](https://leetcode.com/problems/Palindrome-Partitioning/) | [Python C++](./solutions/131.Palindrome_Partitioning) | [Notes](./solutions/131.Palindrome_Partitioning) |
| 132 | [132.Palindrome_Partitioning_II](https://leetcode.com/problems/Palindrome-Partitioning-II/) | [C++ Java](./solutions/132.Palindrome_Partitioning_II) | [Notes](./solutions/132.Palindrome_Partitioning_II) |
| 133 | [133.Clone_Graph](https://leetcode.com/problems/Clone-Graph/) | [C++](./solutions/133.Clone_Graph) | Coming soon |
| 134 | [134.Gas_Station](https://leetcode.com/problems/Gas-Station/) | [C++](./solutions/134.Gas_Station) | [Notes](./solutions/134.Gas_Station) |
| 135 | [135.Candy](https://leetcode.com/problems/Candy/) | [](./solutions/135.Candy) | Coming soon |
| 136 | [136.Single_Number](https://leetcode.com/problems/Single-Number/) | [C++](./solutions/136.Single_Number) | [Notes](./solutions/136.Single_Number) |
| 137 | [137.Single_Number_II](https://leetcode.com/problems/Single-Number-II/) | [C++](./solutions/137.Single_Number_II) | Coming soon |
| 138 | [138.Copy_List_with_Random_Pointer](https://leetcode.com/problems/Copy-List-with-Random-Pointer/) | [Java Python C++](./solutions/138.Copy_List_with_Random_Pointer) | [Notes](./solutions/138.Copy_List_with_Random_Pointer) |
| 139 | [139.Word_Break](https://leetcode.com/problems/Word-Break/) | [Python C++](./solutions/139.Word_Break) | [Notes](./solutions/139.Word_Break) |
| 140 | [140.Word_Break_II](https://leetcode.com/problems/Word-Break-II/) | [](./solutions/140.Word_Break_II) | Coming soon |
| 141 | [141.Linked_List_Cycle](https://leetcode.com/problems/Linked-List-Cycle/) | [C++](./solutions/141.Linked_List_Cycle) | Coming soon |
| 142 | [142.Linked_List_Cycle_II](https://leetcode.com/problems/Linked-List-Cycle-II/) | [](./solutions/142.Linked_List_Cycle_II) | Coming soon |
| 143 | [143.Reorder_List](https://leetcode.com/problems/Reorder-List/) | [C++](./solutions/143.Reorder_List) | Coming soon |
| 144 | [144.Binary_Tree_Preorder_Traversal](https://leetcode.com/problems/Binary-Tree-Preorder-Traversal/) | [C++](./solutions/144.Binary_Tree_Preorder_Traversal) | Coming soon |
| 145 | [145.Binary_Tree_Postorder_Traversal](https://leetcode.com/problems/Binary-Tree-Postorder-Traversal/) | [C++](./solutions/145.Binary_Tree_Postorder_Traversal) | Coming soon |
| 146 | [146.LRU_Cache](https://leetcode.com/problems/LRU-Cache/) | [Python C++](./solutions/146.LRU_Cache) | [Notes](./solutions/146.LRU_Cache) |
| 147 | [147.Insertion_Sort_List](https://leetcode.com/problems/Insertion-Sort-List/) | [C++](./solutions/147.Insertion_Sort_List) | Coming soon |
| 148 | [148.Sort_List](https://leetcode.com/problems/Sort-List/) | [C++](./solutions/148.Sort_List) | [Notes](./solutions/148.Sort_List) |
| 149 | [149.Max_Points_on_a_Line](https://leetcode.com/problems/Max-Points-on-a-Line/) | [](./solutions/149.Max_Points_on_a_Line) | Coming soon |
| 150 | [150.Evaluate_Reverse_Polish_Notation](https://leetcode.com/problems/Evaluate-Reverse-Polish-Notation/) | [Java Python C++](./solutions/150.Evaluate_Reverse_Polish_Notation) | [Notes](./solutions/150.Evaluate_Reverse_Polish_Notation) |
| 151 | [151.Reverse_Words_in_a_String](https://leetcode.com/problems/Reverse-Words-in-a-String/) | [C++ Python Java](./solutions/151.Reverse_Words_in_a_String) | [Notes](./solutions/151.Reverse_Words_in_a_String) |
| 152 | [152.Maximum_Product_Subarray](https://leetcode.com/problems/Maximum-Product-Subarray/) | [C++](./solutions/152.Maximum_Product_Subarray) | Coming soon |
| 153 | [153.Find_Minimum_in_Rotated_Sorted_Array](https://leetcode.com/problems/Find-Minimum-in-Rotated-Sorted-Array/) | [C++](./solutions/153.Find_Minimum_in_Rotated_Sorted_Array) | [Notes](./solutions/153.Find_Minimum_in_Rotated_Sorted_Array) |
| 154 | [154.Find_Minimum_in_Rotated_Sorted_Array_II](https://leetcode.com/problems/Find-Minimum-in-Rotated-Sorted-Array-II/) | [Python C++](./solutions/154.Find_Minimum_in_Rotated_Sorted_Array_II) | [Notes](./solutions/154.Find_Minimum_in_Rotated_Sorted_Array_II) |
| 155 | [155.Min_Stack](https://leetcode.com/problems/Min-Stack/) | [C++](./solutions/155.Min_Stack) | [Notes](./solutions/155.Min_Stack) |
| 156 | [156.Binary_Tree_Upside_Down $](https://leetcode.com/problems/Binary-Tree-Upside-Down/) | Not Buy | Not Buy |
| 157 | [157.Read_N_Characters_Given_Read4 $](https://leetcode.com/problems/Read-N-Characters-Given-Read4/) | Not Buy | Not Buy |
| 158 | [158.Read_N_Characters_Given_Read4_II... $](https://leetcode.com/problems/Read-N-Characters-Given-Read4-II---Call-multiple-times/) | Not Buy | Not Buy |
| 159 | [159.Longest_Substring_with_At_Most_T... $](https://leetcode.com/problems/Longest-Substring-with-At-Most-Two-Distinct-Characters/) | Not Buy | Not Buy |
| 160 | [160.Intersection_of_Two_Linked_Lists](https://leetcode.com/problems/Intersection-of-Two-Linked-Lists/) | [C++](./solutions/160.Intersection_of_Two_Linked_Lists) | Coming soon |
| 161 | [161.One_Edit_Distance $](https://leetcode.com/problems/One-Edit-Distance/) | Not Buy | Not Buy |
| 162 | [162.Find_Peak_Element](https://leetcode.com/problems/Find-Peak-Element/) | [C++ Python Java](./solutions/162.Find_Peak_Element) | Coming soon |
| 163 | [163.Missing_Ranges $](https://leetcode.com/problems/Missing-Ranges/) | Not Buy | Not Buy |
| 164 | [164.Maximum_Gap](https://leetcode.com/problems/Maximum-Gap/) | [C++](./solutions/164.Maximum_Gap) | [Notes](./solutions/164.Maximum_Gap) |
| 165 | [165.Compare_Version_Numbers](https://leetcode.com/problems/Compare-Version-Numbers/) | [C++](./solutions/165.Compare_Version_Numbers) | Coming soon |
| 166 | [166.Fraction_to_Recurring_Decimal](https://leetcode.com/problems/Fraction-to-Recurring-Decimal/) | [C++](./solutions/166.Fraction_to_Recurring_Decimal) | [Notes](./solutions/166.Fraction_to_Recurring_Decimal) |
| 167 | [167.Two_Sum_II_-_Input_array_is_sorted $](https://leetcode.com/problems/Two-Sum-II---Input-array-is-sorted/) | Not Buy | Not Buy |
| 168 | [168.Excel_Sheet_Column_Title](https://leetcode.com/problems/Excel-Sheet-Column-Title/) | [Java Python C++](./solutions/168.Excel_Sheet_Column_Title) | Coming soon |
| 169 | [169.Majority_Element](https://leetcode.com/problems/Majority-Element/) | [Java Python C++](./solutions/169.Majority_Element) | Coming soon |
| 170 | [170.Two_Sum_III_-_Data_structure_design $](https://leetcode.com/problems/Two-Sum-III---Data-structure-design/) | Not Buy | Not Buy |
| 171 | [171.Excel_Sheet_Column_Number](https://leetcode.com/problems/Excel-Sheet-Column-Number/) | [Java Python C++](./solutions/171.Excel_Sheet_Column_Number) | Coming soon |
| 172 | [172.Factorial_Trailing_Zeroes](https://leetcode.com/problems/Factorial-Trailing-Zeroes/) | [Java Python C++](./solutions/172.Factorial_Trailing_Zeroes) | Coming soon |
| 173 | [173.Binary_Search_Tree_Iterator](https://leetcode.com/problems/Binary-Search-Tree-Iterator/) | [Python C++](./solutions/173.Binary_Search_Tree_Iterator) | [Notes](./solutions/173.Binary_Search_Tree_Iterator) |
| 174 | [174.Dungeon_Game](https://leetcode.com/problems/Dungeon-Game/) | [](./solutions/174.Dungeon_Game) | Coming soon |
| 175 | [175.Combine_Two_Tables](https://leetcode.com/problems/Combine-Two-Tables/) | [Sql](./solutions/175.Combine_Two_Tables) | Coming soon |
| 176 | [176.Second_Highest_Salary](https://leetcode.com/problems/Second-Highest-Salary/) | [Sql](./solutions/176.Second_Highest_Salary) | Coming soon |
| 177 | [177.Nth_Highest_Salary](https://leetcode.com/problems/Nth-Highest-Salary/) | [Sql](./solutions/177.Nth_Highest_Salary) | [Notes](./solutions/177.Nth_Highest_Salary) |
| 178 | [178.Rank_Scores](https://leetcode.com/problems/Rank-Scores/) | [Sql](./solutions/178.Rank_Scores) | [Notes](./solutions/178.Rank_Scores) |
| 179 | [179.Largest_Number](https://leetcode.com/problems/Largest-Number/) | [Java Python C++](./solutions/179.Largest_Number) | Coming soon |
| 180 | [180.Consecutive_Numbers](https://leetcode.com/problems/Consecutive-Numbers/) | [Sql](./solutions/180.Consecutive_Numbers) | [Notes](./solutions/180.Consecutive_Numbers) |
| 181 | [181.Employees_Earning_More_Than_Thei...](https://leetcode.com/problems/Employees-Earning-More-Than-Their-Managers/) | [Sql](./solutions/181.Employees_Earning_More_Than_Their_Managers) | Coming soon |
| 182 | [182.Duplicate_Emails](https://leetcode.com/problems/Duplicate-Emails/) | [Sql](./solutions/182.Duplicate_Emails) | Coming soon |
| 183 | [183.Customers_Who_Never_Order](https://leetcode.com/problems/Customers-Who-Never-Order/) | [Sql](./solutions/183.Customers_Who_Never_Order) | [Notes](./solutions/183.Customers_Who_Never_Order) |
| 184 | [184.Department_Highest_Salary](https://leetcode.com/problems/Department-Highest-Salary/) | [Sql](./solutions/184.Department_Highest_Salary) | [Notes](./solutions/184.Department_Highest_Salary) |
| 186 | [186.Reverse_Words_in_a_String_II $](https://leetcode.com/problems/Reverse-Words-in-a-String-II/) | Not Buy | Not Buy |
| 187 | [187.Repeated_DNA_Sequences](https://leetcode.com/problems/Repeated-DNA-Sequences/) | [C++ Python Java](./solutions/187.Repeated_DNA_Sequences) | Coming soon |
| 188 | [188.Best_Time_to_Buy_and_Sell_Stock_IV](https://leetcode.com/problems/Best-Time-to-Buy-and-Sell-Stock-IV/) | [C++](./solutions/188.Best_Time_to_Buy_and_Sell_Stock_IV) | [Notes](./solutions/188.Best_Time_to_Buy_and_Sell_Stock_IV) |
| 189 | [189.Rotate_Array](https://leetcode.com/problems/Rotate-Array/) | [C++](./solutions/189.Rotate_Array) | [Notes](./solutions/189.Rotate_Array) |
| 190 | [190.Reverse_Bits](https://leetcode.com/problems/Reverse-Bits/) | [C++ Python Java](./solutions/190.Reverse_Bits) | [Notes](./solutions/190.Reverse_Bits) |
| 191 | [191.Number_of_1_Bits](https://leetcode.com/problems/Number-of-1-Bits/) | [C++ Java](./solutions/191.Number_of_1_Bits) | [Notes](./solutions/191.Number_of_1_Bits) |
| 192 | [192.Word_Frequency](https://leetcode.com/problems/Word-Frequency/) | [Shell](./solutions/192.Word_Frequency) | [Notes](./solutions/192.Word_Frequency) |
| 193 | [193.Valid_Phone_Numbers](https://leetcode.com/problems/Valid-Phone-Numbers/) | [Shell](./solutions/193.Valid_Phone_Numbers) | [Notes](./solutions/193.Valid_Phone_Numbers) |
| 194 | [194.Transpose_File](https://leetcode.com/problems/Transpose-File/) | [Shell](./solutions/194.Transpose_File) | [Notes](./solutions/194.Transpose_File) |
| 195 | [195.Tenth_Line](https://leetcode.com/problems/Tenth-Line/) | [Shell](./solutions/195.Tenth_Line) | [Notes](./solutions/195.Tenth_Line) |
| 196 | [196.Delete_Duplicate_Emails](https://leetcode.com/problems/Delete-Duplicate-Emails/) | [Sql](./solutions/196.Delete_Duplicate_Emails) | Coming soon |
| 197 | [197.Rising_Temperature](https://leetcode.com/problems/Rising-Temperature/) | [Sql](./solutions/197.Rising_Temperature) | [Notes](./solutions/197.Rising_Temperature) |
| 198 | [198.House_Robber](https://leetcode.com/problems/House-Robber/) | [C++](./solutions/198.House_Robber) | [Notes](./solutions/198.House_Robber) |
| 199 | [199.Binary_Tree_Right_Side_View](https://leetcode.com/problems/Binary-Tree-Right-Side-View/) | [Python C++](./solutions/199.Binary_Tree_Right_Side_View) | [Notes](./solutions/199.Binary_Tree_Right_Side_View) |
| 200 | [200.Number_of_Islands](https://leetcode.com/problems/Number-of-Islands/) | [C++](./solutions/200.Number_of_Islands) | [Notes](./solutions/200.Number_of_Islands) |
| 201 | [201.Bitwise_AND_of_Numbers_Range](https://leetcode.com/problems/Bitwise-AND-of-Numbers-Range/) | [Python C++](./solutions/201.Bitwise_AND_of_Numbers_Range) | [Notes](./solutions/201.Bitwise_AND_of_Numbers_Range) |
| 202 | [202.Happy_Number](https://leetcode.com/problems/Happy-Number/) | [Python C++](./solutions/202.Happy_Number) | [Notes](./solutions/202.Happy_Number) |
| 203 | [203.Remove_Linked_List_Elements](https://leetcode.com/problems/Remove-Linked-List-Elements/) | [C++ Python Java](./solutions/203.Remove_Linked_List_Elements) | [Notes](./solutions/203.Remove_Linked_List_Elements) |
| 204 | [204.Count_Primes](https://leetcode.com/problems/Count-Primes/) | [C++](./solutions/204.Count_Primes) | Coming soon |
| 205 | [205.Isomorphic_Strings](https://leetcode.com/problems/Isomorphic-Strings/) | [Python C++](./solutions/205.Isomorphic_Strings) | [Notes](./solutions/205.Isomorphic_Strings) |
| 206 | [206.Reverse_Linked_List](https://leetcode.com/problems/Reverse-Linked-List/) | [C++](./solutions/206.Reverse_Linked_List) | Coming soon |
| 207 | [207.Course_Schedule](https://leetcode.com/problems/Course-Schedule/) | [Python C++](./solutions/207.Course_Schedule) | [Notes](./solutions/207.Course_Schedule) |
| 208 | [208.Implement_Trie_(Prefix_Tree)](https://leetcode.com/problems/Implement-Trie-Prefix-Tree/) | [C++](./solutions/208.Implement_Trie_(Prefix_Tree)) | [Notes](./solutions/208.Implement_Trie_(Prefix_Tree)) |
| 209 | [209.Minimum_Size_Subarray_Sum](https://leetcode.com/problems/Minimum-Size-Subarray-Sum/) | [C++](./solutions/209.Minimum_Size_Subarray_Sum) | Coming soon |
| 210 | [210.Course_Schedule_II](https://leetcode.com/problems/Course-Schedule-II/) | [Python C++](./solutions/210.Course_Schedule_II) | [Notes](./solutions/210.Course_Schedule_II) |
| 211 | [211.Add_and_Search_Word_-_Data_struc...](https://leetcode.com/problems/Add-and-Search-Word---Data-structure-design/) | [](./solutions/211.Add_and_Search_Word_-_Data_structure_design) | Coming soon |
| 212 | [212.Word_Search_II](https://leetcode.com/problems/Word-Search-II/) | [](./solutions/212.Word_Search_II) | Coming soon |
| 213 | [213.House_Robber_II](https://leetcode.com/problems/House-Robber-II/) | [](./solutions/213.House_Robber_II) | Coming soon |
| 214 | [214.Shortest_Palindrome](https://leetcode.com/problems/Shortest-Palindrome/) | [](./solutions/214.Shortest_Palindrome) | Coming soon |
| 215 | [215.Kth_Largest_Element_in_an_Array](https://leetcode.com/problems/Kth-Largest-Element-in-an-Array/) | [C++ Python Java](./solutions/215.Kth_Largest_Element_in_an_Array) | [Notes](./solutions/215.Kth_Largest_Element_in_an_Array) |
| 216 | [216.Combination_Sum_III](https://leetcode.com/problems/Combination-Sum-III/) | [C++](./solutions/216.Combination_Sum_III) | [Notes](./solutions/216.Combination_Sum_III) |
| 217 | [217.Contains_Duplicate](https://leetcode.com/problems/Contains-Duplicate/) | [Python C++](./solutions/217.Contains_Duplicate) | [Notes](./solutions/217.Contains_Duplicate) |
| 218 | [218.The_Skyline_Problem](https://leetcode.com/problems/The-Skyline-Problem/) | [](./solutions/218.The_Skyline_Problem) | Coming soon |
| 219 | [219.Contains_Duplicate_II](https://leetcode.com/problems/Contains-Duplicate-II/) | [C++](./solutions/219.Contains_Duplicate_II) | [Notes](./solutions/219.Contains_Duplicate_II) |
| 220 | [220.Contains_Duplicate_III](https://leetcode.com/problems/Contains-Duplicate-III/) | [C++ Java](./solutions/220.Contains_Duplicate_III) | [Notes](./solutions/220.Contains_Duplicate_III) |
| 221 | [221.Maximal_Square](https://leetcode.com/problems/Maximal-Square/) | [Python C++](./solutions/221.Maximal_Square) | [Notes](./solutions/221.Maximal_Square) |
| 222 | [222.Count_Complete_Tree_Nodes](https://leetcode.com/problems/Count-Complete-Tree-Nodes/) | [Python C++](./solutions/222.Count_Complete_Tree_Nodes) | [Notes](./solutions/222.Count_Complete_Tree_Nodes) |
| 223 | [223.Rectangle_Area](https://leetcode.com/problems/Rectangle-Area/) | [C++](./solutions/223.Rectangle_Area) | [Notes](./solutions/223.Rectangle_Area) |
| 224 | [224.Basic_Calculator](https://leetcode.com/problems/Basic-Calculator/) | [Java C++](./solutions/224.Basic_Calculator) | [Notes](./solutions/224.Basic_Calculator) |
| 225 | [225.Implement_Stack_using_Queues](https://leetcode.com/problems/Implement-Stack-using-Queues/) | [Java C++](./solutions/225.Implement_Stack_using_Queues) | [Notes](./solutions/225.Implement_Stack_using_Queues) |
| 226 | [226.Invert_Binary_Tree](https://leetcode.com/problems/Invert-Binary-Tree/) | [Python C++](./solutions/226.Invert_Binary_Tree) | [Notes](./solutions/226.Invert_Binary_Tree) |
| 227 | [227.Basic_Calculator_II](https://leetcode.com/problems/Basic-Calculator-II/) | [](./solutions/227.Basic_Calculator_II) | Coming soon |
| 228 | [228.Summary_Ranges](https://leetcode.com/problems/Summary-Ranges/) | [Python C++](./solutions/228.Summary_Ranges) | [Notes](./solutions/228.Summary_Ranges) |
| 229 | [229.Majority_Element_II](https://leetcode.com/problems/Majority-Element-II/) | [](./solutions/229.Majority_Element_II) | Coming soon |
| 230 | [230.Kth_Smallest_Element_in_a_BST](https://leetcode.com/problems/Kth-Smallest-Element-in-a-BST/) | [C++](./solutions/230.Kth_Smallest_Element_in_a_BST) | [Notes](./solutions/230.Kth_Smallest_Element_in_a_BST) |
| 231 | [231.Power_of_Two](https://leetcode.com/problems/Power-of-Two/) | [Python C++](./solutions/231.Power_of_Two) | [Notes](./solutions/231.Power_of_Two) |
| 232 | [232.Implement_Queue_using_Stacks](https://leetcode.com/problems/Implement-Queue-using-Stacks/) | [Python C++](./solutions/232.Implement_Queue_using_Stacks) | [Notes](./solutions/232.Implement_Queue_using_Stacks) |
| 233 | [233.Number_of_Digit_One](https://leetcode.com/problems/Number-of-Digit-One/) | [](./solutions/233.Number_of_Digit_One) | Coming soon |
| 234 | [234.Palindrome_Linked_List](https://leetcode.com/problems/Palindrome-Linked-List/) | [Java Python C++](./solutions/234.Palindrome_Linked_List) | [Notes](./solutions/234.Palindrome_Linked_List) |
| 235 | [235.Lowest_Common_Ancestor_of_a_Bina...](https://leetcode.com/problems/Lowest-Common-Ancestor-of-a-Binary-Search-Tree/) | [Python C++](./solutions/235.Lowest_Common_Ancestor_of_a_Binary_Search_Tree) | [Notes](./solutions/235.Lowest_Common_Ancestor_of_a_Binary_Search_Tree) |
| 236 | [236.Lowest_Common_Ancestor_of_a_Binary_Tree](https://leetcode.com/problems/Lowest-Common-Ancestor-of-a-Binary-Tree/) | [](./solutions/236.Lowest_Common_Ancestor_of_a_Binary_Tree) | Coming soon |
| 237 | [237.Delete_Node_in_a_Linked_List](https://leetcode.com/problems/Delete-Node-in-a-Linked-List/) | [Python C++](./solutions/237.Delete_Node_in_a_Linked_List) | [Notes](./solutions/237.Delete_Node_in_a_Linked_List) |
| 238 | [238.Product_of_Array_Except_Self](https://leetcode.com/problems/Product-of-Array-Except-Self/) | [Java Python C++](./solutions/238.Product_of_Array_Except_Self) | [Notes](./solutions/238.Product_of_Array_Except_Self) |
| 239 | [239.Sliding_Window_Maximum](https://leetcode.com/problems/Sliding-Window-Maximum/) | [Python C++](./solutions/239.Sliding_Window_Maximum) | [Notes](./solutions/239.Sliding_Window_Maximum) |
| 240 | [240.Search_a_2D_Matrix_II](https://leetcode.com/problems/Search-a-2D-Matrix-II/) | [](./solutions/240.Search_a_2D_Matrix_II) | Coming soon |
| 241 | [241.Different_Ways_to_Add_Parentheses](https://leetcode.com/problems/Different-Ways-to-Add-Parentheses/) | [Python C++](./solutions/241.Different_Ways_to_Add_Parentheses) | [Notes](./solutions/241.Different_Ways_to_Add_Parentheses) |
| 242 | [242.Valid_Anagram](https://leetcode.com/problems/Valid-Anagram/) | [Python C++](./solutions/242.Valid_Anagram) | [Notes](./solutions/242.Valid_Anagram) |
| 243 | [243.Shortest_Word_Distance $](https://leetcode.com/problems/Shortest-Word-Distance/) | Not Buy | Not Buy |
| 244 | [244.Shortest_Word_Distance_II $](https://leetcode.com/problems/Shortest-Word-Distance-II/) | Not Buy | Not Buy |
| 245 | [245.Shortest_Word_Distance_III $](https://leetcode.com/problems/Shortest-Word-Distance-III/) | Not Buy | Not Buy |
| 246 | [246.Strobogrammatic_Number $](https://leetcode.com/problems/Strobogrammatic-Number/) | Not Buy | Not Buy |
| 247 | [247.Strobogrammatic_Number_II $](https://leetcode.com/problems/Strobogrammatic-Number-II/) | Not Buy | Not Buy |
| 248 | [248.Strobogrammatic_Number_III $](https://leetcode.com/problems/Strobogrammatic-Number-III/) | Not Buy | Not Buy |
| 249 | [249.Group_Shifted_Strings $](https://leetcode.com/problems/Group-Shifted-Strings/) | Not Buy | Not Buy |
| 250 | [250.Count_Univalue_Subtrees $](https://leetcode.com/problems/Count-Univalue-Subtrees/) | Not Buy | Not Buy |
| 251 | [251.Flatten_2D_Vector $](https://leetcode.com/problems/Flatten-2D-Vector/) | Not Buy | Not Buy |
| 252 | [252.Meeting_Rooms $](https://leetcode.com/problems/Meeting-Rooms/) | Not Buy | Not Buy |
| 253 | [253.Meeting_Rooms_II $](https://leetcode.com/problems/Meeting-Rooms-II/) | Not Buy | Not Buy |
| 254 | [254.Factor_Combinations $](https://leetcode.com/problems/Factor-Combinations/) | Not Buy | Not Buy |
| 255 | [255.Verify_Preorder_Sequence_in_Bina... $](https://leetcode.com/problems/Verify-Preorder-Sequence-in-Binary-Search-Tree/) | Not Buy | Not Buy |
| 256 | [256.Paint_House $](https://leetcode.com/problems/Paint-House/) | Not Buy | Not Buy |
| 257 | [257.Binary_Tree_Paths](https://leetcode.com/problems/Binary-Tree-Paths/) | [Python C++](./solutions/257.Binary_Tree_Paths) | [Notes](./solutions/257.Binary_Tree_Paths) |
| 258 | [258.Add_Digits](https://leetcode.com/problems/Add-Digits/) | [Python C++](./solutions/258.Add_Digits) | [Notes](./solutions/258.Add_Digits) |
| 259 | [259.3Sum_Smaller $](https://leetcode.com/problems/3Sum-Smaller/) | Not Buy | Not Buy |
| 260 | [260.Single_Number_III](https://leetcode.com/problems/Single-Number-III/) | [](./solutions/260.Single_Number_III) | Coming soon |
| 261 | [261.Graph_Valid_Tree $](https://leetcode.com/problems/Graph-Valid-Tree/) | Not Buy | Not Buy |
| 263 | [263.Ugly_Number](https://leetcode.com/problems/Ugly-Number/) | [Python C++](./solutions/263.Ugly_Number) | [Notes](./solutions/263.Ugly_Number) |
| 264 | [264.Ugly_Number_II](https://leetcode.com/problems/Ugly-Number-II/) | [](./solutions/264.Ugly_Number_II) | Coming soon |
| 265 | [265.Paint_House_II $](https://leetcode.com/problems/Paint-House-II/) | Not Buy | Not Buy |
| 266 | [266.Palindrome_Permutation $](https://leetcode.com/problems/Palindrome-Permutation/) | Not Buy | Not Buy |
| 267 | [267.Palindrome_Permutation_II $](https://leetcode.com/problems/Palindrome-Permutation-II/) | Not Buy | Not Buy |
| 268 | [268.Missing_Number](https://leetcode.com/problems/Missing-Number/) | [C++ Python Java](./solutions/268.Missing_Number) | [Notes](./solutions/268.Missing_Number) |
| 269 | [269.Alien_Dictionary $](https://leetcode.com/problems/Alien-Dictionary/) | Not Buy | Not Buy |
| 270 | [270.Closest_Binary_Search_Tree_Value $](https://leetcode.com/problems/Closest-Binary-Search-Tree-Value/) | Not Buy | Not Buy |
| 271 | [271.Encode_and_Decode_Strings $](https://leetcode.com/problems/Encode-and-Decode-Strings/) | Not Buy | Not Buy |
| 272 | [272.Closest_Binary_Search_Tree_Value_II $](https://leetcode.com/problems/Closest-Binary-Search-Tree-Value-II/) | Not Buy | Not Buy |
| 273 | [273.Integer_to_English_Words](https://leetcode.com/problems/Integer-to-English-Words/) | [](./solutions/273.Integer_to_English_Words) | Coming soon |
| 274 | [274.H-Index](https://leetcode.com/problems/H-Index/) | [](./solutions/274.H-Index) | Coming soon |
| 275 | [275.H-Index_II](https://leetcode.com/problems/H-Index-II/) | [](./solutions/275.H-Index_II) | Coming soon |
| 276 | [276.Paint_Fence $](https://leetcode.com/problems/Paint-Fence/) | Not Buy | Not Buy |
| 277 | [277.Find_the_Celebrity $](https://leetcode.com/problems/Find-the-Celebrity/) | Not Buy | Not Buy |
| 278 | [278.First_Bad_Version](https://leetcode.com/problems/First-Bad-Version/) | [Python C++](./solutions/278.First_Bad_Version) | [Notes](./solutions/278.First_Bad_Version) |
| 279 | [279.Perfect_Squares](https://leetcode.com/problems/Perfect-Squares/) | [Python C++](./solutions/279.Perfect_Squares) | [Notes](./solutions/279.Perfect_Squares) |
| 280 | [280.Wiggle_Sort $](https://leetcode.com/problems/Wiggle-Sort/) | Not Buy | Not Buy |
| 281 | [281.Zigzag_Iterator $](https://leetcode.com/problems/Zigzag-Iterator/) | Not Buy | Not Buy |
| 282 | [282.Expression_Add_Operators](https://leetcode.com/problems/Expression-Add-Operators/) | [](./solutions/282.Expression_Add_Operators) | Coming soon |
| 283 | [283.Move_Zeroes](https://leetcode.com/problems/Move-Zeroes/) | [C++](./solutions/283.Move_Zeroes) | [Notes](./solutions/283.Move_Zeroes) |
| 284 | [284.Peeking_Iterator](https://leetcode.com/problems/Peeking-Iterator/) | [](./solutions/284.Peeking_Iterator) | Coming soon |
| 285 | [285.Inorder_Successor_in_BST $](https://leetcode.com/problems/Inorder-Successor-in-BST/) | Not Buy | Not Buy |
| 286 | [286.Walls_and_Gates $](https://leetcode.com/problems/Walls-and-Gates/) | Not Buy | Not Buy |
| 287 | [287.Find_the_Duplicate_Number](https://leetcode.com/problems/Find-the-Duplicate-Number/) | [](./solutions/287.Find_the_Duplicate_Number) | Coming soon |
| 288 | [288.Unique_Word_Abbreviation $](https://leetcode.com/problems/Unique-Word-Abbreviation/) | Not Buy | Not Buy |
| 289 | [289.Game_of_Life](https://leetcode.com/problems/Game-of-Life/) | [Python C++](./solutions/289.Game_of_Life) | [Notes](./solutions/289.Game_of_Life) |
| 290 | [290.Word_Pattern](https://leetcode.com/problems/Word-Pattern/) | [Python C++](./solutions/290.Word_Pattern) | [Notes](./solutions/290.Word_Pattern) |
| 291 | [291.Word_Pattern_II $](https://leetcode.com/problems/Word-Pattern-II/) | Not Buy | Not Buy |
| 292 | [292.Nim_Game](https://leetcode.com/problems/Nim-Game/) | [C++](./solutions/292.Nim_Game) | [Notes](./solutions/292.Nim_Game) |
| 293 | [293.Flip_Game $](https://leetcode.com/problems/Flip-Game/) | Not Buy | Not Buy |
| 294 | [294.Flip_Game_II $](https://leetcode.com/problems/Flip-Game-II/) | Not Buy | Not Buy |
| 295 | [295.Find_Median_from_Data_Stream](https://leetcode.com/problems/Find-Median-from-Data-Stream/) | [](./solutions/295.Find_Median_from_Data_Stream) | Coming soon |
| 296 | [296.Best_Meeting_Point $](https://leetcode.com/problems/Best-Meeting-Point/) | Not Buy | Not Buy |
| 297 | [297.Serialize_and_Deserialize_Binary_Tree](https://leetcode.com/problems/Serialize-and-Deserialize-Binary-Tree/) | [](./solutions/297.Serialize_and_Deserialize_Binary_Tree) | Coming soon |
| 298 | [298.Binary_Tree_Longest_Consecutive_Sequence $](https://leetcode.com/problems/Binary-Tree-Longest-Consecutive-Sequence/) | Not Buy | Not Buy |
| 299 | [299.Bulls_and_Cows](https://leetcode.com/problems/Bulls-and-Cows/) | [C++](./solutions/299.Bulls_and_Cows) | Coming soon |
| 300 | [300.Longest_Increasing_Subsequence](https://leetcode.com/problems/Longest-Increasing-Subsequence/) | [](./solutions/300.Longest_Increasing_Subsequence) | Coming soon |
| 301 | [301.Remove_Invalid_Parentheses](https://leetcode.com/problems/Remove-Invalid-Parentheses/) | [](./solutions/301.Remove_Invalid_Parentheses) | Coming soon |
| 302 | [302.Smallest_Rectangle_Enclosing_Bla... $](https://leetcode.com/problems/Smallest-Rectangle-Enclosing-Black-Pixels/) | Not Buy | Not Buy |
| 303 | [303.Range_Sum_Query_-_Immutable](https://leetcode.com/problems/Range-Sum-Query---Immutable/) | [](./solutions/303.Range_Sum_Query_-_Immutable) | Coming soon |
| 304 | [304.Range_Sum_Query_2D_-_Immutable](https://leetcode.com/problems/Range-Sum-Query-2D---Immutable/) | [](./solutions/304.Range_Sum_Query_2D_-_Immutable) | Coming soon |
| 305 | [305.Number_of_Islands_II $](https://leetcode.com/problems/Number-of-Islands-II/) | Not Buy | Not Buy |
| 306 | [306.Additive_Number](https://leetcode.com/problems/Additive-Number/) | [](./solutions/306.Additive_Number) | Coming soon |
| 307 | [307.Range_Sum_Query_-_Mutable](https://leetcode.com/problems/Range-Sum-Query---Mutable/) | [](./solutions/307.Range_Sum_Query_-_Mutable) | Coming soon |
| 308 | [308.Range_Sum_Query_2D_-_Mutable $](https://leetcode.com/problems/Range-Sum-Query-2D---Mutable/) | Not Buy | Not Buy |
| 309 | [309.Best_Time_to_Buy_and_Sell_Stock_...](https://leetcode.com/problems/Best-Time-to-Buy-and-Sell-Stock-with-Cooldown/) | [](./solutions/309.Best_Time_to_Buy_and_Sell_Stock_with_Cooldown) | Coming soon |
| 310 | [310.Minimum_Height_Trees](https://leetcode.com/problems/Minimum-Height-Trees/) | [](./solutions/310.Minimum_Height_Trees) | Coming soon |
| 311 | [311.Sparse_Matrix_Multiplication $](https://leetcode.com/problems/Sparse-Matrix-Multiplication/) | Not Buy | Not Buy |
| 312 | [312.Burst_Balloons](https://leetcode.com/problems/Burst-Balloons/) | [](./solutions/312.Burst_Balloons) | Coming soon |
| 313 | [313.Super_Ugly_Number](https://leetcode.com/problems/Super-Ugly-Number/) | [](./solutions/313.Super_Ugly_Number) | Coming soon |
| 314 | [314.Binary_Tree_Vertical_Order_Traversal $](https://leetcode.com/problems/Binary-Tree-Vertical-Order-Traversal/) | Not Buy | Not Buy |
| 315 | [315.Count_of_Smaller_Numbers_After_Self](https://leetcode.com/problems/Count-of-Smaller-Numbers-After-Self/) | [](./solutions/315.Count_of_Smaller_Numbers_After_Self) | Coming soon |
| 316 | [316.Remove_Duplicate_Letters](https://leetcode.com/problems/Remove-Duplicate-Letters/) | [](./solutions/316.Remove_Duplicate_Letters) | Coming soon |
| 317 | [317.Shortest_Distance_from_All_Buildings $](https://leetcode.com/problems/Shortest-Distance-from-All-Buildings/) | Not Buy | Not Buy |
| 318 | [318.Maximum_Product_of_Word_Lengths](https://leetcode.com/problems/Maximum-Product-of-Word-Lengths/) | [](./solutions/318.Maximum_Product_of_Word_Lengths) | Coming soon |
| 319 | [319.Bulb_Switcher](https://leetcode.com/problems/Bulb-Switcher/) | [](./solutions/319.Bulb_Switcher) | Coming soon |
| 320 | [320.Generalized_Abbreviation $](https://leetcode.com/problems/Generalized-Abbreviation/) | Not Buy | Not Buy |
| 321 | [321.Create_Maximum_Number](https://leetcode.com/problems/Create-Maximum-Number/) | [](./solutions/321.Create_Maximum_Number) | Coming soon |
| 322 | [322.Coin_Change](https://leetcode.com/problems/Coin-Change/) | [](./solutions/322.Coin_Change) | Coming soon |
| 323 | [323.Number_of_Connected_Components_i... $](https://leetcode.com/problems/Number-of-Connected-Components-in-an-Undirected-Graph/) | Not Buy | Not Buy |
| 324 | [324.Wiggle_Sort_II](https://leetcode.com/problems/Wiggle-Sort-II/) | [](./solutions/324.Wiggle_Sort_II) | Coming soon |
| 325 | [325.Maximum_Size_Subarray_Sum_Equals_k $](https://leetcode.com/problems/Maximum-Size-Subarray-Sum-Equals-k/) | Not Buy | Not Buy |
| 326 | [326.Power_of_Three](https://leetcode.com/problems/Power-of-Three/) | [C++ Python Java](./solutions/326.Power_of_Three) | [Notes](./solutions/326.Power_of_Three) |
| 327 | [327.Count_of_Range_Sum](https://leetcode.com/problems/Count-of-Range-Sum/) | [](./solutions/327.Count_of_Range_Sum) | Coming soon |
| 328 | [328.Odd_Even_Linked_List](https://leetcode.com/problems/Odd-Even-Linked-List/) | [Python C++](./solutions/328.Odd_Even_Linked_List) | [Notes](./solutions/328.Odd_Even_Linked_List) |
| 329 | [329.Longest_Increasing_Path_in_a_Matrix](https://leetcode.com/problems/Longest-Increasing-Path-in-a-Matrix/) | [](./solutions/329.Longest_Increasing_Path_in_a_Matrix) | Coming soon |
| 330 | [330.Patching_Array](https://leetcode.com/problems/Patching-Array/) | [](./solutions/330.Patching_Array) | Coming soon |
| 331 | [331.Verify_Preorder_Serialization_of...](https://leetcode.com/problems/Verify-Preorder-Serialization-of-a-Binary-Tree/) | [](./solutions/331.Verify_Preorder_Serialization_of_a_Binary_Tree) | Coming soon |
| 332 | [332.Reconstruct_Itinerary](https://leetcode.com/problems/Reconstruct-Itinerary/) | [](./solutions/332.Reconstruct_Itinerary) | Coming soon |
| 333 | [333.Largest_BST_Subtree $](https://leetcode.com/problems/Largest-BST-Subtree/) | Not Buy | Not Buy |
| 334 | [334.Increasing_Triplet_Subsequence](https://leetcode.com/problems/Increasing-Triplet-Subsequence/) | [C++](./solutions/334.Increasing_Triplet_Subsequence) | [Notes](./solutions/334.Increasing_Triplet_Subsequence) |