अभ्यास • Week 15

Weekly MUST Budget Standard

27.0h / 27.0h cap

Hour Calibration

actual hours logged

Rule: slippage > 1.25x triggers Scope-Cut Rung 2

Week Execution 0%

0/ 19 tasks 0.0h

target

Week Objective & Target Output

Target Output

January 11 – January 17, 2027 — Focus: DSA Comprehensive Recall Sprint; Graphs Foundations & Traversals; Graph Connected Components & Cycles; DP 1D Foundations; OS Complete Revision & Interview Drill.

Weeks: W11 W12 W13 W14 W15 Active

MUST — Critical Path

12 Tasks • ~27.0h

Non-negotiable core curriculum

DSA (Java) 6 tasks

DSA DSA Comprehensive Recall Sprint 5 problems

5 random medium problems across Arrays, Hashing, Binary Search, Linked Lists, Trees and Graphs without hints, followed by the Phase 3 ledger checkpoint. Ledger checkpoint: ≥ 170 unique problems logged in the Journal (cumulative; tracked metric, Architecture §3).

3.0h

DSA Graphs Foundations & Traversals 3 problems

Graph representation (Adjacency Matrix vs Adjacency List in Java), Breadth First Search (BFS), Depth First Search (DFS). TUF+ A2Z Step 15.1

3.5h

DSA Graph Connected Components & Cycles 6 problems

Number of Provinces, Connected Components, Detect Cycle in Undirected Graph (BFS & DFS), Number of Islands, Flood Fill, 0/1 Matrix. TUF+ A2Z Step 15.2

3.5h

DSA DSA Transfer: No-Hint Timed Graph Set (Components & Islands) 2 problems LC #

Sit 2 unseen Graph problems you have never attempted (pick from the LeetCode topic tag, NeetCode “similar questions” or a company list; never a problem named in any learning task), at least 72 h after the learning task — move the set to the first half of next week if needed. Format: 25 min per problem (35 min for a Hard), including 5 min for edge cases and a dry run; no hints, no AI. Pass bar: ≥ 1/2 solved inside the time box; on a miss, log the miss reason in the Journal and re-sit a fresh pair within 7 days.

1.5h

DSA DP 1D Foundations 4 problems

Introduction to DP (overlapping subproblems, optimal substructure, memoization vs tabulation vs space optimization), Climbing Stairs, Frog Jump, Frog Jump with K Distances, Maximum Sum of Non-Adjacent Elements (House Robber I & II). TUF+ A2Z Step 16.1-16.2

3.5h

DSA DSA Daily Quota (Week 15) 4 problems

Solve 4 new problems from NeetCode 150 — Trees (Pass 2); time-box each at 25 min before any hint (2.5h includes editorial on misses), then log pattern and miss reason in the Journal. Never repeat a problem already in the ledger.

2.5h

Competitive Programming 1 tasks

CP Contest & Upsolving (Week 15) LC #

LeetCode Weekly Contest (+ Codeforces Div.2/3 when it fits) and mandatory upsolving within 48 h.

2.5h

Core CS (OS) 1 tasks

OS OS Complete Revision & Interview Drill

Revise process synchronization, virtual memory, paging, thrashing, and deadlock conditions. TUF+ OS

2.5h

Recruiting Pipeline 1 tasks

PIPELINE Recruiting Pipeline Weekly (Week 15)

Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 3 personalised outreach messages (alumni, seniors, recruiters) and log each in the Tracker; follow up open threads; ask for a referral 1–2 days after any OA invite; apply within 72 h of any new posting on the Target-40.

1.0h

Mock Interviews 1 tasks

MOCK Mock Interview 2 (Behavioural — STAR & LP Mapping)

30-min behavioural mock on your 5 STAR stories plus two Amazon LP questions; get a peer to score. Rubric: Behavioural (Architecture §15.4: STAR + LP mapping + quantification + brevity).

1.0h

Aptitude 1 tasks

APT Aptitude Timed Drill (Week 15)

25-minute timed mixed set (quant, logical reasoning, data interpretation) from IndiaBix / PrepInsta-style banks; log accuracy and seconds per question in the Tracker. Target: ≥ 70% accuracy by W28.

0.5h

Core CS (LLD) 1 tasks

LLD Machine-Coding Primer 1 (90 min): Snake & Ladder

Build a working console Snake & Ladder in Java inside 90 minutes: entities, interfaces, a game loop, 3 unit tests. Then a 30-minute self-review against Architecture §15.2 and, where possible, a code review from a senior who has sat Flipkart / PhonePe / Swiggy machine-coding rounds. Resource: Refactoring Guru patterns catalogue.

2.0h

SHOULD — Depth & Mastery

(5 Tasks)

Execute when MUST pace is on track

CORE Aditya Verma Sliding Window Preview

Watch first 3 videos on sliding window concepts in preparation for Phase 4.

2.0h

DSA DSA Spaced Re-Solve (Week 15)

Re-solve 3 hard linked list problems from Week 14.

1.5h

OS Model Evaluation & Cross-Validation Protocols

Stratified K-Fold, TimeSeriesSplit, data leakage prevention, ROC-AUC calibration, learning curves.

2.0h

APT Quant M15 & Logical L10

Mensuration & Syllogisms. Complete Aptitude Phase 1 syllabus!

2.0h

APT Quant M6–M7

Time & Work, Time Speed Distance (Basic + Advanced).

2.0h

STRETCH — If Ahead

(2 Tasks)

Bonus reps & competitive advantage

CORE Kaggle Notebook Discussion

Write a structured summary of your competition approach in the Kaggle competition discussion forum to earn community upvotes. Architecture §6.3

1.5h

CORE Kaggle Competition Sprint

Optional stretch: end-to-end tabular pipeline on a live Kaggle competition (feature engineering, LightGBM/XGBoost baseline, 5-fold CV, Optuna) and a documented notebook. Not a gate; the Kaggle protocol requires only the EDA, CNN and RAG notebooks.

6.0h

verified_user

Weekly Clearance Gate

0 / 12 Cleared

[T: DSA Comprehensive Recall Sprint] DSA: Have you completed “DSA Comprehensive Recall Sprint” (5 random medium problems across Arrays, Hashing, Binary Search, Linked Lists, Trees and…)?