Java - DSA

Foundations

1

Introduction to DSA

→

2

Complexity Analysis

→

3

Problem Solving Skills

→

Array Mastery

4

Array Operations

→

5

In-place Manipulation

→

Two Pointers

6

Two Pointers Fundamentals

→

7

Fast and Slow Pointers

→

Sliding Window

8

Sliding Window Patterns

→

String Processing

9

String Patterns

→

10

String Matching

→

Linked Lists

11

Core Operations

→

12

Advanced Operations

→

Stacks

13

Stack Fundamentals

→

14

Monotonic Stack

→

15

Stack Computation

→

Hash Tables

16

Queue Variants

→

17

Hash Table Patterns

→

18

Hash-Based Design

→

Backtracking

19

Recursion Fundamentals

→

20

Backtracking Patterns

→

21

Puzzles and Word Search

→

Sorting and Searching

22

Sorting Algorithms

→

23

Binary Search Patterns

→

24

Advanced Binary Search

→

Binary Trees

25

Tree Fundamentals

→

26

Tree Operations

→

27

Binary Search Trees

→

Heaps

28

Heap Fundamentals

→

29

Advanced Heap Problems

→

Tries

30

Trie Data Structure

→

Graph Fundamentals

31

Graph Basics

→

32

Graph Analysis

→

Graph Algorithms

33

Shortest Path

→

34

Minimum Spanning Tree

→

35

BFS Applications

→

DP Foundations

36

DP Fundamentals

→

37

Linear DP

→

38

Knapsack Problems

→

DP Patterns

39

Subsequence DP

→

40

String DP

→

41

Grid DP

→

Advanced DP

42

Tree and Bitmask DP

→

43

Interval DP

→

44

Stock Trading DP

→

Greedy Algorithms

45

Greedy Fundamentals

→

46

Interval Problems

→

Bit Manipulation

47

Bit Operations

→

48

Math for Interviews

→

Matrix and Design

49

Matrix Problems

→

50

Design Problems

→

Range Queries

51

Range Query Structures

→