TypeScript Algorithms, Data Structures and Patterns

This repository is a collection of JavaScript algorithms, data structures, and design patterns that have been refactored and rewritten using TypeScript.

Introduction

This repository aims to provide a comprehensive collection of algorithms, data structures, and design patterns implemented in TypeScript. It includes code and patterns from the "JavaScript Algorithms" repository, translated from JavaScript to TypeScript. JavaScript Algorithms

Data structure

• Comparator
• HashTable
• MinHeap
• MaxHeap
• LinkedList
• Queue
• Stack
• MaxPriorityQueue
• MinPriorityQueue
• Trie
• BinarySearch
• LinearSearch

Code challanges

Array

• Find missing numbers
• Find max subarray
• Max profit
• Find majority element

Please note that the repository is still a work in progress, and new algorithms and patterns will be added over time.

Getting Started

ُTo see the current task please, check the Board.

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

License

The "TypeScript Algorithms, Data Structures and Patterns" repository is licensed under the MIT License. Feel free to use, modify, and distribute the code as per the terms of the license.

Contact

If you have any questions or suggestions regarding the repository, please feel free to contact me.