Although I have all the questions from all the interview stages documented in a word file, I am not sure if I am allowed to reveal them here. But to give you a hint, I will paste only a few questions here: Interview 1: how does traceroute work? difference between big endian and little endian (with example)? BSD vs GPL vs LGPL vs FSF vs GNU? 255 & 42 = ? solve in 15 sec 11 << 2 = ? solve in 15 sec what is TTL in a packet? give examples of functional programming languages what other language runs on JVM? Interview 2: write code for fibonacci series. later, improve it. On-site Interview: (can't disclose)
Perguntas de entrevista de Mobile Software Engineer
352 Perguntas de entrevista compartilhadas pelos candidatos | mobile software engineer
Algorithms question was probably the trickiest thing. Given an array of integers of length N from 1 to N-1, how would you detect a single duplicate in the array?
Implement a Sudoko puzzle validator - given a 9x9 matrix of numbers (1-9) and "." for empty spaces, return true for a valid puzzle matrix and false if it would not be a valid sudoku puzzle.
What's the angle between the hands of a clock if the time is 3:15.
Implement Integer.parseInt from scratch
Hardest Q was: Here's a binary tree: find the longest path within it. So, find a path between any two leaf nodes, where the path is the longest.
dispatch queues … what are they and how do they work?
2nd skype: - Lets say you have to build an activity (screen) which has a drop-down & once you select an item in the drop-down, it loads an image corresponding to that on the screen below. - How will handle cases where user is very rapidly changing his selection from the drop down
Involved copying a linked list. The tricky part though was the objects in the list could refer to one another.
If one has a collection of N stock options vesting over P periods, describe algorithmically how one would come up with the data for a table listing how many options are awarded per period.
Exibindo 1 a 10 perguntas de entrevista