Placement Preparation Roadmap
Complete guide to crack campus placements — DSA, CS fundamentals, aptitude, system design, and interview skills.
Prerequisites
- Basic computer skills
- A text editor installed
- Browser (Chrome recommended)
Recommended Tools
Your Progress
0 of 15 topics completed
Programming Fundamentals
1.Language Mastery (C++/Java/Python)
Deep understanding of your primary coding language.
What you'll learn
- Syntax, data types, operators
- Control flow and loops
- Functions and recursion
- OOP (classes, inheritance, polymorphism, abstraction)
- STL/Collections framework
- Input/output handling
- Memory management basics
Resources
Library Management System
Build a console-based library system with OOP concepts — classes for Book, Member, Transaction with file I/O for persistence.
2.Time & Space Complexity
Analyze algorithm efficiency like an expert.
What you'll learn
- Big O, Big Theta, Big Omega notation
- Analyzing loops (single, nested, logarithmic)
- Space complexity (auxiliary vs total)
- Best, worst, average case analysis
- Amortized analysis (basics)
- Comparing algorithm complexities
Resources
Complexity Analyzer
Implement 10 common algorithms, measure their actual runtime for increasing input sizes, and plot the growth curves.
Complexity Analyzer
Implement 10 common algorithms, measure their actual runtime for increasing input sizes, and plot the growth curves.
Build this before moving to the next stage
Data Structures
3.Arrays & Strings
Foundation patterns for linear data.
What you'll learn
- Two-pointer technique
- Sliding window problems
- Prefix sum and difference arrays
- Matrix traversal patterns
- String manipulation and pattern matching
- Kadane's algorithm (max subarray)
- Dutch National Flag (3-way partition)
Solve 50 Array Problems
Solve 50 array/string problems on LeetCode (20 easy, 20 medium, 10 hard). Track patterns and time yourself.
4.Linked Lists, Stacks & Queues
Linear data structures with pointer manipulation.
What you'll learn
- Singly and doubly linked lists
- Fast and slow pointer technique
- Stack operations and applications
- Queue and circular queue
- Monotonic stack/queue patterns
- LRU Cache implementation
- Expression evaluation
Browser History (Doubly LL)
Implement a browser history system using doubly linked list — back, forward, new page visit, with stack-based undo.
5.Trees & Graphs
Hierarchical and network data structures.
What you'll learn
- Binary tree traversals (inorder, preorder, postorder, level-order)
- BST operations (insert, delete, search)
- Tree problems (height, diameter, LCA, views)
- Graph representations (adjacency list/matrix)
- BFS and DFS traversals
- Shortest path (Dijkstra, BFS unweighted)
- Topological sort and cycle detection
Social Network Analyzer
Model a social network as a graph. Implement friend suggestions (BFS), mutual friends, shortest connection path, and community detection.
6.Hashing & Heaps
Fast lookups and priority-based processing.
What you'll learn
- Hash maps and hash sets
- Collision handling (chaining, open addressing)
- Frequency counting patterns
- Min-heap and max-heap
- Priority queue applications
- Top-K problems
- Heap sort
Real-time Leaderboard
Build a leaderboard system using heaps — add scores, get top-K players, update scores, and remove players efficiently.
Real-time Leaderboard
Build a leaderboard system using heaps — add scores, get top-K players, update scores, and remove players efficiently.
Build this before moving to the next stage
Algorithms
7.Sorting & Searching
Fundamental algorithms and binary search mastery.
What you'll learn
- Merge sort and quick sort (implementations)
- Binary search on sorted arrays
- Binary search on answer space
- Search in rotated sorted array
- Finding peak elements
- Median of two sorted arrays
Resources
Custom Sort Visualizer
Build a visual sorting tool that animates merge sort, quick sort, and heap sort step-by-step with speed controls.
8.Dynamic Programming
The most feared interview topic — demystified.
What you'll learn
- Memoization (top-down) vs tabulation (bottom-up)
- 1D DP (climbing stairs, house robber, coin change)
- 2D DP (grid paths, LCS, edit distance)
- Subsequence problems (LIS, knapsack variants)
- Partition DP (MCM, palindrome partitioning)
- DP on strings
- State optimization techniques
Resources
Solve 40 DP Problems
Solve 40 DP problems following Striver's sheet. For each, write the recursive, memoized, and tabulated solutions.
9.Greedy & Backtracking
Optimization and exhaustive search strategies.
What you'll learn
- Greedy algorithm design (activity selection, fractional knapsack)
- Interval scheduling and merging
- Huffman coding
- Backtracking framework
- N-Queens, Sudoku solver
- Subset/permutation generation
- Word search and path finding
Resources
Sudoku Solver with Visualization
Build a sudoku solver using backtracking with step-by-step visual animation showing the algorithm's decision process.
Sudoku Solver with Visualization
Build a sudoku solver using backtracking with step-by-step visual animation showing the algorithm's decision process.
Build this before moving to the next stage
CS Fundamentals
10.Operating Systems
Process, memory, and storage management.
What you'll learn
- Process vs thread, context switching
- CPU scheduling algorithms (FCFS, SJF, RR, Priority)
- Synchronization (mutex, semaphore, deadlock)
- Memory management (paging, segmentation, virtual memory)
- Page replacement algorithms (LRU, FIFO, Optimal)
- File systems and disk scheduling
OS Concepts Simulator
Simulate CPU scheduling (compare algorithms), page replacement (visualize hits/misses), and deadlock detection.
11.Database Management
SQL, normalization, and database design.
What you'll learn
- ER diagrams and relational model
- SQL queries (joins, subqueries, aggregation)
- Normalization (1NF to BCNF)
- Indexing and B+ trees
- Transactions (ACID properties)
- Concurrency control and isolation levels
Design a Database Schema
Design a normalized schema for an e-commerce platform (users, products, orders, reviews) and write 20 complex SQL queries.
12.Computer Networks
How the internet works under the hood.
What you'll learn
- OSI and TCP/IP model layers
- TCP vs UDP, 3-way handshake
- HTTP/HTTPS, DNS resolution
- IP addressing and subnetting
- Routing algorithms
- Network security basics (SSL/TLS, firewalls)
Resources
Network Protocol Analyzer
Document the lifecycle of a web request (DNS → TCP → TLS → HTTP → Response) with diagrams and implement a simple HTTP server.
Network Protocol Analyzer
Document the lifecycle of a web request (DNS → TCP → TLS → HTTP → Response) with diagrams and implement a simple HTTP server.
Build this before moving to the next stage
Interview & Soft Skills
13.System Design (Basics)
High-level design thinking for freshers.
What you'll learn
- Scalability concepts (horizontal vs vertical)
- Load balancing and caching
- Database sharding and replication
- Message queues and async processing
- Design URL shortener, chat app (basic level)
- API design best practices
Resources
Design 5 Systems
Write high-level design docs for: URL Shortener, Chat App, Twitter Feed, File Storage, and Notification System.
14.Aptitude & Reasoning
Clear online assessment rounds.
What you'll learn
- Quantitative aptitude (percentages, ratios, probability)
- Logical reasoning (puzzles, seating arrangements)
- Verbal ability (reading comprehension, grammar)
- Data interpretation (charts, tables)
- Pattern recognition
- Time management for MCQ tests
Resources
Daily Practice Routine
Solve 20 aptitude questions daily for 2 weeks. Track accuracy per topic and focus on weak areas.
15.Interview Skills
HR rounds, behavioral questions, and presentation.
What you'll learn
- STAR method for behavioral answers
- Self-introduction (30s, 1min, 2min versions)
- Common HR questions and answers
- Explaining projects clearly
- Salary negotiation basics
- Body language and communication
- Mock interview practice
Resources
10 Mock Interviews
Do 10 mock interviews with peers or on Pramp. Record yourself, review, and improve each time.