Loading lesson path
Named after the ancient Greek mathematician Euclid, the Euclidean algorithm is the oldest known non-trivial algorithm, described in Euclid's famous book "Elements" from 300 BCE. The Euclidean Algorit…
Huffman Coding Huffman Coding is an algorithm used for lossless data compression. Huffman Coding is also used as a component in many different compression algorithms. It is used as a component in los…
The Traveling Salesman Problem The Traveling Salesman Problem states that you are a salesperson and you must visit a number of cities or towns. The Traveling Salesman Problem Rules : Visit every city…
The 0/1 Knapsack Problem The 0/1 Knapsack Problem states that you have a backpack with a weight limit, and you are in a room full of treasures, each treasure with a value and a weight. To solve the 0…
Memoization Memoization is a technique where results are stored to avoid doing the same computations many times. When Memoization is used to improve recursive algorithms, it is called a "top-down" ap…
Tabulation
Dynamic Programming
DSA Greedy Algorithms