I was asked a question about the following. If a user types in a n digit number on the telephone, how do you write a function to deduce if the number constitutes a valid word. For example, if the user enters 123, then can a valid word be made out of (a/b/c) + (d/e/f) + (g/h/i)
Give 2 coding solutions on returning an array by removing duplicates. One solution with O(n^2) and the other Linear.
Given an array whose elements are sorted, return the index of a the first occurrence of a specific integer. Do this in sub-linear time. I.e. do not just go through each element searching for that element.
Reverse a linked list in place
Write a function in C/C++ that returns the number of zeros contained in the factorial of the number that is passed to it.
Find the lowest common ancestor for BST
Given a list of integers that fall within a known short but unknown range of values, how to find the median value?
Write a Square Root function for a computer without floating point calculations
Write a routine that does secret santa in O(N) time.
Given a string, return true if after jumbling/rearranging the characters of the string will it be a palindrome. and false if not. eg: given string "evlel", it can be rearranged to "level" and thus it is a palindrome, and return true. eg: 1234 cannot be rearranged to become a palindrome hence false.
Viewing 1311 - 1320 interview questions