Round 1:

1. House Robber - 1
2. OOD Design question -> Input is ID. Assume a black box function which returns list of connected IDs. The data type of above function I need to assume optimally. I have another func which tells me list of products brought by an ID. Again datatype needs to be assumed optimally. I need to print order of products brought in desc order based on frequency.
3. 2 LP Questions

Round 2:

1. Given list of extensions and connectors required to convert one extension to another. Find if its possible to convert one extension to another.
   Eg:
   extn1 can be converted to extn2 using convertor C1
   extn2 can be converted to extn3 using convertor C2
   extn1 can be converted to extn3 using convertor C3
   extn3 can be converted to extn4 using convertor C4
   Print the sequence of convertors used.

2. Connect left neighbour of Binary tree.

Round 3: (Bar Raiser)

1. Given a string and set of strings check if all the strings in the set exists in the main string.
   Eg: s="abcfhgffgdfgahgd"
   set={a,abc,fgafhg}
   Ans-> True
2. 3 LPs & follow ups.