Write code to permute a string. I've been programming for 30 years, 20 in games. I have written code to do permutations exactly ... 0 times! It's not all that trivial. I recognized it needed recursion, but I whiffed under the interview pressure. Later looked it up and found he was giving me hints that aren't even in the basic algorithm. I guess I was either unlucky or fortunate (I wasn't at all convinced yet I'd want to work there).
One of the interviewers asked me a design question that was very far afield of my expertise, and I winged it as best I could -- after doing my best with that question, I bowed out of further consideration for that, and he gave me a much more general design question that was a bit of a softball, and I asked him some pointed questions regarding Amazon's distributed design ethos. The fact that the initial question was so far afield of my resume makes one question if that is the point, or if
In my field, ask more about bit field, linked list and hardware debugging skill, like i2c spec, but the most difficult one is to find all errors in a function.
Determine if a string containing block-delimiters "([{<>}])" is balanced. In this case, it is.
Represent the tail command programmatically Print the last 10 lines of server.log
1. Framework currently you are using. 2. What are your contributions to the framework. 3. Java concepts with coding examples 4. Gradle vs Maven, Git vs SVN, Cucumber, BDD vs TDD. 5. Advantages of using BDD
Why I wanted to to work for PaperG, algorithm questions, etc
Questions on Recursions.
Tell me 5 things you don't like about it
What do you know about Bookee?
Viewing 531 - 540 interview questions