unix questions were difficult.....sql was easy....choose your skill carefully...i choose c so they asked only c questions....
Engineer Interview Questions
1,135,583 engineer interview questions shared by candidates
1- write a java program to print the total arrangement of any string without using collection and string.
how to find the closest 2 number in an array of unique positive number
You have five bottles with pills. One bottle has 9 gram pills, the others have 10 gram pills. You have a scale that can only be used once. How can you find out which bottle contains the 9 gram pills?
Pass a list of word to a function [car, rats, arc, star] and have the function group the words which are anagrams of eachother.
Output a single linked list in reverse, in linear time and constant space, and recursively
How to implement Sqrt(double k) efficiently?
Given n+1 buckets with n of them with ball inside and move(a,b) function, that moves ball from bucket a to bucket b. Each ball has a different number from [1,n] on it. Move balls, so each bucket has a ball with matching number in it.
Given 2 arrays sorted in ascending orders (a[n] and b[n*2]) with the second half of array a[] being empty, create a function that merges both arrays into a single sorted array.
You are given an array of N elements in the form "property1: value1; property2: value2;...;propertyX: valueX;" for some some N and any X. There is also another array of M elements of the form "property: value". You are supposed to write an algorithm to remove every element in the N length array that has a "property: value" pair in the M length array. The trick is that the most intuitive solution of iterating through the M array and filtering the N array at each element is already written. You must come up with a solution that solves the problem in less than O(NM) time.
Viewing 961 - 970 interview questions