Susquehanna International Group (SIG) · Phone screen
In processSIG Quant Second-Round Tech Screen: 1 Experience
A SIG quant candidate's 2026 second-round tech screen was math-heavy: two puzzles, a matrix rank proof and Find Median from Data Stream with heaps.
At a glance
- Process: recruiter round → a technical second round about a week later (report 01, 2026 Q3).
- Asked recently: rock-paper-scissors where the opponent never repeats a gesture; a three-candidate voting fairness puzzle; prove rank(A) = rank(A·Aᵀ); Find Median from Data Stream explained out loud with heap follow-ups (report 01).
- Difficulty: rated average; the candidate answered everything but heard nothing back.
- Practise first: Find Median from Data Stream.
Coverage: One quant candidate's technical second round at SIG, after a recruiter round. The report's job field says internship, while the candidate lists themselves as a new grad. Interview period given as July–September 2026. Report published October 30, 2026.
What came up
The candidate said this round focuses on linear algebra, calculus, and logic. The four questions they remembered were two reasoning puzzles, a rank proof, and a data-stream median with heap follow-ups.
| Topic | Reports |
|---|---|
| Linear algebra | 1 of 1 |
| Logic | 1 of 1 |
| Calculus (named as a focus; no recalled question is labeled as calculus) | 1 of 1 |
| Game and voting puzzles | 1 of 1 |
| Heaps and streaming data | 1 of 1 |
Questions we found
Probability and Logic Puzzles
| Question | Reports | Last seen |
|---|---|---|
| Rock-paper-scissors where the opponent won't play a gesture they've already played: is there a strategy that gives you an edge after round one? | 1 | Oct 2026 (report date) |
| Three-candidate election with equal first-preference and second-preference scores: is A's proposed match order fair? | 1 | Oct 2026 (report date) |
Math Proof
| Question | Reports | Last seen |
|---|---|---|
| Prove rank(A) = rank(A·Aᵀ) | 1 | Oct 2026 (report date) |
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Find Median from Data Stream, explained out loud, with heap follow-ups | 1 | Oct 2026 (report date) |
1 detailed candidate timeline
01: A math-heavy tech round about a week after the recruiter
Interview period: 2026 Q3 · Report date: October 30, 2026 · Role: Quant · Candidate's rating: Neutral, average · Result: Waitlist in the report's result field; the candidate says they've been ghosted
Recruiter round
The candidate passed it. The notice for the tech second round came within about a week.
Tech second round
These are the four questions the candidate remembered as most worth working through, so they may not be the whole round.
- Two people play rock-paper-scissors, and you're told your opponent won't play a gesture they've played before. With both players rational, is there a strategy that puts you ahead after the first round? The answer has to take each player's play probabilities into account.
- Three candidates, A, B, and C, are in an election. Each voter has a preference order, such as ABC or CAB. All three candidates have the same first-preference score and the same second-preference score. A proposes that B and C go head to head first, with the winner then facing A. Is that fair?
- For a matrix A, prove that rank(A) = rank(A·Aᵀ).
- Find Median from Data Stream, the LeetCode problem, with the approach explained out loud. Follow-ups tested heap knowledge; the report doesn't list them. The linked practice version has you write the code, since the candidate only described theirs.
Afterward
The candidate says they answered everything but hasn't heard back. Their guess is that they applied too late and no headcount was left.
Common questions
What does the SIG quant second round ask?
In this report: linear algebra, calculus and logic, including two reasoning puzzles, a matrix rank proof and a data-stream median with heap follow-ups (report 01).
Keep practicing
- Find Median from Data Stream: question 4 in report 01.
- SIG question bank: algorithms (sign-in needed).
- More firsthand reports: the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.