Koko loves to eat bananas. There are N piles of bananas, the i-th pile has piles[i] bananas. The guards have gone and will come back in H hours. Koko can decide her bananas-per-hour eating speed of K. Each hour, she chooses some pile of bananas, and eats K bananas from that pile. If the pile has less than K bananas, she eats all of them instead, and won't eat any more bananas during this hour. Koko likes to eat slowly but still wants to finish eating all the bananas before the guards come back. Return the minimum integer K such that she can eat all the bananas within H hours. piles = [3,6,7,11+1000], H = 8 speed - 4 (1 + 2 + 2 + 3) = 8 129. 1 + 1 + 1 + 1+ 7 Ouput - 4

Round 1. - Multiply two very big string numbers a*b - one random easy(not common) problem to code on leetcode Round 2: LLD for different subscription plans and for a specific plan - avail benefits (I got it wrong here - question was expected to be solved with Decorator Design pattern while my solution was strategy/factory based)