Algorithms

Learn algorithms to handle large amounts of data, create faster programs, and pass software engineering interviews.

Prime 1

Prime 2

Sieve of Eratosthenes

Sieve Implementation

Design Algorithm

Implementation

Bubble Sort

Bubble Sort Code

Selection Sort

Selection Sort Code

Merge Sort

Merge Sort Code

Divide and Conquer

Divide and Conquer Code

ATM (Basic Problem)

ATM (Basic Recursion)

ATM (Advanced)

ATM (Advanced Recursion)

ATM (Memoization)

ATM (Memoization Code)

ATM Dynamic Programming DP 1

ATM Dynamic Programming DP 2

ATM Dynamic Programming Code

ATM DP Optimization

ATM DP Optimization Code

Fibonacci Recursion

Fibonacci Memoization

Fibonacci Memoization Code

Fibonacci DP

Fibonacci DP Code

Math Equation 1

Math Equation 2

Math Equation 3

Math Equation 4

Maze Recursion

Maze Recursion Code

Maze Memoization

Maze Memoization Code

Maze Dynamic Programming

Maze DP Code

Knapsack Problem

Knapsack Recursion

Knapsack Memoization

Knapsack Memoization Code

Knapsack Dynamic Programming

Knapsack DP Code

Knapsack DP Optimization

Knapsack DP Optimization Code

Insertion Sort Algorithm

Insertion Sort Algorithm Code

Greedy Algorithm

Fractional Knapsack

Binary Search

Binary Search Code

Bit Masking

Bit Masking Code

Graph Representations

Graph Theory

Dijkstra’s algorithm

Dijkstra Code

Bellman-Ford algorithm

Bellman-Ford algorithm Code

Single Source Shortest Path Algorithm

All Pair Shortest Path Algorithm

Floyd-Warshall algorithm