Interview Cake teaches a framework for approaching programming interviews at Uber and other top tech companies. It can be easy to think that interviewing at Uber is all about memorizing all these crazy algorithm questions, but that's actually not the case. We can teach an approach to the software engineer interview that will prepare you for any interview at Uber.
Uber interviews are known to be among the toughest in the industry. Uber's engineering team supports the growth of one of the industry's biggest unicorn companies, with some of the craziest hypergrowth that anybody has ever seen. To support their pace of growth, Uber screens their engineering candidates very thoroughly.
Uber's coding interviews are hard, but not impossible. Like anything else, it just takes practice. We'll walk you through it, step by step.
A friend and I are trying to win the prize for most Girl Scout Cookies sold. Write a function to merge our sorted arrays of orders into one sorted array of orders. Think about edge cases! What happens when we've finished merging one... keep reading »Does This Linked List Have A Cycle? »
Write a function contains_cycle() that takes the first node in a singly-linked list and returns a boolean indicating whether the list contains a cycle. Careful—a cycle can occur in the middle of a list, or it can simply... keep reading »MillionGazillion™: A New Search Engine »
I wrote a web crawler that's running on my old desktop computer in my parents' basement (where I totally don't live anymore), and it keeps running out of memory... keep reading »Binary Search Tree Checker »
Write a function to check that a binary tree is a valid binary search tree. Careful: checking a node against its parent isn't sufficient to prove... keep reading »Product of Other Numbers »
You have an array of integers, and for each index you want to find the product of every integer except the integer at that index. Write a function that takes an array... keep reading »Implement a Queue With Two Stacks »
This one's a classic toy problem that will really help you understand the importance of the different properties of queues and stacks. There's a naive solution, but then there's a much more efficient... keep reading »The Nth Fibonacci Number »
This one's a classic, but there's more than meets the eye. Our first thought might be a naive recursive solution, but it has a massive time cost... keep reading »Find The Rotation Point In An Array »
I have an array of words that are mostly alphabetical, except they start somewhere in the middle of the alphabet, reach the end, and then start from the beginning of the alphabet. In other words, this is an alphabetically ordered array that has been "rotated"... keep reading »Permutation Palindrome »
Write an efficient function that checks whether any permutation of an input string is a palindrome. We can do this in time and... keep reading »Exploiting An Uneven Shuffle To Get Rich »
I figured out how to get rich: online poker. I suspect the online poker game I'm playing shuffles cards by doing a single "riffle." To prove this, let's write a function to tell us if a full deck of... keep reading »