अभ्यास • Week 12

Weekly MUST Budget Golden Window

30.0h / 36.0h cap

Hour Calibration

actual hours logged

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

Week Execution 0%

0/ 24 tasks 0.0h

target

Week Objective & Target Output

Target Output

DECEMBER BREAK GOLDEN WINDOW — December 21 – December 27, 2026. Focus: Binary Search on Answers II; Recursion & Subsequences; Backtracking I: Permutations & N-Queens; Stack & Queue Foundations; Logistic Regression Theory & Loss Derivation.

Weeks: W11 W12 Active W13 W14 W15

MUST — Critical Path

13 Tasks • ~30.0h

Non-negotiable core curriculum

DSA (Java) 7 tasks

DSA Binary Search on Answers II 5 problems

Minimum Days to Make M Bouquets, Capacity to Ship Packages in D Days, Aggressive Cows, Book Allocation Problem / Split Array Largest Sum, Painter's Partition. TUF+ A2Z Step 4.2

3.5h

DSA Recursion & Subsequences 4 problems

Generate all binary strings without consecutive 1s, generate all valid parentheses, print all subsets, Combination Sum I & II. TUF+ A2Z Step 7.2

3.0h

DSA Backtracking I: Permutations & N-Queens 3 problems

Permutations I & II, N-Queens Problem with board state validation. TUF+ A2Z Step 7.3

3.0h

DSA DSA Transfer: No-Hint Timed Recursion & Backtracking Set 2 problems LC #

Sit 2 unseen Recursion & Backtracking 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 Stack & Queue Foundations 4 problems

Implement Stack using Arrays/LL, Implement Queue using Arrays/LL, Implement Stack using Queues, Implement Queue using Stacks. TUF+ A2Z Step 9.1

3.0h

DSA DSA Daily Quota (Week 12) 4 problems

Solve 4 new problems from NeetCode 150 — Stack; 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 Intervals & Matrix Patterns 6 problems LC #54

Spiral Matrix (LC #54), Rotate Image (LC #48), Set Matrix Zeroes (LC #73), Insert Interval (LC #57), Minimum Number of Arrows to Burst Balloons (LC #452), Meeting Rooms II (LC #253; LintCode 919 without Premium) — sweep-line and min-heap patterns.

3.0h

Competitive Programming 1 tasks

CP Contest & Upsolving (Week 12) 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 Memory Management

Contiguous vs non-contiguous allocation, paging, Page Table architecture, TLB, multi-level paging, inverted page tables, segmentation, virtual memory, page fault handling, page replacement (FIFO, LRU, Optimal). TUF+ OS

3.5h

Professional 1 tasks

PRO STAR Stories v1

Draft 5 STAR stories (conflict, failure, leadership, ambiguity, deadline) with one measurable result each; read aloud once. Why: needed for the first behavioural mock and for OA work-style sections.

1.0h

Recruiting Pipeline 1 tasks

PIPELINE Recruiting Pipeline Weekly (Week 12)

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 1 (DSA Diagnostic)

Peer or Exponent Practice 45-min live DSA mock with a stranger/peer; no IDE autocomplete. First data point on communication and gaps. Rubric: DSA 8-step protocol (Architecture §15.1).

2.0h

Aptitude 1 tasks

APT Aptitude Timed Drill (Week 12)

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

(10 Tasks)

Execute when MUST pace is on track

AI/ML Classification Metrics

Confusion Matrix, Precision, Recall, F1-score, Specificity, ROC-AUC score implementation.

1.5h

CORE Aditya Verma Recursion Playlist

Watch key videos on recursive tree method and subset generation.

2.0h

OS OSTEP Chapter 13–19

Address Spaces, Paging, TLBs reading. Architecture §6.2

2.0h

APT Logical L8

Syllogisms & Critical Reasoning.

1.5h

CP Sorting & Searching

Solve 3–4 classic problems from the CSES Sorting and Searching section (e.g. Distinct Numbers, Concert Tickets, Restaurant Customers) to build speed and accuracy.

2.0h

APT Quant M9–M10

Percentages & Ratio/Proportion (Basic + Advanced).

2.0h

OS Logistic Regression Theory & Loss Derivation

Sigmoid function, odds ratio, derivation of Binary Cross-Entropy (Log-Loss) from Maximum Likelihood Estimation (MLE), decision boundaries.

2.0h

CORE Logistic Regression from Scratch (NumPy)

Implement LogisticRegression class in NumPy: sigmoid activation, binary cross-entropy loss, gradient calculation, gradient descent updates. Train on binary classification dataset. Compare with sklearn.linear_model.LogisticRegression. Push to ml-from-scratch. Architecture §6.1

4.0h

APT Aptitude Teaching Block (Week 12)

Learn the methods (not drills) for permutations & combinations, probability, seating and blood-relation puzzles, data interpretation; 20 worked examples. MUST if the W10 baseline was below 60%.

2.0h

SQL Questions 18–34)

Basic Joins, Intermediate Joins, and Aggregations (questions 18 to 34). Architecture §6.2

2.5h

STRETCH — If Ahead

(1 Tasks)

Bonus reps & competitive advantage

CORE Softmax Regression (Multinomial)

Extend your NumPy logistic regression class to multiclass classification using the Softmax function and Categorical Cross-Entropy.

2.5h

verified_user

Weekly Clearance Gate

0 / 7 Cleared

[T: Binary Search on Answers II] Can you solve the "Book Allocation Problem" / "Aggressive Cows" in Java from memory?

Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.

[T: Stack & Queue Foundations] DSA: Have you completed “Stack & Queue Foundations” (Implement Stack using Arrays/LL, Implement Queue using Arrays/LL, Implement Stack using…)?

Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.

[T: OS Memory Management] OS: Have you completed “OS Memory Management” (Contiguous vs non-contiguous allocation, paging, Page Table architecture, TLB,…)?

Evidence: written answers in your notes repo.

[T: Recruiting Pipeline Weekly (Week 12)] Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 12)” (Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 3 personalised…)?

Evidence: Tracker log shows ≥ 3 personalised outreach messages this week.

[T: Mock Interview 1 (DSA Diagnostic)] Have you completed “Mock Interview 1 (DSA Diagnostic)” (Peer or Exponent Practice 45-min live DSA mock with a stranger/peer; no IDE autocomplete)?

Evidence: rubric sheet saved in Journal.

[T: DSA Transfer: No-Hint Timed Recursion & Backtracking Set] DSA: Did you pass “DSA Transfer: No-Hint Timed Recursion & Backtracking Set” — 2 unseen Recursion & Backtracking problems, 25 min per problem, no hints, pass bar ≥ 1/2 solved?

Evidence: timed result and miss reasons logged in the Journal.

Health & Guardrails: 1 full rest day taken every 2 weeks?

tune

If Behind / Life Interruption Protocol

Triage Rule

When academic exams spike or weekly time slips, execute this contingency plan:

shield Protect (Non-Negotiable)

Binary Search on Answers II + Logistic Regression Theory & Loss Derivation + Recruiting Pipeline Weekly (Week 12)

schedule Defer (Safe to Shift)

AI/ML: Classification Metrics → weekend; Aditya Verma Recursion Playlist → Week 13

edit_note

Week 12 Technical Notes & Journal

#LeetCode #Java #DSA #Week12