This repository contains my solutions to various LeetCode problems.
# | Title | Deifficulty | Solution | Date |
---|---|---|---|---|
1 | Remove Duplicates from Sorted Array | Easy | TS | 27-04-2023 |
2 | Best Time to Buy and Sell Stock II | Medium | TS | 27-04-2023 |
3 | Rotate Array | Medium | TS | 27-04-2023 |
4 | Contains Duplicate | Easy | TS | 27-04-2023 |
5 | Single Number | Easy | TS | 27-04-2023 |
6 | Intersection of Two Arrays II | Easy | TS | 28-04-2023 |
7 | Plus One | Easy | TS | 28-04-2023 |
8 | Move Zeroes | Easy | TS | 03-05-2023 |
9 | Two Sum | Easy | TS | 03-05-2023 |
9 | Easy | TS | 27-04-2023 |
- The first column contains the problem number.
- The second column contains the problem title, which links to the LeetCode problem page.
- The third column contains the difficulty level of the problem.
- The fourth column contains a link to the solution file in the corresponding language-specific directory.
- The fifth column contains the date when the solution was added.
Contributions are always welcome! If you'd like to contribute to this repository, please follow these steps:
- Fork this repository.
- Create a new branch for your changes:
git checkout -b my-new-feature
. - Add your solutions to the corresponding folder and update the Table of Contents with the new problem and its date.
- Commit your changes:
git commit -am 'Add new feature'
. - Push your branch to your fork:
git push origin my-new-feature
. - Create a new pull request.
This repository is licensed under the MIT License. See LICENSE for more information.