6-Month Campus Placement Preparation Timeline 2026
6-Month Campus Placement Preparation Timeline 2026: Complete Month-by-Month Plan
Introduction
Campus placement season is one of the most defining periods of an engineering student's life. In a span of a few intense weeks, years of learning are compressed into coding rounds, technical interviews, and HR discussions. The students who land offers at Google, Microsoft, Goldman Sachs, or Flipkart don't do it by luck — they do it through structured, consistent preparation that began months before the first company arrived on campus.
This guide provides a complete 6-month campus placement preparation timeline for 2026 — a month-by-month plan that takes you from foundational DSA to mock interviews and offer negotiations. Whether you're starting from scratch or looking to sharpen an existing foundation, this roadmap will tell you exactly what to do each month, each week, and each day. Use this timeline alongside our Data Structures Interview Questions 2026 and HR Interview Questions 2026 guides for comprehensive coverage.
Who This Guide Is For
- Pre-final or final year B.Tech/MCA students preparing for 2026 placements
- Students targeting software engineering roles at top-tier companies (FAANG, startups, PSUs)
- Anyone who feels overwhelmed by placement prep and needs a structured path
Overview: The 6-Month Roadmap
| Month | Focus | Milestone |
|---|---|---|
| Month 1 | DSA Foundation | Arrays, Strings, Sorting, Searching |
| Month 2 | DSA Intermediate | Trees, Graphs, Recursion, Backtracking |
| Month 3 | DSA Advanced + CS Fundamentals | DP, System Design basics, OS/DBMS/CN |
| Month 4 | Projects + Resume + Applications | 2 strong projects, polished resume |
| Month 5 | Mock Interviews + Weak Areas | 30+ mock sessions, targeted fixes |
| Month 6 | Final Prep + Interview Season | Peak performance, calm confidence |
Month 1: DSA Foundation
Goal: Build an unshakeable foundation in basic data structures and algorithms. This is the layer everything else sits on.
What to Cover
| Topic | Resources | Problems to Solve |
|---|---|---|
| Arrays & Strings | LeetCode, GFG | 25 problems |
| Hashing & Hash Maps | NeetCode, YouTube | 15 problems |
| Two Pointers | LeetCode patterns | 15 problems |
| Sliding Window | NeetCode | 10 problems |
| Binary Search | CP-Algorithms | 15 problems |
| Sorting Algorithms | GeeksforGeeks | Implement 5 sorts |
| Linked Lists | Striver's DSA sheet | 15 problems |
| Total Problems | 95–100 |
Recommended Resources — Month 1
- Primary: Striver's A2Z DSA Sheet (free, structured)
- Practice: LeetCode (Easy → Medium progression)
- Videos: Take U Forward (YouTube) — best Indian DSA channel
- Book: Introduction to Algorithms (CLRS) — for conceptual clarity, not to read cover-to-cover
Month 1 Daily Schedule (Weekday)
| Time | Activity |
|---|---|
| 6:00 – 7:00 AM | Solve 1 LeetCode problem (timed, 45 mins) |
| 7:00 – 8:00 AM | Review solution, understand optimal approach |
| 8:00 – 12:00 PM | Classes / College |
| 12:00 – 1:00 PM | Concept reading (30 min) + 1 problem attempt |
| 1:00 – 5:00 PM | Classes / Break |
| 5:00 – 7:00 PM | Focused DSA session: 2–3 problems on today's topic |
| 7:00 – 8:00 PM | Review and note patterns from solutions |
| 8:00 – 9:00 PM | Optional: revision or Codeforces easy problems |
Weekend: 5–6 hours of coding + topic revision
Month 1 Milestone Check
By end of Month 1, you should be able to:
- ✅ Solve any array/string LeetCode Easy without hints
- ✅ Solve 60–70% of array/string Mediums independently
- ✅ Implement binary search in any variant problem
- ✅ Write a linked list reversal and cycle detection from scratch
Month 2: DSA Intermediate
Goal: Conquer the "hard" topics that eliminate most candidates — Trees, Graphs, and Recursion.
What to Cover
| Topic | Key Concepts | Problems to Solve |
|---|---|---|
| Stack & Queue | Monotonic stack, BFS | 15 problems |
| Binary Trees | Traversals, LCA, paths | 20 problems |
| BST | Insert, delete, validate | 10 problems |
| Heaps / Priority Queue | Top K, Dijkstra | 10 problems |
| Recursion | Base cases, tree recursion | 15 problems |
| Backtracking | N-Queens, permutations, sudoku | 12 problems |
| Graphs (BFS/DFS) | Connected components, shortest path | 20 problems |
| Tries | Word search, prefix problems | 8 problems |
| Total Problems | 110 |
Recommended Resources — Month 2
- Graphs: William Fiset's Graph Theory playlist (YouTube)
- Trees + Recursion: Abdul Bari's algorithms playlist
- Practice: LeetCode Tree and Graph sections (Medium difficulty focus)
- Patterns: NeetCode's roadmap (neetcode.io — free organized by topic)
Month 2 Daily Schedule (Weekday)
| Time | Activity |
|---|---|
| 6:00 – 7:30 AM | 1–2 problems on current topic (Trees/Graphs) |
| College hours | Attend classes, maintain academic performance |
| 5:00 – 8:00 PM | Deep-dive on concept (1 hour) + 2–3 problems |
| 8:00 – 9:00 PM | Review failed problems from the week |
Month 2 Milestone Check
By end of Month 2, you should:
- ✅ Code BFS and DFS from memory
- ✅ Solve tree traversal problems in all variants (inorder, preorder, postorder, level-order)
- ✅ Write backtracking solutions for classic problems (N-Queens, subsets, permutations)
- ✅ Explain Graph algorithms: Dijkstra, Floyd-Warshall, Topological Sort
Month 3: DSA Advanced + CS Fundamentals
Goal: Master Dynamic Programming (the most-feared topic in interviews) and build solid CS fundamentals that paper-based rounds test heavily.
DSA: Dynamic Programming
DP is where candidates either shine or stumble. The key is pattern recognition, not memorization.
| DP Pattern | Classic Problems |
|---|---|
| 0/1 Knapsack | Subset sum, partition equal subset |
| Unbounded Knapsack | Coin change, rod cutting |
| Longest Common Subsequence | LCS, edit distance, shortest supersequence |
| Longest Increasing Subsequence | LIS, Russian doll envelopes |
| DP on Grids | Unique paths, minimum path sum, triangle |
| Interval DP | Matrix chain multiplication, burst balloons |
| DP on Strings | Palindrome partitioning, regular expression match |
| DP on Trees | House robber III, diameter |
Target: Solve 50 DP problems in Month 3. Identify the "type" before solving each.
Resource: Aditya Verma's DP playlist on YouTube — widely considered the best DP explanation in Hindi.
CS Fundamentals: Operating Systems
| Topic | Key Concepts |
|---|---|
| Process Management | Process vs Thread, PCB, context switching |
| Scheduling Algorithms | FCFS, SJF, Round Robin, Priority |
| Memory Management | Paging, segmentation, virtual memory |
| Deadlocks | Detection, prevention, avoidance (Banker's algorithm) |
| Synchronization | Mutex, semaphore, condition variables |
Resource: Operating System Concepts (Silberschatz) — chapters 1–8; OR Neso Academy OS playlist (YouTube)
CS Fundamentals: DBMS
| Topic | Key Concepts |
|---|---|
| Normalization | 1NF, 2NF, 3NF, BCNF |
| SQL | Joins, aggregates, subqueries, window functions |
| Indexing | B-trees, clustered vs non-clustered |
| Transactions | ACID properties, isolation levels |
| NoSQL vs SQL | When to use each, CAP theorem |
Resource: DBMS by Navathe — first 10 chapters; OR W3Schools SQL + LeetCode SQL section
CS Fundamentals: Computer Networks
| Topic | Key Concepts |
|---|---|
| OSI vs TCP/IP Model | Layer functions, protocols at each layer |
| Application Layer | HTTP/HTTPS, DNS, SMTP, FTP |
| Transport Layer | TCP vs UDP, 3-way handshake, flow control |
| Network Layer | IP addressing, subnetting, routing algorithms |
| Data Link Layer | MAC, framing, error detection |
Resource: Computer Networks by Tanenbaum (chapters 1–5); OR Gate Smashers CN playlist
Month 3 Daily Schedule
| Time | Activity |
|---|---|
| 6:00 – 7:30 AM | 1–2 DP problems |
| Morning | College |
| 5:00 – 6:30 PM | CS Fundamentals (OS / DBMS / CN — rotate daily) |
| 6:30 – 8:00 PM | 2 DP problems + review |
| 8:00 – 9:00 PM | Company-specific question practice (LeetCode OA archives) |
Month 3 Milestone Check
- ✅ Solve 40+ DP problems independently
- ✅ Explain any OS concept (process scheduling, deadlock) clearly
- ✅ Write SQL queries for medium-complexity joins and aggregations
- ✅ Draw TCP/IP model layers from memory and name protocols at each layer
Month 4: Projects, Resume & Applications
Goal: Build a portfolio that makes your resume stand out, craft a compelling story, and begin targeted applications.
Project Guidelines
Most freshers make the mistake of building tutorial-based projects (to-do lists, clones of popular apps). Interviewers have seen thousands of these. What makes a project memorable:
Characteristics of a Strong Project:
- Solves a real problem — You identified an actual pain point
- At scale — Handles meaningful amounts of data or users (even simulated)
- Has a technical challenge — Uses algorithms, ML, distributed systems, or an interesting API
- Deployed — Live on the internet (not just on your laptop)
- Documented — Has a clear README with architecture, setup, and future plans
Project Ideas by Domain:
| Domain | Project Idea | Tech Stack |
|---|---|---|
| Backend/Systems | Rate Limiter, URL Shortener with analytics | Node.js/Go, Redis, PostgreSQL |
| AI/ML | Resume parser with skill extraction | Python, spaCy, FastAPI |
| Full Stack | Alumni network for your college | React, Node.js, MongoDB |
| Data Engineering | Real-time stock price dashboard | Kafka, Spark, Grafana |
| Open Source | Meaningful contribution to major repo | Varies |
Aim for 2 projects: one that demonstrates depth (complex backend or ML), one that demonstrates breadth (full-stack with deployment).
Resume Building
Your resume should tell a clear, compelling story in one page. Structure:
[Your Name]
[Email] | [Phone] | [LinkedIn] | [GitHub] | [Portfolio]
EDUCATION
B.Tech CS, [College Name], [City]
CGPA: X.XX/10 | Expected Graduation: [Month Year]
EXPERIENCE
[Internship Company] — SWE Intern | [Month Year – Month Year]
• Built [feature] using [tech stack] that [measurable impact]
• Reduced [metric] by X% through [approach]
PROJECTS
[Project Name] | [GitHub Link] | [Live Link]
• [What it does in one line]
• [Tech stack used]
• [Interesting technical detail or scale]
SKILLS
Languages: Python, C++, Java, SQL
Frameworks: React, Node.js, FastAPI, Spring Boot
Tools: Git, Docker, AWS (EC2, S3), PostgreSQL, MongoDB
ACHIEVEMENTS
• Competitive Programming: [Codeforces rating / LeetCode ranking]
• [Hackathon win / open source contribution]
• [Relevant course certification]
Resume Rules:
- One page, maximum
- No spelling or grammar errors (use Grammarly)
- Quantify everything: "Improved performance by 40%" not "improved performance"
- Use action verbs: Built, Designed, Implemented, Optimized, Led
- Tailor your resume for each company category (quant firm vs product company)
Application Strategy
Don't apply to 2 companies. Apply to 12–15.
Categorize Your Targets:
| Tier | Companies | Notes |
|---|---|---|
| Dream (Stretch) | Google, Microsoft, Tower Research, DE Shaw | Low probability but worth applying |
| Target | Uber, Atlassian, Goldman Sachs, Stripe | Match your profile well |
| Safe | Flipkart, Amazon, Zomato, Paytm, Freshworks | Higher probability |
| Backup | Service companies, mid-tier tech | Fallback options |
Start applying immediately when portals open. Early applications have significantly higher visibility.
Month 5: Mock Interviews & Weak Area Targeting
Goal: Convert preparation into performance. Practice simulates pressure. Pressure reveals gaps. Gaps need fixing.
The Mock Interview Plan
Target: 30+ mock sessions in Month 5
| Type | Frequency | Platform |
|---|---|---|
| Peer mock interviews | 3× per week | With batchmates |
| Online mock platform | 2× per week | Pramp, Interviewing.io, LeetCode mock |
| Self-timed coding | Daily | LeetCode timed mode |
| Behavioral mock | 2× per week | Record yourself answering |
Pramp & Interviewing.io: How to Use Them
- Pramp (pramp.com): Free peer interview platform. You interview a peer, they interview you. Structured 45-min sessions with rotation.
- Interviewing.io: Anonymous mock interviews with engineers from Google, Facebook, Amazon (some free, some paid).
- LeetCode Mock: Under "Assessment" tab — simulates real OA conditions
Weak Area Targeting
After each mock session, categorize your performance:
| Area | Strong (✅) | Needs Work (⚠️) | Weak (❌) |
|---|---|---|---|
| Arrays/Strings | |||
| Trees | |||
| DP | |||
| Graphs | |||
| System Design | |||
| OS/DBMS/CN | |||
| Behavioral |
Spend 60% of your remaining prep time on the ❌ categories.
Behavioral Interview Preparation
Prepare 8–10 strong STAR (Situation, Task, Action, Result) stories:
Themes to Cover:
- A time you led a project/team
- A time you failed and what you learned
- A time you disagreed with someone and resolved it
- A time you had to learn something new quickly
- A time you went beyond your defined role
- A time you solved a problem with limited resources
- Your biggest achievement in college
- Why this specific company?
Write these out, then practice saying them in 2–3 minutes — not reading from a script, but from memory.
Month 5 Daily Schedule
| Time | Activity |
|---|---|
| 6:00 – 7:00 AM | Timed LeetCode problem (simulate OA conditions) |
| Morning | College |
| 4:00 – 5:00 PM | Behavioral prep (review/practice STAR stories) |
| 5:00 – 7:00 PM | Mock interview (peer or platform) |
| 7:00 – 8:30 PM | Post-mock review — analyze what went wrong |
| 8:30 – 9:30 PM | Weak area targeted practice |
Month 5 Milestone Check
- ✅ Completed 25+ mock coding sessions
- ✅ All 8 STAR stories memorized and smooth
- ✅ Solved 5+ problems in each major DSA category
- ✅ Can explain time and space complexity for every problem you've solved
Month 6: Final Preparation & Interview Season
Goal: Peak performance. Sustain your sharpness, manage stress, and execute in the actual interviews.
The Final Month Mindset
Month 6 is not for learning new topics. It is for:
- Revision — Revisit weak areas, not new content
- Consistency — Maintain 2–3 problems per day, not cramming
- Rest — Sleep 7–8 hours. Cognitive performance degrades significantly with poor sleep
- Simulation — Keep doing mocks to stay sharp
Week-by-Week Plan (Month 6)
Week 1: Full Revision
- Redo your hardest problems from months 1–5
- Complete a 2-hour timed mock (simulate OA)
- Finalize resume and get 2 people to review it
Week 2: Company-Specific Prep
- Research each target company's interview format (GFG's company-specific sections)
- Practice company-tagged problems on LeetCode
- Research the company: products, recent news, culture — for behavioral rounds
Week 3: Interview Week Simulation
- Schedule 3 mock interviews as if they're real (professional setting, no interruptions)
- Do a full system design mock for each target company
- Sleep and routine stabilization
Week 4: Active Interview Season
- Stop learning anything new
- Maintain calm with 1–2 easy/medium problems daily
- Rest the night before each interview
- Post-interview: Write down what was asked for future reference
Before Every Interview: Checklist
Day Before:
- Solve 1–2 easy problems to stay warm (not to cram)
- Review your behavioral stories once
- Prepare your setup: stable internet, quiet room, working camera + mic (for virtual)
- Sleep at least 7 hours
Day Of:
- Eat a proper meal 1 hour before
- No heavy learning or cramming
- Log in 5 minutes early
- Have water and a notepad on your desk
During the Interview:
- Repeat/clarify the problem before solving
- Think out loud — interviewers grade your thinking process, not just the solution
- Start with a brute force approach, then optimize
- If stuck, ask for a hint — don't sit silent for 5 minutes
Resource Masterlist
DSA
| Resource | Type | Cost |
|---|---|---|
| LeetCode | Practice Platform | Free + Premium |
| Striver's A2Z Sheet | Structured Roadmap | Free |
| NeetCode 150 | Curated Problem Set | Free |
| Take U Forward (YouTube) | Video Explanations | Free |
| Abdul Bari (YouTube) | Algorithm Theory | Free |
| Codeforces | Competitive Programming | Free |
System Design
| Resource | Type | Cost |
|---|---|---|
| System Design Primer (GitHub) | Comprehensive Guide | Free |
| Grokking the System Design Interview | Structured Course | Paid |
| Designing Data-Intensive Applications | Book | Paid |
| YouTube: Gaurav Sen | Video Explanations | Free |
CS Fundamentals
| Resource | Type | Cost |
|---|---|---|
| Neso Academy (YouTube) | OS, DBMS, CN | Free |
| Gate Smashers (YouTube) | OS, DBMS, CN | Free |
| W3Schools SQL | SQL Practice | Free |
| LeetCode SQL Section | SQL Problems | Free |
Mock Interviews
| Resource | Type | Cost |
|---|---|---|
| Pramp | Peer Mocks | Free |
| Interviewing.io | Professional Mocks | Freemium |
| LeetCode Mock Assessments | Timed OA Practice | Free |
| interviewbit.com | Structured Practice | Free |
Resume
| Resource | Type | Cost |
|---|---|---|
| Overleaf (LaTeX Resume) | Resume Builder | Free |
| Jake's Resume Template | LaTeX Template | Free |
| Grammarly | Grammar Check | Free |
| Profile + Apply | Free |
Common Mistakes to Avoid
1. Starting Too Late
The students who get Day 1 offers at top companies start preparing in their 5th or 6th semester, not the month before placements. The earlier you start, the better.
2. Only Practicing Easy Problems
Easy problems keep you comfortable. Medium and Hard problems make you hireable. Aim for 60% Medium, 20% Hard in your practice ratio.
3. Ignoring CS Fundamentals
OS, DBMS, and CN are tested in OAs and technical rounds. Students who skip these lose marks in rounds that would otherwise be easy wins.
4. Not Building Real Projects
A GitHub full of todo-list clones signals to interviewers that you follow tutorials but don't solve problems. Build original work.
5. Skipping Mock Interviews
Reading solutions and doing mocks are fundamentally different. Mocks expose your communication gaps, time pressure failures, and gaps in understanding. Do 30+ before placements.
6. Neglecting CGPA
Many top companies have a CGPA cutoff (7.0 to 8.5). A weak CGPA can prevent your resume from even being reviewed. Balance placement prep with academic performance.
7. Not Applying Broadly
Apply to 12–15 companies. Interview season is short. Your "dream company" may not visit, or you may have an off day. Having multiple pipelines protects you.
The 6-Month Progress Tracker
Print this and track your progress weekly:
| Week | DSA Problems Solved | Mocks Done | CS Topics Revised | Projects Updated |
|---|---|---|---|---|
| Week 1 | ||||
| Week 2 | ||||
| Week 3 | ||||
| Week 4 | ||||
| ... (24 weeks) |
Target numbers by end of 6 months:
- DSA Problems Solved: 400+
- Mock Interviews Completed: 30+
- CS Fundamental Topics Revised: All (OS, DBMS, CN)
- Projects Built: 2 (deployed)
- Companies Applied To: 10–15
Conclusion
Six months is enough time to go from struggling with basic arrays to landing offers at top companies — but only if you're consistent and structured. The students who get great placements don't work harder than everyone else every day. They work smarter, measure progress, do mocks, and show up even on bad days.
The roadmap is in front of you. The resources are free. The only variable is your consistency.
Start Month 1 today. Future-you will thank present-you.
Related Articles
- Top 50 Aptitude Questions — Month 1 foundation: aptitude is tested in every company
- Data Structures Interview Questions 2026 — The DSA guide to power Months 2-4 of your prep
- HR Interview Questions 2026 — Month 5-6: ace every HR round with these questions
- How to Negotiate Salary as a Fresher 2026 — The final step: turn your offer into your best offer
Tags: campus placement preparation 2026, placement preparation timeline India, 6 month placement study plan, DSA preparation schedule, how to prepare for campus placements, placement preparation resources, mock interview preparation India 2026
Explore this topic cluster
More resources in career-guides
Use the category hub to browse similar questions, exam patterns, salary guides, and preparation resources related to this topic.