write a function to check if two strings are substrings of each other (either first is substring of second or vice versa). write a function to check if two strings are anagrams of each other. The interview was 45 minutes and we didn't have time to code the seconds question so i discussed the two solutions and analyzed their time and space complexities.
Q: Given an array of integers, such that their product is also a 32-bit signed integer, replace each element of the array with the product of all elements besides it.
Find is a word is present in a grid of letters.
1.basic programming concepts 2. data structures (i dont remember the question)
How would you scale your solution?
Why Quantcast? Culture fit is important.
Given a string of numbers, such as 3,3,3,4,2,3,4,5,2. I'd like to receive an output of 2, when I input 2. And an output of 4 when I input 3. This list can be very long.
Find the subarray with the largest sum
Given a dictionary with words (the "language"), and a string (with 0 spaces), return True if you can add space(s) to the string in a way that will create a "legal" sentence in the language (according to the given dictionary)
Find the longest palindromic sub sequence of a string
Viewing 141 - 150 interview questions