Software Developer Interview Questions in Boston, MA | Glassdoor.co.in

Find jobs for Software Developer

Software Developer Interview Questions in Boston, MA, US

448

Software developer interview questions shared by candidates

Top Interview Questions

Sort: RelevancePopular Date

Given a binary tree with the usual left and right pointers on each node, and additionally a parent pointer, make an algorithm to discover the closest ancestor to 2 nodes on the tree.

7 Answers

Time complexity is : O(max height of binary tree) public void findCommonAncestor(Node current,int a,int b){ if(current.getKey() a && current.getKey()>b){ findCommonAncestor(current.getLeft(), a, b); }else{ System.out.println(" least common ancestor is "+current.getKey()); } }

analog76, your solution is not complete.

@clusterfudge, what do you mean by incomplete? Can you be more precise?. Common ancestor - first encounter of node value between a and b. Otherwise either you go left or right node.

count the number of duplicates in a binary tree in O(n) time O(1) space.

4 Answers

Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word.

3 Answers

How would you code up a custom rectangle detector?

5 Answers

Given a sentence input : helloworld output: HelloWorld YOu should make use of a dictionary available with you. Capitalize the dictionary words in the sentence

4 Answers

6 face dice. He rolls 1 to win, and me 6. He rolls first, what's the probability that he eventually win.

3 Answers

sorting the red and green balls.RRRRRGGGGGGGG to RGRGRGRGRGGGGG

3 Answers

1 step: 1m /2m. How many ways you can walk through a 10 meters road.

3 Answers

The coding test was difficult. They give very little time and you need to produce the correct output. This is to see how you perform under pressure.

3 Answers

same questions as mentioned by others.

1 Answer