Real, anonymized candidate journeys from recent (2025–2026) Salesforce AMTS/MTS through LMTS/SMTS loops in India — round by round, including what was asked, how the candidate approached it, and the outcome.
One complete journey, start to finish
Round 1 — HackerRank Screening (75 min, proctored)
A heap/priority-queue implementation problem and a DP-or-math sorting problem.
Round 2 — DSA (Google Meet)
Implementing a Max Stack and then a Frequency Stack, with the interviewer pushing until both hit O(1) operations with fully working code.
Round 3 — LLD (Google Meet)
Designing a connection pool for 1000-2000 concurrent connections, handling free/blocked/closed states, timeout handling, and thread safety — settling on a synchronized BlockingQueue with an O(n) timeout check, flagged as a scalability tradeoff.
Round 4 — HLD (in-person, whiteboard)
Designing a marketing campaign system, with deep dives on distributed transactions, scalability, failure handling, and the saga pattern.
Round 5 — Hiring Manager (in-person, whiteboard, ~45+ min)
Deep discussion of current project architecture, plus leadership and mentoring style.
Key takeaway: Sketching the approach live (the candidate used Excalidraw) made the reasoning easier to follow for the interviewer; always propose the optimal solution since interviewers keep probing, and narrate time-complexity tradeoffs out loud rather than leaving them implicit.
More real interview journeys
The first round of each journey below is shown in full; the rest of each candidate's journey — every remaining round, verbatim — is part of the Placement-Ready PYQ Kit.
Round 1 — Online Assessment (HackerRank, 75 min)
Array frequency-tracking problem and a binary-array sorting problem, proctored.
🔒 4 more rounds — continue this journey in the full kit
Round 1 — Online Coding Assessment
Two problems, both cleared.
🔒 3 more rounds — continue this journey in the full kit
Round 1 — Online Assessment (100 min)
Three problems: a power-of-two energy-reduction problem, an XOR-based log-update problem, and a tree-diameter endpoints problem.
🔒 2 more rounds — continue this journey in the full kit