DSU & MST, Bit Manipulation Advanced, JVM Memory & GC, Java Concurrency I

Single Number III (two numbers appearing once), XOR of numbers in a given range, Power Set using bitwise operators. TUF+ A2Z Step 8.2-8.3

DSU by Rank and Size with Path Compression, Kruskal's Algorithm, Prim's Algorithm for Minimum Spanning Tree. TUF+ A2Z Step 15.4

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

Solve 4 new problems from NeetCode 150 — Advanced Graphs; 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.

Sieve of Eratosthenes (Count Primes, LC #204), fast power (Pow(x, n), LC #50), modular arithmetic and modular inverse (CSES Binomial Coefficients), GCD reasoning (Find GCD of Array, LC #1979). Supports the tracked Codeforces targets.

LeetCode Weekly Contest + mandatory upsolving (Codeforces runs on even weeks). Ratings are tracked metrics, never gates.

Thread creation (Thread vs Runnable), thread lifecycle states, synchronized keyword (method vs block level, object monitor vs class monitor), volatile keyword (memory visibility, happens-before relationship), ReentrantLock vs intrinsic locks. Architecture §6.2

Deadlocks in Java, thread dumps, wait(), notify(), notifyAll(), producer-consumer pattern in Java with bounded buffer.

Observer Pattern, Strategy Pattern, Command Pattern, State Pattern with compiled Java implementation.

Implement a complete object-oriented system in compiled Java on LLDCoding.com / Workat.tech under a strict 45-minute timer (e.g. Design a Vending Machine or Library Management System). Include at least one thread-safety mechanism (synchronized, ConcurrentHashMap, or ReentrantLock) — build this habit from Session 2 onward; 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.

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.