Weekly MUST Budget
Standard
26.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
Target Output
Week Objective & Target Output
SEM 6 BEGINS (Jan 4) — January 4 – January 10, 2027. Sem 6 begins Jan 4. Focus: Linked Lists Hard; Binary Trees Properties; Heaps Foundations; Ensemble Methods: Bagging & Boosting; OS File Systems & I/O Management.
MUST — Critical Path
12 Tasks • ~26.0h
DSA (Java)
6 tasks
DSA
Linked Lists Hard
6 problems
Reverse nodes in K-group, Rotate a Linked List, Merge two sorted lists, Sort a Linked List (merge sort on LL), Flattening a Linked List, Copy list with random pointer. TUF+ A2Z Step 6.4
3.5h
DSA
Binary Trees Properties
4 problems
Height of Binary Tree, Diameter of Binary Tree, Balanced Binary Tree check, Maximum Path Sum. TUF+ A2Z Step 13.2
3.5h
DSA
Heaps Foundations
5 problems
Min Heap & Max Heap representation using arrays, heapify up/down, insert, delete, HeapSort implementation from scratch. TUF+ A2Z Step 11.1
3.5h
DSA
DSA Transfer: No-Hint Timed Tree Set
2 problems
LC #
Sit 2 unseen Tree 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
DSA Daily Quota (Week 14)
4 problems
Solve 4 new problems from NeetCode 150 — Linked List (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
DSA
Design Data-Structure Problems
3 problems
LC #146
LRU Cache (LC #146) with HashMap + doubly linked list, Insert Delete GetRandom O(1) (LC #380), Time Based Key-Value Store (LC #981). Code each as a clean class with unit tests; they double as LLD warm-ups.
2.0h
Competitive Programming
1 tasks
CP
Contest & Upsolving (Week 14)
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 File Systems & I/O Management
Inodes, file allocation methods (contiguous, linked, indexed), free space management, disk scheduling algorithms (FCFS, SSTF, SCAN, C-SCAN), TUF+ OS curriculum completion.
2.0h
Recruiting Pipeline
2 tasks
PIPELINE
Off-Cycle Internship Applications (Startups & GCCs)
Lane 2: apply to ≥ 8 off-cycle/startup/GCC internships and alumni-referred roles for Jan–Jun 2027 using the Target-40 Track D list and the Alumni map; log each in the Tracker [VERIFY each portal].
1.0h
PIPELINE
Recruiting Pipeline Weekly (Week 14)
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
Aptitude
1 tasks
APT
Aptitude Timed Drill (Week 14)
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
SQL Database
1 tasks
SQL
LeetCode SQL 50 (Part 1: Questions 1–17)
LC #
Complete questions 1 to 17 on LeetCode SQL 50 study plan (Select & Basic Joins).
2.5h
SHOULD — Depth & Mastery
(6 Tasks)
OS
XGBoost / LightGBM Hands-on
Train an XGBoost model on tabular data; inspect feature importances.
2.0h
OS
OS Top 50 Interview Questions
Revise top operating systems interview questions on TUF+.
1.5h
APT
Verbal V3
Idioms, Phrases & Cloze Test.
1.5h
CORE
K-Means & PCA
K-Means algorithm, Elbow method, PCA dimensionality reduction derivation (covariance matrix, eigenvalues, projection).
2.5h
APT
Quant M13–M14
Permutations, Combinations & Probability (Basic + Advanced).
2.0h
CORE
Bagging & Boosting
Bootstrap aggregating (Bagging), Out-of-Bag (OOB) error, Random Forest feature randomness, Boosting principle (AdaBoost, Gradient Boosting, XGBoost math & split criterion). Architecture §6.2
3.5h
STRETCH — If Ahead
(1 Tasks)
CORE
K-Means from Scratch
Implement K-Means clustering from scratch in pure NumPy.
2.0h
verified_user
0 / 8 Cleared
Weekly Clearance Gate
[T: Linked Lists Hard]
Can you solve "Reverse Nodes in K-Group" and "Copy List with Random Pointer" in Java?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Binary Trees Properties]
DSA: Have you completed “Binary Trees Properties” (Height of Binary Tree, Diameter of Binary Tree, Balanced Binary Tree check, Maximum Path…)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Heaps Foundations]
DSA: Have you completed “Heaps Foundations” (Min Heap & Max Heap representation using arrays, heapify up/down, insert, delete,…)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Off-Cycle Internship Applications (Startups & GCCs)]
Have you completed “Off-Cycle Internship Applications (Startups & GCCs)” (Lane 2: apply to ≥ 8 off-cycle/startup/GCC internships and alumni-referred roles for…)?
Evidence: Tracker rows with dates and links.
[T: Recruiting Pipeline Weekly (Week 14)]
Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 14)” (Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 3 personalised…)?
Evidence: Tracker log shows ≥ 3 personalised outreach messages this week.
[T: DSA Transfer: No-Hint Timed Tree Set]
DSA: Did you pass “DSA Transfer: No-Hint Timed Tree Set” — 2 unseen Tree problems, 25 min per problem, no hints, pass bar ≥ 1/2 solved?
Evidence: timed result and miss reasons logged in the Journal.
[T: LeetCode SQL 50 (Part 1: Questions 1–17)]
SQL: Have you completed “LeetCode SQL 50 (Part 1: Questions 1–17)” (Complete questions 1 to 17 on LeetCode SQL 50 study plan (Select & Basic Joins).)?
Evidence: LeetCode SQL submission count.
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)
Linked Lists Hard + Ensemble Methods: Bagging & Boosting + Recruiting Pipeline Weekly (Week 14)
schedule Defer (Safe to Shift)
XGBoost / LightGBM Hands-on → weekend; OS Top 50 Interview Questions → Week 15
edit_note
Week 14 Technical Notes & Journal
#LeetCode
#Java
#DSA
#Week14