Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 1101. The Earliest Moment When Everyone Become Friends | Medium | ||
| 146. LRU Cache | Medium | ||
| 1. Two Sum | Easy | ||
| 647. Palindromic Substrings | Medium | ||
| 2402. Meeting Rooms III | Hard | ||
| 2158. Amount of New Area Painted Each Day | Hard | ||
| 66. Plus One | Easy | ||
| 2534. Time Taken to Cross the Door | Hard | ||
| 200. Number of Islands | Medium | ||
| 2089. Find Target Indices After Sorting Array | Easy | ||
| 🔒 | 622. Design Circular Queue | Basic DSA | Medium |
| 🔒 | 437. Path Sum III | Depth-First Search | Medium |
| 🔒 | 1381. Design a Stack With Increment Operation | Basic DSA | Medium |
| 🔒 | 621. Task Scheduler | Misc.Basic DSA | Medium |
| 🔒 | 2. Add Two Numbers | BacktrackingBasic DSA | Medium |
| 🔒 | 946. Validate Stack Sequences | Simulation | Medium |
| 🔒 | 3481. Apply Substitutions | Depth-First SearchBreadth-First SearchGraph | Medium |
| 🔒 | 283. Move Zeroes | Two Pointers | Easy |
| 🔒 | 359. Logger Rate Limiter | Basic DSA | Easy |
| 🔒 | 139. Word Break | Adv. Data StructureBacktrackingDynamic Programming | Medium |
| 🔒 | 382. Linked List Random Node | Basic DSA | Medium |
| 🔒 | 365. Water and Jug Problem | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 402. Remove K Digits | Misc. | Medium |
| 🔒 | 1536. Minimum Swaps to Arrange a Binary Grid | Misc. | Medium |
| 🔒 | 2573. Find the String with LCP | Misc.Adv. Data StructureDynamic Programming | Hard |
| 🔒 | 727. Minimum Window Subsequence | Dynamic ProgrammingTwo Pointers | Hard |
| 🔒 | 480. Sliding Window Median | Two Pointers | Hard |
| 🔒 | 32. Longest Valid Parentheses | Dynamic Programming | Hard |
| 🔒 | 2067. Number of Equal Count Substrings | Basic DSATwo Pointers | Medium |
| 🔒 | 2165. Smallest Value of the Rearranged Number | Basic DSA | Medium |
| 🔒 | 853. Car Fleet | Basic DSAMisc. | Medium |
| 🔒 | 493. Reverse Pairs | Adv. Data StructureBinary SearchMisc. | Hard |
| 🔒 | 41. First Missing Positive | Basic DSA | Hard |
| 🔒 | 208. Implement Trie (Prefix Tree) | Adv. Data Structure | Medium |
| 🔒 | 98. Validate Binary Search Tree | Depth-First Search | Medium |
| 🔒 | 29. Divide Two Integers | Basic DSA | Medium |
| 🔒 | 351. Android Unlock Patterns | Dynamic ProgrammingBacktracking | Medium |
| 🔒 | 2184. Number of Ways to Build Sturdy Brick Wall | Dynamic Programming | Medium |
| 🔒 | 271. Encode and Decode Strings | Basic DSA | Medium |
| 🔒 | 1590. Make Sum Divisible by P | Two Pointers | Medium |
| 🔒 | 943. Find the Shortest Superstring | Dynamic Programming | Hard |
| 🔒 | 373. Find K Pairs with Smallest Sums | Basic DSA | Medium |
| 🔒 | 251. Flatten 2D Vector | Two Pointers | Medium |
| 🔒 | 270. Closest Binary Search Tree Value | Depth-First SearchBinary Search | Easy |
| 🔒 | 325. Maximum Size Subarray Sum Equals k | Two Pointers | Medium |
| 🔒 | 960. Delete Columns to Make Sorted III | Dynamic Programming | Hard |
| 🔒 | 1838. Frequency of the Most Frequent Element | Misc.Binary SearchTwo PointersBasic DSA | Medium |
| 🔒 | 1062. Longest Repeating Substring | Binary SearchDynamic ProgrammingAdv. Data Structure | Medium |
| 🔒 | 1700. Number of Students Unable to Eat Lunch | Simulation | Easy |
| 🔒 | 2152. Minimum Number of Lines to Cover Points | Dynamic ProgrammingBacktracking | Medium |
| 🔒 | 1807. Evaluate the Bracket Pairs of a String | Basic DSA | Medium |
| 🔒 | 213. House Robber II | Dynamic Programming | Medium |
| 🔒 | 1710. Maximum Units on a Truck | Misc.Basic DSA | Easy |
| 🔒 | 805. Split Array With Same Average | Dynamic Programming | Hard |
| 🔒 | 15. 3Sum | Two PointersBasic DSA | Medium |
| 🔒 | 815. Bus Routes | Breadth-First Search | Hard |
| 🔒 | 704. Binary Search | Binary Search | Easy |
| 🔒 | 25. Reverse Nodes in k-Group | BacktrackingBasic DSA | Hard |
| 🔒 | 956. Tallest Billboard | Dynamic Programming | Hard |
| 🔒 | 419. Battleships in a Board | Depth-First Search | Medium |
| 🔒 | 399. Evaluate Division | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Medium |
| 🔒 | 1349. Maximum Students Taking Exam | Dynamic Programming | Hard |
| 🔒 | 1166. Design File System | Adv. Data Structure | Medium |
| 🔒 | 683. K Empty Slots | Adv. Data StructureTwo PointersMisc. | Hard |
| 🔒 | 2638. Count the Number of K-Free Subsets | Dynamic ProgrammingBasic DSA | Medium |
| 🔒 | 500. Keyboard Row | Basic DSA | Easy |
| 🔒 | 79. Word Search | Depth-First SearchBacktracking | Medium |
| 🔒 | 2433. Find The Original Array of Prefix Xor | Basic DSA | Medium |
| 🔒 | 542. 01 Matrix | Breadth-First SearchDynamic Programming | Medium |
| 🔒 | 295. Find Median from Data Stream | Two PointersBasic DSA | Hard |
| 🔒 | 643. Maximum Average Subarray I | Two Pointers | Easy |
| 🔒 | 241. Different Ways to Add Parentheses | BacktrackingDynamic Programming | Medium |
| 🔒 | 2137. Pour Water Between Buckets to Make Water Levels Equal | Binary Search | Medium |
| 🔒 | 2498. Frog Jump II | Misc.Binary Search | Medium |
| 🔒 | 35. Search Insert Position | Binary Search | Easy |
| 🔒 | 2101. Detonate the Maximum Bombs | Depth-First SearchBreadth-First SearchGraph | Medium |
| 🔒 | 23. Merge k Sorted Lists | Basic DSAMisc. | Hard |
| 🔒 | 488. Zuma Game | Breadth-First SearchBacktrackingDynamic Programming | Hard |
| 🔒 | 246. Strobogrammatic Number | Two Pointers | Easy |
| 🔒 | 332. Reconstruct Itinerary | Depth-First SearchGraph | Hard |
| 🔒 | 2700. Differences Between Two Objects | Basic DSA | Medium |
| 🔒 | 1110. Delete Nodes And Return Forest | Depth-First Search | Medium |
| 🔒 | 715. Range Module | Adv. Data Structure | Hard |
| 🔒 | 1825. Finding MK Average | Adv. Data Structure | Hard |
| 🔒 | 939. Minimum Area Rectangle | Basic DSA | Medium |
| 🔒 | 975. Odd Even Jump | Dynamic ProgrammingAdv. Data StructureBasic DSAMisc. | Hard |
| 🔒 | 1307. Verbal Arithmetic Puzzle | Backtracking | Hard |
| 🔒 | 2863. Maximum Length of Semi-Decreasing Subarrays | Basic DSAMisc. | Medium |
| 🔒 | 2013. Detect Squares | Basic DSA | Medium |
| 🔒 | 85. Maximal Rectangle | Dynamic ProgrammingMisc. | Hard |
| 🔒 | 900. RLE Iterator | Basic DSA | Medium |
| 🔒 | 2973. Find Number of Coins to Place in Tree Nodes | Depth-First SearchDynamic ProgrammingBasic DSA | Hard |
| 🔒 | 1136. Parallel Courses | Graph | Medium |
| 🔒 | 2667. Create Hello World Function | Basic DSA | Easy |
| 🔒 | 2458. Height of Binary Tree After Subtree Removal Queries | Depth-First SearchBreadth-First Search | Hard |
| 🔒 | 2316. Count Unreachable Pairs of Nodes in an Undirected Graph | Depth-First SearchBreadth-First SearchAdv. Data StructureGraph | Medium |
| 🔒 | 2290. Minimum Obstacle Removal to Reach Corner | Breadth-First SearchGraph | Hard |
| 🔒 | 963. Minimum Area Rectangle II | Basic DSA | Medium |
| 🔒 | 2265. Count Nodes Equal to Average of Subtree | Depth-First Search | Medium |
| 🔒 | 833. Find And Replace in String | Basic DSA | Medium |
| 🔒 | 655. Print Binary Tree | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 2709. Greatest Common Divisor Traversal | Adv. Data Structure | Hard |
| 🔒 | 418. Sentence Screen Fitting | Dynamic Programming | Medium |
| 🔒 | 1125. Smallest Sufficient Team | Dynamic Programming | Hard |
| 🔒 | 315. Count of Smaller Numbers After Self | Adv. Data StructureBinary SearchMisc. | Hard |
| 🔒 | 759. Employee Free Time | Basic DSA | Hard |
| 🔒 | 470. Implement Rand10() Using Rand7() | Basic DSA | Medium |
| 🔒 | 681. Next Closest Time | Backtracking | Medium |
| 🔒 | 690. Employee Importance | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 679. 24 Game | Backtracking | Hard |
| 🔒 | 1834. Single-Threaded CPU | Basic DSA | Medium |
| 🔒 | 2770. Maximum Number of Jumps to Reach the Last Index | Dynamic Programming | Medium |
| 🔒 | 522. Longest Uncommon Subsequence II | Two PointersBasic DSA | Medium |
| 🔒 | 1756. Design Most Recently Used Queue | Adv. Data Structure | Medium |
| 🔒 | 417. Pacific Atlantic Water Flow | Depth-First SearchBreadth-First Search | Medium |
| 🔒 | 1168. Optimize Water Distribution in a Village | Adv. Data StructureGraph | Hard |
| 🔒 | 1820. Maximum Number of Accepted Invitations | Depth-First SearchGraph | Medium |
| 🔒 | 2982. Find Longest Special Substring That Occurs Thrice II | Binary SearchBasic DSATwo Pointers | Medium |
| 🔒 | 1727. Largest Submatrix With Rearrangements | Misc.Basic DSA | Medium |
| 🔒 | 2437. Number of Valid Clock Times | Basic DSA | Easy |
| 🔒 | 459. Repeated Substring Pattern | Basic DSA | Easy |
| 🔒 | 2235. Add Two Integers | Basic DSA | Easy |
| 🔒 | 1730. Shortest Path to Get Food | Breadth-First Search | Medium |
| 🔒 | 1425. Constrained Subsequence Sum | Dynamic ProgrammingTwo PointersMisc. | Hard |
| 🔒 | 729. My Calendar I | Adv. Data StructureBinary Search | Medium |
Sign up for free to track your progress, then upgrade to Pro for all 125 questions with detailed solutions.
Sign Up FreeGoogle's interview process starts with a resume screening to assess a candidate's skills, experience, and suitability. After this, candidates might face an Online Assessment (OA), which tests their coding abilities and problem-solving skills. This is typically followed by one or two phone screen interviews that dive deeper into technical knowledge and coding proficiency.
If successful in the initial stages, candidates are invited for onsite interviews, which consist of four to five rounds. These onsite rounds are known for their difficulty, often involving complex algorithm questions, system design, and sometimes a behavioral interview to gauge cultural fit and teamwork abilities. Each round is designed to challenge and evaluate different aspects of a software engineer's capabilities.
Google's resume screening involves proprietary algorithms and human reviewers focusing on technical skills and past project impact. They prioritize candidates with clear quantification of achievements in past roles.
Applicants may face online assessments (OAs) testing coding skills, followed by a preliminary screening call. Around 20% progress past the initial OA to the next interview stage.
Google typically conducts one or two phone screenings for software engineering positions. These initial interviews focus on coding skills and problem-solving capabilities and often involve solving algorithms or technical questions using a shared Google Doc.
The phone interview serves as a fundamental step to assess a candidate’s technical proficiency and thought process before progressing to the more comprehensive onsite interviews. It’s vital to be well-prepared in relevant programming languages and data structures.
At Google, the onsite interview round is a crucial step. Candidates generally face four to six interviews, each lasting about 45 minutes. These sessions are typically divided into coding, system design, and a Googleyness & leadership assessment.
The coding interviews focus on data structures and algorithms, while the system design interviews assess your ability to architect scalable systems. Google emphasizes assessing problem-solving skills and cultural fit through behavioral questions during the Googleyness & leadership interview.
After completing all interview rounds at Google, candidates often enter the team matching phase, where they discuss potential fits with various teams. Following this, successful candidates may negotiate job offers and occasionally meet with executives.

Aspiring to ace a software engineering interview at Google requires a tactical approach to coding problem patterns. LeetCode data reveals a distinct emphasis on Dynamic Programming, Depth-First Search, and Breadth-First Search. What sets Google apart is the lesser focus on simpler coding patterns like Simulation and Two Pointers, each with only a handful of problems. This suggests that Google values candidates who can navigate complex data structures and algorithms over straightforward problem solving. Dynamic Programming and Basic DSA also hold significant weight, indicating a balanced blend of complexity and foundational knowledge in their coding interviews.
Google evaluates candidates on four main attributes: General Cognitive Ability, Leadership, Role-Related Knowledge, and Googleyness. Behavioral questions focus primarily on Leadership and Googleyness. Expect 2-3 behavioral questions per round using the STAR method.
Googleyness evaluates culture fit and how you work with others. Google looks for eight core traits: comfort with ambiguity, humility, action bias, ethical decision-making, ownership, high standards, creative thinking, and collaborative spirit.
1. Comfort with Ambiguity
Sample Questions:
How to Answer:
Example Framework:
2. Collaboration and Helpfulness
Sample Questions:
How to Answer:
Example Framework:
3. Intellectual Humility
Sample Questions:
How to Answer:
Example Framework:
4. Conscientiousness & Ownership
Sample Questions:
How to Answer:
Example Framework:
5. Innovative & Creative Thinking
Sample Questions:
How to Answer:
Example Framework:
6. Bias for Action & Results
Sample Questions:
How to Answer:
7. High Standards & Excellence
Sample Questions:
How to Answer:
8. Ethical Decision-Making
Sample Questions:
How to Answer:
Every Google interview typically starts with these:
"Why Google?"
"Tell me about yourself"
"Where do you see your career in 5 years?"
Google looks for "emergent leadership" - the ability to step up when needed, regardless of title. Leadership questions assess your ability to influence, drive results, and develop others.
1. Taking Initiative & Influence
Sample Questions:
How to Answer:
Example Framework:
2. Handling Conflict & Difficult Situations
Sample Questions:
How to Answer:
Example Framework:
3. Developing Others & Team Growth
Sample Questions:
How to Answer:
Example Framework:
4. Strategic Thinking & Decision-Making
Sample Questions:
How to Answer:
Example Framework:
Sample Question: "Walk me through a complex technical project you led from start to finish."
How to Answer:
Structure:
Prepare 10-12 STAR Stories
What Google Looks For
Common Follow-Up Questions
Avoid These Mistakes
Technical Preparation
Mock Interviews
Research Google