Hello, This is a repo full of leetcode problems for beginners with optimized and easy to understand codes.
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0100-same-tree | Easy |
| 0104-maximum-depth-of-binary-tree | Easy |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| 0111-minimum-depth-of-binary-tree | Easy |
| 0112-path-sum | Easy |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0074-search-a-2d-matrix | Medium |
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0074-search-a-2d-matrix | Medium |
| Problem Name | Difficulty |
|---|---|
| 0048-rotate-image | Medium |
| 0074-search-a-2d-matrix | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0083-remove-duplicates-from-sorted-list | Easy |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| 0048-rotate-image | Medium |
| Problem Name | Difficulty |
|---|---|
| 0002-add-two-numbers | Medium |
| Problem Name | Difficulty |
|---|---|
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0108-convert-sorted-array-to-binary-search-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0196-delete-duplicate-emails | Easy |