Software Development Engineer I Interview Questions

1,214 software development engineer i interview questions shared by candidates

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Aug 3, 2015

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set. get(key) - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. set(key, value) - Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.

Given a parking lot of fixed size, made up of a number of rows of spaces, and different vehicle sizes (e.g. car = 1 spot, bike = 1/2 spot, van = 2 spots, bus = 4 spots), develop an algorithm to determine the optimal place to park for any entering vehicle.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
Jul 22, 2014

Given a parking lot of fixed size, made up of a number of rows of spaces, and different vehicle sizes (e.g. car = 1 spot, bike = 1/2 spot, van = 2 spots, bus = 4 spots), develop an algorithm to determine the optimal place to park for any entering vehicle.

Bar raiser 1. Given array of numbers, find a, b, c such that a + b = c. Can you beat O(N**2) ? 2. Difference between Quick sort and Merge sort. What modifications you make in Quick sort so that it provides O(N lg N) worst case complexity.
avatar

Software Development Engineer I

Interviewed at Amazon

3.5
May 24, 2011

Bar raiser 1. Given array of numbers, find a, b, c such that a + b = c. Can you beat O(N**2) ? 2. Difference between Quick sort and Merge sort. What modifications you make in Quick sort so that it provides O(N lg N) worst case complexity.

Viewing 31 - 40 interview questions

Glassdoor has 1,214 interview questions and reports from Software development engineer i interviews. Prepare for your interview. Get hired. Love your job.