Given two large files with 64-bit integers produce file with integers which are present in both files and estimate O(?) complexity of your algorithm.
Engineers Interview Questions
844,385 engineers interview questions shared by candidates
Input is a 4x4 table with letters. One starts from any of the 16 elements and can move in one step to any of the 8 neighboring cells not visited before (up, down, left, right, up-left, etc, no hyperspace jumps between rows 1 & 4, columns 1 & 4). Every time step is made letter in that cell is added so a word is built as we walk. These generated words are looked up in external dictionary (function to look up in the dictionary is provided, I did not understand significance of this dictionary well) and the goal of the exercise is to output all words generated by all possible table walks and which are contained in the dictionary.
Phone Interview: i) Find the number of inversions in an array (describe & code) ii) Find collinear points in a given set of 2D points (describe & code)
Given a sorted array of integers, write a function to remove any duplicates. Give algorithm, then code and finally list how you would test your program.
Find the max and second largest max in an array of integers. What is run time? How to test function?
Given a sorted array [0-99] With input: [1, 5, 45, 86] Write a function that prints the empty regions, example Output: “0,2-4,6-44,46-85,87-99”
find and output the given number's shortest square sum. like input: 12=2^2+2^2+2^2 (not 3^2+1^2+1^2+1^2) output: {2 2 2}
a. Given a function double f(double x), 0<=x<=1, f(x) is increasing. f(0)<0, f(1)>0. Find x s.t. f(x)\approx 0.
finding the biggest sum of subset in an int array.
write code to find the second shortest path between two given nodes in an undirected graph.
Viewing 1461 - 1470 interview questions