Scribd
Upload
38 views5 pages

Java Mar Apr

The document outlines a four-week Java placement preparation schedule, covering foundational to advanced data structures and algorithms (DSA) topics. Each week includes specific topics, such as graph traversal, recursion, dynamic programming, and mock tests for assessment. A progress tracker is also provided to monitor the completion status of each topic.

Uploaded by

Stephy Bless
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
38 views5 pages

Java Mar Apr

The document outlines a four-week Java placement preparation schedule, covering foundational to advanced data structures and algorithms (DSA) topics. Each week includes specific topics, such as graph traversal, recursion, dynamic programming, and mock tests for assessment. A progress tracker is also provided to monitor the completion status of each topic.

Uploaded by

Stephy Bless
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Week Day Topic

Week 1 (Foundations & Basic DSA) 1 BFS & DFS (Graph Traversal)
2 BFS & DFS (Graph Traversal)
3 Recursion & Backtracking
4 Recursion & Backtracking
5 Sliding Window (Substring problems)
6 Two Pointers Technique
7 Prefix Sum
8 Fast & Slow Pointers
9 Linked List In-Place Reversal
Week 2 (Intermediate Topics) 10 Monotonic Stack
11 Binary Tree BFS & DFS
12 Binary Tree Traversals
13 Topological Sort
14 Modified Binary Search
15 Top-K Elements
16 Overlapping Intervals
Dynamic Programming Basics
Week 3 (Advanced DSA) 17
(Fibonacci, 0/1 Knapsack)
18 Longest Common Subsequence
19 Longest Increasing Subsequence
20 Subset Sum
21 Matrix Chain Multiplication
22 Matrix Traversal
Week 4 (Problem-Solving &
23 Sliding Window (Optimization)
Optimization)
24 Binary Search (Advanced)
Backtracking (Revisit with Complex
25 Problems)
26 Mock Test (Mixed Problems)
27 Revision of Weak Areas
28 Full-Length Mock Interviews
✅ Java Placement Prep Progress Tracker

Topic Status (✅/❌)

Graph Traversal (BFS & DFS) ⬜

Recursion & Backtracking ⬜

Sliding Window (Substring Problems) ⬜

Two Pointers Technique ⬜

Prefix Sum ⬜

Fast & Slow Pointers ⬜

Linked List In-Place Reversal ⬜

Monotonic Stack ⬜

Binary Tree BFS & DFS ⬜

Binary Tree Traversals ⬜

Topological Sort ⬜

Modified Binary Search ⬜

Top-K Elements ⬜
Overlapping Intervals ⬜

Dynamic Programming Basics (Fibonacci, 0/1


⬜
Knapsack)

Longest Common Subsequence ⬜

Longest Increasing Subsequence ⬜

Subset Sum ⬜

Matrix Chain Multiplication ⬜

Matrix Traversal ⬜

Sliding Window (Optimization) ⬜

Binary Search (Advanced) ⬜

Backtracking (Complex Problems) ⬜

Mock Test 1 (Mixed Problems) ⬜


Revision of Weak Areas ⬜

Mock Test 2 (Final Assessment) ⬜


Notes/Weak Areas

You might also like