Adobe interview questions

1st Round: 1. Interviewer said he didn't have my resume so he wants me to tell him about my career, but he has no interest in listening, no eye contact(busy doing something on his laptop) 2. inorder traversal of Binary tree without using recursion 3. to write set/get method for LRU 4. How to cover N-steps using 1/2 steps at a time The interviewer has fixed questions and answers memorized and if you are thinking and writing the code, he is not interested. He wants you to write code in a jiffy(5-10mins). He will keep giving you the look as if what is there to think. For Q3, my code was right, but since I used(iterator for list) an unordered_map<int, pair<list<int>::iterator, int>>, without even going through the code he says it won't work, because iterator cannot be used. Because he wanted me to use "node* ", a linked list using C-type implementation. There is no end of learning algorithms, and if some bunch of moron thinks they have learnt enough and know everything do a little thing called self-assessment and you will know where you stand. 2nd Round: I was asked to provide the design and implement the code for a game "Minesweeper", as I didn't know much about this game so I asked to provide more details, the interviewer just shown me by playing it once. This was so superb, I have seen her playing the game and I needed to complete the SDLC cycle in next 15-30 mins, I have written the code using assumption of course(as no constraints was being shared), but this was not even before I started.....God bless you guys....you are remarkably talented. Hope these are the kind of code used in your projects(running all your product)

Given a start and an end bound, return a list of all integers between the start and the end for which the digits are factors of the number.