SDE1 Interview Questions
- 10of 10 votes
AnswersGiven 3 unsorted arrays A, B and C you need to find all possible combinations such that A[i] + B[j] = B[k] + C[l].
- venkataratnamkumar7777 September 22, 2018 in United States| Report Duplicate | Flag | PURGE
Walmart Labs SDE1 Algorithm Arrays - 1of 1 vote
AnswersThere are n number of stones. Each stone has a weight associated with it. 1st stone’s weight is 1, 2nd stone’s weight is 2.. and so on. You are given an integer x. You need to pick the maximum number of stones such that the total weight of stones picked is less than x.
- shivamdurani220 September 14, 2018 in India
You’re also given an array of stones which you can not pick.?| Report Duplicate | Flag | PURGE
Microsoft SDE1 - 0of 0 votes
AnswersRemove 3 or more consecutive characters from a string, repeat until there are no more.
- kqiann August 17, 2018 in United States
eg.
ABCCCCBBA => ABBBA => AA| Report Duplicate | Flag | PURGE
Bloomberg LP SDE1 String Manipulation - 0of 0 votes
AnswerGiven two arrays. One is for tasks (Processes) and each element depicts the amount of cores required to run the task. 2nd array is an array of CPU where each element depicts the no of cores in it.We have to tell how many maximum number of tasks can be allocated. Example: Task: [3, 5, 7], Cores: [1, 3, 5] . Here only task 0 and 1 can be allocated to CPU 1 and 2 . So, answer=2.
- Anil Kumar July 23, 2018 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 - -2of 4 votes
AnswersDid any one took Microsoft Online Technical Screen ?? What questions I can expect in this test ??
- Tom July 07, 2018 in United States| Report Duplicate | Flag | PURGE
Microsoft SDE1 - 0of 0 votes
AnswersGiven a BST of memory sizes. Find best fit for a memory block of size M.
- akisonlyforu June 11, 2018 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 Data Structures - 0of 0 votes
AnswerGiven an infinitely large array and every element has tags associated with them, and there are about 10,000 tags (say) then sort the given array to get all tag-0’s first, tag-1’s next and so on in O(n).
- Ankita June 10, 2018 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 Algorithm - -1of 3 votes
AnswersFor Amazon SDE-1 On Campus Interview, what are the topics I should study in Database Management ?
- akisonlyforu June 08, 2018 in India
Just don't name the topics. Please elaborate too.| Report Duplicate | Flag | PURGE
Amazon SDE1 Database - 1of 1 vote
AnswersGiven k, and a binary string, determine if this contains all permutations of length k.
- ajay.raj May 24, 2018 in United States
For example, 11001 contains all possible binary sequences with k=2 (00,01,10,11)| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswersYou have been given a generator string ab from which any number of strings can be generated recursively by inserting ‘ab’ at any location. You have been given an input string to check if that given string is valid or not.(i.e. generated by given with given string.)
- akisonlyforu May 22, 2018 in India
eg.
Input: aabbab
Output: valid
Input: abbaab
Output: Invalid
I could not come up with a algorithm less than O(N*N)| Report Duplicate | Flag | PURGE
Amazon SDE1 Algorithm - 0of 0 votes
AnswerGiven a multiple tree, and multiple nodes that need to be deleted,
- ajay.raj May 17, 2018 in United States
It is required to return a list of nodes so that the children of these nodes can be found after the nodes have been deleted.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersGives you an int m, and a set of char (0,1,2,3,4,5,6,7,8,9)
- ajay.raj May 17, 2018 in United States
Lets you implement a function that generates a id based on the characters in the set. Each time you return a string, it must be unique. satisfying the same character can not appear consecutively more than m times, such as m = 3, "1000" is valid,
"0000" is not valid.
The smaller the string, the better.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersLet’s say you have two input arrays with sorted elements. Find the union.
- prasad.hybris May 16, 2018 in United States
a[] = {2, 10, 14, 19, 51, 71}
b[] = {2, 9, 19, 40, 51}
Union = {2, 9, 10, 14, 19, 40, 51}| Report Duplicate | Flag | PURGE
Amazon SDE1 Java - 0of 0 votes
AnswersA group of friends are tracking the miles per gallon for each of their cars. Each time one of them fills up their gas tank, they record the following in a file: His or her name The type of car they drove How many miles driven since they last filled up How many gallons purchased at this fill up Date of the fill Their data is formatted as a comma separate value (csv) file with the following format for each row:(#person,carName,milesDriven,gallonsFilled,fillupDate) Miles are recorded as floating-point numbers and gallons as integers. Please create a program that allows members of this group to determine the miles per gallon (MPG) of each of their cars during a specific time range. Note: person may have more than one so a time range query might need to output data for one or more cars. A skeleton class will be provided; your job will be to complete the program. The principal function for querying MPG is of the form (the exact name, data types, etc., can be learned by inspecting the "solution" class in the skeleton code): GetRangeMPG(PersonName, StartDate, EndDate) Returns list of objects containing (CarName, MPG) MPG is calculated as (total miles traveled during time period)/ (total gallons filled during time period. The dates you receive in the query should be treated inclusively.
- pragramticProgrammer May 15, 2018 in United States| Report Duplicate | Flag | PURGE
Amazon SDE1 .Net/C# - 1of 1 vote
AnswerTo push dominoes, find out how many dominoes are standing in the end
- ajay.raj May 15, 2018 in United States
For example, the input is ".R...RL..R..L..", which means pushing the 2nd, 6th, and 12th dominoes to the right and pushing the 8th and 15th dominoes to the left. This example returns 4th. 1,7,16,17 blocks are standing| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersThe question is that there are a lot of vm, what is the total vm consumption max. For example, (2,4,8), (3,5,3) this input,
- ajay.raj May 15, 2018 in United States
This means that 2 to 4 seconds have a memory usage of 8 and 3 to 5 seconds of 3, so the answer is 11 at 3 seconds.
Return 11 to it. Note that (1,2,3) and (2,3,4) such that the middle 3+4=7 is good.
Follow up is usage is not constant, such as (1,2,1,2) the first second usage is 1,
The second second is 2, the linear increase, the highest is how much.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswersGiven as list of movies in a csv file, extract the movie name and genre and be able to return a query based on the years and the genre.
- pragramticProgrammer May 13, 2018 in United States
Basically, Parsing a CSV input file and build an indexed data storage to allow search the data in time manner.| Report Duplicate | Flag | PURGE
Amazon SDE1 .Net/C# - 0of 0 votes
AnswersGiven a list of tasks each with memory requirements and time, only one machine has K memory.
- ajay.raj May 12, 2018 in United States
Do not consider the context switch, page swap, virtual memory, (for example, the machine has only 20mb memory, a task that requires 25MB of the task can only wait until there is enough memory to run it.) The running task cannot be suspended.
Ask how long it takes to complete all these tasks. . .| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersHow many squares are inside a m*n rectangle where some grids in the rectangle were grey and the gray grid could not appear in the small squares.
- ajay.raj May 03, 2018 in United States| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersGiven an int array, check if all the numbers can be divided into 5 consecutive numbers.
- ajay.raj May 03, 2018 in United States
Eg: [1,2,2,3,3,4,4,5,5,6] Yes: (1,2,3,4,5) (2,3,4,5,6)
Followup: ask if you know that all the numbers are between 1 and 13,
what's a good optimization.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswerYou have two matrixs, how to move the first matrix
(move up, down, left, and right) so that the two matrix in the two matrixs match most.eg: matrix 1: matrix 2: 0 0 1 0 0 0 0 1 1 1 1 0 0 0 0 1 1 0
Then, after taking matrix1 (1 left shift + 1 down),
- ajay.raj May 03, 2018 in United States
the number of 1 in the match with matrix2 is 3| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
Answershow to check if two graphs are structurally identical
- ajay.raj May 03, 2018 in United States
class UndirectedGraphNode {
List<UndirectedGraphNode> neighbors;
UndirectedGraphNode() {
neighbors = new ArrayList<>();
}
}| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
Answersconvert a Sorted array to complete BST
- ajay.raj May 02, 2018 in United States| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswerGive a connected graph, no cycle,
- ajay.raj May 01, 2018 in United States
Find the node where the average distance from all other nodes is the smallest| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswerInput: an int array without sorting, then do a binary search on it, and find the number of digits that cannot be found by binary search.
- ajay.raj May 01, 2018 in United States| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
Answers<key = "a"; val = "3"; depend_list = null;/>; <key = "b"; val = "a * a";
- ajay.raj May 01, 2018 in United States
Depend_list = {a};/>; <key = "c"; val = "a * b"; depend_list = {a,b};/>;
Lets output a map<key, value>,a -> 3, b -> 9, c -> 27
Follow-up questions: Make a statistic for all keys and corresponding map entries with the same value.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswersGiven an array, find an x such that all numbers less than x are equal to themselves. Numbers greater than it are equal to x, and all numbers add up to a target
- ajay.raj May 01, 2018 in United States
For example, [1 3 5 7 9] target=24, answer is8. Because when x=8, the array has only 9>8, so 1+3+5+7+8=24 is the closest to the target.| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 0 votes
AnswerGive an N-length array with only 0 and 1 inside
- ajay.raj May 01, 2018 in United States
Requires to find the minimum number of conversions needed to convert the array to 0 before all 1.
The conversion is to change a 0 to 1 or a 1 to 0,
And the number of 0 and 1 in the converted array can be arbitrary.
Just find the minimum conversion step| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswerGiven list of schedules for different flights in a month, determine maximum number of flights that can be in the air anytime in that month.
- sanjureddy.v April 14, 2018 in United States
Input : list of schedules for flights.- spread over a month.
output: a number - maximum flights that can be in the air
Assumptions: 1. All the given times are in a specific timezone( like GMT).
2. Given Schedules can be any time in the month| Report Duplicate | Flag | PURGE
Google SDE1 Algorithm