The interview started with a general introduction and then I was given the problem statement to read and then
explain the approach. Also, the interviewer asked me the internal implementations for the sets,
hashmaps, and a thorough discussion on the time complexities of the mentioned DS.

Here are the coding problems.

1. https://leetcode.com/problems/longest-consecutive-sequence/
2. Follow up for the 1st question which was:
		  i) How would you do this for a stream of numbers?
		  ii) What would be the time complexity for the solution?