Lectures related to Knapsack Problem: Optimization and Traveling Salesman

Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.

Covers the time complexity of algorithms and includes a quiz.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.

Explores optimizing exponentiation in modular arithmetic for efficient calculations and prime number determination.