Design a deck class. Given a fully implemented deck class, design a shuffling algorithm. Find the arithmetic mean of a binary tree. Follow-up to mean question: why can't you just design a function that recursively calculates the mean as it recurses the tree?
Identify the data structure and interpret what segment of code does.
Who are you tell me?
What interests you in working for DeShawResearch?
To see if a number is divisible by 3, you need to add up the digits of its decimal notation, and check if the sum is divisible by 3. To see if a number is divisible by 11, you need to split its decimal notation into pairs of digits (starting from the right end), add up corresponding numbers and check if the sum is divisible by 11. For any prime p (except for 2 and 5) there exists an integer r such that a similar divisibility test exists: to check if a number is divisible by p, you need to split its decimal notation into r-tuples of digits (starting from the right end), add up these r-tuples and check whether their sum is divisible by p. Given a prime int p, find the minimal r for which such divisibility test is valid and output it. The input consists of a single integer p - a prime between 3 and 999983, inclusive, not equal to 5.
What is your favorite class? What do you think is your hardest class? Tell me about a time when you had a team conflict.
Design a cache system for a function querying for stock prices. Your system can hold up to 1000 entries. The query does not need to be fetched if its was called within 15 minutes.
Explain to me how you built your last project?
Detect cycle(infinite loop) in LinkedList, while 95% space is already preoccupied.
Do you know Google Docs and Google Sheets
Viewing 1371 - 1380 interview questions