leetcode practice start from 2020 Feb

104. Maximum Depth of Binary Tree (Easy) #3

105. Minimum Depth of Binary Tree (Easy) #2

106. Diameter of Binary Tree (Easy) #1

107. Path Sum (Easy) #1 depth function

108. Binary Tree Inorder Traversal (Medium) #-1

109. Binary Tree Preorder Traversal (Medium) #-1

110. Binary Tree Postorder Traversal (Medium) #-1

111. validate binary search tree #1 recursion #-1 inorder

112. Lowest Common Ancestor of a Binary Search Tree (Easy) #2

113. Lowest Common Ancestor of a Binary Tree (Medium) #2

114. Symmetric Tree (Easy) #-1

115. Invert Binary Tree (Easy) #2

116. Convert Sorted Array to Binary Search Tree (Easy) 还没做

117. Convert Sorted List to Binary Search Tree (Medium)

118. Balanced Binary Tree (Easy)

119. Kth Smallest Element in a BST (Medium)

120. Binary Tree Paths

121. Path Sum III (Easy)

122. Find Mode in Binary Search Tree (Easy)

123. Next Greater Element III

124. Subtree of Another Tree (Easy)

125. Merge Two Binary Trees (Easy)

126. Trim a Binary Search Tree (Easy)

127. Longest Univalue Path (Easy)

404. Sum of Left Leaves (Easy) #2
405. Find Bottom Left Tree Value (Easy) #2
406. Average of Levels in Binary Tree (Easy)
407. Binary Tree Level Order

19. Remove Nth Node From End of List (Medium) #0
20. Merge Two Sorted Lists (Easy) #2
21. Swap Nodes in Pairs (Medium) #3
22. Remove Duplicates from Sorted List (Easy)
23. copy-list-with-random-pointer
24. Linked List Cycle #2
25. Intersection of Two Linked Lists (Easy) #2
26. Reverse Linked List (Easy) #3 while #-1 recursion
27. Palindrome Linked List (Easy)

22. generate parentheses #1
23. helper-gen-add.js
24. permutations #1
25. permutations-ii #1
26. combinations #1
27. Largest Number
28. House Robber III (Medium)

36. 数独
38. N-queens #2

50. pow-x-n #3
51. majority-element #-1
52. different-ways-to-add-parentheses #1 interview-find100.js #-1

70. climbing-stairs #2
71. triangle #2
72. Maximum Product Subarray #-1
73. Paint Fence
74. Nim Game #1
75. longest-increasing-subsequence
76. coin change
77. Product of Array Except Self
78. Min Cost Climbing Stairs #2

122. buy sell stocks

69. Sqrt(x) #2

https://www.beyond3d.com/content/articles/8/ 278. First Bad Version #2 704. Binary Search #3

1. Two Sum #3
2. Isomorphic Strings (Easy) string
3. Longest Palindrome (Easy) string
4. Valid Anagram (Easy) #2

20. Valid Parentheses (Easy) #3
21. Decode String #-1
22. Min Stack (Easy) #1
23. Implement Stack using Queues (Easy)
24. Implement Queue using Stacks (Easy) #1

739. Daily Temperatures (Medium) #3
740. Next Greater Element II (Medium) #1
741. Remove K Digits #2

239. Sliding Window Maximum 用deque #1
240. Kth Largest Element in a Stream 不会考 因为js没有优先队列或者堆

15. 3-sum #3
16. Palindromic Substrings (Medium)

28. implement-str-str (dp) #-1

2. add-two-numbers #1

3. Add Strings #2

4. Compare Version Numbers #1

5. Palindrome Number (Easy) #2

6. Implement Rand10() Using Rand7() #1

7. reverse-words-in-a-string #0

8. reverse-words-in-a-string-iii #1

9. Count Binary Substrings (Easy)

283. Move Zeroes (Easy)
284. Reshape the Matrix (Easy)
285. Max Consecutive Ones (Easy)

191. 1-bit hamming weight 没做
192. power of two
193. counting bits

1. "实例：模板编译"
2. 就是过滤 HTML 字符串
3. 国际化处理
4. reduce #1
5. throttle, debounce #1
6. flatten #1
7. curry #2
8. bind #1
9. qsort #1
10. symbol
11. myPromise
12. f(1)(2)(3) //9 #1 f(2)(2)(1) //4 f(2,2,1) //4 f() //0

12. jsx函数的具体实现 https://gist.github.com/lygaret/a68220defa69174bdec5
13. 提示字符串格式 YYYY-MM-12
14. code point超过两个字节的汉字 如何获得码点 var s = "𠮷" 码点是0x20BB7 UTF-16 编码为0xD842 0xDFB7（十进制为55362 57271），需要4个字节储存
15. let s = '𠮷a' 如何打出这两个字的码点 // 20bb7 // 61
16. 测试一个字符由两个字节还是由四个字节组成
17. 字符串码点和字符串相互转化
18. 2进制 16进制互换

19. 正确返回字符串长度的函数 var s = '𠮷𠮷'; s.length // 4 codePointLength(s) // 2

1. timeout
2. 按顺序完成异步操作

function m1({x = 0, y = 0} = {}) function m2({x, y} = {x:0, y:0}) m1({x: 3}) m2({x: 3})

2. strict 模式 严格模式下不能用前缀0表示八进制 严格模式下没有func.arguments：返回调用时函数的参数。 严格模式下没有func.caller：返回调用当前函数的那个函数

3. 蹦床函数（trampoline）可以将递归执行转为循环执行

4. 箭头函数this 例子