अभ्यास • Week 11

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/ 20 tasks 0.0h

target

Week Objective & Target Output

Target Output

DECEMBER BREAK GOLDEN WINDOW — December 14 – December 20, 2026. Focus: Binary Search 1D; Binary Search on Answers I; Sliding Window & Two Pointers I; NeetCode Pass 1: Two Pointers & Binary Search; Linear Regression Theory & Calculus.

Weeks: W11 Active W12 W13 W14 W15

MUST — Critical Path

12 Tasks • ~30.0h

Non-negotiable core curriculum

DSA (Java) 6 tasks

DSA Binary Search 1D 4 problems

Iterative & recursive binary search (lower bound, upper bound), search in rotated sorted array (I & II), single element in sorted array, find minimum in rotated array. TUF+ A2Z Step 4.1

3.5h

DSA Binary Search on Answers I 3 problems LC #875

Sqrt of integer, Nth root, Koko Eating Bananas (LC #875). TUF+ A2Z Step 4.2

3.0h

DSA DSA Transfer: No-Hint Timed Binary Search Set 2 problems LC #

Sit 2 unseen Binary Search 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 Sliding Window & Two Pointers I 3 problems

Longest Substring Without Repeating Characters, Max Consecutive Ones III, Fruit Into Baskets. TUF+ A2Z Step 10.1

3.5h

DSA NeetCode Pass 1: Two Pointers & Binary Search 6 problems LC #125

Breadth pass — Valid Palindrome (LC #125), Two Sum II (LC #167), 3Sum (LC #15), Container With Most Water (LC #11), Trapping Rain Water (LC #42), Search a 2D Matrix (LC #74). NeetCode 150

3.0h

DSA DSA Daily Quota (Week 11) 4 problems

Solve 4 new problems from NeetCode 150 — Sliding Window; 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 11) LC #

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

2.5h

AI / ML Track 1 tasks

AI/ML Linear Regression from Scratch (NumPy)

Implement LinearRegression class in raw NumPy: forward pass (X @ W + b), compute gradients, gradient descent update loop. Compare coefficients and predictions against sklearn.linear_model.LinearRegression. Push to ml-from-scratch repo. Architecture §6.1 In the same notebook implement Logistic Regression (sigmoid + BCE gradient) and benchmark both models against scikit-learn — one repo, two models, no separate week.

3.0h

SQL Database 1 tasks

SQL SQL Fundamentals & Aggregations

SELECT, WHERE, ORDER BY, GROUP BY, HAVING, aggregations (COUNT, SUM, AVG, MIN, MAX). TUF+ SQL

2.5h

Core CS (OS) 1 tasks

OS OS Foundations & Process Management

Dual-mode operation (kernel vs user mode), system calls, Process Control Block (PCB), context switching, process states, CPU scheduling algorithms (FCFS, SJF, Round Robin, Priority). TUF+ OS

3.5h

Recruiting Pipeline 1 tasks

PIPELINE Recruiting Pipeline Weekly (Week 11)

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 11)

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

(6 Tasks)

Execute when MUST pace is on track

AI/ML Regularization

Ridge (L2), Lasso (L1), ElasticNet intuition. Implement L2 penalty into your from-scratch regression class.

2.0h

OS OSTEP Chapter 4–6

Processes, Direct Execution, CPU Scheduling deep-dive reading. Architecture §6.2

2.0h

APT Logical L7

Blood Relations Advanced & Input/Output.

1.5h

APT Quant M8

Simple & Compound Interest (Basic + Advanced).

1.5h

CORE Linear Regression Theory & Calculus

OLS closed-form derivation, cost function (MSE), partial derivatives, gradient descent update rule, learning rate dynamics. Architecture §6.2

2.5h

APT Aptitude Teaching Block (Week 11)

Learn the methods (not drills) for percentages, ratios, time-speed-distance, time & work; 20 worked examples. MUST if the W10 baseline was below 60%.

2.0h

STRETCH — If Ahead

(2 Tasks)

Bonus reps & competitive advantage

CORE Polynomial Regression

Implement polynomial feature expansion in NumPy; plot learning curves showing underfitting vs overfitting.

2.0h

PIPELINE Regression Metrics & Pipelines

Implement R², Adjusted R², MAE, RMSE from scratch; build an end-to-end sklearn.pipeline.Pipeline on California Housing dataset.

2.0h

verified_user

Weekly Clearance Gate

0 / 9 Cleared

[T: Binary Search 1D] DSA: Have you completed “Binary Search 1D” (Iterative & recursive binary search (lower bound, upper bound), search in rotated sorted…)?

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

[T: Sliding Window & Two Pointers I] Can you solve "Longest Substring Without Repeating Characters" in Java with O(N) time and O(1) space?

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

[T: NeetCode Pass 1: Two Pointers & Binary Search] DSA: Have you completed “NeetCode Pass 1: Two Pointers & Binary Search” (Breadth pass — Valid Palindrome (LC #125), Two Sum II (LC #167), 3Sum (LC #15), Container…)?

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

[T: Linear Regression from Scratch (NumPy)] Can you implement gradient descent for Linear Regression in pure NumPy from memory?

Evidence: GitHub commit or notebook link.

[T: OS Foundations & Process Management] OS: Have you completed “OS Foundations & Process Management” (Dual-mode operation (kernel vs user mode), system calls, Process Control Block (PCB),…)?

Evidence: written answers in your notes repo.

[T: Recruiting Pipeline Weekly (Week 11)] Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 11)” (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 Binary Search Set] DSA: Did you pass “DSA Transfer: No-Hint Timed Binary Search Set” — 2 unseen Binary Search problems, 25 min per problem, no hints, pass bar ≥ 1/2 solved?

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

[T: SQL Fundamentals & Aggregations] SQL: Have you completed “SQL Fundamentals & Aggregations” (SELECT, WHERE, ORDER BY, GROUP BY, HAVING, aggregations (COUNT, SUM, AVG,…)?

Evidence: LeetCode SQL submission count.

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 1D + Linear Regression Theory & Calculus + Recruiting Pipeline Weekly (Week 11)

schedule Defer (Safe to Shift)

AI/ML: Regularization → weekend; OSTEP Chapter 4–6 → Week 12

edit_note

Week 11 Technical Notes & Journal

#LeetCode #Java #DSA #Week11