given an array of n unsorted integers and each number is at most k positions away from its final sorted position, give an efficient sorting algorithm.
Development Engineer Interview Questions
37,444 development engineer interview questions shared by candidates
given a matrix, you can move right or down only and cost of each move is 1. Find an optimal way to reach to right-bottom from top-left of the matrix.
Given a random array with integers, find every pair that sum up to a certain number.
Write a method to decide if the given binary tree is a binary search tree or not.
Given two lists, A and B, of sizes n and k, respectively, describe an algorithm to determine the intersection, C, of the two lists. What is the complexity of your algorithm? (The obvious solution is O(n*k)). Can you describe a solution that is faster? (An optimized solution can do it in O(n+k)).
What would u do if deadline is approaching and ur product is not finished?
Q3) Few questions on design patterns(Interpreter/ Observer/State) etc.
1) Given an array of numbers where each number has a duplicate except one, write a program to return the lone number.
Given two (huge) sets, what is an efficient way to find their intersection?
Given an integer N and an array of unsorted integers A find all pairs of numbers within A which add up to N. (This is the only question I can remember and I had trouble thinking of an answer at the time)
Viewing 181 - 190 interview questions