- https://leetcode.com/problems/longest-consecutive-sequence/\n- Design Minesweeper\n- Top K frequent elements given an Array of elements. What if you are getting a continuous stream of data? What if the Array is too big to fit in memory\n- Design a stock notification system. An application which received data from a stock exchange continuosly and answers following user queries:\n\t- Current price of any stock\n\t- Top K movers of the day\n\t- Historic chart of a stock (1D, 5D, 1month, 1Yr etc)

https://leetcode.com/problems/longest-consecutive-sequence/\n- Design Minesweeper\n- Top K frequent elements given an Array of elements. What if you are getting