← Squarepoint Interview Insights

Squarepoint·Software Engineer·Technical Phone Screen·Junior

JuniorPrefer not to say
May 2026

Summary

Squarepoint Discretionary Trader interview with one math/combinatorics question. The interviewer gave zero feedback the entire time, just sat there doodling while I worked through it out loud. Not the most comfortable experience.

Questions Asked (1)

Q1

For an n-sided polygon, how many diagonals does it have?

Algorithms & Data Structures
Author's notes

Started by trying to count manually: first vertex connects to n-3 others, next connects to n-4, and so on.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by recalling the formula for the number of diagonals in an n-sided polygon: n(n-3)/2. Explain the reasoning: each vertex connects to n-3 other vertices (excluding itself and its two adjacent vertices), and divide by 2 to avoid double-counting. Optionally, verify with a small example like a pentagon.

Pro tip: Mention that this is a classic combinatorics problem and that the formula can be derived from combinations: C(n,2) - n. This shows you understand the underlying counting principle and can generalize to other problems.

1. Understand the problem

Clarify what a diagonal is: a line segment connecting two non-adjacent vertices of the polygon.

2. Count connections per vertex

From any vertex, you can draw diagonals to all other vertices except itself and its two adjacent vertices, giving n-3 diagonals per vertex.

3. Avoid double-counting

Since each diagonal is counted twice (once from each endpoint), divide the total by 2 to get the correct number.

4. Derive the formula

Combine the counts: total diagonals = n(n-3)/2.

5. Verify with an example

Test with a small polygon, e.g., a pentagon (n=5) gives 5(5-3)/2 = 5 diagonals, which is correct.

Key Points to Mention

  • Definition of a diagonal in a polygon
  • Each vertex connects to n-3 other vertices
  • Double-counting and division by 2
  • Formula: n(n-3)/2
  • Alternative derivation using combinations: C(n,2) - n
  • Verification with a simple example (e.g., square, pentagon)

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.