Development Engineer Interview Questions

37,130 development engineer interview questions shared by candidates

Given an input string, return whether or not the string contains balanced brackets where bracket characters are (), []. {}. The input string can contain alphanumeric characters in addition to the bracket characters.
avatar

Software Development Engineer-II

Interviewed at Expedia Group

3.7
Feb 16, 2018

Given an input string, return whether or not the string contains balanced brackets where bracket characters are (), []. {}. The input string can contain alphanumeric characters in addition to the bracket characters.

1) Implement atoi 2) correct bug in the code that deletes head from linked list 3) Given string of digits like "72388" and int n, delete n characters from the sting such the resulting string contains minimal number representation, you must preserve relative position of digits. Example: if st="72388" and n=2, the answer is 238.
avatar

Software Development Engineer

Interviewed at Microsoft

4
Sep 29, 2015

1) Implement atoi 2) correct bug in the code that deletes head from linked list 3) Given string of digits like "72388" and int n, delete n characters from the sting such the resulting string contains minimal number representation, you must preserve relative position of digits. Example: if st="72388" and n=2, the answer is 238.

Round1 : 1) Given a list of words, group them by anagrams Input: List of "cat", "dog", "god" Output: A Set of Sets of anagrams: {{'cat'}, {'dog', 'god'}} 3) Consider adding some additional tests in doTestsPass(). 4) Implement the AnagramSolution group() method correctly. 5) If time permits, try to improve your implementation. dog -> dgo -> {dog} god -> dgo -> {dog, god}
avatar

Senior Software Development Engineer

Interviewed at Expedia Group

3.7
Feb 27, 2020

Round1 : 1) Given a list of words, group them by anagrams Input: List of "cat", "dog", "god" Output: A Set of Sets of anagrams: {{'cat'}, {'dog', 'god'}} 3) Consider adding some additional tests in doTestsPass(). 4) Implement the AnagramSolution group() method correctly. 5) If time permits, try to improve your implementation. dog -> dgo -> {dog} god -> dgo -> {dog, god}

Round3 : Question1 : How will you implement your own ThreadPool using jdk1.4like that of Executor in jdk1.5 Question2: How will you convert a monolithic application like makemytrip into Microservices? Question3: We have less number of resources for the tasks, so are you ready to work in odd extended hours?
avatar

Senior Software Development Engineer

Interviewed at Expedia Group

3.7
Feb 27, 2020

Round3 : Question1 : How will you implement your own ThreadPool using jdk1.4like that of Executor in jdk1.5 Question2: How will you convert a monolithic application like makemytrip into Microservices? Question3: We have less number of resources for the tasks, so are you ready to work in odd extended hours?

with that go like this: you have an array of string you should print all the word by group. group define: by the same letters and the same number of repeated letter like example: dad,add,dda in same group it should be in O(N)
avatar

Software Development Engineer

Interviewed at Microsoft

4
Jul 8, 2021

with that go like this: you have an array of string you should print all the word by group. group define: by the same letters and the same number of repeated letter like example: dad,add,dda in same group it should be in O(N)

Java Singleton (volatile, synchronize), HashMap, Heavier coin, segregate odd & even number from array list, left view of binary tree, remove larger element from right side of linked list. Reverse a singly linked list,
avatar

Software Development Engineer

Interviewed at Zilingo

3.3
Nov 12, 2017

Java Singleton (volatile, synchronize), HashMap, Heavier coin, segregate odd & even number from array list, left view of binary tree, remove larger element from right side of linked list. Reverse a singly linked list,

Viewing 931 - 940 interview questions

Glassdoor has 37,130 interview questions and reports from Development engineer interviews. Prepare for your interview. Get hired. Love your job.