"Section 17: Greedy Algorithm"

📚 Vanakkam DSA Course (24 sections) · Hope AI — ML & DS Course

Section 17: Greedy Algorithm

Greedy algorithms make locally optimal choices at each step with the hope of finding a global optimum.

Lessons

#Lesson NameDurationNotes
1Intro to Greedy Algorithm42m 17s
2Two City Scheduling23m 1s
3Assign Cookies16m 13s
4Lemonade Change25m 39s
5Best Time to Buy and Sell Stock II17m 22s
6Insert Interval28m 38s
7Merge Intervals23m 3s
8Partition Labels38m 21s
9Non Overlapping Intervals26m 39s
10Task Scheduler39m 29s
11Gas Station43m 29s
12Car Pooling27m 42s
13Candy - Two Pass34m 11s
14Candy - One Pass21m 49s

Lesson Checklist

  • [ ] Intro to Greedy Algorithm (42m 17s)
  • [ ] Two City Scheduling (23m 1s)
  • [ ] Assign Cookies (16m 13s)
  • [ ] Lemonade Change (25m 39s)
  • [ ] Best Time to Buy and Sell Stock II (17m 22s)
  • [ ] Insert Interval (28m 38s)
  • [ ] Merge Intervals (23m 3s)
  • [ ] Partition Labels (38m 21s)
  • [ ] Non Overlapping Intervals (26m 39s)
  • [ ] Task Scheduler (39m 29s)
  • [ ] Gas Station (43m 29s)
  • [ ] Car Pooling (27m 42s)
  • [ ] Candy - Two Pass (34m 11s)
  • [ ] Candy - One Pass (21m 49s)

My Notes

Add your key takeaways here...
← S16 — BacktrackingS18 — Dynamic Programming →