• Algorithm notes:
  • How to run the solution?
  • Basics
    • Common patterns
    • Recursion
  • Search Algorithms
    • Linear search
  • Data Structures
    • Linked List
    • Doubly linked list
    • Stacks
    • Queue
    • Trees
    • Heaps
    • Priority Queue
    • Hash tables
    • Graphs
  • Algorithm Paradigms
    • Dynamic Programming
  • Shortest path algorithms
    • Dijkstra's algorithm

Algorithm notes:

How to run the solution?

• npm start and select the program you want to run.
• npm test to run all tests.

Basics

Common patterns

Recursion

1. Has 2 elements :- A base case & a function that calls itself, with a reducing set of input to recursive call.
2. Helper method recursion is a pattern that is used when we want to collect the results in an collection.

Search Algorithms

Linear search

1. Loop through all the elements, compare each element.

(Skipping for now, we'll come back to this)

Data Structures

Linked List

Doubly linked list

We'll come back to this section, skipping for now

Stacks

Queue

Trees

Heaps

Priority Queue

Hash tables

Graphs

Algorithm Paradigms

Dynamic Programming

Shortest path algorithms

Dijkstra's algorithm