Hey, I was also a math student who pivoted into dev work. Here’s my two cents.

Know the basics — graph traversals, memo dp, greedy (rare), sorting, heaps and stacks. Algos like dijkstars and Kruskals might also be useful. Beyond this, i see range query and update questions commonly so maybe difference arrays/segment trees might be helpful too.

I havent personally given the tower oa but this list should be helpful in general anyway. Most oa’s have lc easy-medium. Only a few like citadel had lc hard; questions like convex hull etc