Weride计算机科学面试真题

During a coding interview, you are presented with a string password generation problem that initially seems to have no clear starting point. However, with the interviewer's guidance, you realize it is related to the Traveling Salesman Problem (TSP) or Eulerian path problem. Without a dynamic programming approach in mind, you attempt to solve it using backtracking. You spend the last ten or more minutes debugging and feel close to completing the solution. No behavioral questions were asked.