Case part was most difficult, especially since there was not enough time to think it through.
Development Intern Interview Questions
5,458 development intern interview questions shared by candidates
Given list of words, some of which are anagrams (words that has the same letters, but different ordering, eg. CAT and ACT), how do we pair the anagrams and identify words that do not have anagram pair in one pass (going through the list once)
behavioral-why does your background fit this role
Reversi / Othello Game Logic: You receive a board size n and a series of moves. You have to simulate the game mechanics of Othello/Reversi. This involves placing a piece, checking all 8 directions (vertical, horizontal, diagonal) for opponent pieces, and "flipping" them if they are sandwiched between your pieces. You had to return the final score of Black vs. White pieces.
Pretty simple questions on basic data structures, OOP and a couple of coding problems.
Sometimes the interviewer would not talk, but it is to let you do all the talking.
The most unexpected question for me was about networking: Given two IP addresses and one subnet mask as input (All are string data type), write a function to determine whether the two IP addresses are in the same subnet.
Interview 2: Like the first interview this one started with basic cv questions and a simple coding question. Then moved onto a longer question that was basically weighted graph search but the edge weights were dynamic. Harder than the first interview but still not too difficult compared to other companies. I'd say about similar in difficulty to google but easier than palantir.
Interview 1: Started with basic cv chit-chat and discussing projects. Was asked general information (complexity and high level implementation) about data structures you'd expect to find in standard libraries. Continued on to a super simple coding question that was something like reversing a string in place. Then had a longer coding question that was a variant on the subtree sum problem and could be made to run in O(n) time with some preprocessing. Overall not particularly difficult.
Classic interview question about matrixes sorted row and column wise.
Viewing 3331 - 3340 interview questions