arrow_back अभ्यास
Phase 2 • Week 10

Arrays Hard, Strings, OA Diagnostic #1, Data Science Toolkit, Phase 2 Gate

Weekly MUST Budget Golden Window - post-ESE ease-in
24.0h / 24.0h cap
Hour Calibration
actual hours logged
Rule: slippage > 1.25x triggers Scope-Cut Rung 2
Week Execution 0%
0/ 18 tasks 0.0h
target

Week Objective & Target Output

Target Output
DECEMBER BREAK GOLDEN WINDOW BEGINS — December 7 – December 13, 2026. Focus: Arrays Hard I & II; Strings Basics & Medium (TUF+ Step 5); Hashing Deep; NeetCode Pass 1: Arrays & Hashing; OA Diagnostic #1 (90-min Timed).
Weeks: W06 W07 W08 W09 W10 Active

MUST — Critical Path

11 Tasks • ~24.0h
DSA (Java) 8 tasks
DSA Arrays Hard I & II 4 problems
3 Sum, 4 Sum, Merge Overlapping Intervals, Count Inversions (modified merge sort). TUF+ A2Z Step 3.3
3.5h
DSA Strings Basics & Medium (TUF+ Step 5) 8 problems
Reverse Words in a String, Valid Anagram, Isomorphic Strings, Longest Common Prefix, Roman to Integer, Implement Atoi, Count Substrings with K Distinct Chars, Longest Palindromic Substring. TUF+ A2Z Step 5.1-5.2
4.5h
DSA DSA Transfer: No-Hint Timed Arrays & Strings Set 2 problems LC #
Sit 2 unseen Arrays & Strings 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. Ledger checkpoint: ≥ 50 unique problems logged in the Journal (cumulative; tracked metric, Architecture §3).
1.5h
DSA Hashing Deep 2 problems
Count Subarrays with Sum K, Longest Subarray with 0 Sum. TUF+ A2Z Step 3.2
2.0h
DSA NeetCode Pass 1: Arrays & Hashing 6 problems LC #217
Breadth pass (Pass 1) — Contains Duplicate (LC #217), Encode and Decode Strings (LC #271; LintCode 659), Group Anagrams (LC #49), Top K Frequent Elements (LC #347), Product of Array Except Self (LC #238), Valid Sudoku (LC #36). NeetCode 150
3.0h
DSA OA Diagnostic #1 (90-min Timed) 2 problems
Sit a 90-minute HackerRank/Codility-style OA (2 coding problems + 10 MCQs) under proctor rules (no AI, no hints, single tab). Log every question, your approach and the miss reason in the Journal. Includes a 60-minute post-mortem (the exam alone is 90 minutes).
2.5h
DSA OA Vendor Sandbox Drill 0 problems — platform drill
On HackerRank, Codility and CodeSignal practice pages: Java stdin/stdout parsing, required class naming (Main/Solution), custom test cases, tab-switch and copy-paste rules. Submit one trivial problem on each.
1.0h
DSA Prefix Sums & Difference Arrays 3 problems LC #304
Range Sum Query 2D (LC #304), Corporate Flight Bookings (LC #1109, difference array), Subarray Sums Divisible by K (LC #974). The top OA pattern beyond 1-D prefix sums.
1.5h
AI / ML Track 1 tasks
AI/ML NumPy & Pandas Mastery
Vectorized operations, array slicing, broadcasting, DataFrame filtering, groupby, merge/join, handling missing data. Complete 30+ exercises. Architecture §6.2
3.0h
Recruiting Pipeline 1 tasks
PIPELINE Recruiting Pipeline Weekly (Week 10)
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 10)
Baseline test: 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. If the baseline is below 60%, the W11–W12 Aptitude Teaching Blocks become MUST (Architecture §3).
0.5h

SHOULD — Depth & Mastery

(4 Tasks)
Execute when MUST pace is on track
DSA DSA Spaced Re-Solve (Week 10)
Re-solve 3 medium array problems from Phase 1 under 15 min each.
1.5h
CP Contest & Upsolving (Week 10)
Participate in weekend contest + mandatory upsolve.
2.0h
DSA DSA Daily Quota (Week 10)
Solve 5 problems from the TUF+ A2Z step currently in progress (the daily practice behind Architecture §14); log each in the Journal.
2.5h
CORE EDA Notebook (Kaggle Milestone 1)
Download Titanic or House Prices dataset. Perform end-to-end Exploratory Data Analysis, feature distributions, missing value strategy, and correlation analysis using Matplotlib and Seaborn. Publish a polished public Kaggle notebook. Architecture §6.3
2.0h

STRETCH — If Ahead

(3 Tasks)
Bonus reps & competitive advantage
CORE Kaggle Community Upvote Drive
Share your published EDA notebook on LinkedIn and Kaggle discussion forums to earn your first Bronze medal upvotes towards Notebooks Expert. Architecture §6.3
1.5h
CP Codeforces Div.2 Contest
Participate in live contest; push towards 900+ rating.
2.0h
CORE Kaggle Learn Micro-Courses
Complete Kaggle "Pandas" and "Data Visualization" micro-courses for certifications.
2.0h
verified_user

Weekly Clearance Gate

0 / 9 Cleared
[T: Arrays Hard I & II] DSA: Can you solve "3 Sum" and "Merge Overlapping Intervals" in Java cold in under 25 minutes?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: Strings Basics & Medium (TUF+ Step 5)] DSA: Can you solve Step 5 string problems (Valid Anagram, Longest Common Prefix, Count Substrings with K Distinct Chars, Longest Palindromic Substring) cold?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: NeetCode Pass 1: Arrays & Hashing] DSA: Have you completed “NeetCode Pass 1: Arrays & Hashing” (Breadth pass (Pass 1) — Contains Duplicate (LC #217), Valid Anagram (LC #242), Group…)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: NumPy & Pandas Mastery] Have you completed “NumPy & Pandas Mastery” (Vectorized operations, array slicing, broadcasting, DataFrame filtering, groupby,…)?
Evidence: GitHub commit or notebook link.
[T: Recruiting Pipeline Weekly (Week 10)] Recruiting Pipeline: Have you completed “Recruiting Pipeline Weekly (Week 10)” (Calendar check against the Opportunity Calendar (Architecture §16); send ≥ 3 personalised…)?
Evidence: Tracker log shows ≥ 3 personalised outreach messages this week.
[T: Hashing Deep] DSA: Have you completed “Hashing Deep” (Count Subarrays with Sum K, Longest Subarray with 0 Sum)?
Evidence: one problem from this task re-solved cold in ≤ 25 min a week later, logged in the Journal.
[T: DSA Transfer: No-Hint Timed Arrays & Strings Set] Ledger: Does your Journal show ≥ 50 unique problems logged (cumulative)?
Evidence: Journal ledger count and LeetCode submission links.
[T: DSA Transfer: No-Hint Timed Arrays & Strings Set] DSA: Did you pass “DSA Transfer: No-Hint Timed Arrays & Strings Set” — 2 unseen Arrays & Strings problems, 25 min per problem, no hints, pass bar ≥ 1/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)
Arrays Hard I & II + NumPy & Pandas Mastery + Recruiting Pipeline Weekly (Week 10)
schedule Defer (Safe to Shift)
DSA Spaced Re-Solve (Week 10) → weekend; Contest & Upsolving (Week 10) → Week 11
edit_note

Week 10 Technical Notes & Journal

#LeetCode #Java #DSA #Week10