500+ 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: Medium
Category: time_series
Practice quant interview questions from top firms including Jane Street, Citadel, Two Sigma, DE Shaw, and other leading quantitative finance companies.
Topics: dtw, dynamic_time_warping, time_series, pattern_matching, dynamic_programming
Dynamic Time Warping (DTW) is an algorithm for measuring similarity between two temporal sequences that may vary in speed. It finds the optimal non-linear alignment between sequences, making it useful in quantitative finance for pattern recognition in price series or comparing instruments with non-synchronous trading. The method uses dynamic programming to find the minimum-cost path through a matrix of pairwise distances. Task Implement the function dtw_distance(s: list, t_seq: list) -> float t
Practice this medium researcher interview question on Myntbit - the all-in-one quant learning platform with 650+ quant interview questions for Jane Street, Citadel, Two Sigma, and other top quantitative finance firms.