Interview Cake is a tool that helps software engineers prepare to interview at top companies like Yahoo! Thousands of applicants interview with Yahoo! each year, and so many show up unprepared after only having done some basic interview prep. That’s not enough to land your dream job at Yahoo! We can help you ace your technical interview by giving you an interview strategy to prepare for even the toughest questions
Yahoo! has long been regarded as one of the top companies in the world. Their engineering team is top-of-the-line and are hyper-focused on groundbreaking solutions for the everyday user. With the competition constantly pressuring them to think out of the box, Yahoo! has high expectations for their engineering team. The interview at Yahoo! will challenge you. You will be expected to prove that you are the best of the best. Interview Cake’s strategic approach to interview prep will make sure that you’re covering all of the bases ahead of your interview with Yahoo!
In this free email course, you'll learn the right way of thinking for breaking down the tricky algorithmic coding interview questions Yahoo loves to ask.
No CS degree necessary.
Yahoo!’s coding interviews are hard, but not impossible. It just takes some practice. Our program is a step-by-step guide to coding interview preparation.
Find the second largest element in a binary search tree. keep reading »Reverse Words »
Write a function to reverse the word order of a string, in place. It's to decipher a supersecret message and head off a heist. keep reading »In-Place Shuffle »
Do an in-place shuffle on an array of numbers. It's trickier than you might think! keep reading »Does This Linked List Have A Cycle? »
Check to see if a linked list has a cycle. We'll start with a simple solution and move on to some pretty tricky ones. keep reading »Delete Node »
Write a function to delete a node from a linked list. Turns out you can do it in constant time! keep reading »Largest Stack »
You've implemented a Stack class, but you want to access the largest element in your stack from time to time. Write an augmented LargestStack class. keep reading »Merge Sorted Arrays »
Write a function for consolidating cookie orders and taking over the world. keep reading »Bracket Validator »
Your friend copied a bunch of your files and put them in random places around your hard drive. Write a function to undo the damage. keep reading »Implement A Queue With Two Stacks »
Implement a queue with two stacks. Assume you already have a stack implementation. keep reading »
Check out some of the positive highlights that others have written about their Yahoo! interview experience on Glassdoor:
And here are some of the negative experiences interviewees have reported to Glassdoor: