Just had my first ever google interview and wanted to share my experience.
After a basic introduction we jumped into the problem. I won't discuss the problem duo to NDA.
Just that it was a DP medium very similar to the ones on leetcode. Pretty standard stuff nothing crazy.
I started off with a recursive solution with backtracking. Interviewer asked if it can be more optmized so I rewrote my solution to utilize memoization. After testing it with a couple of test cases the time was up.
I'm pretty sure I got the optimal solution atleast in terms of time complexity. It could have been more space effiecient using DP tabulation but there was no time for that.

Update: Was told today that they would like to conduct a second phone interview. I think the main reason might be because the interview question ended up being not that difficult (for google) despite my interviewer trying to make it harder as we went on. It just wasn't very open ended and once I figured out the initial DP "trick" there wasn't much else to do really.