DP Grids & Subsequences I, OA Diagnostic #3, Python RAG + RAGAS, Concurrency II, Mock 5

Ninja's Training, Grid Unique Paths, Unique Paths II (with obstacles), Minimum Path Sum in Grid, Triangle, Minimum Falling Path Sum. TUF+ A2Z Step 16.3

Subset Sum Equals K, Partition Equal Subset Sum, Partition Set Into 2 Subsets with Min Absolute Sum Diff, Count Subsets with Sum K. TUF+ A2Z Step 16.4

Sit 2 unseen DP 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.

Sit a 90-min mixed OA: 2 coding problems, 1 debugging task (fix failing tests in a given Java class) and 10 MCQs (include OS, DBMS, CN questions from Sanfoundry/GFG to simulate the full 3-section OA format used by most companies), under proctor rules. Log every miss in the Journal. Why: modern OAs add debugging and MCQ sections. Includes a 60-minute post-mortem (the exam alone is 90 minutes).

Solve 4 new problems from NeetCode 150 — 2-D DP (grids); 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.

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

Build a Python RAG pipeline (chunking, embeddings, retrieval, grounded answer) and evaluate with RAGAS (faithfulness, answer relevancy, context precision); publish as Kaggle Notebook 3 and record scores in the README.

ExecutorService, thread pool types (FixedThreadPool, CachedThreadPool, WorkStealingPool), Callable, Future, CompletableFuture (chaining with thenApply, thenCompose, exception handling), Java 21+ Virtual Threads (Project Loom) architecture. Architecture §6.2

Implement a complete system in Java under 45-minute timer on LLDCoding.com (e.g. Design a Rate Limiter or Splitwise). Include at least one thread-safety mechanism (synchronized, ConcurrentHashMap, or ReentrantLock) even if the problem statement doesn't require it — every real interview will ask "now make it thread-safe." Architecture §6.1

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.

90-min machine-coding round: design and write runnable Java code for a small system (e.g. Parking Lot) with tests, then extend it by one requirement; a peer scores code quality, extensibility and concurrency safety. Rubric: LLD (Architecture §15.2: requirements → entities → interfaces → patterns → concurrency → tests → extensibility).

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.