Trexquant·Data Scientist·Technical Phone Screen
May 2026
Interviewed for a Data Scientist role at Trexquant and got a coding problem that felt more like a software engineering screen than anything data-related. The problem was algorithmic and the hint they gave basically told you the solution approach, which was a little odd.
- Given two strings s and p where p is a subsequence of s, and an array of removable indices, find the maximum number of characters you can remove from s (in the given order) such that p remains a subsequence of the resulting string.
“They gave away the approach in the hint, which was binary search on k.”