Squarepoint·Software Engineer·Technical Phone Screen
- For an n-sided polygon, how many diagonals can be drawn by connecting all non-adjacent vertices?
“Started with a brute-force approach, counting n-3 diagonals from the first vertex, n-4 from the second, and so on.”