To find least common ancestor in a binary search tree
Development Interview Questions
137,213 development interview questions shared by candidates
Implement atoi
Given two sets of numbers find the elements in A that appear in B (set intersection)
Write a function that returns the depth of a tree.
Write a function which takes two strings as parameters and returns a string of common characters between the two strings but no duplicates. Use hash table to implement the algorithm.
First Round Questions (6 year Exp Software Engineer took the interview) 1)In a Given array which contains sorted numbers only one of number matches with that of Index. Find the number Not in O(N). 2)Derive a DataStructure to support the following operations Insert/Delete/Search/GetRandom Value in O(1) & O(logN)
Some project related questions like choice of datastructure and how would i optimize the code
Given an infinite number line from -INFINITY to +INFINITY and we are on zero. We can move n steps either side at each n’th time. Find minimum number of steps to reach k.
Consider a series similar to the fibonacci series (fn = fn-1 + fn-2) but with f(0) = x, f(1) = y.Given x,y and z (each can be +ve or -ve), how do you find if z exists in the series
1. Implement a method that verifies if one string can be constructed by another. E.g: "aaabc" can be constructed by "aaabbbccd" 2. Given a linked list containing numbers (Node element), implement a method that returns two lists: one containing even numbers and one odd numbers - without allocating new list elements.
Viewing 631 - 640 interview questions