146 problems tagged
Problems frequently asked in Google technical interviews, sorted by frequency.
140Total problems
0Solved
57Very High freq.
0%Completion
Largest Subarray Sum· Arrays
Very High frequency
Medium
20m
Search Element in Rotated Sorted Array· Binary Search
Very High frequency
Medium
25m
Find Minimum in Rotated Sorted Array· Binary Search
Very High frequency
Medium
20m
Longest Substring Without Repeating Characters· Sliding Window & Two Pointers
Very High frequency
Medium
25m
Minimum Window Substring· Sliding Window & Two Pointers
Very High frequency
Hard
45m
Largest Rectangle in Histogram· Stacks & Queues
Very High frequency
Hard
40m
Intersection of Two Linked Lists· Linked List
Very High frequency
Easy
20m
Lowest Common Ancestor of a Binary Tree· Binary Trees
Very High frequency
Medium
25m
Kth Smallest Element in BST· Binary Search Tree
Very High frequency
Medium
20m
Validate a Binary Search Tree· Binary Search Tree
Very High frequency
Medium
20m
Partition Equal Subset Sum· Dynamic Programming
Very High frequency
Medium
25m
Longest Common Subsequence· Dynamic Programming
Very High frequency
Medium
25m
Building a Growing Sequence of Heights· Dynamic Programming
Very High frequency
Medium
25m
All Palindromic Splits of a String· Recursion
High frequency
Hard
40m
Minimum Capacity to Transport Parcels· Binary Search
High frequency
Medium
25m
Search in a 2D Sorted Matrix II· Binary Search
High frequency
Medium
25m
Max Consecutive Ones III· Sliding Window & Two Pointers
High frequency
Medium
25m
Fruits & Baskets· Sliding Window & Two Pointers
High frequency
Medium
25m
Longest Repeating Character Replacement· Sliding Window & Two Pointers
High frequency
Medium
25m
Longest Substring with At Most K Distinct Chars· Sliding Window & Two Pointers
High frequency
Medium
30m
Clone Smart Device Chain with Random Pointer· Linked List
High frequency
Hard
40m
Cheapest Flight within K Stops· Graphs
High frequency
Medium
30m
Longest Palindromic Subsequence· Dynamic Programming
High frequency
Medium
25m
Number of Palindromic Substrings· Strings — Advanced Algorithms
High frequency
Medium
25m
Max Points From Cards· Sliding Window & Two Pointers
Medium frequency
Medium
25m
Subarrays with K Distinct Integers· Sliding Window & Two Pointers
Medium frequency
Hard
40m
Sum of Min Subarray Elements· Stacks & Queues
Medium frequency
Hard
40m
Maximal Unity Rectangle Discovery· Stacks & Queues
Medium frequency
Hard
45m
Minimum Insertions to Make Palindrome· Dynamic Programming
Medium frequency
Hard
30m
Shortest Common Supersequence· Dynamic Programming
Medium frequency
Hard
30m
Minimum Matrix Multiplication Cost· Dynamic Programming
Medium frequency
Hard
40m
Maximum Coins from Bursting Bubbles· Dynamic Programming
Medium frequency
Hard
40m
Min Additions To Make Parentheses Valid· Strings — Advanced Algorithms
Medium frequency
Medium
20m
Pattern Searching (Rabin-Karp Algorithm)· Strings — Advanced Algorithms
Medium frequency
Hard
35m
Shortest Palindrome Substring· Strings — Advanced Algorithms
Medium frequency
Hard
30m
Shortest Substring Containing Subsequence· Sliding Window & Two Pointers
Low frequency
Hard
45m
Expanding the Longest Word Sequence· Dynamic Programming
Low frequency
Hard
30m