Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/behzadam/solved
Solved is my code practices and solutions in typescript
https://github.com/behzadam/solved
algorithm algorithms code-challenges data-structures datastructures design-patterns exercism exercism-solutions hackerrank leetcode leetcode-typescript patterns typescript
Last synced: about 1 month ago
JSON representation
Solved is my code practices and solutions in typescript
- Host: GitHub
- URL: https://github.com/behzadam/solved
- Owner: behzadam
- License: mit
- Created: 2022-01-15T21:06:29.000Z (about 3 years ago)
- Default Branch: main
- Last Pushed: 2024-07-22T12:58:20.000Z (6 months ago)
- Last Synced: 2024-07-22T15:23:24.464Z (6 months ago)
- Topics: algorithm, algorithms, code-challenges, data-structures, datastructures, design-patterns, exercism, exercism-solutions, hackerrank, leetcode, leetcode-typescript, patterns, typescript
- Language: TypeScript
- Homepage:
- Size: 242 KB
- Stars: 3
- Watchers: 2
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Solved in TypeScript
[](https://app.codacy.com/gh/behzadam/solved/dashboard?utm_source=gh&utm_medium=referral&utm_content=&utm_campaign=Badge_grade)
## Introduction
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.
### Array
- [Find missing numbers](src/challange/array/find-missing-numbers/find-missing-numbers.ts)
- [Find max subarray](src/challange/array/find-max-subarray/find-max-subarray.ts)
- [Find majority element](src/challange/array/find-majority-element/find-majority-element.ts)
- [Find Largest And Smallest](src/challange/array/find-largest-and-smallest/find-largest-and-smallest.ts)
- [Max profit](src/challange/array/max-profit/max-profit.ts)
- [Move Zeroes](src/challange/array/move-zeroes/move-zeroes.ts)
- [Non-constructible Change](src/challange/array/non-constructible-change/non-constructible-change.ts)
Please note that the repository is still a work in progress, and new algorithms and patterns will be added over time.
## Getting Started
To get started with the repository, follow these simple steps:
Clone the repository to your local machine using the command:
```bash
git clone https://github.com/behzadam/solved.git
```
Install the required dependencies by running the following command:
```bash
pnpm install
```
Run all tests
```bash
pnpm test
```
Format checking
```bash
pnpm format:check
```
Format fixing
```bash
pnpm format:fix
```
Run ESLint
```bash
pnpm lint
```
## License
The "Solved" repository is licensed under the [MIT License](https://opensource.org/licenses/MIT). Feel free to use, modify, and distribute the code.
## Contact
If you have any questions or suggestions regarding the repository, please feel free to [contact me](mailto:[email protected]).