500+ quant interview questions for Jane Street, Citadel, Two Sigma, DE Shaw, and other top quantitative finance firms.
C++ and Python coding challenges for quant developer interviews
Statistical analysis and quantitative modeling problems
Trading MCQs, probability brainteasers, and market scenarios
Practice quant interview questions on MyntBit - the all-in-one quant learning platform. Free questions available for C++ coding, Python problems, probability brainteasers, and trading MCQs.
Difficulty: Medium
Category: Algorithms & Data Structures
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: dynamic-array, amortized-analysis, algorithms, data-structures
A dynamic array starts with a size of 1. When the array is full, it doubles in size. Appending an element takes $O(1)$ time, except when the array is full, in which case doubling the array takes $O(n)$ time, where $n$ is the current size of the array. What is the amortized time complexity of $n$ append operations?
Practice this medium trader interview question on MyntBit - the all-in-one quant learning platform with 500+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.