Basically the interview questions were data structure. The first one was just a simple data structure question, but the second one was mathematical question. I hadn't expected that kind of questions would be asked, so I got really confused. The questions was to prove that Y is a multiple of six, where there are consecutive three numbers X, Y, Z and X and Z are a prime number. I was totally stuck at the point and couldn't make it.
nothing as such but you need satisfy them for your ability in IT.
Given a coin with probability x (= U[0, 1] showing head at each flip, what is the probability that you got a second head after getting the first one.
Find the integer pairs in an integer array, so that they sum up to a specific number n.
how would you find the shortest path between two nodes in a social network?
Given a list of strings, write a function to calculate the longest common prefix (LCP) of all those strings.
Given a binary tree, write a function to find the length of the longest path in the tree.
Write a function that computes log2() using sqrt().
Create a linked list with 3 char (A,B,C) in it and print the list in reverse.
Write a C function to return the number of set bits in an integer.
Viewing 381 - 390 interview questions