For the coding part of the interview, it was a sorting algorithm style problem where there were some unique constraints given on how to sort the objects. It involved a combination of DSA and OOP. For the discussion parts of the interview, it was mostly design and architectural type questions. Event driven architecture, message queues vs. cache, etc.
DSA problem solving questions and the previous projects that I have worked.
They don't look at your resume from one interview to the next, so be prepared to review it each step of the way.
Describe some challenges you encountered during your graduate studies and how did you solve them?
Tell me a little bit about yourself.
Tell me about a time questions
Discuss a time where you made a professional error that affected others. How did you deal with the consequences and what were the lessons you learned?
What you have beed done in your phD is different from what we are doing in here. How can you contribute in this company?
Tell me about your past work experience.
You are given an array `board` of length N, describing subsequent positions on a game board from left to right. Every position is either empty (represented by 0 in the array) or contains a single game piece (represented by 1). Each game piece can be moved at most once. A move means going one or more positions to either the left or the right. Pieces cannot capture (occupy another piece's position) or jump over each other. When the game piece is moved by X positions (either left or right), we say it travels distance X. Also, pieces can be moved in any order, but they must be moved only one at a time. What is the maximum possible distance that the game pieces can travel altogether? Examples: [1, 1, 0, 0, 1] = 4; [0, 1] = 1; [0, 0, 0] = 0 N is an integer within [1..40000]. `board` only contains integers within [0..1].
Viewing 3321 - 3330 interview questions