Interview Cake helps software engineers land their dream jobs at the top companies, like eBay! We’ve developed a strategic approach to programming interviews to give engineers the tools they need to solve any programming interview question. No matter how difficult the questions you face at your eBay interview, you’ll be prepared with an interview prep strategy like ours.
eBay revolutionized the way that people buy and sell goods. As one of the world’s leading online retailers with over 170K active users, eBay as high expectations of its engineering team. eBay wants to hire highly-skilled engineers, and this is reflected in their interview process.
In this free email course, you'll learn the right way of thinking for breaking down the tricky algorithmic coding interview questions eBay loves to ask.
No CS degree necessary.
eBay’s interview process is tough, but our strategic approach to interview preparation will make sure that you’re ready for any question they throw your way.
You're building a word cloud. Write a function to figure out how many times each word appears so we know how big to make each word in the cloud. keep reading »Two Egg Problem »
A building has 100 floors. Figure out the highest floor an egg can be dropped from without breaking. keep reading »Compute the nth Fibonacci Number »
Computer the nth Fibonacci number. Careful--the recursion can quickly spin out of control! keep reading »The Stolen Breakfast Drone »
In a beautiful Amazon utopia where breakfast is delivered by drones, one drone has gone missing. Write a function to figure out which one is missing. keep reading »The Cake Thief »
You've hit the mother lode: the cake vault of the Queen of England. Figure out how much of each cake to carry out to maximize profit. keep reading »Permutation Palindrome »
Check if any permutation of an input string is a palindrome. keep reading »Parenthesis Matching »
Write a function that finds the corresponding closing parenthesis given the position of an opening parenthesis in a string. keep reading »Recursive String Permutations »
Write a recursive function of generating all permutations of an input string. keep reading »Find Repeat, Space Edition »
Figure out which number is repeated. But here's the catch: optimize for space. keep reading »Find Repeat, Space Edition BEAST MODE »
Figure out which number is repeated. But here's the catch: do it in linear time and constant space! keep reading »
Check out some of the positive highlights that others have written about their eBay interview experience on Glassdoor:
And here are some of the negative experiences interviewees have reported to Glassdoor: