They asked two questions. 1. O(n*log n) time to find the k-th largest element of a n*n matrix, given every row or column of the matrix is pre-sorted. 2. O(log n) tome to find the k-th largest element of two pre-sorted array. Both questions were expected to be well disscussed, then to write pseudocode and test cases. I found it was very stressful and the time was not enough. I provide a O(n^2) solution for the first one, and solved the second one. But I they didn't move me forward.
Given an nxn matrix representing a crossword board. Implement a function that verifies that all of the squares that can contain letters (the white squares on the crossword board) are connected to each other throughout the whole board.
Building cache datastructure
Object-oriented design and Algorithm question
Coding challenge was 3 questions. First 2 were super easy, not much to say. The 3rd question was, given 3 integers that represent the amount of As Bs and Cs you can use to construct a string, return the length of the longest possible string such that this string does not have any sequence of 3 numbers being all the same. For example, if I had the input 3,0,0, meaning 3 As, 0 Bs, 0 Cs, I would return 2 (for AA. AAA would not work, because there is a substring in this string of length 3 such that they are all the same).
Given 2 strings, one is to be sorted, the other is the order. For example, first one is "hello", the second one is "loade", then the sorting result is "lloeh".
Simple
How would you design Google Images?
find sum of numbers in the given range on the given binary search tree
Four Questions Asked: 1. To find a longest palindrome in a string. 2. What is a HashSet ? Difference between HashSet and TreeSet. 3. Given a list List<x> and a function f: x -> y, convert the list to map i.e. Map<x, y> 4. What happens in the background (whole procedure) when you type a URL till the page is displayed ?
Viewing 2991 - 3000 interview questions