We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Greedy Florist
  5. Discussions

Greedy Florist

  • sant_mandar
     + 0 comments
    1. Sort array ascending which is default.
    2. Make multiple groups of k elements each, from right to left.
    3. Iterate left to right within each group.
    4. Increase previous purchase by one after iterating each group.