A recruiter approached me with the opportunity. I proceeded to interview them. The question I was asked was about the coin change problem. I gave two solutions: brute force and dynamic programming. When I mentioned that the dynamic programming solution is better in terms of time complexity, the interviewer told me that it will have the same time complexity as brute force. I told them that one will probably be O(n^m) and another one will probably be O(n*m). They literally told me that it is the same. Maybe they wanted me to explain how multiplication and exponents work? I don't know. Anyway, I proceeded to code my solution using dynamic programming. It took me 10-12 minutes to write the code but I got a syntax error. I told him that I need to set my initial values to infinity/MAX because we wanted the lowest denominations and then the solution will work. They didn't let me fix the syntax/write a print or even run my code the second time. I didn't ask to google. I copied that code to run on my machine later and as soon I fixed my syntax with the initial value, it worked. I kept telling him that since the return statement is outside the for loops and there is no break. You need to let the loops complete before judging whether or not the solution will work. But somehow, a nested FOR with an IF condition is a bit too complex.