| 589 | N-ary Tree Preorder Traversal | Easy |
| 590 | N-ary Tree Postorder Traversal | Easy |
| 591 | Tag Validator | Hard |
| 636 | Exclusive Time of Functions | Medium |
| 654 | Maximum Binary Tree | Medium |
| 678 | Valid Parenthesis String | Medium |
| 682 | Baseball Game | Easy |
| 726 | Number of Atoms | Hard |
| 735 | Asteroid Collision | Medium |
| 736 | Parse Lisp Expression | Hard |
| 739 | Daily Temperatures | Medium |
| 768 | Max Chunks To Make Sorted II | Hard |
| 769 | Max Chunks To Make Sorted | Medium |
| 770 | Basic Calculator IV | Hard |
| 844 | Backspace String Compare | Easy |
| 853 | Car Fleet | Medium |
| 856 | Score of Parentheses | Medium |
| 880 | Decoded String at Index | Medium |
| 895 | Maximum Frequency Stack | Hard |
| 897 | Increasing Order Search Tree | Easy |
| 901 | Online Stock Span | Medium |
| 907 | Sum of Subarray Minimums | Medium |
| 921 | Minimum Add to Make Parentheses Valid | Medium |
| 936 | Stamping The Sequence | Hard |
| 946 | Validate Stack Sequences | Medium |
| 962 | Maximum Width Ramp | Medium |
| 975 | Odd Even Jump | Hard |
| 1003 | Check If Word Is Valid After Substitutions | Medium |
| 1006 | Clumsy Factorial | Medium |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium |