RepostedSquarepoint Capital logo

Squarepoint Capital · OA → Phone screen → Onsite

In process

Squarepoint Campus SDE Interviews: 7 Experiences (Part 2 of 2)

Software engineer · New GradReported Oct 16, 2025
Shared byjanebeingjane

Squarepoint new grad and campus SDE interviews, 2023–2025: C++ and Python coding mixed with OS, networking and OOP questions; seven more reports.

At a glance

Coverage: 7 new grad and campus Software Developer / SDE reports from the 2023 placement season to October 2025 (Indian campuses and Montreal where stated), plus one 2022–23 report in History. Two offers and one more selection; two rejections.

In this collection

  • New grad / campus SDE, Part 1: five recent graduate and campus reports, including Python OA updates and the C++ torch and exact-decimal interviews.
  • New grad / campus SDE, Part 2 (current): seven more campus reports, entries 06–12.
  • Other SWE and adjacent profiles: seven reports with unconfirmed graduate status, an infrastructure engineer, and a SWE/quant developer title conflict.

What came up

Every report had coding, and most paired it with CS fundamentals: OS scheduling and race conditions, C++ internals, networking layers. Several tasks were practical implementations rather than LeetCode puzzles.

Topic Reports Last seen
Coding or debugging exercises 6 of 6 Oct 2025
OS, memory or concurrency 4 of 6 Oct 2025 (report date)
Resume, project or fit discussion 3 of 6 Aug 2025
C++ language and ownership 4 of 6 Oct 2025 (report date)
Computer networks 3 of 6 Oct 2025 (report date)
Python language concepts 2 of 6 Mar 2025

Questions we found

Coding and implementation

Question Reports Last seen
Estimate pi with a finite series 1 Oct 2025 (report date)
In-memory directory and file operations 1 Oct 2025 (report date)
Predict forked program output 1 Oct 2025 (report date)
Gravity Falls: lexicographically smallest bottom row 1 Oct 2025
Longest increasing subsequence from two arrays 1 Oct 2025
AVL insertion and rotations 1 Oct 2024
Best currency conversion path 1 Oct 2024
Observe a lazy generator 1 Nov 2024
Order matching on execute 1 Nov 2024
Resolve overlapping price ranges 1 Dec 2024 (report date)
Accumulate numeric value objects 1 2023
Reverse an ASCII string in C 1 2023

Design and project coding

Question Reports Last seen
Demonstrate the four OOP principles 1 Oct 2025 (report date)
Repair flight-queue notifications without deadlock 1 Nov 2024

CS and language questions

Question Reports Last seen
How would you change the finished solution for production? 1 Aug 2025
Semaphores versus locks 1 Oct 2024
Virtual-circuit versus datagram service 1 Oct 2024
A C++17 feature missing from C++14 1 Oct 2024

6 detailed candidate timelines

06: OOP, Linux functions and a Node.js round

Report date: October 16, 2025 · Role: Software Developer · Level: 2025 graduate (IIT Kharagpur) · Result: Offer

Three online interviews of about an hour each on HackerRank CodePair, before end-semester exams and about ten days before campus Day 0.

  1. OA: two C++ challenges using binary search and string/hash techniques (objectives not shared).
  2. Technical 1: code examples of all four OOP pillars (practice), then virtual functions, vtables and constructors; OS scheduling and a fork output question; finally Linux-style directory and file operations in C++ (mkdir, ls, file creation).
  3. Technical 2 (right after): race conditions and fixes, semaphores, vector/array internals through output questions, stack versus heap, Linux commands and pipes, ports and the OSI model; then code to estimate pi. The candidate felt drained after two sessions in a row.
  4. Technical 3 (a few days later): a two-part Node.js application in JavaScript (behavior not shared), improved for time complexity; memory led to sharding, load balancing, CDNs and caching. Offer on Day 0.

07: an October OA with two identifiable tasks

Interview date: October 4, 2025 · Role: Software Developer · Result: Not stated

  1. Choose C[i] from A[i] or B[i] to maximize a strictly increasing subsequence.
  2. Gravity Falls: arrange left-aligned arrays in any order, let unsupported cells fall, and get the lexicographically smallest bottom row.
  3. A third "Problem 2" had no statement.

08: a graduate C++ screen, then five implementation parts

Interview date: late July–August 2025 · Role: Graduate Software Developer, C++ · Result: Not stated

  1. OA passed.
  2. Technical 1 (about an hour): 15–20 minutes on background, 10–15 on pointers, OOP, polymorphism and virtual functions; an unnamed coding task finished in about 15 minutes with edge-case tests, then how to change it for production.
  3. Technical 2: resume questions, one implementation exercise in five progressive parts (domain not shared), then stack versus heap, recursion versus iteration, threads and race conditions.

09: Montreal Python: an OA invitation, then a first-round rejection

Interview date: February–March 2025 · Role: New grad Software Developer, Python · Location: Montreal · Result: Rejected after the first interview

  1. OA (no webcam): two medium array/string tasks; the first fully solved, the second 7 of 9 tests with an unclear statement; still invited.
  2. Technical 1: resume and behavioral questions; Python decorators, generators, hashing, mutable versus immutable types; a string task with a hash-map approach and CLI-style output that was not finished in time.

10: currency paths, flight queues and an iterator mistake

Interview date: October–November 2024 · Role: SDE · Location: IIT BHU, pan-IIT recruiting · Result: Not selected

  1. OA: an unnamed two-pointer problem and overlapping stock-price ranges.
  2. Round 1 (October 22): a C++17 feature missing from C++14 (structured bindings, shown iterating a map); a balanced-BST map and AVL rotations; semaphores versus locks, race conditions, critical sections, C++ casts, static and dynamic allocation; then the best conversion path through exchange rates (e.g. USD→CAN 1.8, CAN→YEN 2.3), modeled as a graph with a Dijkstra-style approach and OOP code; TCP/IP and virtual-circuit versus datagram.
  3. Round 2 (November 11): the internship project; list comprehensions, generators and the GIL; a priority-queue task and a digit-DP task (not described), all tests passing; multithreading and parallel programming.
  4. Final: repair two flight-detail queues without deadlock and with lower latency (condition waits and notifications halved the runtime); then buy/sell order matching on an execute call in about fifteen minutes, where erasing an element during iteration drew negative feedback.

11: safe C code and an immediate offer

Interview date: 2023 placement season (report date September 9, 2024) · Role: Software Developer · Level: 2024 graduate (IIT Kharagpur) · Result: Offer

  1. Written test: two C++ implementation questions heavy on parsing and edge cases, plus C++ MCQs.
  2. Technical 1 (40–45 minutes): OS, networking, OOP and C++; reverse a string in C with clean, safe code.
  3. Technical 2 (40–45 minutes): Git, Linux and C++; a simple greedy task and STL accumulate with operator overloading.
  4. HR / technology head (40–45 minutes): memory management, locks and HR questions; offer right after.

Patterns across the reports

  1. Implementation with CS questions. Entries 06, 10 and 11 paired practical coding with OS, networking or C++ questions in the same round.
  2. Projects drew specific follow-ups. Entry 10's internship led to threading questions; entry 08 was asked how to productionize a finished solution.

Common questions

What does Squarepoint ask new grad software developers?

Practical C++ or Python coding plus CS fundamentals: Linux file operations and OOP (06), currency conversion and order matching (10), safe C string code (11), with OS, networking and C++ questions throughout.

How many rounds is the Squarepoint campus process?

An OA and two or three technical rounds, sometimes with an HR or technology-head round (entries 06, 10, 11).

History (before 2023)

H12: a short first screen and polynomial differentiation

Interview date: 2022–23 campus placement cycle · Role: Software Engineer / Python developer · Location: Montreal role, IIT Kanpur campus · Result: Selected

  1. A test described as more about understanding than typical DSA.
  2. Round 1 (10–15 minutes): resume and React, then split a number into integer and fractional parts.
  3. Round 2 (30–40 minutes): differentiate a polynomial with edge cases; Python, DBMS (normalization), networking and OS.
  4. Round 3 (40–60 minutes, a founding member): what the candidate built and why, and deeper networking.

Keep practicing

In this collection: Part 1 · Part 2 (current) · Other SWE and adjacent profiles

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.