Gammal Tech
Premium
Courses
Masterclass
FAQ
Contact
SIGN IN
My Account
Algorithms
Learn algorithms to handle large amounts of data, create faster programs, and pass software engineering interviews.
Lesson
1
Prime 1
Lesson
2
Prime 2
Lesson
3
Sieve of Eratosthenes
Lesson
4
Sieve Implementation
Lesson
5
Design Algorithm
Lesson
6
Implementation
Lesson
7
Bubble Sort
Lesson
8
Bubble Sort Code
Lesson
9
Selection Sort
Lesson
10
Selection Sort Code
Lesson
11
Merge Sort
Lesson
12
Merge Sort Code
Lesson
13
Divide and Conquer
Lesson
14
Divide and Conquer Code
Lesson
15
ATM (Basic Problem)
Lesson
16
ATM (Basic Recursion)
Lesson
17
ATM (Advanced)
Lesson
18
ATM (Advanced Recursion)
Lesson
19
ATM (Memoization)
Lesson
20
ATM (Memoization Code)
Lesson
21
ATM Dynamic Programming DP 1
Lesson
22
ATM Dynamic Programming DP 2
Lesson
23
ATM Dynamic Programming Code
Lesson
24
ATM DP Optimization
Lesson
25
ATM DP Optimization Code
Lesson
26
Fibonacci Recursion
Lesson
27
Fibonacci Memoization
Lesson
28
Fibonacci Memoization Code
Lesson
29
Fibonacci DP
Lesson
30
Fibonacci DP Code
Lesson
31
Math Equation 1
Lesson
32
Math Equation 2
Lesson
33
Math Equation 3
Lesson
34
Math Equation 4
Lesson
35
Maze Recursion
Lesson
36
Maze Recursion Code
Lesson
37
Maze Memoization
Lesson
38
Maze Memoization Code
Lesson
39
Maze Dynamic Programming
Lesson
40
Maze DP Code
Lesson
41
Knapsack Problem
Lesson
42
Knapsack Recursion
Lesson
43
Knapsack Memoization
Lesson
44
Knapsack Memoization Code
Lesson
45
Knapsack Dynamic Programming
Lesson
46
Knapsack DP Code
Lesson
47
Knapsack DP Optimization
Lesson
48
Knapsack DP Optimization Code
Lesson
49
Insertion Sort Algorithm
Lesson
50
Insertion Sort Algorithm Code
Lesson
51
Greedy Algorithm
Lesson
52
Fractional Knapsack
Lesson
53
Binary Search
Lesson
54
Binary Search Code
Lesson
55
Bit Masking
Lesson
56
Bit Masking Code
Lesson
57
Graph Representations
Lesson
58
Graph Theory
Lesson
59
Dijkstra’s algorithm
Lesson
60
Dijkstra Code
Lesson
61
Bellman-Ford algorithm
Lesson
62
Bellman-Ford algorithm Code
Lesson
63
Single Source Shortest Path Algorithm
Lesson
64
All Pair Shortest Path Algorithm
Lesson
65
Floyd-Warshall algorithm