Companies
Amazon851 questions
Meta483 questions
Google373 questions
Uber282 questions
ByteDance / TikTok309 questions
Microsoft223 questions
Apple141 questions
Stripe184 questions
Snowflake156 questions
OpenAI168 questions
Netflix87 questions
Databricks95 questions
IBM117 questions
DoorDash114 questions
Roblox73 questions
Anthropic89 questions
Coinbase87 questions
Bloomberg102 questions
LinkedIn94 questions
Capital One90 questions
Snapchat90 questions
Salesforce83 questions
Citadel / Citadel Securities77 questions
Goldman Sachs77 questions
Rippling65 questions
Airbnb71 questions
Pinterest67 questions
Oracle64 questions
Reddit40 questions
Walmart Labs59 questions

Google Interview Question Bank
Google's loop runs on hiring-committee arbitration, with a separate team-match phase deciding whether HC approval turns into an offer. Coding bars are remarkably consistent across teams; leveling rigor and behavioral depth drive most of the L3–L6 differentiation.
372
questions
Last updated
Before you start
Showing 43 of 43
OJ Problems
practice in the online judgeConsolidate On-call Rotations into Maximal Constant SegmentsDetermine Whether Two Horses Are Related (Pedigree Graph)Longest Increasing Subarray Length; with One Modification AllowedMin Hand Moves to Play a Sequence on a 1..∞ Keyboard (Segment Grouping)Longest Non-Increasing Path in Grid with One-Step Lookback ConstraintImplement deleteDirectory with getChildrenPaths and deleteFile APIsGrid Flower Placement with Row/Column Uniqueness and House Adjacency ConstraintsDetonate Bombs with Chain Reactions (Graph reachability)Evaluate a Nested Math Expression String (add/sub function calls)Design a Tic-Tac-Toe System for k Players on an n×n Board with 3-in-a-Row Win ConditionLongest-Match Greedy Tokenization With Dictionary ReplacementBuild a Huffman Tree From Symbol FrequenciesMulti-Elevator Controller: Scheduling and DispatchingTaxi Dispatch (Wrapper around Meeting Rooms II)Count Perfect Wake Numbers ≤ N (Digit DP)Stack problem (details unspecified)Graph problem (details unspecified)Unknown (insufficient details from the interview notes)Determine Passing Order and Crossing Times for People Entering/Exiting a DoorNecklace Split with at Most Two Cuts (Equal D and R for Both People)Earliest Time When Everyone Becomes Friends (Union-Find / Graph) + Support UnfriendMinimum Cars to Satisfy Rental Requests + Assignment RecordsShortest Path Reachability in a Weighted Graph (with Mandatory Waypoint)Activate Features with Dependency Prerequisites (Simulation)Range Updates Using Difference Array (Template Problem)Maximum Sum Subarray with Equal EndpointsGolden Chain Split After Removing One LinkRussian Doll Envelopes (Maximum Nesting)Trie (Prefix Tree) Implementation / UsageDebug Feature Enablement With Dependencies and Constraints
