How would you approach designing an algorithm for a problem with no obvious brute-force-to-optimal path, such as a hard dynamic programming or graph problem in an interview?