Skip to content

Latest commit

 

History

History
136 lines (127 loc) · 15.7 KB

File metadata and controls

136 lines (127 loc) · 15.7 KB

DSA – Data Structures & Algorithms

Yet another try to learn algorithms

TypeScript Node.js License: ISC


Table of contents

Grokking algorithms – Basics of DSA:

  • Chapter #1 - binary search implementations
  • Chapter #2 - selection sort implementation
  • Chapter #3 - factorial implementations
  • Chapter #4 - Euclid algorithm, quick sort & other "divide and rule" implementations
  • Chapter #5 - hash tables usage examples
  • Chapter #6 - breadth-first search implementation
  • Chapter #7 - Dijkstra algorithm implementation
  • Chapter #8 - greedy algorithm implementation
  • Chapter #9 - algorithm implementations using dynamic programming
  • Chapter #10 - k-near neighbors algorithm implementation
  • Chapter #11 - binary search tree implementation

CodeRun Summer Challenge – Competition of most efficient solutions:

LeetCode - 30 Days of JavaScript (TypeScript edition) - Learn JS (TS) Basics with 30 Qs

NeetCode - RoadMap - Bunch of interview tech questions grouped by topics

BigFrontEnd - JavaScript Coding Questions

Interview Questions