Weekly MUST Budget
Standard
26.5h / 27.0h cap
Hour Calibration
actual hours logged
Rule: slippage > 1.25x triggers Scope-Cut Rung 2
Week Execution
0%
0/ 16 tasks
0.0h
target
Target Output
Week Objective & Target Output
March 1 – March 7, 2027 — Focus: Shortest Path Algorithms; Negative Cycles & All-Pairs Shortest Path; Java Collections Internals; Dockerfile, GitHub Actions CI & First Cloud Deploy; LLD Structural Patterns.
MUST — Critical Path
11 Tasks • ~26.5h
DSA (Java)
5 tasks
DSA
Shortest Path Algorithms
4 problems
Dijkstra's Algorithm (PriorityQueue approach & Set approach), Shortest path in weighted undirected graph. TUF+ A2Z Step 15.3
3.5h
DSA
Negative Cycles & All-Pairs Shortest Path
3 problems
Bellman-Ford Algorithm (detect negative cycles), Floyd-Warshall Algorithm (all-pairs shortest path). TUF+ A2Z Step 15.3
3.5h
DSA
DSA Transfer: No-Hint Timed Shortest Path Set
2 problems
LC #
Sit 2 unseen Shortest Path 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: 2/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
OA Simulation (Week 22)
2 problems
90-minute timed OA in HackerRank / CodeSignal / Codility format: 2–3 unseen coding problems from company OA sets + 10 CS/aptitude MCQs, proctor rules (single tab, no AI). Then a 60-minute post-mortem: score = % of test cases passed; log every miss in the Journal. Target from W28: average ≥ 70% of test cases.
2.5h
DSA
DP 1D Part III: Interview Classics
4 problems
LC #152
Maximum Product Subarray (LC #152), Palindromic Substrings (LC #647), Delete and Earn (LC #740), Combination Sum IV (LC #377). Second DP revisit before DP grids in W24.
2.0h
Competitive Programming
1 tasks
CP
Contest & Upsolving (Week 22)
LC #
Codeforces Div.2/3 (fortnightly) + LeetCode Weekly Contest + mandatory upsolving. Ratings are tracked metrics, never gates.
2.5h
Core CS (Java)
1 tasks
JAVA
Java Collections Internals
Deep dive into
HashMap (bucket array, hashing formula, collision resolution, linked list to red-black tree threshold at treeify=8, load factor, rehash), ConcurrentHashMap (segment locking vs synchronized buckets, CAS operations), ArrayList vs LinkedList. Architecture §6.2
3.0h
Cloud & DevOps
1 tasks
DEVOPS
Dockerfile, GitHub Actions CI & First Cloud Deploy
Write a multi-stage Dockerfile and a GitHub Actions workflow (build, test, image) that runs on every PR. Deploy the service to a free-tier cloud host and expose a public health URL [VERIFY host terms]. Capstone milestone 6. Why: a deployed, CI-green service is the strongest portfolio signal.
4.0h
Core CS (LLD)
1 tasks
LLD
LLD Structural Patterns
Decorator Pattern (Coffee Shop / Pizza), Adapter Pattern, Facade Pattern with compiled Java code.
2.0h
Recruiting Pipeline
1 tasks
PIPELINE
Recruiting Pipeline Weekly (Week 22)
Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 5 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.5h
Aptitude
1 tasks
APT
Aptitude Timed Drill (Week 22)
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
SHOULD — Depth & Mastery
(4 Tasks)
CORE
BPE Tokenizer Build
Build a minimal Byte Pair Encoding tokenizer in Python. (Demoted from MUST to SHOULD per Step 3).
2.5h
CORE
Problem-Solving Journal Spaced Review (Week 22)
Re-solve 3 tagged BST and tree problems.
2.0h
APT
Quant M22
Probability Advanced & Baye's Theorem.
1.5h
DSA
DSA Daily Quota (Week 22)
Solve 4 new problems from NeetCode 150 — Graphs (shortest paths & grids); 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. [4 problems]
2.5h
STRETCH — If Ahead
(1 Tasks)
CORE
Train GPT on Custom Text
Fine-tune your from-scratch nanoGPT model on your favorite book or technical documentation.
2.0h
verified_user
0 / 8 Cleared
Weekly Clearance Gate
[T: Shortest Path Algorithms]
DSA: Have you completed “Shortest Path Algorithms” (Dijkstra's Algorithm (PriorityQueue approach & Set approach), Shortest path in weighted…)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Negative Cycles & All-Pairs Shortest Path]
DSA: Have you completed “Negative Cycles & All-Pairs Shortest Path” (Bellman-Ford Algorithm (detect negative cycles), Floyd-Warshall Algorithm (all-pairs…)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Java Collections Internals]
Java: Have you completed “Java Collections Internals” (Deep dive into
HashMap (bucket array, hashing formula, collision resolution, linked…)?
Evidence: GitHub link to your examples and written answers.
[T: Dockerfile, GitHub Actions CI & First Cloud Deploy]
Have you completed “Dockerfile, GitHub Actions CI & First Cloud Deploy” (Write a multi-stage Dockerfile and a GitHub Actions workflow (build, test, image) that…)?
Evidence: GitHub Actions run URL and public service URL.
[T: LLD Structural Patterns]
LLD: Have you completed “LLD Structural Patterns” (Decorator Pattern (Coffee Shop / Pizza), Adapter Pattern, Facade Pattern with compiled…)?
Evidence: class diagram and code link in your design repo.
[T: Recruiting Pipeline Weekly (Week 22)]
Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 22)” (Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 5 personalised…)?
Evidence: Tracker log shows ≥ 5 personalised outreach messages this week.
[T: DSA Transfer: No-Hint Timed Shortest Path Set]
DSA: Did you pass “DSA Transfer: No-Hint Timed Shortest Path Set” — 2 unseen Shortest Path problems, 25 min per problem, no hints, pass bar 2/2 solved?
Evidence: timed result and miss reasons logged in the Journal.
Health & Guardrails: 1 full rest day taken every 2 weeks?
tune
Triage Rule
If Behind / Life Interruption Protocol
When academic exams spike or weekly time slips, execute this contingency plan:
shield Protect (Non-Negotiable)
Shortest Path Algorithms + Java Collections Internals + Recruiting Pipeline Weekly (Week 22)
schedule Defer (Safe to Shift)
BPE Tokenizer Build → weekend; Problem-Solving Journal Spaced Review (Week 22) → Week 23
edit_note
Week 22 Technical Notes & Journal
#LeetCode
#Java
#DSA
#Week22