This is a massive collection of JavaScript Data Structures and Algorithms. I put this repository together to get ready for technical interviews. I hope it helps you get ready for your next big technical interview. Also, feel free to contribute 😀        Â
What is an algorithm?
In simple terms, it is possible to say that an algorithm is a sequence of steps that allow solving a certain task ( Yes, not just computers use algorithms, humans also use them). Now, an algorithm should have three important characteristics to be considered valid:
- It should be finite:Â If your algorithm never ends trying to solve the problem it was designed to solve then it is useless
- It should have well-defined instructions:Â Each step of the algorithm has to be precisely defined; the instructions should be unambiguously specified for each case.
- It should be effective:Â The algorithm should solve the problem it was designed to solve. And it should be possible to demonstrate that the algorithm converges with just a paper and pencil.
This repo covers the following topics:
- Binary Heap
- Bitwise
- Complex Arrays
- Graph Traversing
- Graph
- Hash Table
- Fast Fourier Transformations
- Linked Lists
- List
- Memoization
- Queue
- Rabin Karp
- Search
- Shortest Path
- Sorting
- Stack
- Trie
- Â
Follow Joe Karlsson on Social
- Twitter – https://twitter.com/JoeKarlsson1
- TikTok – https://www.tiktok.com/@joekarlsson
- GitHub – https://github.com/JoeKarlsson
- YouTube – https://www.youtube.com/c/JoeKarlsson
- Twitch – https://www.twitch.tv/joe_karlsson
- Medium – https://medium.com/@joekarlsson
- LinkedIn – https://www.linkedin.com/in/joekarlsson/
- Reddit – www.reddit.com/user/joekarlsson
- Instagram – https://www.instagram.com/joekarlsson/