# leetcode

**Repository Path**: vue-then/leetcode

## Basic Information

- **Project Name**: leetcode
- **Description**: No description available
- **Primary Language**: Unknown
- **License**: Not specified
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-09-04
- **Last Updated**: 2021-03-08

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README

### Backtracking
[17. Letter Combinations of a Phone Number (Medium)](./1-100/17_Letter_Combinations_of_a_Phone_Number.md)<br />
[22. Generate Parentheses (Medium)](./1-100/22_Generate_Parentheses.md)<br />
[39. Combination Sum (Medium)](./1-100/39_Combination_Sum.md)<br />
[40. Combination Sum II (Medium)](./1-100/40_Combination_Sum_II.md)<br />
[46. Permutations (Medium)](./1-100/46_Permutations.md)<br />
[47. Permutations II (Medium)](./1-100/47_Permutations_II.md)<br />
[77. Combinations (Medium)](./1-100/77_Combinations.md)<br />
[78. Subsets (Medium)](./1-100/78_Subsets.md)<br />
[90. Subsets II (Medium)](./1-100/90_Subsets_II.md)<br />
[131. Palindrome Partitioning (Medium)](./101-200/131_Palindrome_Partitioning.md)<br />
[216. Combination Sum III (Medium)](./201-300/216_Combination_Sum_III.md)<br />
[491. Increasing Subsequences (Medium)](./401-500/491_Increasing_Subsequences.md)<br />

### BFS
[127. Word Ladder (Medium)](./101-200/127_Word_Ladder.md)<br />
[310. Minimum Height Trees (Medium)](./301-400/310_Minimum_Height_Trees.md)<br />
[429. N-ary Tree Level Order Traversal (Medium)](./401-500/429_N-ary_Tree_Level_Order_Traversal.md)<br />
[542. 01 Matrix (Medium)](./501-600/542_01_Matrix.md)<br />
[1161. Maximum Level Sum of a Binary Tree (Medium)](./1101-1200/1161_Maximum_Level_Sum_of_a_Binary_Tree.md)<br />
[1162. As Far from Land as Possible (Medium)](./1101-1200/1162_As_Far_from_Land_as_Possible.md)

### Binary Search
[33. Search in Rotated Sorted Array (Medium)](./1-100/33_Search_in_Rotated_Sorted_Array.md)<br />
[34. Find First and Last Position of Element in Sorted Array (Medium)](./1-100/34_Find_First_and_Last_Position_of_Element_in_Sorted_Array.md)<br />
[35. Search Insert Position (Medium)](./1-100/35_Search_Insert_Position.md)<br />
[153. Find Minimum in Rotated Sorted Array (Medium)](./101-200/153_Find_Minimum_in_Rotated_Sorted_Array.md)<br />
[154. Find Minimum in Rotated Sorted Array II (Hard)](./101-200/154_Find_Minimum_in_Rotated_Sorted_Array_II.md)<br />
[378. Kth Smallest Element in a Sorted Matrix (Medium)](./301-400/378_Kth_Smallest_Element_in_a_Sorted_Matrix.md)<br />
[540. Single Element in a Sorted Array (Medium)](./501-600/540_Single_Element_in_a_Sorted_Array.md)<br />
[658. Find K Closest Elements (Medium)](./601-700/658_Find_K_Closest_Elements.md)<br />
[875. Koko Eating Bananas (Medium)](./801-900/875_Koko_Eating_Bananas.md)<br />

### Bit
[136. Single Number (Easy)](./101-200/136_Single_Number.md)<br />
[191. Number of 1 Bits (Easy)](./101-200/191_Number_of_1_Bits.md)<br />
[338. Counting Bits (Medium)](./301-400/338_Counting_Bits.md)<br />

### Design
[146. LRU Cache (Medium)](./101-200/146_LRU_Cache.md)<br />
[155. Min Stack (Easy)](./101-200/155_Min_Stack.md)<br />
[173. Binary Search Tree Iterator (Medium)](./101-200/173_Binary_Search_Tree_Iterator.md)<br />
[208. Implement Trie (Prefix Tree) (Medium)](./201-300/208_Implement_Trie.md)<br />
[211. Add and Search Word - Data structure design (Medium)](./201-300/211_Add_and_Search_Word.md)<br />
[225. Implement Stack using Queues (Easy)](./201-300/225_Implement_Stack_using_Queues.md)<br />
[622. Design Circular Queue (Medium)](./601-700/622_Design_Circular_Queue.md)<br />
[641. Design Circular Deque (Medium)](./601-700/641_Design_Circular_Deque.md)<br />
[705. Design HashSet (Easy)](./701-800/705_Design_HashSet.md)<br />
[706. Design HashMap (Easy)](./701-800/706_Design_HashMap.md)<br />

### DFS
[79. Word Search (medium)](./1-100/79_Word_Search.md)<br />
[130. Surrounded Regions (Medium)](./101-200/130_Surrounded_Regions.md)<br />
[169. Majority Element (Easy)](./101-200/169_Majority_Element.md)<br />
[200. Number of Islands (Medium)](./101-200/200_Number_of_Islands.md)<br />
[222. Count Complete Tree Nodes (Medium)](./201-300/222_Count_Complete_Tree_Nodes.md)<br />
[241. Different Ways to Add Parentheses (Medium)](./201-300/241_Different_Ways_to_Add_Parentheses.md)<br />
[323. Number of Connected Components in an Undirected Graph (Medium)](301-400/323_Number_of_Connected_Components_in_an_Undirected_Graph.md)<br />
[695. Max Area of Island (Medium)](./601-700/695_Max_Area_of_Island.md)<br />
[733. Flood Fill (Easy)](./701-800/733_Flood_Fill.md)<br />
[784. Letter Case Permutation (Easy)](./701-800/784_Letter_Case_Permutation.md)<br />
[827. Making A Large Island (Hard)](./801-900/827_Making_A_Large_Island.md)<br />

### DP
[53. Maximum Subarray (Easy)](./1-100/53_Maximum_Subarray.md)<br />
[62. Unique Paths (Medium)](./1-100/62_Unique_Paths.md)<br />
[63. Unique Paths II (Medium)](./1-100/63_Unique_Paths_II.md)<br />
[64. Minimum Path Sum (Medium)](./1-100/64_Minimum_Path_Sum.md)<br />
[70. Climbing Stairs (Easy)](./1-100/70_Climbing_Stairs.md)<br />
[72. Edit Distance (Hard)](./1-100/72_Edit_Distance.md)<br />
[91. Decode Ways (Medium)](./1-100/91_Decode_Ways.md)<br />
[132. Palindrome Partitioning II (Hard)](./101-200/132_Palindrome_Partitioning_II.md)<br />
[139. Word Break (Medium)](./101-200/139_Word_Break.md)<br />
[152. Maximum Product Subarray (Medium)](./101-200/152_Maximum_Product_Subarray.md)<br />
[198. House Robber (Easy)](./101-200/198_House_Robber.md)<br />
[213. House Robber II (Medium)](./201-300/213_House_Robber_II.md)<br />
[221. Maximal Square (Medium)](./201-300/221_Maximal_Square.md)<br />
[279. Perfect Squares (Medium)](./201-300/279_Perfect_Squares.md)<br />
[300. Longest Increasing Subsequence (Medium)](./201-300/300_Longest_Increasing_Subsequence.md)<br />
[303. Range Sum Query - Immutable (Easy)](./301-400/303_Range_Sum_Query.md)<br />
[322. Coin Change (Medium)](./301-400/322_Coin_Change.md)<br />
[357. Count Numbers with Unique Digits (Medium)](./301-400/357_Count_Numbers_with_Unique_Digits.md)<br />
[516. Longest Palindromic Subsequence (Medium)](./501-600/516_Longest_Palindromic_Subsequence.md)<br />
[583. Delete Operation for Two Strings (Medium)](./501-600/583_Delete_Operation_for_Two_Strings.md)<br />
[673. Number of Longest Increasing Subsequence (Medium)](./601-700/673_Number_of_Longest_Increasing_Subsequence.md)<br />
[718. Maximum Length of Repeated Subarray (Medium)](./701-800/718_Maximum_Length_of_Repeated_Subarray.md)<br />
[746. Min Cost Climbing Stairs (Easy)](./701-800/746_Min_Cost_Climbing_Stairs.md)<br />
[983. Minimum Cost For Tickets (Medium)](./901-1000/983_Minimum_Cost_For_Tickets.md)<br />
[1143. Longest Common Subsequence (Medium)](./1101-1200/1143_Longest_Common_Subsequence.md)<br />

### Graph
[133. Clone Graph (Medium)](./101-200/133_Clone_Graph.md)<br />
[207. Course Schedule (Medium)](./201-300/207_Course_Schedule.md)<br />
[210. Course Schedule II (Medium)](./201-300/210_Course_Schedule_II.md)<br />
[310. Minimum Height Trees (Medium)](./301-400/310_Minimum_Height_Trees.md)<br />
[323. Number of Connected Components in an Undirected Graph (Medium)](301-400/323_Number_of_Connected_Components_in_an_Undirected_Graph.md)<br />
[565. Array Nesting (Medium)](./501-600/565_Array_Nesting.md)<br />
[785. Is Graph Bipartite? (Medium)](./701-800/785_Is_Graph_Bipartite?.md)<br />
[990. Satisfiability of Equality Equations (Medium)](./901-1000/990_Satisfiability_of_Equality_Equations.md)<br />
[997. Find the Town Judge (Easy)](./901-1000/997_Find_the_Town_Judge.md)<br />
[1042. Flower Planting With No Adjacent (Easy)](./1001-1100/1042_Flower_Planting_With_NoAdjacent.md)<br />

### Greedy
[55. Jump Game (Medium)](./1-100/55_Jump_Game.md)

### Hash Map
[1. Two Sum (Easy)](./1-100/1_Two_Sum.md)<br />
[49. Group Anagrams (Medium)](./1-100/49_Group_Anagrams.md)<br />
[350. Intersection of Two Arrays II (Easy)](./301-400/350_Intersection_of_Two_Arrays_II.md)<br />
[387. First Unique Character in a String (Easy)](./301-400/387_First_Unique_Character_in_a_String.md)<br />
[409. Longest Palindrome (Easy)](./401-500/409_Longest_Palindrome.md)<br />
[554. Brick Wall (Medium)](./501-600/554_Brick_Wall.md)<br />
[560. Subarray Sum Equals K (Medium)](./501-600/560_Subarray_Sum_Equals_K.md)<br />
[916. Word Subsets (Medium)](./901-1000/916_Word_Subsets.md)<br />
[1160. Find Words That Can Be Formed by Characters (Easy)](./1101-1200/1160_Find_Words_That_Can_Be_Formed_by_Characters.md)<br />

### Heap
[23. Merge k Sorted Lists (Hard)](./1-100/23_Merge_k_Sorted_Lists.md)<br />
[347. Top K Frequent Elements (Medium)](./301-400/347_Top_K_Frequent_Elements.md)<br />
[373. Find K Pairs with Smallest Sums (Medium)](./301-400/373_Find_K_Pairs_with_Smallest_Sums.md)<br />
[692. Top K Frequent Words (Medium)](./601-700/692_Top_K_Frequent_Words.md)<br />

### Knapsack
[416. Partition Equal Subset Sum (Medium)](./401-500/416_Partition_Equal_Subset_Sum.md)<br />
[474. Ones and Zeroes (Medium)](./401-500/474_Ones_and_Zeroes.md)<br />

### Linked List
[2. Add Two Numbers (Medium)](./1-100/2_Add_Two_Numbers.md)<br />
[21. Merge Two Sorted Lists (Easy)](./1-100/21_Merge_Two_Sorted_Lists.md)<br />
[19. Remove Nth Node From End of List (Medium)](./1-100/19_Remove_Nth_Node_From_End_of_List.md)<br />
[24. Swap Nodes in Pairs (Medium)](./1-100/24_Swap_Nodes_in_Pairs.md)<br />
[82. Remove Duplicates from Sorted List II (Medium)](./1-100/82_Remove_Duplicates_from_Sorted_List_II.md)
[83. Remove Duplicates from Sorted List (Easy)](./1-100/83_Remove_Duplicates_from_Sorted_List.md)<br />
[141. Linked List Cycle (Easy)](./101-200/141_Linked_List_Cycle.md)<br />
[206. Reverse Linked List (Easy)](./201-300/206_Reverse_Linked_List.md)<br />
[203. Remove Linked List Elements (Easy)](./201-300/203_Remove_Linked_List_Elements.md)<br />
[328. Odd Even Linked List (Medium)](./301-400/328_Odd_Even_Linked_List.md)<br />
[876. Middle of the Linked List (Easy)](./801-900/876_Middle_of_the_Linked_List.md)<br />

### Math
[9. Palindrome Number (Medium)](./1-100/9_Palindrome_Number.md)<br />
[41. First Missing Positive (Hard)](./1-100/41_First_Missing_Positive.md)<br />
[48. Rotate Image (Medium)](./1-100/48_Rotate_Image.md)<br />
[118. Pascal's Triangle (Easy)](./101-200/118_Pascal's_Triangle.md)<br />
[119. Pascal's Triangle II (Easy)](./101-200/119_Pascal's_Triangle_II.md)<br />
[121. Best Time to Buy and Sell Stock (Easy)](./101-200/121_Best_Time_to_Buy_and_Sell_Stock.md)<br />
[189. Rotate Array (Easy)](./101-200/189_Rotate_Array.md)<br />
[258. Add Digits (Easy)](./201-300/258_Add_Digits.md)<br />
[349. Intersection of Two Arrays (Easy)](./301-400/349_Intersection_of_Two_Arrays.md)<br />
[442. Find All Duplicates in an Array (Medium)](./401-500/442_Find_All_Duplicates_in_an_Array.md)<br />
[448. Find All Numbers Disappeared in an Array (Easy)](./401-500/448_Find_All_Numbers_Disappeared_in_an_Array.md)<br />
[561. Array Partition I (Easy)](./501-600/561_Array_Partition_I.md)<br />
[593. Valid Square (Medium)](./501-600/593_Valid_Square.md)<br />
[621. Task Scheduler (Medium)](./601-700/621_Task_Scheduler.md)<br />
[650. 2 Keys Keyboard (Medium)](./601-700/650_2_Keys_Keyboard.md)<br />
[731. My Calendar II (Medium)](./701-800/731_My_Calendar_II.md)<br />
[747. Largest Number At Least Twice of Others (Easy)](./701-800/747_Largest_Number_At_Least_Twice_of_Others.md)<br />
[836. Rectangle Overlap (Easy)](./801-900/836_Rectangle_Overlap.md)<br />
[849. Maximize Distance to Closest Person (Easy)](./801-900/849_Maximize_Distance_to_Closest_Person.md)<br />
[892. Surface Area of 3D Shapes (Easy)](./801-900/892_Surface_Area_of_3D_Shapes.md)<br />
[908. Smallest Range I (Easy)](./901-1000/908_Smallest_Range_I.md)<br />
[930. Binary Subarrays With Sum (Medium)](./901-1000/930_Binary_Subarrays_With_Sum.md)<br />
[945. Minimum Increment to Make Array Unique (Medium)](./901-1000/945_Minimum_Increment_to_Make_Array_Unique.md)<br />
[1013. Partition Array Into Three Parts With Equal Sum (Easy)](./1001-1100/1013_Partition_Array_Into_Three_Parts_With_Equal_Sum.md)<br />
[1071. Greatest Common Divisor of Strings (Easy)](./1001-1100/1071_Greatest_Common_Divisor_of_Strings.md)<br />

### Stack
[20. Valid Parentheses (Simple)](./1-100/20_Valid_Parentheses.md)<br />
[71. Simplify Path (Medium)](./1-100/71_Simplify_Path.md)<br />
[224. Basic Calculator (Hard)](./201-300/224_Basic_Calculator.md)<br />
[227. Basic Calculator II (Medium)](./201-300/227_Basic_Calculator_II.md)<br />
[921. Minimum Add to Make Parentheses Valid (Medium)](./901-1000/921_Minimum_Add_to_Make_Parentheses_Valid.md)<br />

### String
[5. Longest Palindromic Substring (Medium)](./1-100/5_Longest_Palindromic_Substring.md)<br />
[6. ZigZag Conversion (Medium)](./1-100/6_ZigZag_Conversion.md)<br />
[151. Reverse Words in a String (Medium)](./101-200/151_Reverse_Words_in_a_String.md)<br />
[394. Decode String (Medium)](./301-400/394_Decode_String.md)<br />
[520. Detect Capital (Easy)](./501-600/520_Detect_Capital.md)<br />
[722. Remove Comments (Medium)](./701-800/722_Remove_Comments.md)<br />
[880. Decoded String at Index (Medium)](./801-900/880_Decoded_String_at_Index.md)<br />

### Tree
[98. Validate Binary Search Tree (Medium)](./1-100/98_Validate_Binary_Search_Tree.md)<br />
[100. Same Tree (Easy)](./1-100/100_Same_Tree.md)<br />
[101. Symmetric Tree (Easy)](./101-200/101_Symmetric_Tree.md)<br />
[102. Binary Tree Level Order Traversal (Medium)](./101-200/102_Binary_Tree_Level_Order_Traversal.md)<br />
[104. Maximum Depth of Binary Tree (Easy)](./101-200/104_Maximum_Depth_of_Binary_Tree.md)<br />
[108. Convert Sorted Array to Binary Search Tree (Easy)](./101-200/108_Convert_Sorted_Array_to_Binary_Search_Tree.md)<br />
[110. Balanced Binary Tree (Easy)](./101-200/110_Balanced_Binary_Tree.md)<br />
[111. Minimum Depth of Binary Tree (Medium)](./101-200/111_Minimum_Depth_of_Binary_Tree.md)<br />
[112. Path Sum (Easy)](./101-200/112_Path_Sum.md)<br />
[113. Path Sum II (Medium)](./101-200/113_Path_Sum_II.md)<br />
[114. Flatten Binary Tree to Linked List (Medium)](./101-200/114_Flatten_Binary_Tree_to_Linked_List.md)<br />
[116. Populating Next Right Pointers in Each Node (Medium)](./101-200/116_Populating_Next_Right_Pointers_in_Each_Node.md)<br />
[129. Sum Root to Leaf Numbers (Medium)](./101-200/129_Sum_Root_to_Leaf_Numbers.md)<br />
[160. Intersection of Two Linked Lists (Easy)](./101-200/160_Intersection_of_Two_Linked_Lists.md)<br />
[226. Invert Binary Tree (Easy)](./201-300/226_Invert_Binary_Tree.md)<br />
[235. Lowest Common Ancestor of a Binary Search Tree (Easy)](201-300/235_Lowest_Common_Ancestor_of_a_Binary_Search_Tree.md)<br />
[236. Lowest Common Ancestor of a Binary Tree (Mdium)](./201-300/236_Lowest_Common_Ancestor_of_a_Binary_Tree.md)<br />
[257. Binary Tree Paths (Easy)](./201-300/257_Binary_Tree_Paths.md)<br />
[404. Sum of Left Leaves (Easy)](./401-500/404_Sum_of_Left_Leaves.md)<br />
[450. Delete Node in a BST (Medium)](./401-500/450_Delete_Node_in_a_BST.md)<br />
[501. Find Mode in Binary Search Tree (Easy)](./501-600/501_Find_Mode_in_Binary_Search_Tree.md)<br />
[508. Most Frequent Subtree Sum (Medium)](./501-600/508_Most_Frequent_Subtree_Sum.md)<br />
[513. Find Bottom Left Tree Value (Medium)](./501-600/513_Find_Bottom_Left_Tree_Value.md)<br />
[515. Find Largest Value in Each Tree Row (Medium)](./501-600/515_Find_Largest_Value_in_Each_Tree_Row.md)<br />
[538. Convert BST to Greater Tree (Easy)](./501-600/538_Convert_BST_to_Greater_Tree.md)<br />
[543. Diameter of Binary Tree (Easy)](./501-600/543_Diameter_of_Binary_Tree.md)<br />
[572. Subtree of Another Tree (Easy)](./501-600/572_Subtree_of_Another_Tree.md)<br />
[606. Construct String from Binary Tree (Easy)](./601-700/606_Construct_String_from_Binary_Tree.md)<br />
[648. Replace Words (Medium)](./601-700/648_Replace_Words.md)<br />
[662. Maximum Width of Binary Tree (Medium)](./601-700/662_Maximum_Width_of_Binary_Tree.md)<br />
[676. Implement Magic Dictionary (Medium)](./601-700/676_Implement_Magic_Dictionary.md)<br />
[687. Longest Univalue Path (Easy)](./601-700/687_Longest_Univalue_Path.md)<br />
[700. Search in a Binary Search Tree (Easy)](./601-700/700_Search_in_a_Binary_Search_Tree.md)<br />
[701. Insert into a Binary Search Tree (Medium)](./701-800/701_Insert_into_a_Binary_Search_Tree.md)<br />
[729. My Calendar I (Medium)](./701-800/729_My_Calendar_I.md)<br />
[863. All Nodes Distance K in Binary Tree (Medium)](./801-900/863_All_Nodes_Distance_K_in_Binary_Tree.md)<br />

### Two Pointers
[3. Longest Substring Without Repeating Characters (Medium)](./1-100/3_Longest_Substring_Without_Repeating_Characters.md)<br />
[11. Container With Most Water (Medium)](./1-100/11_Container_With_Most_Water.md)<br />
[15. 3 Sum (Medium)](./1-100/15_3_Sum.md)<br />
[16. 3 Sum Closest (Medium)](./1-100/16_3_Sum_Closest.md)<br />
[88. Merge Sorted Array (Easy)](./1-100/88_Merge_Sorted_Array.md)<br />
[125. Valid Palindrome (Easy)](./101-200/125_Valid_Palindrome.md)<br />
[209. Minimum Size Subarray Sum (Medum)](./201-300/209_Minimum_Size_Subarray_Sum.md)<br />
[228. Summary Ranges (Medium)](./201-300/228_Summary_Ranges.md)<br />
[283. Move Zeroes (Easy)](./201-300/283_Move_Zeroes.md)<br />
[424. Longest Repeating Character Replacement (Medium)](./401-500/424_Longest_Repeating_Character_Replacement.md)<br />
[438. Find All Anagrams in a String (Medium)](./401-500/438_Find_All_Anagrams_in_a_String.md)<br />
[567. Permutation in String (Medium)](./501-600/567_Permutation_in_String.md)<br />
[674. Longest Continuous Increasing Subsequence (Easy)](./601-700/674_Longest_Continuous_Increasing_Subsequence.md)<br />
[697. Degree of an Array (Easy)](./601-700/697_Degree_of_an_Array.md)<br />
[763. Partition Labels (Medium)](./701-800/763_Partition_Labels.md)<br />
[904. Fruit Into Baskets (Medium)](./901-1000/904_Fruit_Into_Baskets.md)<br />
[915. Partition Array into Disjoint Intervals (Medium)](./901-1000/915_Partition_Array_into_Disjoint_Intervals.md)<br />
[917. Reverse Only Letters (Easy)](./901-1000/917_Reverse_Only_Letters.md)<br />
[925. Long Pressed Name (Easy)](./901-1000/925_Long_Pressed_Name.md)<br />

### Union Find
[547. Friend Circles (Medium)](./501-600/547_Friend_Circles.md)<br />
[684. Redundant Connection (Medium)](./601-700/684_Redundant_Connection.md)<br />
[721. Accounts Merge (Medium)](./701-800/721_Accounts_Merge.md)<br />
[737. Sentence Similarity II (Medium)](./701-800/737_Sentence_Similarity_II.md)