I got asked following two questions in the 105 minute time limit on hackerrank:\n\n* Storage Optimization or [Maximum Area after Horizontal & Vertical cuts](https://leetcode.com/problems/maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts/) - Greedy based solution. \n* [CloudFront Caching](https://aonecode.com/oa-cloudfront-caching) - Underlying problem is to find different connected components in a graph.\n\nI implemented both questions but was failing 1 test-case in both of them. Not keeping my hopes high.

I got asked following two questions in the 105 minute time limit on hackerrank:\n\n Storage Optimization or Maximum Area after Horizontal & Vertical cuts - Gree