Learn how to use greedy algorithms to solve coding challenges, make locally optimal choices at each stage, and tackle various coding problems. The course covers topics such as bulbs, highest product, disjoint intervals, largest permutation, meeting rooms, distribute candy, seats, assign mice to holes, majority element, and gas station. The teaching method includes tutorial videos with timestamps for each topic. This course is intended for individuals interested in mastering greedy algorithms and preparing for coding interviews at tech companies.
Overview
Syllabus
) Greedy introduction.
) Bulbs.
) Highest product.
) Disjoint intervals.
) Largest permutation.
) Meeting rooms.
) Distribute candy.
) Seats.
) Assign mice to holes.
) Majority element.
) Gas station.
) End.
Taught by
freeCodeCamp.org
