An open API service indexing awesome lists of open source software.

https://github.com/yuzu02/leetcode-top-interview

LeetCode Top Interview Questions using Typescript
https://github.com/yuzu02/leetcode-top-interview

leetcode-solutions typescript

Last synced: 2 months ago
JSON representation

LeetCode Top Interview Questions using Typescript

Awesome Lists containing this project

README

        

# LeetCode Top Interview Questions

## Description

- This is a repository for the LeetCode Top Interview Questions
- The repository contains the solutions to the problems in Typescript.
- The problems are divided into different categories such as Easy, Medium, and Hard.

## Table of Contents

- [Features](#features)
- [Installation](#installation)
- [Usage](#usage)
- [Examples](#examples)
- [Contributing](#contributing)
- [License](#license)

## Features

- The most efficient solutions to the problems.
- Notable comments for the solutions.
- Up to 5 Unit tests for the solutions using Ava.
- Two solutions for each problem.

- The first solution is the most efficient solution in time complexity.
- The second solution is the most efficient solution in space complexity.

## Installation

To run the project, you need to have Node.js installed on your machine.

- You can download it from [here](https://nodejs.org/).

You can install the project by following the steps below:

```bash
# Clone the repository
git clone https://github.com/Yuzu02/Leetcode-Top-Interview

# Enter into the directory
cd Leetcode-Top-Interview

# Install the dependencies using ur preferred package manager
npm install
# or
yarn install
# or
pnpm install
# or
bun install

# Open the project in VSCode
code .
```

## Usage

This project is a collection of solutions to the LeetCode Top Interview Questions divide into different categories.

- [Easy-Collection](Easy-Collection)

- [Array](Easy-Collection/Array)

- [1-Two-Sum](Easy-Collection/Array/1-Two-Sum/Solution/Two-Sum.md)
- [36-Valid-Sudoku](Easy-Collection/Array/36-Valid-Sudoku/Solution/Valid-Sudoku.md)
- [189-Rotate-Array](Easy-Collection/Array/189-Rotate-Array/Solution/Rotate-Array.md)
- [217-Contains-Duplicate](Easy-Collection/Array/217-Contains-Duplicate/Solution/Contains-Duplicate.md)

- [Strings](Easy-Collection/Strings)

- [125-Valid-Palindrome](Easy-Collection/Strings/125-Valid-Palindrome/Solution/Valid-Palindrome.md)
- [344-Reverse-String](Easy-Collection/Strings/344-Reverse-String/Solution/Reverse-String.md)

- Linked-List
- Tree
- Sorting-and-Searching
- Dynamic-Programming
- Design
- Math
- Others

- Medium-Collection

- As soon as I solve the problems, I will update the repo with the solutions.

- Hard-Collection

- As soon as I solve the problems, I will update the repo with the solutions.

You can run the tests for the solutions by running the following command:

```bash
# test# means the test file you want to run based on the number of the problem, e.g. test1, test2, test3, etc.
npm test#
# or
yarn test#
# or
pnpm test#
```

## Examples

```bash
# Example 1
yarn test125

# Example 2
pnpm test189

# Example 3
npm run test217

# Example 4
bun run test344
```

## Contributing

If you want to contribute to this project using ur own solutions and tests, you can follow the steps below:

- Fork the project
- Create a new branch
- Make your changes and commit them
- Push to the branch
- Create a new pull request

## License

This project is licensed under the MIT License - see the [LICENSE](LICENSE) file for details.