Implement a function - isSumPair(int[],sum) - which returns true/false if the given sum can be achieved from an addition on two integers in the given list (can appear more then one time and be positive/negative). Follow up - how to improve space complexity?
Pair the elements of an array that sum up 100.
It's their "follow the white rabbit" question for back-end developers
Reverse Of a Linked List recursively
Why you are looking for a switch ?
You have 2 unsorted arrays of integers that only differ by one element. Find that element in the most efficient way.
Given an array with n integers, check if it could become non-decreasing by removing at most 1 element. Example: Input: [3,2,4,3], Output: false Input:[1, 4, 2, 3], Output: true Input:[4, 3, 2], Output: false Input:[1, 2, 3], Output: true
Do you believe in aliens?
Basic C++ questions based on kiddish logic and some STL functions in online test. Phone Interview discussing background.
Directly code challenge as HOME thinks they are above candidates and don't want to waste their time by talking to candidate first.
Viewing 11 - 20 interview questions