SIG software engineer candidates typically report a timed online coding assessment, a recruiter screen, live coding interviews with C++ depth, and a final stage with low-level design and team-matching conversations.
$177K
Avg. Base Comp
$192K
Avg. Total Comp
Not reported
Typical Rounds
Not reported
Process Length
Candidates describing SIG software engineer interviews most often start with a timed online assessment, and several report four questions in about 70 minutes on CodeSignal or HackerRank. The difficulty is described as ramping up, with early questions easy and later ones much harder, so pacing matters as much as raw algorithm knowledge.
The technical rounds that follow appear to reward C++ fluency and implementation detail. Multiple candidates report being asked to implement or explain vector push_back. One candidate who reached a final virtual onsite says follow-ups went into noexcept moves, exception safety and reallocation ownership. Others mention live coding of about 30 minutes, a binary tree level-order problem, and building a hash map or LRU-style structure from scratch.
Design questions are reported as low-level rather than distributed-systems design. Candidates mention a grocery-store checkout system, a library system, a movie catalog class and an order book, with interviewers pressing on class structure, syntax, data structure choices and latency tradeoffs. One candidate said interviewers kept adding constraints to see how the design adapted.
Expect recruiter and manager conversations about your background, why SIG, and one project in depth. One candidate also reported mental math without a calculator. Most reported outcomes were rejections, and several candidates mention slow recruiter communication, so plan for some waiting between stages. Practice timed coding, narrate your tradeoffs, and rehearse C++ container internals.
Synthesized from 15 candidate reports by our editorial team.
Had an interview recently?
Share your experience. Unlock the full guide.
Real interview reports from people who went through the Susquehanna International Group, Llp (Sig) process.
I applied through a headhunter. The process began with a recruiter call, followed by a technical round. Know your data structures and time complexity, and be ready to build things from scratch.
Questions asked: You are expected to know how to implement a hash map, or a structure like an LRU cache. At the start, ask constraint questions to show your communication skills. You are then given about 30 minutes to write a hash map class with put, contains and remove. The interviewer comes back to go over time complexity and asks optimization questions, and you implement the changes. A follow-up asked how to do this with a deque, including replacing an unbounded list as the backing store with a circular buffer array to save memory.
Prep tip from this candidate
Ask clarifying questions before you start coding. Practice building core structures such as a hash map from scratch, then explain the complexity and how you would cut memory use, for example with a circular buffer.
Share your own interview experience to unlock all reports, or subscribe for full access.
Sourced from candidate reports and verified by our team.
Topics based on recent interview experiences.
Featured question at Susquehanna International Group, Llp (Sig)
In which case would you use a bagging algorithm versus a boosting algorithm
| Question | |
|---|---|
| Fixed Length Arrays: Addition | |
| Simple Movie Database | |
| 2nd Highest Salary | |
| Employee Salaries | |
| Merge Sorted Lists | |
| Subscription Overlap | |
| Empty Neighborhoods | |
| Top Three Salaries | |
| Closest SAT Scores | |
| Find the Missing Number | |
| Monthly Customer Report | |
| Rolling Bank Transactions | |
| Top 5 Turnover Risk | |
| Payments Received | |
| Size of Joins | |
| Total Spent on Products | |
| Get Top N Frequent Words | |
| Top 3 Users | |
| Maximum Profit | |
| Duplicate Rows | |
| String Shift | |
| Google Maps Improvement | |
| Scrambled Tickets | |
| Comments Histogram | |
| Prime to N | |
| Slacking Employees Salaries | |
| Last Transaction | |
| Like Tracker | |
| Find the First Non-Repeating Character in a String |
Synthesized from candidate reports. Individual experiences may vary.
Candidates report an online assessment of about 70 minutes with four problems that ramp from very easy to hard, on CodeSignal or HackerRank. Several describe it as the main filter, with time pressure the biggest challenge.
Candidates typically describe a recruiter call of roughly 30 minutes covering your resume, why SIG, and one project in depth, including your own contribution. One candidate reported four mental math questions solved aloud without a calculator. Some report postponed calls or long gaps in communication afterward.
Candidates report live coding sessions ranging from about 30 minutes to roughly 90 minutes, sometimes on CodeSignal. Reported tasks include implementing vector push_back, level-order traversal of a binary tree, and building a hash map. Interviewers may probe complexity, edge cases and optimization, and a C++ candidate reported deep follow-ups on exception safety and memory ownership.
Candidates report a final stage that can last around two and a half hours, mixing another coding problem with a low-level design exercise such as a grocery checkout system or an order book. Interviewers may push from high-level structure into syntax and data structure choices, and add constraints partway through.
Some candidates describe manager conversations of about 30 minutes, and others mention multiple team-matching interviews in the same later stage, mixing technical and behavioral topics. Format, length and sequencing may vary by office and level.
