Google - All Time
Google - All Time
We've improved our algorithm that calculates company tags and their frequencies to
be more accurate and current.
All time
Times
218 The Skyline Problem ArrayDivide and ConquerBinary Indexed TreeSegment 39.2%
TreeLine SweepHeap (Priority Queue)Ordered Set
222 Count Complete Tree Nodes Binary SearchTreeDepth-First SearchBinary Tree 56.8%
315 Count of Smaller Numbers ArrayBinary SearchDivide and ConquerBinary Indexed 42.9%
After Self TreeSegment TreeMerge SortOrdered Set
2034 Stock Price Fluctuation Hash TableDesignHeap (Priority Queue)Data StreamOrdered 49.2%
Set
Notation
23 Merge k Sorted Lists Linked ListDivide and ConquerHeap (Priority Queue)Merge 48.0%
Sort
295 Find Median from Data Two PointersDesignSortingHeap (Priority Queue)Data Stream 50.9%
Stream
Decimal
659 Split Array into Consecutive ArrayHash TableGreedyHeap (Priority Queue) 50.5%
Subsequences
285 Inorder Successor in BST TreeDepth-First SearchBinary Search TreeBinary Tree 48.0%
ProgrammingBacktrackingTrieMemoization
173 Binary Search Tree Iterator StackTreeDesignBinary Search TreeBinary TreeIterator 68.5%
124 Binary Tree Maximum Path Dynamic ProgrammingTreeDepth-First SearchBinary Tree 38.2%
Sum
307 Range Sum Query - Mutable ArrayDesignBinary Indexed TreeSegment Tree 40.6%
2092 Find All People With Secret Depth-First SearchBreadth-First SearchUnion FindGraphSorting 34.0%
96 Unique Binary Search Trees MathDynamic ProgrammingTreeBinary Search TreeBinary Tree 59.0%
2174 Remove All Ones With Row ArrayBit ManipulationBreadth-First SearchMatrix 69.2%
and Column Flips II
270 Closest Binary Search Tree Binary SearchTreeDepth-First SearchBinary Search TreeBinary 54.4%
Value Tree
480 Sliding Window Median ArrayHash TableSliding WindowHeap (Priority Queue) 41.3%
889 Construct Binary Tree from ArrayHash TableDivide and ConquerTreeBinary Tree 70.6%
Preorder and Postorder
Traversal
432 All O`one Data Structure Hash TableLinked ListDesignDoubly-Linked List 36.6%
347 Top K Frequent Elements ArrayHash TableDivide and ConquerSortingHeap (Priority 64.9%
Queue)Bucket SortCountingQuickselect
1606 Find Servers That Handled ArrayGreedyHeap (Priority Queue)Ordered Set 42.3%
Most Number of Requests
658 Find K Closest Elements ArrayTwo PointersBinary SearchSortingHeap (Priority Queue) 45.0%
1157 Online Majority Element In ArrayBinary SearchDesignBinary Indexed TreeSegment Tree 42.1%
Subarray
287 Find the Duplicate Number ArrayTwo PointersBinary SearchBit Manipulation 59.0%
109 Convert Sorted List to Binary Linked ListDivide and ConquerTreeBinary Search TreeBinary 56.8%
Search Tree Tree
395 Longest Substring with At Hash TableStringDivide and ConquerSliding Window 44.8%
Least K Repeating Characters
426 Convert Binary Search Tree Linked ListStackTreeDepth-First SearchBinary Search 64.5%
to Sorted Doubly Linked List TreeBinary TreeDoubly-Linked List
327 Count of Range Sum ArrayBinary SearchDivide and ConquerBinary Indexed 36.1%
TreeSegment TreeMerge SortOrdered Set
Race
108 Convert Sorted Array to ArrayDivide and ConquerTreeBinary Search TreeBinary Tree 68.5%
Binary Search Tree
209 Minimum Size Subarray Sum ArrayBinary SearchSliding WindowPrefix Sum 44.2%
105 Construct Binary Tree from ArrayHash TableDivide and ConquerTreeBinary Tree 60.1%
Preorder and Inorder
Traversal
98 Validate Binary Search Tree TreeDepth-First SearchBinary Search TreeBinary Tree 31.5%
501 Find Mode in Binary Search TreeDepth-First SearchBinary Search TreeBinary Tree 48.2%
Tree
99 Recover Binary Search Tree TreeDepth-First SearchBinary Search TreeBinary Tree 49.8%
# Title Tags Acceptanc
230 Kth Smallest Element in a TreeDepth-First SearchBinary Search TreeBinary Tree 68.8%
BST
703 Kth Largest Element in a TreeDesignBinary Search TreeHeap (Priority Queue)Binary 55.3%
Stream TreeData Stream
Target Sum
864 Shortest Path to Get All Keys Bit ManipulationBreadth-First Search 45.3%
148 Sort List Linked ListTwo PointersDivide and ConquerSortingMerge Sort 53.5%
862 Shortest Subarray with Sum ArrayBinary SearchQueueSliding WindowHeap (Priority 26.1%
at Least K Queue)Prefix SumMonotonic Queue
272 Closest Binary Search Tree Two PointersStackTreeDepth-First SearchBinary Search 58.0%
Value II TreeHeap (Priority Queue)Binary Tree
235 Lowest Common Ancestor of TreeDepth-First SearchBinary Search TreeBinary Tree 59.6%
a Binary Search Tree
114 Flatten Binary Tree to Linked Linked ListStackTreeDepth-First SearchBinary Tree 60.6%
List
1506 Find Root of N-Ary Tree Hash TableBit ManipulationTreeDepth-First Search 77.7%
938 Range Sum of BST TreeDepth-First SearchBinary Search TreeBinary Tree 85.3%
802 Find Eventual Safe States Depth-First SearchBreadth-First SearchGraphTopological Sort 54.0%
1004 Max Consecutive Ones III ArrayBinary SearchSliding WindowPrefix Sum 63.4%
2035 Partition Array Into Two ArrayTwo PointersBinary SearchDynamic ProgrammingBit 18.0%
Arrays to Minimize Sum ManipulationOrdered SetBitmask
Difference
930 Binary Subarrays With Sum ArrayHash TableSliding WindowPrefix Sum 50.2%
617 Merge Two Binary Trees TreeDepth-First SearchBreadth-First SearchBinary Tree 78.4%
1461 Check If a String Contains Hash TableStringBit ManipulationRolling HashHash Function 56.8%
All Binary Codes of Size K
1305 All Elements in Two Binary TreeDepth-First SearchBinary Search TreeSortingBinary Tree 79.7%
Search Trees
106 Construct Binary Tree from ArrayHash TableDivide and ConquerTreeBinary Tree 56.9%
Inorder and Postorder
Traversal
199 Binary Tree Right Side View TreeDepth-First SearchBreadth-First SearchBinary Tree 60.9%
1756 Design Most Recently Used ArrayHash TableStackDesignBinary Indexed TreeOrdered Set 78.7%
Queue
314 Binary Tree Vertical Order Hash TableTreeDepth-First SearchBreadth-First SearchBinary 51.8%
Traversal Tree
Communicate FindMatrixCounting
1135 Connecting Cities With Union FindGraphHeap (Priority Queue)Minimum Spanning 61.0%
Minimum Cost Tree
Chain
1488 Avoid Flood in The City ArrayHash TableBinary SearchGreedyHeap (Priority Queue) 25.9%
1202 Smallest String With Swaps Hash TableStringDepth-First SearchBreadth-First SearchUnion 57.4%
Find
Bus
1851 Minimum Interval to Include ArrayBinary SearchLine SweepSortingHeap (Priority Queue) 47.0%
Each Query
1346 Check If N and Its Double ArrayHash TableTwo PointersBinary SearchSorting 35.9%
Exist
2031 Count Subarrays With More ArrayBinary SearchDivide and ConquerBinary Indexed 52.7%
Ones Than Zeros TreeSegment TreeMerge SortOrdered Set
1738 Find Kth Largest XOR ArrayDivide and ConquerBit ManipulationHeap (Priority 61.8%
Coordinate Value Queue)MatrixPrefix SumQuickselect
2251 Number of Flowers in Full ArrayHash TableBinary SearchSortingPrefix SumOrdered Set 51.8%
Bloom
2286 Booking Concert Tickets in Binary SearchDesignBinary Indexed TreeSegment Tree 15.1%
Groups
2302 Count Subarrays With Score ArrayBinary SearchSliding WindowPrefix Sum 51.4%
Less Than K
2349 Design a Number Container Hash TableDesignHeap (Priority Queue)Ordered Set 46.3%
System