https://www.rik-kisnah.ai/tags/greedy/Recent content in Greedy on Rik Kisnah - BlogHugoenTue, 07 May 2019 09:00:00 -0700https://www.rik-kisnah.ai/teach/coding/merge-intervals/Tue, 07 May 2019 09:00:00 -0700https://www.rik-kisnah.ai/teach/coding/merge-intervals/Sort your meetings by start time, then walk the calendar once. If the next one starts before the current one ends, stretch. This one shape covers half of all scheduling questions.https://www.rik-kisnah.ai/teach/coding/intervals/Tue, 27 Mar 2018 09:00:00 -0700https://www.rik-kisnah.ai/teach/coding/intervals/Start and end pairs: meetings, bookings, ranges. Sort them and the mess becomes a line you walk once. Sort by start to merge. Sort by end to pick the most that fit. The only question at each step is whether the next one starts before the current one ends.https://www.rik-kisnah.ai/teach/coding/best-time-to-buy-and-sell-stock/Tue, 14 Mar 2017 09:00:00 -0800https://www.rik-kisnah.ai/teach/coding/best-time-to-buy-and-sell-stock/Prices for each day. Buy once, sell once later, make the most money. Walk the days once, remembering only the cheapest price so far. The lesson is what to carry and what to throw away.https://www.rik-kisnah.ai/teach/coding/container-with-most-water/Tue, 08 Nov 2016 09:00:00 -0800https://www.rik-kisnah.ai/teach/coding/container-with-most-water/Vertical walls of different heights. Pick two that hold the most water between them. Start with a finger at each end and always move the shorter wall inward. Same shape as sorted Two Sum, and the lesson is why the move is safe.