Lesson 12 of 15 • 2 upvotes • 5:46mins
After learning how to create solutions for each and every state and then levelling them up to the required final state in Dynamic Programming, this lesson we learn a method called Greedy Algorithms. While similar to Dynamic Programming in a few aspects Greedy algorithms works much faster. In this lesson understand what is a Greedy Strategy and the required properties which are explained with the help of an example. This lesson also talks about the difference in the solution using Greedy Strategy and using Dynamic Programming.
15 lessons • 1h 48m
Overview Of The Course: Ultimate Guide To Acing A Coding Interview
2:47mins
Starting With Linked Lists
6:30mins
Typical Problems On Linked Lists
8:54mins
Binary Trees: Meaning And Associated Terminology
6:03mins
Binary Search Trees: Writing, Traversing And Deleting
7:10mins
Heaps: Meaning, Types & Implementation
7:49mins
Importance Of Binary Search
6:42mins
Mergesort: Meaning & Implementation
8:03mins
Quicksort: Meaning & Coding
8:53mins
Introduction To Dynamic Programming
7:06mins
Levelling Up In Dynamic Programming
9:52mins
Learn The Greedy Programming Paradigm
5:46mins
Learn Bitwise Operations Tricks
8:23mins
Introduction To Graph Theory
6:04mins
Breadth First Search And Depth First Search
8:51mins