This repository is dedicated to solved problems from Leetcode Study Plans.
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 217 | Contains Duplicate | C++ | Easy |
| 53 | Maximum Subarray | C++ | Medium |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 1 | Two Sum | C++ | Easy |
| 88 | Merge Sorted Array | C++ | Easy |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 350 | Intersection of Two Arrays II | C++ | Easy |
| 121 | Best Time to Buy and Sell Stock | C++ | Easy |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 566 | Reshape the Matrix | C++ | Easy |
| 118 | Pascal's Triangle | C++ | Easy |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 1480 | Running Sum of 1d Array | C++ | Easy |
| 724 | Find Pivot Index | C++ | Easy |
| # | Title | Solution | Difficulty |
|---|---|---|---|
| 205 | Isomorphic Strings | C++ | Easy |
| 392 | Is Subsequence | C++ | Easy |