新年新开始，为找工作刷题

Merge Intervals
Copy List with Random Pointer
Clone Graph

最近比较忙，所以随便和同学一起讨论了几个题目

Perfect Number
Find all numbers disappeared in an array
reverse a word in a string
find largest value in each tree row
most frequent subtree sum

Validate BST
Find Mode in BST
Longest Substring without Repeating Chars
Longest Substring with at most two distinct chars

Group Anagrams
Product of Array Except Self
Set Mismatch
今天还和同学讨论了几道题 模拟面了一下他们

昨天做了和3Sum相关的一系列题目。现在开始从高频 往下看medium和hard的题目。剩下的时间还要多准备一些特殊的主题比如DP

昨天参加了lc的challenge。感觉题目难度适中。但是个人的bugfree能力还需要加强。
        Sum of Even Numbers After Queries
interval list intersections
顺便又做了
meeting rooms ii
Minimum Number of Arrows to Burst Balloons
Smallest String Starting From Leaf

今天又和同学练了白板。同时做了这几道题。
        Two Sum IV - Input is a BST
        Pascal's Triangle II
Decode String
Flip Game
Unique Email Addresses

昨天做了几道和tree相关的。
        Trim a Binary Search Tree
        Binary Tree Inorder Traversal
        Binary Tree Postorder Traversal
N-ary Tree Postorder Traversal
        Smallest Subtree with all the Deepest Nodes

突然发现已经一周没更新了。最近一周比较懒散。刷到了瓶颈期。最近在逐渐找回状态。LeetCode到现在有200+了。一定要做到熟悉的题目重新写的时候bugfree