1. Given Linked list as number, return head node which will flatten to next number and handle all edge cases. e.g 1->2->3 = 1->2->4 1->9->9 = 2->0->0 2. Kth largest number in stream. 3. Decorator, Observer and Singleton Design pattern and scenarios. 4.Distance between two nodes in binary tree. 5.In list of string, find character which occurs in most strings. 6. Library Management 7.Unique Question which i am not able to solve and didn't understand problem correctly given binary string, find min flips to make string with all 0's on left and 1's on right e.g. given by him 1010 --> 0010 --> 0011 --> ans = 2 00001100000 --> 00000100000 --> 0000000000 --> ans = 2 101 --> 001 --> ans = 1
