1p3a Experience · Sep 2025

Point72 2026 Summer Quantitative Research Internship Online Coding Test

Quant Intern
1 reply

Interview Experience

OA是一道coding题,限时30min。 求解一个数组中满足以下条件的子数组的和的最大值: arr[i]- arr[j] = i - j

Full Details

OA是一道coding题,限时30min。 求解一个数组中满足以下条件的子数组的和的最大值: arr[i]- arr[j] = i - j

Free preview. Unlock all questions →