DSA Mastery
  • Home
  • Topics
    • Introduction to DSA
    • Time & Space Complexity
    • Arrays
    • Strings
    • Recursion
    • Linked List
    • Stack
    • Queue
    • Hashing
    • Trees
    • Binary Search Tree
    • Heap
    • Trie
    • Graph
    • Greedy Algorithms
    • Dynamic Programming
    • Backtracking
    • Advanced Algorithms
  • Problems
    • Dynamic Programming
    • Fibonacci DP
    • 0/1 Knapsack
    • Fractional Knapsack
    • Coin Change
    • Subset Sum
    • View All DP →

    • Graph Algorithms
    • BFS (Breadth First Search)
    • DFS (Depth First Search)
    • Dijkstra's Algorithm
    • Bellman Ford Algorithm
    • View All →
  • Quiz
  • 0%
📚 Learning Path
🏛️ Foundation
Introduction to DSA Time & Space Complexity
📏 Linear Data Structures
Arrays Strings
⚙️ Core Concepts
Recursion
📏 Linear Data Structures
Linked List Stack Queue
⚙️ Core Concepts
Hashing
🌳 Non-Linear Data Structures
Trees Binary Search Tree Heap
🚀 Advanced Topics
Trie Graph Greedy Algorithms Dynamic Programming Backtracking Advanced Algorithms
⚡ Quick Links
DP Problems Graph Algorithms Classical Problems Practice Quiz

🏆 Classical DSA Problems

Timeless DSA problems that appear in every coding interview. Each with detailed explanations, multiple approaches, PHP implementations, and complexity analysis.

📝 Tower of Hanoi
Medium

Recursive puzzle: move disks between pegs.

📝 N Queens
Hard

Backtracking: place N queens on chessboard.

📝 Sudoku Solver
Hard

Backtracking: fill 9×9 Sudoku grid.

📝 Rat in a Maze
Medium

Backtracking: find path through maze.

📝 Traveling Salesman Problem
Hard

NP-Hard: shortest route visiting all cities.

📝 Job Scheduling
Medium

Greedy: schedule jobs for maximum profit.

📝 Activity Selection
Easy

Greedy: select maximum non-overlapping activities.

📝 Huffman Coding
Medium

Greedy: optimal prefix codes for compression.

📝 Number of Islands
Medium

Graph/DFS: count islands in 2D grid.

📝 Kth Largest Element
Easy

Heap/QuickSelect: find Kth largest element.

📝 Trapping Rain Water
Medium

Array/Two-pointer: trapped water between bars.

📝 Merge Intervals
Easy

Array: merge overlapping intervals.

📝 Two Sum
Easy

Hash Map: find pair summing to target.

📝 Three Sum
Medium

Two Pointer: find triplets summing to zero.

📝 Maximum Subarray
Easy

Kadane: max sum contiguous subarray.

DSA Mastery

Master Data Structures & Algorithms with comprehensive lessons, PHP implementations, and interview-focused practice problems.

Quick Navigation
  • Home
  • Getting Started
  • Arrays
  • Linked List
  • Trees
  • Graph
  • DP
  • DP Problems
  • Graph Algos
  • Quiz
Learning Stats
Overall Progress 0%
0 of 18 topics 18 remaining

© 2026 DSA Mastery. Built for DSA learners. All implementations in PHP 8+.

Home Topics Quiz Search Top