The hardest problem posed was the C# function I had to write. Write a function that accepts a character parameter such as "8" and then returns its digit value which would be 8 in this case. You cannot use any helper functions, casting or conversion functions. int ParseCharToInt(char c)
Unusual sort: sort an array A such that: A[0]<A[1]>A[2]<A[3]>A[4]<A[5].............
Find the number f set bits in an integer
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}
You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.
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.
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.
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.
Viewing 1011 - 1020 interview questions