It was a great session organized by Linux World.
Thank you Preeti Ma'am and Vimal Sir for organizing this session, it helped in clearance of many myths and doubts.
Learned lots and lots of new concepts.
- space complexity and time complexity helps in determining the amount of space and time required
- it can also help in optimization of app
- Richard bellman
- some important modules to get important information about the code, like timeit, line profiler
- multi stage division process is the process of dividing a bigger problem it subproblems.
- overlapping it means in a subproblem If same subproblem is solved again and again.
- dynamic programming we divide the problem into smaller problems abd them combine the solutions to get thr final solution.
- backward induction Is reasoning backward in time from the end of a problem to determine a sequence of optimal operations.
- Dynamic programming is an approach
- Recursion and Memorization is used to achieve it.
- it takes more memory because of memorization
- bottom-up approach takes more time
- choosing between top-down and bottom-up is dependent on the given problem
- dp resolves the problem of overlapping but Divide and conquer don't
- dynamic programming provides optimal solution.
