1,000+ quant interview questions for Jane Street, Citadel, Two Sigma, DE Shaw, and other top quantitative finance firms.
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: Hard
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: algorithms, cache-oblivious, matrix multiplication, complexity analysis
A cache-oblivious algorithm is designed to perform optimally across various cache sizes without explicitly knowing the cache parameters (size $M$ and block size $B$). Consider a cache-oblivious matrix multiplication algorithm for multiplying two $n imes n$ matrices. What is the cache complexity (number of cache misses) of this algorithm?
Practice this hard trader interview question on Myntbit - the all-in-one quant learning platform with 1000+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.