Sarthak SrivastavaAI Engineer

Start a Project

Loading...

LearnData Structures & Algorithms

🧮

Core CSBeginner to Expert

Data Structures & Algorithms

DSA is the core of every software engineering interview at every company worldwide. This track covers every data structure and algorithm pattern you will ever face — from first principles to advanced competitive programming. Includes company-specific patterns from Google, Amazon, Microsoft, Adobe, Uber, and Indian MNCs.

220+ Topics

16–24 weeks

8–50 LPA

Start Learning →View Roadmap

Foundations

Introduction to DSA

What is DSA, why it matters, how to study it, time and space complexity

Time & Space Complexity

Big O, Big Omega, Big Theta, worst/best/average case, complexity hierarchy

Recursion Fundamentals

Base case, recursive case, call stack, recursion tree, tail recursion

Recursion Patterns

Linear, tree, DAG recursion; memoization, top-down vs bottom-up

Bitwise Operations for DSA

AND, OR, XOR tricks; bit manipulation for sets, flags, and optimization

Arrays

Arrays Fundamentals

Declaration, access, traversal, memory layout, cache locality

Two Pointer Technique

Opposite ends, same direction pointers, pair sum, palindrome check

Fixed vs variable window, maximum subarray, longest substring

Prefix Sum & Difference Array

Range sum queries, range update, 2D prefix sum

Kadane's Algorithm

Maximum subarray sum, variants, circular array

Bubble, selection, insertion, merge, quick, counting, radix, heap sort

Classic binary search, search in rotated array, on answer, templates

Matrix Problems

Spiral traversal, rotate 90°, search in sorted matrix, diagonal

Strings

String Fundamentals

Immutability, character arrays, ASCII, Unicode, string in memory

Pattern Matching

Naive search, KMP algorithm, Rabin-Karp, Z-algorithm

Anagram & Frequency Problems

Frequency maps, sorting approach, sliding window anagram

Palindrome Problems

Checking, longest palindromic substring, Manacher's algorithm

String DP Problems

LCS, edit distance, longest palindromic subsequence

Linked Lists

Linked List Basics

Singly, doubly, circular linked lists, node structure, operations

Linked List Operations

Insert, delete, search, reverse, complexity comparison with arrays

Fast & Slow Pointers

Cycle detection (Floyd's), middle of list, nth from end

Reversal Patterns

Reverse full list, reverse in groups, reverse between positions

Merge two sorted lists, merge K sorted lists, sort linked list

Stacks & Queues

Stack Fundamentals

LIFO, push/pop/peek, array & linked list implementation, call stack

Monotonic Stack

Next greater element, largest rectangle in histogram, daily temperatures

Stack Applications

Valid parentheses, expression evaluation, decode string, min stack

Queue Fundamentals

FIFO, enqueue/dequeue, circular queue, deque (double-ended queue)

Priority Queue & Heap

Min-heap, max-heap, heapify, heap operations, heapsort

Sliding Window Maximum

Deque-based O(n) solution, monotonic deque pattern

Hashing

Hash function, collisions, chaining, open addressing, load factor

Hashing Problem Patterns

Two sum, group anagrams, LRU cache, first unique character

HashSet Patterns

Contains duplicate, longest consecutive sequence, intersection

Trees

Tree Fundamentals

Terminology, binary tree, height, depth, balanced, complete, full, perfect

Tree Traversals

Inorder, preorder, postorder (recursive & iterative), level-order BFS

Binary Search Trees

BST property, insert, delete, search, inorder gives sorted, successor/predecessor

Tree Properties

Height, diameter, LCA, check balanced, symmetric, mirror

Tree Path Problems

Root to leaf paths, path sum, max path sum, all paths

Balance factor, rotations (LL, RR, LR, RL), insertion, deletion

Build, range query, point update, lazy propagation

Trie (Prefix Tree)

Insert, search, startsWith, autocomplete, word search in board

Heap Advanced Patterns

Top K frequent, K closest points, merge K sorted, median of stream

Graphs

Graph Fundamentals

Directed/undirected, weighted/unweighted, adjacency matrix vs list

BFS (Breadth-First Search)

Queue-based BFS, level-order, shortest path in unweighted graph

DFS (Depth-First Search)

Recursive/iterative DFS, connected components, islands

Topological Sort

Kahn's algorithm (BFS), DFS-based, course schedule, build order

Shortest Path Algorithms

Dijkstra, Bellman-Ford, Floyd-Warshall, SPFA comparison

Union-Find (Disjoint Set)

Find, union, path compression, union by rank, cycle detection

Minimum Spanning Tree

Kruskal's algorithm, Prim's algorithm, applications

Advanced Graph Problems

Bipartite check, bridges, articulation points, SCC (Kosaraju, Tarjan)

Dynamic Programming

DP Introduction

Overlapping subproblems, optimal substructure, memoization vs tabulation

Fibonacci, climbing stairs, house robber, jump game

Grid DP, unique paths, minimum path sum, dungeon game

LCS, LIS, edit distance, longest palindromic subsequence, regex matching

Knapsack Problems

0/1 knapsack, unbounded knapsack, subset sum, partition equal subset

Diameter, maximum path sum, house robber on trees

Travelling salesman, assignment problem, subsets enumeration

Matrix chain multiplication, burst balloons, palindrome partitioning

Greedy Algorithms

Greedy Fundamentals

Greedy choice property, optimal substructure, when greedy works

Interval Scheduling

Activity selection, interval merging, non-overlapping intervals

Greedy Patterns

Jump game, gas station, candy distribution, task scheduler

Backtracking

Backtracking Fundamentals

Decision tree, pruning, state space exploration

Subsets & Combinations

Subsets, combinations, combination sum, letter combinations

All permutations, unique permutations, next permutation

N-Queens, Sudoku solver, word search, rat in a maze

Advanced Topics

Divide & Conquer

Merge sort, quick sort, count inversions, closest pair of points

Math & Number Theory

GCD/LCM, Sieve of Eratosthenes, prime factorization, modular arithmetic

Advanced Bit Manipulation

Power of 2, count set bits, XOR tricks, bit DP

Advanced Sliding Window

Minimum window substring, maximum of all subarrays, fruit into baskets

Interview Preparation

Problem Solving Framework

UMPIRE method, how to approach unknown problems, clarifying questions

Pattern Recognition Guide

14 must-know patterns: two pointers, sliding window, fast-slow, merge intervals, cyclic sort, in-place reversal, tree BFS/DFS, two heaps, subsets, modified binary search, top K, K-way merge, 0/1 knapsack, topological sort

Google Interview Patterns

BFS/DFS graphs, DP, system design, coding round style

Amazon Interview Patterns

Trees, arrays, OOP design, leadership principles integration

Complete complexity reference, patterns quick-guide, template code

400+ multiple choice questions for placement aptitude

Companies Using Data Structures & Algorithms

GoogleAmazonMicrosoftMetaAdobeOracleUberFlipkartTCSInfosys