Course Contents
(0:00:00) Greedy introduction
(0:04:32) Bulbs
0:12:11) Highest product
(0:17:08) Disjoint intervals
(0:28:43) Largest permutation
(0:38:30) Meeting rooms
(0:49:25) Distribute candy
(1:03:13) Seats
(1:19:13) Assign mice to holes
(1:24:19) Majority element
(1:35:28) Gas station
(1:52:39) End
Greedy Algorithms Tutorial – Solve Coding Challenges
freeCodeCamp
via YouTube
Learn how to use greedy algorithms to solve coding challenges. Many tech companies want people to solve coding challenges during interviews and many of the challenges can be solved using a greedy algorithm. A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage.
Instructor(s)
Tanishq Chaudhary