SUBJECTS
May 29, 2026
Memoization and dynamic programming
explores efficient computational techniques for solving recursive problems by eliminating redundant calculations. The session demonstrates how to move from naive recursion to optimized approaches using table-based storage for computed subproblems
the backtracking algorithm using the classic N Queens puzzle
Madhavan Mukundan explores the backtracking algorithm using the classic N Queens puzzle. The session demonstrates how to systematically search for solutions by building candidate steps and undoing them when reaching dead ends, optimizing the process for efficiency.
how to manage runtime errors in Python using
Madhav Mukund explains how to manage runtime errors in Python using try and except blocks to prevent program termination
assignment statement, basic types - int, float, bool
assignment statement, basic types - int, float, bool
Subscribe to:
Posts (Atom)