JavaScript - DSA

Foundations

1

Complexity Analysis

→

2

Problem Solving Skills

→

Array Mastery

3

Array Operations

→

4

In-place Manipulation

→

Two Pointers

5

Two Pointers Fundamentals

→

6

Fast and Slow Pointers

→

Sliding Window

7

Sliding Window Patterns

→

String Processing

8

String Patterns

→

9

String Matching

→

Linked Lists

10

Core Operations

→

11

Advanced Operations

→

Stacks

12

Stack Fundamentals

→

13

Monotonic Stack

→

14

Stack Computation

→

Hash Tables

15

Queue Variants

→

16

Hash Table Patterns

→

17

Hash-Based Design

→

Backtracking

18

Recursion Fundamentals

→

19

Backtracking Patterns

→

20

Puzzles and Word Search

→

Sorting and Searching

21

Sorting Algorithms

→

22

Binary Search Patterns

→

23

Advanced Binary Search

→

Binary Trees

24

Tree Fundamentals

→

25

Tree Operations

→

26

Binary Search Trees

→

Heaps

27

Heap Fundamentals

→

28

Advanced Heap Problems

→

Tries

29

Trie Data Structure

→

Graph Fundamentals

30

Graph Basics

→

31

Graph Analysis

→

Graph Algorithms

32

Shortest Path

→

33

Minimum Spanning Tree

→

34

BFS Applications

→

DP Foundations

35

DP Fundamentals

→

36

Linear DP

→

37

Knapsack Problems

→

DP Patterns

38

Subsequence DP

→

39

String DP

→

40

Grid DP

→

Advanced DP

41

Tree and Bitmask DP

→

42

Interval DP

→

43

Stock Trading DP

→

Greedy Algorithms

44

Greedy Fundamentals

→

45

Interval Problems

→

Bit Manipulation

46

Bit Operations

→

47

Math for Interviews

→

Matrix and Design

48

Matrix Problems

→

49

Design Problems

→

Range Queries

50

Range Query Structures

→