This repository contains solutions to some of the most common coding challenges in TypeScript. You can find the Leetcode solutions with the number of the problem in the title.
- Find missing numbers
- Find max subarray
- Find majority element
- Find Largest And Smallest
- Max profit
- Move Zeroes
- Non-constructible Change
Please note that the repository is still a work in progress, and new algorithms and patterns will be added over time.
To get started with the repository, follow these simple steps:
Clone the repository to your local machine using the command:
git clone https://github.com/behzadam/solved.git
Install the required dependencies by running the following command:
pnpm install
Run all tests
pnpm test
Format checking
pnpm format:check
Format fixing
pnpm format:fix
Run ESLint
pnpm lint
The "Solved" repository is licensed under the MIT License. Feel free to use, modify, and distribute the code.
If you have any questions or suggestions regarding the repository, please feel free to contact me.