Reverse a linked-list.
Developer Advisor Interview Questions
710,975 developer advisor interview questions shared by candidates
find the missing number of an array of consecutive numbers.
NDA
Experience working on technical projects as part of a team
String s = "Hey"; s = s.concat(" Guys") sop(s)
* Print binary tree level by level * Find distance between words in a string eg: String => "I am a good girl" distance between "I" and "good" is 3
You have a potentially very-large set of documents, which are potentially very-large, and contain text. For searching these documents, they've been pre-processed into a (very-large) table mapping words to the set of documents that contain each word. E.g. (word) : (documents (referenced by ID) containing that word) Apple: 1, 4, 5, 6, 32 Banana: 5, 6, 7, 9, 32 Cantaloupe: 1, 2, 6 ... Clients will pass in a set of words (e.g. {apple, cantaloupe}), and want the set of document IDs that contain all the words. (e.g. {apple, cantaloupe} -> {1, 6}) Design a distributed system to implement this, bearing in mind that the number of documents, the number of words, and the number of document-IDs-per-word are potentially really, really big.
1. How many bits in a byte? 2. What's the integral of velocity?
phone screen question: what is the derivative of veloctiy?
5 Guys went for dinner.. and were going to sit on a round table having 5 seats.. their birthdays are not same .. probability of getting them seated in inc/dec order of their age.
Viewing 1461 - 1470 interview questions