count | number | title | difficult |
---|---|---|---|
1 | 701 | Insert into a Binary Search Tree | Medium |
2 | 709 | To Lower Case | Easy |
3 | 807 | Max Increase to Keep City Skyline | Medium |
4 | 835 | Image Overlap | Medium |
5 | 841 | Keys and Rooms | Medium |
6 | 846 | Hand of Straights | Medium |
7 | 848 | Shifting Letters | Medium |
8 | 851 | Loud and Rich | Medium |
9 | 856 | Score of Parentheses | Medium |
10 | 861 | Score After Flipping Matrix | Medium |
11 | 863 | All Nodes Distance K in Binary Tree | Medium |
12 | 865 | Smallest Subtree with all the Deepest Nodes | Medium |
13 | 870 | Advantage Shuffle | Medium |
14 | 877 | Stone Game | Medium |
15 | 881 | Boats to Save People | Medium |
16 | 890 | Find and Replace Pattern | Medium |
17 | 894 | All Possible Full Binary Trees | Medium |
18 | 900 | RLE Iterator | Medium |
19 | 901 | Online Stock Span | Medium |
20 | 904 | Fruit Into Baskets | Medium |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 911 | Online Election | Medium | 2018-09-24 | |
2 | 916 | Word Subsets | Medium | 2018-10-02 | DELAY (National Day) |
3 | 915 | Partition Array into Disjoint Intervals | Medium | 2018-10-02 | DELAY (National Day) |
4 | 641 | Design Circular Deque | Medium | 2018-10-02 | DELAY (National Day) |
5 | 622 | Design Circular Queue | Medium | 2018-10-02 | DELAY (National Day) |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 922 | Sort Array By Parity II | Easy | 2018-10-14 | |
2 | 921 | Minimum Add to Make Parentheses Valid | Medium | 2018-10-14 | |
3 | 923 | 3Sum With Multiplicity | Medium | 2018-10-14 | |
4 | 919 | Complete Binary Tree Inserter | Medium | 2018-10-14 | |
5 | 430 | Flatten a Multilevel Doubly Linked List | Medium | 2018-10-14 | |
6 | 540 | Single Element in a Sorted Array | Medium | 2018-10-14 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 869 | Reordered Power of 2 | Medium | 2018-10-17 | |
2 | 849 | Maximize Distance to Closest Person | Easy | 2018-10-17 | |
3 | 855 | Exam Room | Medium | 2018-10-18 | NEED OPTIMIZATION |
4 | 926 | Flip String to Monotone Increasing | Medium | 2018-10-21 | |
5 | 654 | Maximum Binary Tree | Medium | 2018-10-21 | |
6 | 814 | Binary Tree Pruning | Medium | 2018-10-21 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 931 | Minimum Falling Path Sum | Medium | 2018-10-28 | |
2 | 930 | Binary Subarrays With Sum | Medium | 2018-10-30 | subarray (think about presum) |
3 | 513 | Find Bottom Left Tree Value | Medium | 2018-10-30 | |
4 | 515 | Find Largest Value in Each Tree Row | Medium | 2018-10-30 | |
5 | 94 | Binary Tree Inorder Traversal | Medium | 2018-10-30 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 918 | Maximum Sum Circular Subarray | Medium | 2018-10-30 | |
2 | 907 | Sum of Subarray Minimums | Medium | 2018-10-31 | |
3 | 873 | Length of Longest Fibonacci Subsequence | Medium | 2018-10-31 | |
4 | 938 | Range Sum of BST | Medium | 2018-11-11 | |
5 | 875 | Koko Eating Bananas | Medium | 2018-11-12 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 94 | Binary Tree Inorder Traversal | Medium | 2018-11-12 | |
2 | 508 | Most Frequent Subtree Sum | Medium | 2018-11-18 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 941 | Valid Mountain Array | Easy | 2018-11-18 | |
2 | 944 | Delete Columns to Make Sorted | Medium | 2018-11-18 | |
3 | 942 | DI String Match | Medium | 2018-11-18 | |
4 | 951 | Flip Equivalent Binary Trees | Medium | 2018-12-02 | |
5 | 949 | Largest Time for Given Digits | Easy | 2018-12-02 | |
6 | 950 | Reveal Cards In Increasing Order | Medium | 2018-12-02 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 885 | Spiral Matrix III | Medium | 2018-11-21 | |
2 | 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | 2018-11-22 | |
3 | 945 | Minimum Increment to Make Array Unique | Medium | 2018-11-25 | |
4 | 946 | Validate Stack Sequences | Medium | 2018-11-25 | |
5 | 934 | Shortest Bridge | Medium | 2018-11-25 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 655 | Print Binary Tree | Medium | 2018-12-01 | |
2 | 144 | Binary Tree Preorder Traversal | Medium | 2018-12-01 | |
3 | 230 | Kth Smallest Element in a BST | Medium | 2018-12-01 | |
4 | 684 | Redundant Connection | Medium | 2018-12-01 | |
5 | 685 | Redundant Connection II | Medium | 2018-12-01 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 979 | Distribute Coins in Binary Tree | Medium | 2019-01-23 | |
2 | 969 | Pancake Sorting | Medium | 2019-01-24 | |
3 | 959 | Regions Cut By Slashes | Medium | 2019-01-25 | |
4 | 337 | House Robber III | Medium | 2019-01-30 | |
5 | 958 | Check Completeness of a Binary Tree | Medium | 2019-02-01 |
count | number | title | difficult | finish-time | comment |
---|---|---|---|---|---|
1 | 985 | Sum of Even Numbers After Queries | Easy | 2019-02-03 | |
2 | 986 | Interval List Intersections | Medium | 2019-02-03 | |
3 | 988 | Smallest String Starting From Leaf | Medium | 2019-02-03 | |
4 | 863 | All Nodes Distance K in Binary Tree | Medium | 2019-02-03 | |
5 | 96 | Unique Binary Search Trees | Medium | 2019-02-03 | |
6 | 652 | Find Duplicate Subtrees | Medium | 2019-02-03 |
count | number | title | difficult | deadline | status | finish-time | comment |
---|---|---|---|---|---|---|---|
1 | 846 | Hand of Straights | Medium | 2018-09-16 | DONE | 2018-09-16 | |
2 | 835 | Image Overlap | Medium | 2018-09-23 | DONE | 2018-09-23 | |
3 | 870 | Advantage Shuffle | Medium | 2018-09-23 | DONE | 2018-09-23 | |
4 | 900 | RLE Iterator | Medium | 2018-09-30 | DONE | 2018-10-02 | replace binary search by using some tricks |
5 | 901 | Online Stock Span | Medium | 2018-09-30 | DONE | 2018-10-02 | replace useless storage by using stack style |
6 | 807 | Max Increase to Keep City Skyline | Medium | 2018-10-07 | TODO | ||
7 | 894 | All Possible Full Binary Trees | Medium | 2018-10-07 | TODO | ||
8 | 863 | All Nodes Distance K in Binary Tree | Medium | 2018-10-07 | DONE | 2019-02-03 | |
9 | 915 | Partition Array into Disjoint Intervals | Medium | 2018-10-14 | TODO | ||
10 | 923 | 3Sum With Multiplicity | Medium | 2018-10-21 | TODO | ||
11 | 869 | Reordered Power of 2 | Medium | 2018-10-24 | TODO | ||
12 | 926 | Flip String to Monotone Increasing | Medium | 2018-10-28 | TODO | ||
13 | 930 | Binary Subarrays With Sum | Medium | 2018-11-12 | TODO | ||
14 | 513 | Find Bottom Left Tree Value | Medium | 2018-11-12 | TODO | ||
15 | 918 | Maximum Sum Circular Subarray | Medium | 2018-11-12 | TODO | ||
16 | 907 | Sum of Subarray Minimums | Medium | 2018-11-12 | TODO | ||
17 | 873 | Length of Longest Fibonacci Subsequence | Medium | 2018-11-12 | TODO | ||
18 | 865 | Smallest Subtree with all the Deepest Nodes | Medium | 2018-1124 | TODO | ||
19 | 885 | Spiral Matrix III | Medium | 2018-11-24 | |||
20 | 889 | Construct Binary Tree from Preorder and Postorder Traversal | Medium | 2018-11-24 | |||
21 | 685 | Redundant Connection II | Medium | 2018-12-15 | |||
22 | 979 | Distribute Coins in Binary Tree | Medium | 2019-02-06 | |||
23 | 959 | Regions Cut By Slashes | Medium | 2019-02-06 |