Interview Question – two algorithm questions each phone interview. Two of them were a bit challenging . One of them was : given a value k and an array , design an efficient algorithm that should output the number of pairs that sum up to k. They wanted a n log n solution, wich i provided, but I wasn't handy with the implementation. We spent several minutes with questions like why would you want to work for us? or how did you heard and what you know about us ?
given the utitlies getFriend(User u) and areFriends(User u1, User u2), write the function which takes as parameter the array of users and return a bool saying if you can divide the users in 2 groups s.t. if u1 and u2 both belong to a certain group, they are not friends.
How to retrieve a file with a specific string or keyword using UNIX command line
Calculate the square root of a number.
2nd largest number in an array
Given two linked lists, find out IF they intersect.
Find the max ;length palindrome in an input string.
There is an array of numbers, containing the integers 1-n, how can you find the sum of the numbers in that array?
How would you implement Amazon's "users who bought this item also bought ..." feature?
Given a triangle of integers, find the path of the largest sum without skipping.
Viewing 121 - 130 interview questions