Given two binary trees T1 and T2. Find if T2 is a sub-tree of T1.
Software Development Programmer Interview Questions
33,153 software development programmer interview questions shared by candidates
Make a program that writes a Binary Search Tree to a file. Now create a program that reads those files and recreates a Binary Search Tree.
You are given an array of numbers. You need to print the length of the maximum continuous sequence that you encounter. For example if input is [3,8,10,1,9,6,5,7,2 ], the continuous sequences are{1,2,3} and {5,6,7,8,9,10} the latter is the longest one so the answer becomes 6. O(n) solution was asked for, assuming you have a hash map which supports O(1) insertion and fetching operations
Signed an NDA, so I will not post the questions.
I signed NDA for online assessments. For the phone interview, questions about DS and string manipulation. Should be good if can solve medium level HackerRank or Leetcode problems.
Given a set of N numbers, assume that you have the set of numbers from 1 to N+1, with the exception of one number. How do you determine what number that is? What is the complexity of your solution?
Since this was a testing interview and not full out development he had some testing terms I had never heard of these include: Equivalence Class Testing Pair Wise Combinatorial Testing Failure Mode Analysis the only one I heard of was: White Box vs Black Box testing The coding portion was not difficult the question was this Write a function that takes two lists of strings and return a list of Strings with all of the intersections of the strings ex: List1 = {"a","a","a", "b", "d"} List2 = {"a", "a", "c", "d"} expectedReturn={"a","a","d"} Also he asked what tests cases I would use to validate the function also he wanted to know the run time analysis of the function
i) Given a value v, in a BST find the next value in order.
Find k largest/smallest number in a series of numbers. What data-structures will you use? Code it on white board.
* Merge two sorted linked list. The merged list should also be sorted. * Compact a string. i.e remove spaces * traverse a link list containing char* as data. test cases for the same. * reverse a string. test cases for the same. * remove all the given characters from a string.
Viewing 71 - 80 interview questions