- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization ♣
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Recursion / Memoization »
Memoization is storing the result of a function call. To memoize a function we create a cache dictionary. Python lru_cache decorator automatically memoize function. Only pure functions can be memoize.
What is memoization? How can you implement memoization? What is Python's built-in decorator for memoization? What type of functions can be memoize?
Click to Flip Card
