[LeetCode Online Judge] (https://leetcode.com/) is a website containing many algorithm questions. Most of them are real interview questions of Google, Facebook, LinkedIn, Apple, etc. This repo shows my solutions by Swift and the code style is strictly follow RayWenderlich Swift Style Guide. Please feel free to reference and STAR to support this repo, thank you!
| Title | Solution | Difficulty |
|---|---|---|
| Contains Duplicate | Swift | Easy |
| Contains Duplicate II | Swift | Easy |
| Remove Duplicates from Sorted Array | Swift | Easy |
| Remove Duplicates from Sorted Array II | Swift | Medium |
| Move Zeroes | Swift | Easy |
| Remove Element | Swift | Easy |
| Rotate Array | Swift | Easy |
| Title | Solution | Difficulty |
|---|---|---|
| Same Tree | Swift | Easy |
| Symmetric Tree | Swift | Easy |
| Invert Binary Tree | Swift | Easy |
| Minimum Depth of Binary Tree | Swift | Easy |
| Maximum Depth of Binary Tree | Swift | Easy |
| Balanced Binary Tree | Swift | Easy |
| Binary Tree Level Order Traversal | Swift | Easy |
| Binary Tree Level Order Traversal II | Swift | Easy |
| Binary Tree Zigzag Level Order Traversal | Swift | Medium |
| Path Sum | Swift | Easy |
| Path Sum II | Swift | Medium |