Dynamic programming stores solved subproblems through memoization instead of computing the same results repeatedly.
Dynamic programming stores solved subproblems through memoization instead of computing the same results repeatedly.
More from this video
See all →Passing objects by reference lets multiple variables use one heap object without duplicating its…
Backtracking algorithms test possible options incrementally, returning to alternatives when a path…
A hash, map, or dictionary finds values through user-defined keys instead of integer indexes.
A stack serves the newest item first. A queue serves the oldest item first.
A recursive function without a base condition continues indefinitely and can cause a stack overflow.
A linked list stores each item with a pointer to the next item instead of relying on indexes.
Recursion begins when a function calls itself. Without a terminating condition, it becomes an…
Every recursive algorithm needs a base condition that tells it when to stop.
Don't lose this one
A free account saves insights like this to your Boards, and Korva resurfaces them so you actually remember.