| 543 | Diameter of Binary Tree | Easy |
| 551 | Student Attendance Record I | Easy |
| 557 | Reverse Words in a String III | Easy |
| 559 | Maximum Depth of N-ary Tree | Easy |
| 561 | Array Partition | Easy |
| 563 | Binary Tree Tilt | Easy |
| 566 | Reshape the Matrix | Easy |
| 572 | Subtree of Another Tree | Easy |
| 575 | Distribute Candies | Easy |
| 584 | Find Customer Referee | Easy |
| 586 | Customer Placing the Largest Number of Orders | Easy |
| 589 | N-ary Tree Preorder Traversal | Easy |
| 590 | N-ary Tree Postorder Traversal | Easy |
| 594 | Longest Harmonious Subsequence | Easy |
| 595 | Big Countries | Easy |
| 596 | Classes More Than 5 Students | Easy |
| 598 | Range Addition II | Easy |
| 599 | Minimum Index Sum of Two Lists | Easy |
| 605 | Can Place Flowers | Easy |
| 606 | Construct String from Binary Tree | Easy |
| 607 | Sales Person | Easy |
| 617 | Merge Two Binary Trees | Easy |
| 620 | Not Boring Movies | Easy |
| 627 | Swap Salary | Easy |
| 628 | Maximum Product of Three Numbers | Easy |
| 637 | Average of Levels in Binary Tree | Easy |
| 643 | Maximum Average Subarray I | Easy |
| 645 | Set Mismatch | Easy |
| 653 | Two Sum IV - Input is a BST | Easy |
| 657 | Robot Return to Origin | Easy |