Java - DSA

Foundations

Introduction to DSA

→

Complexity Analysis

→

Problem Solving Skills

→

Array Mastery

Array Operations

→

In-place Manipulation

→

Two Pointers

Two Pointers Fundamentals

→

Fast and Slow Pointers

→

Sliding Window

Sliding Window Patterns

→

String Processing

String Patterns

→

String Matching

→

Linked Lists

Core Operations

→

Advanced Operations

→

Stacks

Stack Fundamentals

→

Monotonic Stack

→

Stack Computation

→

Hash Tables

Queue Variants

→

Hash Table Patterns

→

Hash-Based Design

→

Backtracking

Recursion Fundamentals

→

Backtracking Patterns

→

Puzzles and Word Search

→

Sorting and Searching

Sorting Algorithms

→

Binary Search Patterns

→

Advanced Binary Search

→

Binary Trees

Tree Fundamentals

→

Tree Operations

→

Binary Search Trees

→

Heaps

Heap Fundamentals

→

Advanced Heap Problems

→

Tries

Trie Data Structure

→

Graph Fundamentals

Graph Basics

→

Graph Analysis

→

Graph Algorithms

Shortest Path

→

Minimum Spanning Tree

→

BFS Applications

→

DP Foundations

DP Fundamentals

→

Linear DP

→

Knapsack Problems

→

DP Patterns

Subsequence DP

→

String DP

→

Grid DP

→

Advanced DP

Tree and Bitmask DP

→

Interval DP

→

Stock Trading DP

→

Greedy Algorithms

Greedy Fundamentals

→

Interval Problems

→

Bit Manipulation

Bit Operations

→

Math for Interviews

→

Matrix and Design

Matrix Problems

→

Design Problems

→

Range Queries

Range Query Structures

→