Details DSA Roadmap

Pick a Language

  • πŸ’  C++
  • β˜• Java
  • 🐍 Python
  • 🟨 JavaScript
  • πŸ”· C
  • 🟦 C#
  • 🟠 Go
  • πŸ”΄ Rust

Programming Fundamentals

  • πŸ’» Language
  • πŸ” Control Structures
  • 🧩 Pseudo Code
  • 🧠 Functions
  • 🧱 OOPS Basics

Basic Data Structures

  • πŸ“¦ Array
  • πŸ”— Linked Lists
  • 🚢 Queues
  • πŸ“š Stacks
  • πŸ—‚οΈ Hash Tables

Algorithmic Complexity

  • πŸ“¦ Time vs Space Complexity
  • πŸ”— How to Calculate Complexity?

Algorithmic Complexity

  • 🚢Big-O Notation
  • πŸ“š Big-Theta (Θ) Notation
  • πŸ—‚οΈ Big-Omega (Ξ©) Notation

Common Runtime Complexities

  • ⚑ Constant
  • πŸ“‰ Logarithmic
  • πŸ“ˆ Linear
  • πŸ“ Polynomial
  • πŸš€ Exponential
  • πŸ’₯ Factorial

Sorting Algorithms

    • 🫧 Bubble Sort
    • 🧩 Insertion Sort
    • 🎯 Selection Sort
    • πŸ”€ Merge Sort
    • ⚑ Quick Sort
    • ⛰️ Heap Sort

Searching Algorithms

  • πŸ” Linear Search
  • πŸ“ Binary Search

Tree Data Structure

  • 🌳 Binary Trees
  • πŸ”Ž Binary Search Trees (BST)
  • βš–οΈ AVL Trees
  • πŸ—ƒοΈ B-Trees

Search Algorithms

  • 🌊 Breadth First Search (BFS)
  • 🌲 Depth First Search (DFS)
  • ↙️ In-Order Traversal
  • ⬇️ Pre-Order Traversal
  • ⬆️ Post-Order Traversal

Tree Traversal

  • ↙️ In-Order Traversal
  • ⬇️ Pre-Order Traversal
  • ⬆️ Post-Order Traversal

Graph Data Structure

    • 🌊 Breadth First Search (BFS)
    • 🌲 Depth First Search (DFS)

Search Algorithms

  • 🌊 Breadth First Search (BFS)
  • 🌲 Depth First Search (DFS)
  • ↙️ In-Order Traversal
  • ⬇️ Pre-Order Traversal
  • ⬆️ Post-Order Traversal

Tree Traversal

  • ↙️ In-Order Traversal
  • ⬇️ Pre-Order Traversal
  • ⬆️ Post-Order Traversal

Graph Data Structure

  • 🫧 Bubble Sort
  • 🧩 Insertion Sort
  • 🎯 Selection Sort
  • πŸ”€ Merge Sort
  • ⚑ Quick Sort
  • ⛰️ Heap Sort

Search Algorithms

  • πŸ” Linear Search
  • πŸ“ Binary Search

Tree Data Structure

  • 🌳 Binary Tree
  • πŸ”Ž Binary Search Tree
  • βš–οΈ AVL Tree
  • πŸ—‚οΈ B-Tree
  • 🌲 Red-Black Tree

Search Algorithms

  • 🌊 Breadth First Search
  • 🌲 Depth First Search

Tree Traversal

  • ↙️ In-Order Traversal
  • ⬇️ Pre-Order Traversal
  • ⬆️ Post-Order Traversal

Complex Data Structure

  • πŸ—‚οΈ B Trees
  • πŸ—ƒοΈ B+ Trees
  • ⛓️ Skip List
  • πŸ“‘ ISAM
  • 🌲 2–3 Trees

Indexing

  • πŸ“ Linear Indexing
  • 🌳 Tree-Based Indexing

Problem Sloving Techniques

  • 🏝️ Island traversal
  • 🧡 Multi-threaded
  • βš–οΈ Two Heaps
  • πŸ”€ Merge Intervals
  • πŸ”„ Cyclic Sort
  • 🐒 Fast and Slow Pointers
  • 🧱 Brute Force
  • πŸ”™ Backtracking
  • 🎯 Greedy Algorithms
  • 🎲 Randomised Algorithms
  • πŸͺœ Divide and Conquer
  • πŸ† Kth Element
  • πŸ” Recursion
  • 🧠 Dynamic Programming
  • πŸ‘‰ Two Pointer Technique
  • πŸͺŸ Sliding Window Technique