Optiver Interview Question

OA-> Hard question combining Dijkstra's algorithm and Dynamic Programming. I honestly think it was leetcode hard or worse. You need to have done competitive programming to have cracked it on your first attempt within the time limit.