Re:Solving dynamic programming interview problems
by badlucklottery on Friday May 18, 2018 @04:30PM
(#17104725)
I'd be super surprised if they did. Google interviewers usually encourage you to spit out an easily-verifiable O(n^2) (or even worse!) solution as fast as possible. That way, if you get stuck and honestly can't finesse a faster solution, you can code that up and provide a code sample. People still try to fake their way through the process so being able to code up something close to a compilable function is a useful metric.
[ Parent
| on HN ]