#!process uber oa
1 messages · Page 1 of 1 (latest)
I just got it too
Found this on linkedin:
Problem 1: Dynamic programming optimization for a round-trip passenger pickup route with obstructions and constraints (a “cherry pickup” style path problem).
Problem 2: Optimal facility placement problem using combinatorial search + multi-source BFS to minimize maximum distance.
Hope it helps!
if this was for oa, then it was not close
maybe for vo but idk
What was it like for the oa?