!rant
Explaining bellman equations to a n00b

!rant

I heard you like bellman equations...

so we put a bellman equation in a bellman equation, so you can maximize while you maximize

having a DSA interview in 2 days, any suggestions on how/what to prepare?

its been years since i tried solving coding problems with anything apart from strings or arrays( and that too the one we use in dev, like writing a function to convert string to uppercase, that's all i remember)

There are a million algorithms: knapsac, djikstra, DFS BFS, bellman ford, TRIE, BST, quick sort, merge sort, insertion , binary search... these are some buzz words i could remember from my early college days, 6 years ago. I was able to understand and learn them at that time, but now i know shit about them :/

How to go with all of these in 48 hours?