Best practices, examples, and exercises. Everything you need to prepare for the algorithmic section of the interview if you are going to take it at JS/TS. Most of the examples and implementations are mainly added in the Typescript language, but you can easily turn it into JS.

• Asymptotic (Big O notation)
• Data structures
  • Fixed size array
  • Dynamic array (vector)
  • Stack
  • Dequeue
  • Queue
  • ArrayList
  • LinkedList
  • DoublyLinkedList
  • Hash Table
  • Heap
  • Binary Search Tree
  • Practice
  • Summary Complexity Table
• Algorithms & Techniques
  • Sorting and Searching
  • Bitwise
  • Graphs
    • Disjoint Set
    • DFS
    • BFS
    • Minimum Spanning Tree
    • Single Shortest Path
    • Topological Sorting
  • Strings
  • Greedy
  • Dynamic Programming
• Principal Tasks
  • Graphs
  • Design
    • [M] LRU Cache
    • [H] LFU Cache
    • [H] In-Memory FileSystem
• LeetCode daily problems

Before contributing to this repository, make sure to read our Contribution Guidelines. You can look at the issues with a "help wanted" label for inspiration regarding what to implement. Our maintainers will guide you through how to make your contribution properly if you make any mistakes. The names of the maintainers of this repository are listed in the CODEOWNERS file.

You can find a list of the algorithms currently in the repository in the directory.
Explanations of many of the algorithms can be found in the wiki.

The materials herein are all © 2023 Alex Gavrilov.

I am providing code and resources in this repository to you under an open-source license. Because this is my personal repository, the license you receive for my code and resources is from me and not my employer.