अभ्यास • Week 35

Weekly MUST Budget Summer Golden Window - deferred recovery

19.0h / 20.0h cap

Hour Calibration

actual hours logged

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

Week Execution 0%

0/ 17 tasks 0.0h

target

Week Objective & Target Output

Target Output

SUMMER GOLDEN WINDOW BEGINS — May 31 – June 6, 2027. Focus: Segment Trees & Fenwick Trees; HLD Case Study: Notification Service; Recruiting Pipeline Weekly (Week 35); Mock Interview 8 (Full Placement Simulation); AI-Assisted & Codebase-Comprehension Practice 1.

Weeks: W31 W32 W33 W34 W35 Active

MUST — Critical Path

10 Tasks • ~19.0h

Non-negotiable core curriculum

DSA (Java) 3 tasks

DSA Post-ESE Cold Recall Sprint: DP & Graphs 3 problems LC #337, D

Solve House Robber III (LC #337, DP on Trees) + one random graph medium + one random DP medium cold, no hints, to rebuild speed after the 4-week exam gap. Speed benchmark: each problem must be attempted in ≤ 20 min. Log solve times. Why: the exam gap creates a retention cliff — this drill proves you can still perform under time pressure.

2.0h

DSA DSA Daily Quota (Week 35) 4 problems

Solve 4 new problems from NeetCode 150 — Tries & Bit Manipulation; 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 OA Simulation (Week 35) 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

Core CS (HLD) 2 tasks

HLD HLD Case Study: Notification Service

Use the Architecture §19 blueprint: requirements, estimation, API, queue-based fan-out, retries and dedup, per-channel rate limits, trade-offs; 1-page write-up.

2.0h

HLD Alex Xu Vol 1 Key Systems Review

Review Chapter 4 (Rate Limiter), Chapter 9 (Web Crawler), and Chapter 11 (News Feed).

2.5h

Recruiting Pipeline 1 tasks

PIPELINE Recruiting Pipeline Weekly (Week 35)

Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 8 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.

2.0h

Mock Interviews 2 tasks

MOCK Mock Interview 8 (Full Placement Simulation)

90-min loop: DSA (45) → HLD (30) → Behavioural (15) with three different interviewers if possible. Rubric: DSA 8-step protocol (Architecture §15.1). Rubric: HLD (Architecture §15.3: requirements → estimation → API → data model → architecture → deep dive → bottlenecks/trade-offs). Rubric: Behavioural (Architecture §15.4: STAR + LP mapping + quantification + brevity).

2.0h

MOCK AI-Assisted & Codebase-Comprehension Practice 1

Take an unfamiliar small repo, extend one feature and add tests with an AI assistant while narrating; practise verifying or rejecting AI output and prepare an honest "how I use AI at work" talking point. Zero-AI wording applies only to timed DSA sets. Rubric: AI-assisted round (Architecture §15.6: problem framing, verification, tests, narration).

1.5h

Aptitude 1 tasks

APT Aptitude Timed Drill (Week 35)

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: hold ≥ 70% accuracy.

0.5h

Core CS (LLD) 1 tasks

LLD LLD Machine Coding Session 9 — Notification System (Timed 45 min)

Timed 45 min using the LLD rubric (Architecture §15): requirements → entities → interfaces → patterns → concurrency → tests → extensibility. Write the checklist and a one-page class diagram; self-timed [VERIFY lldcoding.com / Workat.tech availability]. Problem: Notification system (email/SMS/push) with strategy + observer; concurrency: retry queue.

1.5h

SHOULD — Depth & Mastery

(6 Tasks)

Execute when MUST pace is on track

CORE LIS Variations & Advanced DP

Largest Divisible Subset, Longest String Chain, Longest Bitonic Subsequence, Number of LIS.

2.0h

CORE Problem-Solving Journal Spaced Review (Week 35)

Re-solve 3 tagged hard problems from Tries and DP.

2.0h

HLD News Feed

Use the Architecture §19 blueprint: fan-out on write vs read, ranking, caching, hot-key celebrities; 1-page write-up.

2.0h

CORE Segment Trees & Fenwick Trees

Segment tree (build, point update, range query) and Fenwick tree (BIT): Range Sum Query – Mutable (LC #307), Count of Smaller Numbers After Self (LC #315), Reverse Pairs (LC #493), Count of Range Sum (LC #327). Pulled forward from W42 [4 problems]

3.5h

DSA No-Hint Timed Segment Tree Set

Solve 2 problems (LC #307, LC #315) in 25 min total, including 5 min listing edge cases and a dry run, with zero hints, editorial or AI assistance. Pass bar: ≥ 1/2 solved inside the 25 min; log per-problem solve time; log the result and the miss reason in the Journal. [2 problems]

1.5h

HLD Transactions

Kleppmann & Riccomini Designing Data-Intensive Applications (2nd ed., 2026 — go by topic, not first-edition chapter numbers), transactions chapter: ACID isolation levels (Read Committed, Repeatable Read, Snapshot Isolation, Serializable, 2PL, SSI), dirty reads, non-repeatable reads, phantom reads, and write skew. Architecture §6.2

2.0h

STRETCH — If Ahead

(1 Tasks)

Bonus reps & competitive advantage

CORE Advanced Trie Problems

Implement Maximum XOR with an Element from Array (LC #1707).

2.0h

verified_user

Weekly Clearance Gate

0 / 6 Cleared

[T: Post-ESE Cold Recall Sprint: DP & Graphs] DSA: Did you solve 3 cold-recall problems in ≤ 20 min each after the exam gap?

Evidence: solve times logged in Journal.

[T: HLD Case Study: Notification Service] HLD: Have you completed “HLD Case Study: Notification Service” (Use the Architecture §19 blueprint: requirements, estimation, API, queue-based fan-out, retries and…)?

Evidence: 1-page write-up in your design repo.

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

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

[T: AI-Assisted & Codebase-Comprehension Practice 1] Have you completed “AI-Assisted & Codebase-Comprehension Practice 1” (Take an unfamiliar small repo, extend one feature and add tests with an AI assistant…)?

Evidence: rubric sheet saved in Journal.

[T: Mock Interview 8 (Full Placement Simulation)] Mocks: Have you completed 8 total mock interviews with rubric sheets recorded?

Evidence: rubric sheets for mocks 1–8 saved in 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)

Segment Trees & Fenwick Trees + HLD Case Study: Notification Service + Recruiting Pipeline Weekly (Week 35)

schedule Defer (Safe to Shift)

LIS Variations & Advanced DP → weekend; Alex Xu Vol 1 Key Systems Review → Week 36

edit_note

Week 35 Technical Notes & Journal

#LeetCode #Java #DSA #Week35