Find the maximum number of edges possible in a triangle-free graph on n vertices. Practice extremal graph reasoning, a tight bipartite construction, and constant-time implementation.
Company: Virtu Financial
Role: Quantitative Researcher
Category: Coding & Algorithms
Difficulty: hard
Interview Round: Onsite
Overview: Find the maximum number of edges possible in a triangle-free graph on n vertices. Practice extremal graph reasoning, a tight bipartite construction, and constant-time implementation.
Read the full Virtu Financial Quantitative Researcher interview experience this question came from
Blind 75
75 free coding problems to build your foundations, with hints, explanations, and a progress checklist.
Data Structures & Algorithms
The patterns behind arrays, pointers, trees, graphs and dynamic programming, with worked Python examples.
Cracking the Coding Interview Companion
Our free, unofficial companion to the book: how to analyze, solve and speed up coding problems, in Python.