General Questions about leadership principle, 3 coding questions and 1 system design question
Software Developer Ii Interview Questions
6,461 software developer ii interview questions shared by candidates
Two sorted arrays. you can start from any one them, and then at common element you may or may not jump to other array. Continue in this manner till you reach the end of an array. Find the path that results the maximum sum.
Given an array of items of three different colors red, green, blue. How would you sort the items in the array so that all the items with a certain color would be grouped together.
How would you find a duplicate number in a very large unsorted array of ints.
Given a set of strings. Check if a new string is equal to any of them. Here equal means the letters are the same, like abbc=bacb
How can you solve n^m efficiently only using +, -, *, /.
How would you reverse a linked list in Java?
Phone Interview 1: (1)Find maximum height of BST. This is easy using recursion. Then he asked me to do it iteratively, which I somehow managed to solve. (2)The Dutch flag problem. This was not tough. But the next question was tough. It was about finding particular keys in a dictionary. They have a custom function that tells you if a key is in the dictionary and you to find out if for given input, you get required output. For example -- The dictionary is like: {hi,hello,sir,how, are, you} And you have a function isWord(x) that tells you if a particular word is in that dictinary. So if the input is hisirhowareyou the output must be hi sir how are you I couldn't solve this problem. :(
Expectation for coding Questions: Must be sort of analytical questions testing knowledge of DS/Algos and problem-solving skills, that could be done in 65-70 minutes. Reality: Problem Solving tricky questions, I would say they are not really checking candidate's Data Structures knowledge. Standard DS/Algos can be used to come up with the sol, but again coming up with the optimised sol. is the challenging part, I feel. I though it could only be done in the given time frame with most optimised approach, only if candidate had gone through that kind of question in the past. Brute Force or Semi-optimised approach can be thought of, but coming up with most optimised approach in the given time frame, needs some serious practice and some luck too😅. According to me, either questions' difficulty level should be reduced or time can be increased.
post order traversal of a Binary Search Tree Follow up Create a BST from this post order traversed array and write test cases for this function
Viewing 11 - 20 interview questions