अभ्यास • Week 28

Weekly MUST Budget Standard

27.0h / 27.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

April 12 – April 18, 2027 — Focus: DP on Stocks & Longest Increasing Subsequence (LIS); Tries Foundations & FAQs; LLD Machine Coding Session 6 — ATM (90-min Round); HLD Case Study: Distributed Cache (Redis Architecture); Recruiting Pipeline Weekly (Week 28).

Weeks: W26 W27 W28 Active W29 W30

MUST — Critical Path

12 Tasks • ~27.0h

Non-negotiable core curriculum

DSA (Java) 5 tasks

DSA DP on Stocks & Longest Increasing Subsequence (LIS) 8 problems

Best Time to Buy and Sell Stock (I–IV, with Cooldown, with Transaction Fee), Longest Increasing Subsequence (binary search O(N \log N)). TUF+ A2Z Step 16.6 & 16.7

4.0h

DSA Tries Foundations & FAQs 4 problems

Implement Trie (Insert, Search, StartsWith), Complete String, Count distinct substrings, Maximum XOR of two numbers in an array. TUF+ A2Z Step 17

3.5h

DSA DSA Transfer: No-Hint Timed Advanced DP/Trie Set 2 problems LC #

Sit 2 unseen Advanced DP/Trie 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 DSA Daily Quota (Week 28) 4 problems

Solve 4 new problems from NeetCode 150 — Intervals & Greedy; 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 28) 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

Competitive Programming 1 tasks

CP Contest & Upsolving (Week 28) LC #

Codeforces Div.2/3 (fortnightly) + LeetCode Weekly Contest + mandatory upsolving. Ratings are tracked metrics, never gates.

2.5h

Core CS (LLD) 1 tasks

LLD LLD Machine Coding Session 6 — ATM (90-min Round)

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: ATM with state pattern; concurrency: two withdrawals racing on one account.

2.5h

Core CS (HLD) 1 tasks

HLD HLD Case Study: Distributed Cache (Redis Architecture)

Eviction policies (LRU, LFU), cache replication, Redis Sentinel, Redis Cluster sharding, cache stampede (thundering herd), cache penetration prevention. Architecture §6.2

2.5h

Recruiting Pipeline 1 tasks

PIPELINE Recruiting Pipeline Weekly (Week 28)

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

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 Advanced SQL: Window Functions, CTEs & Self-Joins LC #185 D

ROW_NUMBER / RANK / DENSE_RANK, LAG / LEAD, running totals with SUM() OVER, recursive CTEs, self-joins (manager hierarchy, consecutive days), top-N per group; solve 8 Medium–Hard problems (e.g. LC #185 Department Top Three Salaries, LC #601 Human Traffic of Stadium, LC #180 Consecutive Numbers). Why: Track B and fintech SQL rounds.

2.5h

Professional 1 tasks

PRO Readiness Scorecard Dry Run 2

Re-fill the Architecture §4.2 table; any red metric gets a fixed weekly slot in W35–W37 before the real gate.

1.0h

SHOULD — Depth & Mastery

(4 Tasks)

Execute when MUST pace is on track

HLD Distributed Cache

Read Chapter 6 of Alex Xu Volume 2 for distributed caching topologies.

2.0h

CORE Problem-Solving Journal Spaced Review (Week 28)

Re-solve 3 tagged knapsack and grid problems.

2.0h

SPRING Spring Boot Integration Testing

Write test cases using @SpringBootTest and Testcontainers with a real PostgreSQL container.

2.5h

CP Dynamic Programming

Solve 3–4 classic problems from the CSES Dynamic Programming section (e.g. Dice Combinations, Minimizing Coins, Coin Combinations I/II, Book Shop) to solidify 1D/2D DP and knapsack patterns.

2.0h

STRETCH — If Ahead

(1 Tasks)

Bonus reps & competitive advantage

HLD DDIA Chapter 1 & 2

Reliable, Scalable, and Maintainable Applications & Data Models reading.

2.0h

verified_user

Weekly Clearance Gate

0 / 7 Cleared

[T: DP on Stocks & Longest Increasing Subsequence (LIS)] DSA: Have you completed “DP on Stocks & Longest Increasing Subsequence (LIS)” (Best Time to Buy and Sell Stock (I–IV, with Cooldown, with Transaction Fee), Longest…)?

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

[T: Tries Foundations & FAQs] DSA (Tries): Can you implement a Trie (Insert, Search, StartsWith) and count distinct substrings in Java cold?

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

[T: LLD Machine Coding Session 6 — ATM (90-min Round)] LLD: Have you completed “LLD Machine Coding Session 6 — ATM (90-min Round)” (Timed 45 min using the LLD rubric (Architecture §15): requirements → entities →…)?

Evidence: class diagram and code link in your design repo.

[T: HLD Case Study: Distributed Cache (Redis Architecture)] Can you explain Redis cache replication, eviction policies (LRU vs LFU), and how to prevent cache stampede?

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

[T: Recruiting Pipeline Weekly (Week 28)] Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 28)” (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 Advanced DP/Trie Set] DSA: Did you pass “DSA Transfer: No-Hint Timed Advanced DP/Trie Set” — 2 unseen Advanced DP/Trie 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

If Behind / Life Interruption Protocol

Triage Rule

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

shield Protect (Non-Negotiable)

DP on Stocks & Longest Increasing Subsequence (LIS) + LLD Machine Coding Session 6 — ATM (90-min Round) + Recruiting Pipeline Weekly (Week 28)

schedule Defer (Safe to Shift)

Alex Xu Vol 2: Distributed Cache → weekend; Problem-Solving Journal Spaced Review (Week 28) → Week 29

edit_note

Week 28 Technical Notes & Journal

#LeetCode #Java #DSA #Week28