u/oneradsn wrote (the comment Michael replied to):
Is it true they stopped asking DP?
u/michaelnovati replied · · edited
So they don't ask super hard questions that can only be solved with DP. Like coin change and knapsack. They fall in the bucket of problems.that is like "recursion with memoization" and someone who has never heard of DP would be able to solve brute force and then add in memoization with some hints. If people figured this stuff out without using the word DP, it was impressive because they solved the problem on the spot.
Graphs are similar. You need to know BFS and DFS and how to track visited nodes, but you don't need to know any complex off the shelf graph algorithms.