This repository contains my solution to the leetcode problems form easy to hard.
# | Title | My Solution | Related Topics |
---|---|---|---|
1 | Two Sum | 0001_Two_Sum.md | Array, Hash Table |
7 | Reverse Integer | 0007_Reverse_Integer.md | Math |
9 | Palindrome Number | 0009_Palindrome_Number.md | Math |
13 | Roman to Interger | 0013_Roman_To_Integer.md | Math, String |
14 | Longest Common Prefix | 0014_Longest_Common_Prefix.md | String |
20 | Valid Parentheses | 0020_Valid_Parentheses.md | String, Stack |
21 | Merge Two Sorted Lists | 0021_Merge_Two_Sorted_Lists.md | Linked List |
26 | Remove Duplicates From Sorted Array | 0026_Remove_Duplicates_From_Sorted_Array.md | Array, Two pointers |
27 | Remove Element | 0027_Remove_Element.md | Array, Two pointers |
28 | Implement strStr() | 0028_Implement_strStr().md | String, Two pointers |
35 | Search Insert Position | 0035_Search_Insert_Position.md | Array, Binary Search |
38 | Count and Say | 0038_Count_and_Say.md | String |
53 | Maximum Subarray | 0053_Maximum_Subarray.md | Array, Divide and Conquer, Dynamic Programming |
58 | Length of Last Word | 0058_Length_of_Last_Word.md | String |
66 | Plus One | 0066_Plus_One.md | Array |
67 | Add Binary | 0067_Add_Binary.md | Math, String |
69 | Sqrt(x) | 0069_Sqrt(x).md | Math, Binary Search |
70 | Climbing Stairs | 0070_Climbing_Stairs.md | Dynamic Programming |
83 | Remove Duplicates from Sorted List | 0083_Remove_Duplicates_from_Sorted_List.md | Linked List |
88 | Merge Sorted Array | 0088_Merge_Sorted_Array.md | Array, Two pointers |
100 | Same Tree | 0100_Same_Tree.md | Tree, Depth First Search |
101 | Symmetric Tree | 0101_Symmetric_Tree.md | Tree, Depth First Search, Breadth first Search |
104 | Maximum Depth of Binary Tree | 0104_Maximum_Depth_of_Binary_Tree.md | Tree, Depth First Search |
107 | Binary Tree Level Order Traversal II | 0107_Binary_Tree_Level_Order_Traversal_II.md | Tree, Breadth first Search |
108 | Convert Sorted Array to Binary Search Tree | 0108_Convert_Sorted_Array_to_Binary_Search_Tree.md | Tree, Depth First Search |
110 | Balanced Binary Tree | 0110_Balanced_Binary_Tree.md | Tree, Depth First Search |
111 | Minimum Depth of Binary Tree | 0111_Minimum_Depth_of_Binary_Tree.md | Tree, Depth First Search, Breadth first Search |
112 | Path Sum | 0112_Path_Sum.md | Tree, Depth First Search |
118 | Pascal's Triangle | 0118_Pascal's_Triangle.md | Array |
119 | Pascal's Triangle II | 0119_Pascal's_Triangle_II.md | Array |
121 | Best Time to Buy and Sell Stock | 0121_Best_Time_to_Buy_and_Sell_Stock.md | Array, Greedy |
122 | Best Time to Buy and Sell Stock II | 0122_Best_Time_to_Buy_and_Sell_Stock_II.md | Array, Greedy |
125 | Valid Palindrome | 0125_Valid_Palindrome.md | Two Pointers, String |
136 | Single Number | 0136_Single_Number.md | Hash Table, Bit Manipulation |
141 | Linked List Cycle | 0141_Linked_List_Cycle.md | Linked List, Two Pointer |
- 2020/03/03 Weak at Binary Search
- 2020/03/06 Remember to
new
a node