Suppose you have a huge collection of integer values, in an array or a list or some similar data structure. Now suppose there are exactly two appearances of all integers, except one. In other words, each integer appears twice, in some random order, except 1. How would you find that 1 integer.
Given a sequence of integers and an integer total target, return whether a contiguous sequence of integers sums up to target.
1. K-th largest number in the array
Say the program you are running has stack overflow. You want to know when and where this happens, but you don't want to use debuggers, because they slow. How would you do this?
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.
Check if two strings are Palindrome
Given a set of words, group them into sets of anagrams.
2SUM problem and how to optimize it.
Find the indices of max. value in a large array and return them.
1) Given an array with 0s and other integers. Find the fastest (that use least organizing) way to transfer all the 0s to the right end of that array. 2) Given an array of integer, find 2 numbers that their sum is closest to a specific number.
Viewing 1901 - 1910 interview questions