Skip to contentSkip to footer

Engineer Developer Interview Questions

Salaries
Interviews

467,942 engineer developer interview questions shared by candidates

First part: Given a sorted array that was "shifted", e.g., [1, 2, 3, 4] ---> [2, 3, 4, 1], write an algorithm that finds the maximum value in the array. Second part: Improve the time complexity using parallel computing.
avatar

Software Engineer

Interviewed at Microsoft

4★
Dec 15, 2016

First part: Given a sorted array that was "shifted", e.g., [1, 2, 3, 4] ---> [2, 3, 4, 1], write an algorithm that finds the maximum value in the array. Second part: Improve the time complexity using parallel computing.

These are the main technical questions that I had encountered in the two technical interviews: - Interrupt routine life time. - Pins of the SPI and its operation. - Causes of stack overflow. - Difference between memories in terms of speed/density/usage/cost/operation. -PWM operation and parameters. -Difference between startup code / boot loader. -In which memory the Interrupt vector table lies and in which position inside the memory. -Function that takes an array and eliminates any repetitive elements inside an array and returns it (find a proper way to return it). -Function that takes an array and prints another array with same size where the elements in the new array are the number of repetitive times of its indeces .in the input array. Example : Input = [1 2 4 5 6 2 4 0 2 2 3 3] output=[1 1 3 2 1 0 1 0 0 0 0 0] Explanation: 0 was repeated 1 time in the input array so we write 1 at the 0 index at the output array. 1 was repeated 1 time in the input array so we write 1 at the 1 index at the output array. 2 was repeated 3 times in the input array so we write 3 at the 2 index at the output array. 3 was repeated 2 times in the input array so we write 2 at the 3 index at the output array. 4 was repeated 1 time in the input array so we write 1 at the 4 index at the output array. 5 was repeated 0 time in the input array so we write 0 at the 5 index at the output array. ... and so on so forth
avatar

Embedded Software Engineer

Interviewed at Valeo

3.7★
Jul 10, 2016

These are the main technical questions that I had encountered in the two technical interviews: - Interrupt routine life time. - Pins of the SPI and its operation. - Causes of stack overflow. - Difference between memories in terms of speed/density/usage/cost/operation. -PWM operation and parameters. -Difference between startup code / boot loader. -In which memory the Interrupt vector table lies and in which position inside the memory. -Function that takes an array and eliminates any repetitive elements inside an array and returns it (find a proper way to return it). -Function that takes an array and prints another array with same size where the elements in the new array are the number of repetitive times of its indeces .in the input array. Example : Input = [1 2 4 5 6 2 4 0 2 2 3 3] output=[1 1 3 2 1 0 1 0 0 0 0 0] Explanation: 0 was repeated 1 time in the input array so we write 1 at the 0 index at the output array. 1 was repeated 1 time in the input array so we write 1 at the 1 index at the output array. 2 was repeated 3 times in the input array so we write 3 at the 2 index at the output array. 3 was repeated 2 times in the input array so we write 2 at the 3 index at the output array. 4 was repeated 1 time in the input array so we write 1 at the 4 index at the output array. 5 was repeated 0 time in the input array so we write 0 at the 5 index at the output array. ... and so on so forth

1. Started with a HackerRank - session 5 questions - 90 mins, not very hard After that 6 rounds of interview: 2. HR round - to understand interest level, work experience and knowledge about Booking.com 3. Technical round - pair programming on a shared code-collaborator environment, 2 programming questions (basic array and hash questions) Invited to Amsterdam - for face to face interview 4. HR round - for answering any questions, salary discussions etc. 5. Technical round - design graphite from scratch, evolved designed system to handle scaling scenarios 6. Technical round - 2 problems - a. retweet twitter tweets if newer one is an anagram of older one, b. 20 boxes - 500 GB log files on each - no processing box on server file, aggregate data on one box and parse for phone numbers - bookings. Efficiently. 7. Technical and Culture fit round: Discussed various scenarios encountered during work and how will be your behavior on them 8. HR round - offer ! - Offer very low pay, considering high cost of living NL - Amsterdam declined the offer
avatar

Software Developer

Interviewed at Booking.com

4.1★
Oct 8, 2015

1. Started with a HackerRank - session 5 questions - 90 mins, not very hard After that 6 rounds of interview: 2. HR round - to understand interest level, work experience and knowledge about Booking.com 3. Technical round - pair programming on a shared code-collaborator environment, 2 programming questions (basic array and hash questions) Invited to Amsterdam - for face to face interview 4. HR round - for answering any questions, salary discussions etc. 5. Technical round - design graphite from scratch, evolved designed system to handle scaling scenarios 6. Technical round - 2 problems - a. retweet twitter tweets if newer one is an anagram of older one, b. 20 boxes - 500 GB log files on each - no processing box on server file, aggregate data on one box and parse for phone numbers - bookings. Efficiently. 7. Technical and Culture fit round: Discussed various scenarios encountered during work and how will be your behavior on them 8. HR round - offer ! - Offer very low pay, considering high cost of living NL - Amsterdam declined the offer

Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as: [ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ] ... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists) [ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ] (Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see: http://en.wikipedia.org/wiki/File:Monotonicity_example1.png
avatar

Software Developer - (Willing to Learn Perl)

Interviewed at Booking.com

4.1★
Aug 25, 2014

Implement a function nondecreasing_subsequences() that, given a sequence of numbers such as: [ 3,6,61,6,7,9,1,7,7,2,7,7,2,388,3,72,7 ] ... will identify and return each contiguous sub-sequence of non-decreasing numbers. E.g. this example input should return this array-of-arrays (e.g. or list-of-lists) [ [3,6,61],[6,7,9],[1,7,7],[2,7,7],[2,388],[3,72],[7] ] (Each array includes a sequence of numbers that do not get smaller. The original order is unchanged.) For a visual example of a non-decreasing, see: http://en.wikipedia.org/wiki/File:Monotonicity_example1.png

Viewing 2231 - 2240 interview questions

Glassdoor has 467,942 interview questions and reports from Engineer developer interviews. Prepare for your interview. Get hired. Love your job.