A new approach to pass the coding interview
Get a daily algorithm question asked by FAANG companies, for free, straight to your inbox.
Team
Tomoka
Firework Software Engineer. Ex-Mercari. Ex-AbemaTV. Tokyo, Japan native. World-traveler.
Brian
Twitter Software Engineer. Ex-Uber. Los Angeles native. Amateur Poker Player & Basketball Fan.
Oliver
Uber Software Engineer. Ex-Shopify. Beijing born. Canadian citizen. Artist & part-time Rapper.
Hairuo
Instagram Software Engineer. Ex-Amazon. Ex-UberATG. Toronto native & self-taught Stock Trader.
Benefits
Real Questions
Knowing what to study is hard. We focus on questions that have been asked by top tech companies.
Save Time
Our questions and solutions are easy to understand and can be solved in 30 minutes or less.
Stay Informed
Stay up to date with the latest coding questions, interview tips, and tech news. We make it fun :)
Sample Coding Question
This question was asked by Facebook
Problem: Given a string of lowercase English characters, '(', and ')' return any valid string with the minimum number of removed parentheses. A string is valid if english letters or empty spaces can be enclosed in parentheses.
Input: s = ")(tod)"
Output: "(tod)"
Input: s = "b(o(b)b)y)"
Output: "b(o(b)b)y" or "b(o(b)by)"
Category: String, Stack
Difficulty: Medium
SOLUTION: Short Link