Leetcode question type data structure solution Category summary

Chapter 2 linear table 2nd array 2.1.1 remove duplicates from sorted array2.1.2 remove partition from sorted array ii2.1.3 search in rotated sorted sort search in rotated sorted array ii2.1.5 median of two sorted limit longest consecutive limit two sum2.1.8 3sum2. 1.9 3sum closest2.1.10 4sum2. 1.11 remove element2.1.12 next iteration permutation invalid valid duplicate trapping rain water2.1.16 rotate image2.1.17 plus one2.1.18 climbing gradient gray code2.1.20 set matrix variable gas station2.1.22 limit single partition single number ii2.2 Single Chain Table 2.2.1 add two merge reverse linked list ii2.2.3 partition list2.2.4 remove partition from sorted list2.2.5 remove partition from sorted list ii2.2.6 rotate list2.2.7 remove nth node from end of list2.2.8 swap nodes in primary reverse nodes in k-Group2.2.10 copy list with random pointer2.2.11 linked list already linked list cycle ii2.2.13 reorder list2.2.14 LRU cache chapter 3rd string 3.1 valid palindrome3.2 implement strstr () 3.3 string to INTEGER (atoi) 3.4 add binary3.5 longest palindromic comment Regular Expression comment wildcard comment Longest Common prefix3.9 valid number3.10 integer to roman3.11 Roman to integer3.12 count and adjust limit simplify path3.15 length of last word chapter 4th stack and queue 4.1 stack 4.1.1 valid your longest valid your largest rectangle in histogram4.1.4 evaluate reverse Polish notation4.2 queue Chapter 2 tree 5th binary tree traversal 5.1.1 Binary Tree preorder your binary tree inorder your binary tree postorder your binary tree level order traversal5.binary tree level order traversal ii5.1.6 Binary Tree zigzag level order contains recover binary search using same using hierarchical Ric tree5.1.10 balanced binary classification flatten binary tree to linked list5.1.12 populating next right pointers in each node ii5.2 binary tree construction 5.2.1 construct binary tree from preorder and inorder into Construct binary tree from inorder and postorder traversal5.3 Binary Search Tree 5.3.1 unique Binary Search trees5.3.2 unique Binary Search Trees ii5.3.3 validate Binary Search tree5.3.4 convert sorted array to binary search Indexes convert sorted list to binary search parse Binary Tree recursion 5.4.1 minimum depth of binary tree5.4.2 maximum depth of binary tree5.4.3 path sum5.4.4 path sum ii5.4.5 Binary Tree maximum path skip populnext right pointers in each node5.4.7 sum Root to leaf numbers chapter 6th sorting 6.1 merge sorted sort merge two sorted lists6.3 merge K sorted lists6.4 insertion sort list6.5 sort list6.6 first missing sort colors chapter 7th searching 7.1 search for a random search insert position7.3 search A 2D matrix chapter 8th brute force enumeration method 8.1 subsets8.2 subsets ii8.3 examples permutations ii8.5 examples letter combinations of a phone number chapter 9th breadth first search 9.1 word ladder9.2 word ladder ii9.3 surrounded regions Chapter 10th deep first search 10.1 palindrome sans unique paths10.3 unique paths ii10.4 N-Queens10.5 N-Queens ii10.6 restore IP addresses10.7 combination sum10.8 combination sum ii10.9 generate into Sudoku solver10.11 word search chapter 11th Division governance 11.1 POW (X, n) 11.2 SQRT (X) chapter 2 greedy law 12th jump game12.2 jump game ii12.3 best time to buy and invalid stock12.4 best time to buy and invalid stock ii12.5 longest substring without repeating characters12.6 container with most water chapter 12.1 dynamic planning 13th triangle13.2 maximum partition ii13.4 maximal partition best time to buy and invalid stock partition interleaving string13.7 scramble string13.8 minimum path sum13.9 edit partition decode partition distinct partition word limit word break II Chapter 14th figure 14.1 clone graph 15th chapter details implementation question 15.1 reverse invalid values insert interval15.4 merge limit minimum window limit multiply limit substring with concatenation of all values Pascal's limit Pascal's triangle ii15.10 spiral limit spiral matrix iiir15.12 zigzag conversion15.13 divide two integers15.14 text justification15.15 Max points on a line