That book, unfortunately, is too "basic" these days. There is plenty of conflicting information regarding that but Google is said to have the most complicated c

That book, unfortunately, is too "basic" these days. There is plenty of conflicting information regarding that but Google is said to have the most complicated coding problems, including dynamic programming. The really stupid thing about a lot of such problems is that implicitly they require pattern recognition and probably even memorization. For example, solving the problem of finding a duplicate number in an array/list with O(n) time and O(1) space complexity is pretty hard, in my opinion. Even knowing the required data structures doesn't help a lot unless you know the trick with fast and slow pointers. To be fair, this particular pattern is well-known and should be in your algorithmic toolbox if you're aiming for FAANG, but the whole situation is a bit strange.