Google LeetCode Interview Questions
Practice 2344 coding problems currently tagged to Google. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
616 Easy
1223 Medium
505 Hard
Top Topics at Google
Ace your Google interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Google LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Two Sum 100% | EasyE | Solve→ |
Add Two Numbers 78.6% | MediumM | Solve→ |
Median of Two Sorted Arrays 73.9% | HardH | Solve→ |
Trapping Rain Water 73.9% | HardH | Solve→ |
Longest Common Prefix 73.2% | EasyE | Solve→ |
Palindrome Number 73.2% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 72.5% | MediumM | Solve→ |
3Sum 72.3% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 71.7% | EasyE | Solve→ |
Merge Sorted Array 71.4% | EasyE | Solve→ |
Longest Consecutive Sequence 69.6% | MediumM | Solve→ |
Merge Strings Alternately 69.5% | EasyE | Solve→ |
Longest Palindromic Substring 69.5% | MediumM | Solve→ |
Create Hello World Function 69.4% | EasyE | Solve→ |
Container With Most Water 68.1% | MediumM | Solve→ |
Majority Element 66.6% | EasyE | Solve→ |
Valid Parentheses 66.4% | EasyE | Solve→ |
Recyclable and Low Fat Products 66% | EasyE | Solve→ |
Reverse Integer 65.6% | MediumM | Solve→ |
Roman to Integer 65.6% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 65.5% | EasyE | Solve→ |
Subarray Sum Equals K 65.5% | MediumM | Solve→ |
Merge Intervals 65.4% | MediumM | Solve→ |
Number of Islands 65.3% | MediumM | Solve→ |
Maximum Subarray 64.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Climbing Stairs 63.5% | EasyE | Solve→ |
Merge Two Sorted Lists 61.8% | EasyE | Solve→ |
Generate Parentheses 61.4% | MediumM | Solve→ |
Next Permutation 60.7% | MediumM | Solve→ |
Reverse Linked List 59.3% | EasyE | Solve→ |
Spiral Matrix 59% | MediumM | Solve→ |
Meeting Rooms II 58.8% | MediumM | Solve→ |
Concatenation of Array 58.6% | EasyE | Solve→ |
Add Two Integers 58.5% | EasyE | Solve→ |
Move Zeroes 58.3% | EasyE | Solve→ |
Decode String 58.3% | MediumM | Solve→ |
Koko Eating Bananas 58.2% | MediumM | Solve→ |
Search in Rotated Sorted Array 57.9% | MediumM | Solve→ |
Remove Element 57.9% | EasyE | Solve→ |
LRU Cache 57.6% | MediumM | Solve→ |
Top K Frequent Elements 57.6% | MediumM | Solve→ |
Split Array Largest Sum 57.6% | HardH | Solve→ |
N-Queens 57.4% | HardH | Solve→ |
Valid Anagram 57.2% | EasyE | Solve→ |
Letter Combinations of a Phone Number 57.2% | MediumM | Solve→ |
House Robber 57.2% | MediumM | Solve→ |
4Sum 57.1% | MediumM | Solve→ |
Jump Game 57.1% | MediumM | Solve→ |
Pascal's Triangle 57.1% | EasyE | Solve→ |
Single Number 57.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Largest Rectangle in Histogram 57% | HardH | Solve→ |
Rotate Array 56.6% | MediumM | Solve→ |
Minimum Number of Increments on Subarrays to Form a Target Array 56.5% | HardH | Solve→ |
Find Peak Element 56.5% | MediumM | Solve→ |
Rotate Image 56.2% | MediumM | Solve→ |
Group Anagrams 56.2% | MediumM | Solve→ |
Plus One 55.3% | EasyE | Solve→ |
Find the Index of the First Occurrence in a String 55.1% | EasyE | Solve→ |
Combine Two Tables 55.1% | EasyE | Solve→ |
Happy Number 54.9% | EasyE | Solve→ |
Search Insert Position 54.8% | EasyE | Solve→ |
Kth Largest Element in an Array 54.8% | MediumM | Solve→ |
Sliding Window Maximum 54.5% | HardH | Solve→ |
Max Consecutive Ones 54.5% | EasyE | Solve→ |
Viewers Turned Streamers 54.5% | HardH | Solve→ |
Pow(x, n) 54.2% | MediumM | Solve→ |
Zigzag Conversion 53.8% | MediumM | Solve→ |
Longest Repeating Character Replacement 53.8% | MediumM | Solve→ |
Single Element in a Sorted Array 53.8% | MediumM | Solve→ |
Product of Array Except Self 53.7% | MediumM | Solve→ |
Add Binary 53.4% | EasyE | Solve→ |
Power of Two 53.4% | EasyE | Solve→ |
Sort Colors 53.2% | MediumM | Solve→ |
Number of Visible People in a Queue 52.9% | HardH | Solve→ |
Russian Doll Envelopes 52.7% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Increasing Subsequence 52.5% | MediumM | Solve→ |
Logger Rate Limiter 52.3% | EasyE | Solve→ |
Valid Palindrome 52.3% | EasyE | Solve→ |
Contains Duplicate 52.3% | EasyE | Solve→ |
Regular Expression Matching 52.2% | HardH | Solve→ |
Find First and Last Position of Element in Sorted Array 52.2% | MediumM | Solve→ |
Rotting Oranges 52% | MediumM | Solve→ |
Sqrt(x) 52% | EasyE | Solve→ |
Binary Search 51.8% | EasyE | Solve→ |
Course Schedule 51.8% | MediumM | Solve→ |
Set Matrix Zeroes 51.4% | MediumM | Solve→ |
Maximal Square 51.4% | MediumM | Solve→ |
Find Median from Data Stream 51.3% | HardH | Solve→ |
Subsets 51.3% | MediumM | Solve→ |
Maximal Rectangle 51.1% | HardH | Solve→ |
Maximum Product Subarray 51.1% | MediumM | Solve→ |
Intersection of Two Arrays 50.9% | EasyE | Solve→ |
Remove Nth Node From End of List 50.5% | MediumM | Solve→ |
Basic Calculator 50.5% | HardH | Solve→ |
3Sum Closest 50.3% | MediumM | Solve→ |
Fruit Into Baskets 50.1% | MediumM | Solve→ |
Min Stack 50.1% | MediumM | Solve→ |
Permutations 49.7% | MediumM | Solve→ |
Merge k Sorted Lists 49.5% | HardH | Solve→ |
Palindrome Linked List 49.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Unique Paths 49.3% | MediumM | Solve→ |
First Missing Positive 49% | HardH | Solve→ |
Contains Duplicate II 49% | EasyE | Solve→ |
Two Sum II - Input Array Is Sorted 49% | MediumM | Solve→ |
Max Consecutive Ones III 49% | MediumM | Solve→ |
Count Number of Trapezoids II 48.8% | HardH | Solve→ |
Best Time to Buy and Sell Stock II 48.6% | MediumM | Solve→ |
Coin Change 48.6% | MediumM | Solve→ |
Middle of the Linked List 48.6% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 48.1% | HardH | Solve→ |
Jump Game II 47.7% | MediumM | Solve→ |
Combination Sum 47.4% | MediumM | Solve→ |
Candy 47.2% | HardH | Solve→ |
Linked List Cycle 47.2% | EasyE | Solve→ |
Daily Temperatures 47.2% | MediumM | Solve→ |
Partition Equal Subset Sum 47% | MediumM | Solve→ |
Find All Numbers Disappeared in an Array 47% | EasyE | Solve→ |
Insert Delete GetRandom O(1) 47% | MediumM | Solve→ |
Fibonacci Number 47% | EasyE | Solve→ |
Running Sum of 1d Array 47% | EasyE | Solve→ |
Sudoku Solver 46.7% | HardH | Solve→ |
Zero Array Transformation I 46.7% | MediumM | Solve→ |
Same Tree 46.5% | EasyE | Solve→ |
Reverse Nodes in k-Group 46.5% | HardH | Solve→ |
Valid Sudoku 46.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Length of Last Word 46.5% | EasyE | Solve→ |
Reverse Words in a String 46.5% | MediumM | Solve→ |
Edit Distance 46.2% | MediumM | Solve→ |
Palindrome Partitioning 46.2% | MediumM | Solve→ |
Insert Interval 45.9% | MediumM | Solve→ |
Find the Duplicate Number 45.9% | MediumM | Solve→ |
Count Primes 45.9% | MediumM | Solve→ |
Sum of Subarray Minimums 45.9% | MediumM | Solve→ |
Separate Squares I 45.9% | MediumM | Solve→ |
Isomorphic Strings 45.7% | EasyE | Solve→ |
Missing Number 45.7% | EasyE | Solve→ |
Rotate List 45.7% | MediumM | Solve→ |
Peak Index in a Mountain Array 45.7% | MediumM | Solve→ |
Sort an Array 45.7% | MediumM | Solve→ |
The Earliest Moment When Everyone Become Friends 45.4% | MediumM | Solve→ |
Remove K Digits 45.1% | MediumM | Solve→ |
Reverse Vowels of a String 45.1% | EasyE | Solve→ |
Text Justification 44.8% | HardH | Solve→ |
Subsets II 44.8% | MediumM | Solve→ |
Reverse String 44.8% | EasyE | Solve→ |
Employees Earning More Than Their Managers 44.8% | EasyE | Solve→ |
Capacity To Ship Packages Within D Days 44.8% | MediumM | Solve→ |
Integer to Roman 44.6% | MediumM | Solve→ |
Second Highest Salary 44.6% | MediumM | Solve→ |
Word Break 44.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Number of Trapezoids I 44.6% | MediumM | Solve→ |
String to Integer (atoi) 44.3% | MediumM | Solve→ |
Next Greater Element I 44.3% | EasyE | Solve→ |
Next Greater Element II 44.3% | MediumM | Solve→ |
Diameter of Binary Tree 44.3% | EasyE | Solve→ |
Guess the Word 44.3% | HardH | Solve→ |
Find Customer Referee 44% | EasyE | Solve→ |
Random Pick with Weight 44% | MediumM | Solve→ |
Divide Two Integers 43.7% | MediumM | Solve→ |
Word Search 43.7% | MediumM | Solve→ |
Maximum Average Subarray I 43.7% | EasyE | Solve→ |
Create a DataFrame from List 43.7% | EasyE | Solve→ |
Squares of a Sorted Array 43.7% | EasyE | Solve→ |
Article Views I 43.7% | EasyE | Solve→ |
Check if Array Is Sorted and Rotated 43.7% | EasyE | Solve→ |
Binary Tree Level Order Traversal 43.3% | MediumM | Solve→ |
Largest Number 43.3% | MediumM | Solve→ |
Wildcard Matching 43% | HardH | Solve→ |
Invert Binary Tree 43% | EasyE | Solve→ |
String Compression 43% | MediumM | Solve→ |
First Unique Character in a String 42.7% | EasyE | Solve→ |
Move Pieces to Obtain a String 42.7% | MediumM | Solve→ |
Minimum Size Subarray Sum 42.7% | MediumM | Solve→ |
Reverse Pairs 42.7% | HardH | Solve→ |
Range Module 42.7% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Apply Substitutions 42.7% | MediumM | Solve→ |
Search a 2D Matrix 42.4% | MediumM | Solve→ |
Remove Duplicates from Sorted List 42.4% | EasyE | Solve→ |
Number of Provinces 42.4% | MediumM | Solve→ |
Big Countries 42.4% | EasyE | Solve→ |
Power of Three 42% | EasyE | Solve→ |
Find the Difference 42% | EasyE | Solve→ |
Minimum Window Substring 42% | HardH | Solve→ |
Word Ladder 42% | HardH | Solve→ |
Sort List 42% | MediumM | Solve→ |
Rising Temperature 42% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree 42% | MediumM | Solve→ |
Search a 2D Matrix II 42% | MediumM | Solve→ |
Minimum Area Rectangle 42% | MediumM | Solve→ |
Symmetric Tree 41.7% | EasyE | Solve→ |
Surrounded Regions 41.7% | MediumM | Solve→ |
Majority Element II 41.7% | MediumM | Solve→ |
Burst Balloons 41.7% | HardH | Solve→ |
Permutation in String 41.7% | MediumM | Solve→ |
Unique Number of Occurrences 41.7% | EasyE | Solve→ |
Kth Smallest Element in a BST 41.3% | MediumM | Solve→ |
Remove Duplicates from Sorted Array II 41.3% | MediumM | Solve→ |
Binary Tree Inorder Traversal 41.3% | EasyE | Solve→ |
Pacific Atlantic Water Flow 41.3% | MediumM | Solve→ |
Target Sum 41% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Meeting Rooms III 41% | HardH | Solve→ |
Longest Valid Parentheses 40.6% | HardH | Solve→ |
Odd Even Linked List 40.6% | MediumM | Solve→ |
Greatest Common Divisor of Strings 40.6% | EasyE | Solve→ |
Copy List with Random Pointer 40.2% | MediumM | Solve→ |
Longest Common Subsequence 40.2% | MediumM | Solve→ |
Reverse Linked List II 40.2% | MediumM | Solve→ |
First Bad Version 40.2% | EasyE | Solve→ |
Swap Adjacent in LR String 40.2% | MediumM | Solve→ |
Delete Nodes And Return Forest 40.2% | MediumM | Solve→ |
Minimum Number of Days to Make m Bouquets 40.2% | MediumM | Solve→ |
Rotate String 39.8% | EasyE | Solve→ |
Single Number II 39.8% | MediumM | Solve→ |
Can Place Flowers 39.8% | EasyE | Solve→ |
Frequency of the Most Frequent Element 39.8% | MediumM | Solve→ |
Clone Graph 39.5% | MediumM | Solve→ |
Largest Divisible Subset 39.5% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 39.5% | MediumM | Solve→ |
Maximum Depth of Binary Tree 39.5% | EasyE | Solve→ |
Intersection of Two Linked Lists 39.5% | EasyE | Solve→ |
Task Scheduler 39.5% | MediumM | Solve→ |
Finding MK Average 39.5% | HardH | Solve→ |
Can Make Arithmetic Progression From Sequence 39.5% | EasyE | Solve→ |
24 Game 39% | HardH | Solve→ |
Reorder List 39% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Is Subsequence 39% | EasyE | Solve→ |
Fizz Buzz 39% | EasyE | Solve→ |
Maximum Width Ramp 39% | MediumM | Solve→ |
Zero Array Transformation II 39% | MediumM | Solve→ |
Count Good Numbers 38.6% | MediumM | Solve→ |
Gas Station 38.6% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 38.6% | MediumM | Solve→ |
Summary Ranges 38.6% | EasyE | Solve→ |
Swim in Rising Water 38.6% | HardH | Solve→ |
Shortest Palindrome 38.2% | HardH | Solve→ |
Implement Stack using Queues 38.2% | EasyE | Solve→ |
Add Strings 38.2% | EasyE | Solve→ |
Valid Palindrome II 38.2% | EasyE | Solve→ |
Search in Rotated Sorted Array II 38.2% | MediumM | Solve→ |
Perfect Squares 38.2% | MediumM | Solve→ |
Ransom Note 38.2% | EasyE | Solve→ |
Find Missing and Repeated Values 38.2% | EasyE | Solve→ |
Evaluate Reverse Polish Notation 37.8% | MediumM | Solve→ |
Serialize and Deserialize Binary Tree 37.8% | HardH | Solve→ |
Find All Duplicates in an Array 37.8% | MediumM | Solve→ |
Coin Change II 37.8% | MediumM | Solve→ |
Find K Closest Elements 37.8% | MediumM | Solve→ |
Asteroid Collision 37.8% | MediumM | Solve→ |
Group Shifted Strings 37.3% | MediumM | Solve→ |
Trapping Rain Water II 37.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Network Delay Time 37.3% | MediumM | Solve→ |
Cheapest Flights Within K Stops 37.3% | MediumM | Solve→ |
Simplify Path 37.3% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 37.3% | HardH | Solve→ |
Contiguous Array 37.3% | MediumM | Solve→ |
Reorganize String 37.3% | MediumM | Solve→ |
Count Square Submatrices with All Ones 37.3% | MediumM | Solve→ |
Kth Missing Positive Number 37.3% | EasyE | Solve→ |
Path With Minimum Effort 37.3% | MediumM | Solve→ |
Average Time of Process per Machine 37.3% | EasyE | Solve→ |
Counter 36.8% | EasyE | Solve→ |
Construct Binary Tree from Preorder and Inorder Traversal 36.8% | MediumM | Solve→ |
Employee Bonus 36.8% | EasyE | Solve→ |
Accounts Merge 36.8% | MediumM | Solve→ |
Evaluate Division 36.3% | MediumM | Solve→ |
Binary Subarrays With Sum 36.3% | MediumM | Solve→ |
Swap Nodes in Pairs 36.3% | MediumM | Solve→ |
Implement Trie (Prefix Tree) 36.3% | MediumM | Solve→ |
Course Schedule II 36.3% | MediumM | Solve→ |
Rearrange Array Elements by Sign 36.3% | MediumM | Solve→ |
Delete Node in a Linked List 36.3% | MediumM | Solve→ |
Expression Add Operators 36.3% | HardH | Solve→ |
Assign Cookies 36.3% | EasyE | Solve→ |
Predict the Winner 36.3% | MediumM | Solve→ |
01 Matrix 36.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Online Stock Span 36.3% | MediumM | Solve→ |
Minimum Path Sum 35.8% | MediumM | Solve→ |
Number of Islands II 35.8% | HardH | Solve→ |
Odd Even Jump 35.8% | HardH | Solve→ |
Lexicographically Smallest Beautiful String 35.8% | HardH | Solve→ |
Permutation Sequence 35.8% | HardH | Solve→ |
House Robber II 35.8% | MediumM | Solve→ |
Implement Queue using Stacks 35.8% | EasyE | Solve→ |
Add Digits 35.8% | EasyE | Solve→ |
Sum of Two Integers 35.8% | MediumM | Solve→ |
LFU Cache 35.8% | HardH | Solve→ |
Shortest Path in a Grid with Obstacles Elimination 35.8% | HardH | Solve→ |
Set Mismatch 35.3% | EasyE | Solve→ |
Find All Possible Recipes from Given Supplies 35.3% | MediumM | Solve→ |
Substring with Concatenation of All Words 35.3% | HardH | Solve→ |
Validate Binary Search Tree 35.3% | MediumM | Solve→ |
Range Sum Query - Immutable 35.3% | EasyE | Solve→ |
Maximum XOR of Two Numbers in an Array 35.3% | MediumM | Solve→ |
Number of Matching Subsequences 35.3% | MediumM | Solve→ |
Race Car 35.3% | HardH | Solve→ |
Maximum Swap 34.8% | MediumM | Solve→ |
Multiply Strings 34.8% | MediumM | Solve→ |
Linked List Cycle II 34.8% | MediumM | Solve→ |
Alien Dictionary 34.8% | HardH | Solve→ |
Repeated Substring Pattern 34.8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Domino and Tromino Tiling 34.8% | MediumM | Solve→ |
Backspace String Compare 34.8% | EasyE | Solve→ |
Minimum Area Rectangle II 34.8% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 34.8% | HardH | Solve→ |
Average Selling Price 34.8% | EasyE | Solve→ |
Word Search II 34.2% | HardH | Solve→ |
Exclusive Time of Functions 34.2% | MediumM | Solve→ |
Partition Array Into Two Arrays to Minimize Sum Difference 34.2% | HardH | Solve→ |
Minimum Time to Finish the Race 34.2% | HardH | Solve→ |
H-Index 34.2% | MediumM | Solve→ |
Design Hit Counter 34.2% | MediumM | Solve→ |
Managers with at Least 5 Direct Reports 34.2% | MediumM | Solve→ |
Shortest Path in Binary Matrix 34.2% | MediumM | Solve→ |
Shuffle the Array 34.2% | EasyE | Solve→ |
Next Special Palindrome Number 34.2% | HardH | Solve→ |
Binary Tree Right Side View 33.7% | MediumM | Solve→ |
Combination Sum IV 33.7% | MediumM | Solve→ |
Min Cost Climbing Stairs 33.7% | EasyE | Solve→ |
Bus Routes 33.7% | HardH | Solve→ |
Rank Transform of an Array 33.7% | EasyE | Solve→ |
Balanced Binary Tree 33.7% | EasyE | Solve→ |
Triangle 33.7% | MediumM | Solve→ |
Diagonal Traverse 33.7% | MediumM | Solve→ |
Redundant Connection 33.7% | MediumM | Solve→ |
Kth Largest Element in a Stream 33.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find And Replace in String 33.7% | MediumM | Solve→ |
Subarrays with K Different Integers 33.7% | HardH | Solve→ |
Remove Outermost Parentheses 33.7% | EasyE | Solve→ |
Snapshot Array 33.7% | MediumM | Solve→ |
Score of a String 33.7% | EasyE | Solve→ |
Find Pivot Index 33.7% | EasyE | Solve→ |
Best Time to Buy and Sell Stock with Cooldown 33.1% | MediumM | Solve→ |
Count of Smaller Numbers After Self 33.1% | HardH | Solve→ |
Reconstruct Itinerary 33.1% | HardH | Solve→ |
Moving Average from Data Stream 33.1% | EasyE | Solve→ |
Reverse String II 33.1% | EasyE | Solve→ |
Shortest Unsorted Continuous Subarray 33.1% | MediumM | Solve→ |
Richest Customer Wealth 33.1% | EasyE | Solve→ |
Find the Safest Path in a Grid 33.1% | MediumM | Solve→ |
Find Longest Special Substring That Occurs Thrice I 33.1% | MediumM | Solve→ |
Count and Say 33.1% | MediumM | Solve→ |
Combination Sum II 33.1% | MediumM | Solve→ |
Remove Duplicate Letters 33.1% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 33.1% | MediumM | Solve→ |
Max Area of Island 33.1% | MediumM | Solve→ |
Find Eventual Safe States 33.1% | MediumM | Solve→ |
Subarray Sums Divisible by K 33.1% | MediumM | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 33.1% | EasyE | Solve→ |
Single-Threaded CPU 33.1% | MediumM | Solve→ |
Ugly Number 33.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find X-Sum of All K-Long Subarrays I 33.1% | EasyE | Solve→ |
Combinations 32.4% | MediumM | Solve→ |
Flatten Binary Tree to Linked List 32.4% | MediumM | Solve→ |
Binary Tree Paths 32.4% | EasyE | Solve→ |
Number of Closed Islands 32.4% | MediumM | Solve→ |
The Latest Time to Catch a Bus 32.4% | MediumM | Solve→ |
Count Days Without Meetings 32.4% | MediumM | Solve→ |
Convert Sorted Array to Binary Search Tree 32.4% | EasyE | Solve→ |
Non-overlapping Intervals 32.4% | MediumM | Solve→ |
Sort Characters By Frequency 32.4% | MediumM | Solve→ |
Soup Servings 32.4% | MediumM | Solve→ |
Monthly Transactions I 32.4% | MediumM | Solve→ |
Design a Stack With Increment Operation 32.4% | MediumM | Solve→ |
Replace Employee ID With The Unique Identifier 32.4% | EasyE | Solve→ |
Maximum Points You Can Obtain from Cards 32.4% | MediumM | Solve→ |
Type of Triangle 32.4% | EasyE | Solve→ |
Path Existence Queries in a Graph I 32.4% | MediumM | Solve→ |
Linked List Random Node 31.8% | MediumM | Solve→ |
Sequence Reconstruction 31.8% | MediumM | Solve→ |
Top K Frequent Words 31.8% | MediumM | Solve→ |
Champagne Tower 31.8% | MediumM | Solve→ |
Sum of Distances in Tree 31.8% | HardH | Solve→ |
Minimum Number of Operations to Move All Balls to Each Box 31.8% | MediumM | Solve→ |
Minimum Weighted Subgraph With the Required Paths 31.8% | HardH | Solve→ |
Unique Paths II 31.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Recover Binary Search Tree 31.8% | MediumM | Solve→ |
Excel Sheet Column Title 31.8% | EasyE | Solve→ |
Remove Linked List Elements 31.8% | EasyE | Solve→ |
Nth Digit 31.8% | MediumM | Solve→ |
Find All Anagrams in a String 31.8% | MediumM | Solve→ |
Delete Node in a BST 31.8% | MediumM | Solve→ |
Palindromic Substrings 31.8% | MediumM | Solve→ |
Flood Fill 31.8% | EasyE | Solve→ |
Continuous Subarrays 31.8% | MediumM | Solve→ |
Car Fleet 31.8% | MediumM | Solve→ |
Transpose Matrix 31.8% | EasyE | Solve→ |
Students and Examinations 31.8% | EasyE | Solve→ |
Maximum Good Subarray Sum 31.8% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended 31.8% | MediumM | Solve→ |
Inverse Coin Change 31.8% | MediumM | Solve→ |
Remove Duplicates from Sorted List II 31.1% | MediumM | Solve→ |
Fraction to Recurring Decimal 31.1% | MediumM | Solve→ |
The Skyline Problem 31.1% | HardH | Solve→ |
Maximum Candies Allocated to K Children 31.1% | MediumM | Solve→ |
Minimum Cost to Make at Least One Valid Path in a Grid 31.1% | HardH | Solve→ |
Detect Squares 31.1% | MediumM | Solve→ |
Detonate the Maximum Bombs 31.1% | MediumM | Solve→ |
Height of Binary Tree After Subtree Removal Queries 31.1% | HardH | Solve→ |
Partition List 31.1% | MediumM | Solve→ |
Best Time to Buy and Sell Stock III 31.1% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of 1 Bits 31.1% | EasyE | Solve→ |
Longest Palindrome 31.1% | EasyE | Solve→ |
Flipping an Image 31.1% | EasyE | Solve→ |
Time Based Key-Value Store 31.1% | MediumM | Solve→ |
Subarray Product Less Than K 30.4% | MediumM | Solve→ |
Keys and Rooms 30.4% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 30.4% | MediumM | Solve→ |
Stone Game III 30.4% | HardH | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 30.4% | MediumM | Solve→ |
Find the Highest Altitude 30.4% | EasyE | Solve→ |
Find Original Array From Doubled Array 30.4% | MediumM | Solve→ |
Design a Number Container System 30.4% | MediumM | Solve→ |
Time Taken to Cross the Door 30.4% | HardH | Solve→ |
Permutations II 30.4% | MediumM | Solve→ |
Decode Ways 30.4% | MediumM | Solve→ |
Consecutive Numbers 30.4% | MediumM | Solve→ |
Encode and Decode Strings 30.4% | MediumM | Solve→ |
Minimum Height Trees 30.4% | MediumM | Solve→ |
Third Maximum Number 30.4% | EasyE | Solve→ |
Triangle Judgement 30.4% | EasyE | Solve→ |
Find Duplicate Subtrees 30.4% | MediumM | Solve→ |
Maximum Width of Binary Tree 30.4% | MediumM | Solve→ |
Minimum Interval to Include Each Query 30.4% | HardH | Solve→ |
Range Sum Query 2D - Immutable 30.4% | MediumM | Solve→ |
Customers Who Never Order 30.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Basic Calculator II 29.7% | MediumM | Solve→ |
Android Unlock Patterns 29.7% | MediumM | Solve→ |
Path Sum III 29.7% | MediumM | Solve→ |
Repeated String Match 29.7% | MediumM | Solve→ |
Shortest Path Visiting All Nodes 29.7% | HardH | Solve→ |
All Nodes Distance K in Binary Tree 29.7% | MediumM | Solve→ |
Minimum Falling Path Sum 29.7% | MediumM | Solve→ |
Longest Duplicate Substring 29.7% | HardH | Solve→ |
Find the Difference of Two Arrays 29.7% | EasyE | Solve→ |
Number of Substrings Containing All Three Characters 29.7% | MediumM | Solve→ |
Check If N and Its Double Exist 29.7% | EasyE | Solve→ |
Maximum Score After Splitting a String 29.7% | EasyE | Solve→ |
Build Array from Permutation 29.7% | EasyE | Solve→ |
Unique Length-3 Palindromic Subsequences 29.7% | MediumM | Solve→ |
Array Prototype Last 29.7% | EasyE | Solve→ |
Word Ladder II 29.7% | HardH | Solve→ |
Word Break II 29.7% | HardH | Solve→ |
Increasing Triplet Subsequence 29.7% | MediumM | Solve→ |
Making A Large Island 29.7% | HardH | Solve→ |
New 21 Game 29.7% | MediumM | Solve→ |
Shortest Common Supersequence 29.7% | HardH | Solve→ |
Car Pooling 29.7% | MediumM | Solve→ |
Stone Game 29.7% | MediumM | Solve→ |
K-th Smallest in Lexicographical Order 29.7% | HardH | Solve→ |
Number of Digit One 28.9% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Graph Valid Tree 28.9% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 28.9% | MediumM | Solve→ |
Sliding Window Median 28.9% | HardH | Solve→ |
Minimum Absolute Difference in BST 28.9% | EasyE | Solve→ |
Sum of Square Numbers 28.9% | MediumM | Solve→ |
Valid Parenthesis String 28.9% | MediumM | Solve→ |
K-th Symbol in Grammar 28.9% | MediumM | Solve→ |
Largest Triangle Area 28.9% | EasyE | Solve→ |
Boats to Save People 28.9% | MediumM | Solve→ |
Find in Mountain Array 28.9% | HardH | Solve→ |
Remove Sub-Folders from the Filesystem 28.9% | MediumM | Solve→ |
Delete Nodes From Linked List Present in Array 28.9% | MediumM | Solve→ |
Integer to English Words 28.9% | HardH | Solve→ |
Flatten Nested List Iterator 28.9% | MediumM | Solve→ |
Intersection of Two Arrays II 28.9% | EasyE | Solve→ |
Longest Palindromic Subsequence 28.9% | MediumM | Solve→ |
Two Sum IV - Input is a BST 28.9% | EasyE | Solve→ |
Shortest Subarray with Sum at Least K 28.9% | HardH | Solve→ |
Remove All Adjacent Duplicates In String 28.9% | EasyE | Solve→ |
Duplicate Zeros 28.9% | EasyE | Solve→ |
Longest Arithmetic Subsequence of Given Difference 28.9% | MediumM | Solve→ |
Divide Array in Sets of K Consecutive Numbers 28.9% | MediumM | Solve→ |
How Many Numbers Are Smaller Than the Current Number 28.9% | EasyE | Solve→ |
Number of Good Pairs 28.9% | EasyE | Solve→ |
Sum of Beauty of All Substrings 28.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Frequency of an Element After Performing Operations I 28.9% | MediumM | Solve→ |
Maximum Product of Three Numbers 28.9% | EasyE | Solve→ |
Longest Non-Decreasing Subarray After Replacing at Most One Element 28.9% | MediumM | Solve→ |
Spiral Matrix II 28.1% | MediumM | Solve→ |
Rank Scores 28.1% | MediumM | Solve→ |
Wiggle Sort II 28.1% | MediumM | Solve→ |
House Robber III 28.1% | MediumM | Solve→ |
Count Numbers with Unique Digits 28.1% | MediumM | Solve→ |
Detect Capital 28.1% | EasyE | Solve→ |
Max Chunks To Make Sorted 28.1% | MediumM | Solve→ |
Minimum Domino Rotations For Equal Row 28.1% | MediumM | Solve→ |
Longest Arithmetic Subsequence 28.1% | MediumM | Solve→ |
Maximum Level Sum of a Binary Tree 28.1% | MediumM | Solve→ |
Smallest Subsequence of Distinct Characters 28.1% | MediumM | Solve→ |
Find the Smallest Divisor Given a Threshold 28.1% | MediumM | Solve→ |
Product of the Last K Numbers 28.1% | MediumM | Solve→ |
Sender With Largest Word Count 28.1% | MediumM | Solve→ |
Design a Text Editor 28.1% | HardH | Solve→ |
Maximum Beauty of an Array After Applying Operation 28.1% | MediumM | Solve→ |
Interleaving String 28.1% | MediumM | Solve→ |
Pascal's Triangle II 28.1% | EasyE | Solve→ |
Binary Search Tree Iterator 28.1% | MediumM | Solve→ |
Queue Reconstruction by Height 28.1% | MediumM | Solve→ |
Island Perimeter 28.1% | EasyE | Solve→ |
Minimum Time Difference 28.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Jewels and Stones 28.1% | EasyE | Solve→ |
Is Graph Bipartite? 28.1% | MediumM | Solve→ |
Design Linked List 28.1% | MediumM | Solve→ |
Snakes and Ladders 28.1% | MediumM | Solve→ |
Number of Recent Calls 28.1% | EasyE | Solve→ |
K Closest Points to Origin 28.1% | MediumM | Solve→ |
Kids With the Greatest Number of Candies 28.1% | EasyE | Solve→ |
Water Bottles 28.1% | EasyE | Solve→ |
Lexicographical Numbers 28.1% | MediumM | Solve→ |
Nth Highest Salary 28.1% | MediumM | Solve→ |
Sum of Good Subsequences 28.1% | HardH | Solve→ |
Find Numbers with Even Number of Digits 28.1% | EasyE | Solve→ |
Zero Array Transformation III 28.1% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 27.2% | MediumM | Solve→ |
Robot Return to Origin 27.2% | EasyE | Solve→ |
Rotated Digits 27.2% | MediumM | Solve→ |
Smallest Integer Divisible by K 27.2% | MediumM | Solve→ |
Kth Ancestor of a Tree Node 27.2% | HardH | Solve→ |
Longest Subarray of 1's After Deleting One Element 27.2% | MediumM | Solve→ |
Number of Subsequences That Satisfy the Given Sum Condition 27.2% | MediumM | Solve→ |
Minimum Operations to Reduce X to Zero 27.2% | MediumM | Solve→ |
Painting a Grid With Three Different Colors 27.2% | HardH | Solve→ |
To Be Or Not To Be 27.2% | EasyE | Solve→ |
Sum Root to Leaf Numbers 27.2% | MediumM | Solve→ |
Binary Tree Preorder Traversal 27.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Delete the Middle Node of a Linked List 27.2% | MediumM | Solve→ |
Count Complete Tree Nodes 27.2% | MediumM | Solve→ |
Valid Perfect Square 27.2% | EasyE | Solve→ |
My Calendar I 27.2% | MediumM | Solve→ |
Number of Enclaves 27.2% | MediumM | Solve→ |
Product Price at a Given Date 27.2% | MediumM | Solve→ |
The kth Factor of n 27.2% | MediumM | Solve→ |
Minimum Difference Between Largest and Smallest Value in Three Moves 27.2% | MediumM | Solve→ |
Maximum Score From Removing Substrings 27.2% | MediumM | Solve→ |
Check if Grid can be Cut into Sections 27.2% | MediumM | Solve→ |
Reschedule Meetings for Maximum Free Time I 27.2% | MediumM | Solve→ |
Longest Harmonious Subsequence 27.2% | EasyE | Solve→ |
Missing Ranges 26.3% | EasyE | Solve→ |
Best Time to Buy and Sell Stock IV 26.3% | HardH | Solve→ |
Walls and Gates 26.3% | MediumM | Solve→ |
Power of Four 26.3% | EasyE | Solve→ |
Find Leaves of Binary Tree 26.3% | MediumM | Solve→ |
Frog Jump 26.3% | HardH | Solve→ |
Valid Word Abbreviation 26.3% | EasyE | Solve→ |
Optimal Account Balancing 26.3% | HardH | Solve→ |
Ones and Zeroes 26.3% | MediumM | Solve→ |
Student Attendance Record II 26.3% | HardH | Solve→ |
Maximum Sum of 3 Non-Overlapping Subarrays 26.3% | HardH | Solve→ |
My Calendar II 26.3% | MediumM | Solve→ |
Expressive Words 26.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Robot Room Cleaner 26.3% | HardH | Solve→ |
Bag of Tokens 26.3% | MediumM | Solve→ |
Tuple with Same Product 26.3% | MediumM | Solve→ |
Count Submatrices With All Ones 26.3% | MediumM | Solve→ |
Make The String Great 26.3% | EasyE | Solve→ |
Convert 1D Array Into 2D Array 26.3% | EasyE | Solve→ |
Check if Word Can Be Placed In Crossword 26.3% | MediumM | Solve→ |
Maximum Score of a Node Sequence 26.3% | HardH | Solve→ |
First Letter to Appear Twice 26.3% | EasyE | Solve→ |
Divide Array Into Arrays With Max Difference 26.3% | MediumM | Solve→ |
Max Points on a Line 26.3% | HardH | Solve→ |
Duplicate Emails 26.3% | EasyE | Solve→ |
Reverse Bits 26.3% | EasyE | Solve→ |
Delete Duplicate Emails 26.3% | EasyE | Solve→ |
Longest Absolute File Path 26.3% | MediumM | Solve→ |
132 Pattern 26.3% | MediumM | Solve→ |
Heaters 26.3% | MediumM | Solve→ |
Design Search Autocomplete System 26.3% | HardH | Solve→ |
RLE Iterator 26.3% | MediumM | Solve→ |
Maximum Sum Circular Subarray 26.3% | MediumM | Solve→ |
Interval List Intersections 26.3% | MediumM | Solve→ |
User Activity for the Past 30 Days I 26.3% | EasyE | Solve→ |
Queries Quality and Percentage 26.3% | EasyE | Solve→ |
Count Number of Nice Subarrays 26.3% | MediumM | Solve→ |
Minimum Cost to Cut a Stick 26.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Length of the Longest Common Prefix 26.3% | MediumM | Solve→ |
All O`one Data Structure 26.3% | HardH | Solve→ |
Project Employees I 26.3% | EasyE | Solve→ |
Adjacent Increasing Subarrays Detection I 26.3% | EasyE | Solve→ |
Invalid Tweets 26.3% | EasyE | Solve→ |
Count Special Subsequences 26.3% | MediumM | Solve→ |
Maximum Number of Distinct Elements After Operations 26.3% | MediumM | Solve→ |
Word Pattern 25.4% | EasyE | Solve→ |
Shortest Distance from All Buildings 25.4% | HardH | Solve→ |
Create Maximum Number 25.4% | HardH | Solve→ |
Kth Smallest Element in a Sorted Matrix 25.4% | MediumM | Solve→ |
Find Mode in Binary Search Tree 25.4% | EasyE | Solve→ |
Delete Operation for Two Strings 25.4% | MediumM | Solve→ |
Largest Number At Least Twice of Others 25.4% | EasyE | Solve→ |
Longest Mountain in Array 25.4% | MediumM | Solve→ |
Rank Teams by Votes 25.4% | MediumM | Solve→ |
Build an Array With Stack Operations 25.4% | MediumM | Solve→ |
Find the Most Competitive Subsequence 25.4% | MediumM | Solve→ |
Minimum Number of Flips to Make the Binary String Alternating 25.4% | MediumM | Solve→ |
Stock Price Fluctuation 25.4% | MediumM | Solve→ |
Find All K-Distant Indices in an Array 25.4% | EasyE | Solve→ |
Maximum Number of K-Divisible Components 25.4% | HardH | Solve→ |
Convert Sorted List to Binary Search Tree 25.4% | MediumM | Solve→ |
Path Sum 25.4% | EasyE | Solve→ |
Distinct Subsequences 25.4% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Ways to Build Sturdy Brick Wall 25.4% | MediumM | Solve→ |
Bulls and Cows 25.4% | MediumM | Solve→ |
Maximum Product of Word Lengths 25.4% | MediumM | Solve→ |
Counting Bits 25.4% | EasyE | Solve→ |
Longest Increasing Subsequence II 25.4% | HardH | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 25.4% | MediumM | Solve→ |
Relative Ranks 25.4% | EasyE | Solve→ |
Toeplitz Matrix 25.4% | EasyE | Solve→ |
Search in a Binary Search Tree 25.4% | EasyE | Solve→ |
Design Circular Queue 25.4% | MediumM | Solve→ |
Sort Array By Parity 25.4% | EasyE | Solve→ |
Shortest Bridge 25.4% | MediumM | Solve→ |
Defanging an IP Address 25.4% | EasyE | Solve→ |
N-th Tribonacci Number 25.4% | EasyE | Solve→ |
Path with Maximum Probability 25.4% | MediumM | Solve→ |
Nim Game 25.4% | EasyE | Solve→ |
Find the Prefix Common Array of Two Arrays 25.4% | MediumM | Solve→ |
Special Array I 25.4% | EasyE | Solve→ |
Count Number of Bad Pairs 25.4% | MediumM | Solve→ |
Path With Maximum Minimum Value 25.4% | MediumM | Solve→ |
Minimum Depth of Binary Tree 24.4% | EasyE | Solve→ |
Populating Next Right Pointers in Each Node 24.4% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array II 24.4% | HardH | Solve→ |
Sort Transformed Array 24.4% | MediumM | Solve→ |
Binary Watch 24.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Insert into a Binary Search Tree 24.4% | MediumM | Solve→ |
Magic Squares In Grid 24.4% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 24.4% | MediumM | Solve→ |
X of a Kind in a Deck of Cards 24.4% | EasyE | Solve→ |
Unique Email Addresses 24.4% | EasyE | Solve→ |
Knight Dialer 24.4% | MediumM | Solve→ |
Matrix Block Sum 24.4% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 24.4% | MediumM | Solve→ |
Count Servers that Communicate 24.4% | MediumM | Solve→ |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold 24.4% | MediumM | Solve→ |
Parallel Courses II 24.4% | HardH | Solve→ |
Minimize Hamming Distance After Swap Operations 24.4% | MediumM | Solve→ |
Largest Submatrix With Rearrangements 24.4% | MediumM | Solve→ |
Evaluate the Bracket Pairs of a String 24.4% | MediumM | Solve→ |
Describe the Painting 24.4% | MediumM | Solve→ |
Find Target Indices After Sorting Array 24.4% | EasyE | Solve→ |
Find All People With Secret 24.4% | HardH | Solve→ |
Counting Words With a Given Prefix 24.4% | EasyE | Solve→ |
Words Within Two Edits of Dictionary 24.4% | MediumM | Solve→ |
Merge Two 2D Arrays by Summing Values 24.4% | EasyE | Solve→ |
Find the Number of Ways to Place People I 24.4% | MediumM | Solve→ |
Maximum Number of Points with Cost 24.4% | MediumM | Solve→ |
Restore IP Addresses 24.4% | MediumM | Solve→ |
Dungeon Game 24.4% | HardH | Solve→ |
Design Add and Search Words Data Structure 24.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Palindrome Pairs 24.4% | HardH | Solve→ |
Continuous Subarray Sum 24.4% | MediumM | Solve→ |
Buddy Strings 24.4% | EasyE | Solve→ |
Valid Mountain Array 24.4% | EasyE | Solve→ |
Construct Binary Search Tree from Preorder Traversal 24.4% | MediumM | Solve→ |
Game Play Analysis IV 24.4% | MediumM | Solve→ |
Immediate Food Delivery II 24.4% | MediumM | Solve→ |
Time Needed to Inform All Employees 24.4% | MediumM | Solve→ |
Exchange Seats 24.4% | MediumM | Solve→ |
Number of Ways to Arrive at Destination 24.4% | MediumM | Solve→ |
Lemonade Change 24.4% | EasyE | Solve→ |
Maximum Frequency of an Element After Performing Operations II 24.4% | HardH | Solve→ |
Percentage of Users Attended a Contest 24.4% | EasyE | Solve→ |
Find N Unique Integers Sum up to Zero 24.4% | EasyE | Solve→ |
Count Non-Decreasing Subarrays After K Operations 24.4% | HardH | Solve→ |
Maximum Product of Two Elements in an Array 24.4% | EasyE | Solve→ |
The k-th Lexicographical String of All Happy Strings of Length n 24.4% | MediumM | Solve→ |
Minimum Pair Removal to Sort Array I 24.4% | EasyE | Solve→ |
Fill a Special Grid 24.4% | MediumM | Solve→ |
Game of Life 23.3% | MediumM | Solve→ |
Bulb Switcher 23.3% | MediumM | Solve→ |
Count of Range Sum 23.3% | HardH | Solve→ |
Guess Number Higher or Lower 23.3% | EasyE | Solve→ |
Cracking the Safe 23.3% | HardH | Solve→ |
Pyramid Transition Matrix 23.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Push Dominoes 23.3% | MediumM | Solve→ |
Maximize Distance to Closest Person 23.3% | MediumM | Solve→ |
Word Subsets 23.3% | MediumM | Solve→ |
Flip String to Monotone Increasing 23.3% | MediumM | Solve→ |
Delete Columns to Make Sorted 23.3% | EasyE | Solve→ |
Flip Equivalent Binary Trees 23.3% | MediumM | Solve→ |
Longest String Chain 23.3% | MediumM | Solve→ |
Minimum Knight Moves 23.3% | MediumM | Solve→ |
Tiling a Rectangle with the Fewest Squares 23.3% | HardH | Solve→ |
Sort Integers by The Power Value 23.3% | MediumM | Solve→ |
Check If a String Contains All Binary Codes of Size K 23.3% | MediumM | Solve→ |
The Earliest and Latest Rounds Where Players Compete 23.3% | HardH | Solve→ |
Last Day Where You Can Still Cross 23.3% | HardH | Solve→ |
Count the Number of Fair Pairs 23.3% | MediumM | Solve→ |
Confirmation Rate 23.3% | MediumM | Solve→ |
Find if Path Exists in Graph 23.3% | EasyE | Solve→ |
Unique Binary Search Trees II 23.3% | MediumM | Solve→ |
Unique Binary Search Trees 23.3% | MediumM | Solve→ |
Construct Binary Tree from Inorder and Postorder Traversal 23.3% | MediumM | Solve→ |
Number of Flowers in Full Bloom 23.3% | HardH | Solve→ |
Range Sum Query 2D - Mutable 23.3% | MediumM | Solve→ |
Minimum Obstacle Removal to Reach Corner 23.3% | HardH | Solve→ |
Hand of Straights 23.3% | MediumM | Solve→ |
Smallest String Starting From Leaf 23.3% | MediumM | Solve→ |
Minimum Cost to Merge Stones 23.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Last Stone Weight 23.3% | EasyE | Solve→ |
Clear Digits 23.3% | EasyE | Solve→ |
Find the Maximum Length of Valid Subsequence I 23.3% | MediumM | Solve→ |
Cherry Pickup II 23.3% | HardH | Solve→ |
Special Positions in a Binary Matrix 23.3% | EasyE | Solve→ |
Furthest Building You Can Reach 23.3% | MediumM | Solve→ |
Remove All Occurrences of a Substring 23.3% | MediumM | Solve→ |
Find the Maximum Number of Elements in Subset 23.3% | MediumM | Solve→ |
Smallest Range Covering Elements from K Lists 23.3% | HardH | Solve→ |
Check if DFS Strings Are Palindromes 23.3% | HardH | Solve→ |
Adjacent Increasing Subarrays Detection II 23.3% | MediumM | Solve→ |
Maximum Matrix Sum 23.3% | MediumM | Solve→ |
Two Best Non-Overlapping Events 23.3% | MediumM | Solve→ |
Design Twitter 23.3% | MediumM | Solve→ |
House Robber IV 23.3% | MediumM | Solve→ |
Reschedule Meetings for Maximum Free Time II 23.3% | MediumM | Solve→ |
Check if Number is a Sum of Powers of Three 23.3% | MediumM | Solve→ |
Palindrome Partitioning II 23.3% | HardH | Solve→ |
Find Missing Elements 23.3% | EasyE | Solve→ |
Factorial Trailing Zeroes 22.1% | MediumM | Solve→ |
Wiggle Sort 22.1% | MediumM | Solve→ |
Number of Connected Components in an Undirected Graph 22.1% | MediumM | Solve→ |
Max Sum of Rectangle No Larger Than K 22.1% | HardH | Solve→ |
UTF-8 Validation 22.1% | MediumM | Solve→ |
Integer Replacement 22.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The Maze 22.1% | MediumM | Solve→ |
Longest Word in Dictionary through Deleting 22.1% | MediumM | Solve→ |
Student Attendance Record I 22.1% | EasyE | Solve→ |
Implement Magic Dictionary 22.1% | MediumM | Solve→ |
Escape The Ghosts 22.1% | MediumM | Solve→ |
Insert into a Sorted Circular Linked List 22.1% | MediumM | Solve→ |
Similar String Groups 22.1% | HardH | Solve→ |
Online Election 22.1% | MediumM | Solve→ |
Cat and Mouse 22.1% | HardH | Solve→ |
Beautiful Array 22.1% | MediumM | Solve→ |
Largest Component Size by Common Factor 22.1% | HardH | Solve→ |
Delete Columns to Make Sorted II 22.1% | MediumM | Solve→ |
Stream of Characters 22.1% | HardH | Solve→ |
Filling Bookcase Shelves 22.1% | MediumM | Solve→ |
Remove Interval 22.1% | MediumM | Solve→ |
Print in Order 22.1% | EasyE | Solve→ |
Rank Transform of a Matrix 22.1% | HardH | Solve→ |
Minimum Distance to Type a Word Using Two Fingers 22.1% | HardH | Solve→ |
Jump Game IV 22.1% | HardH | Solve→ |
Number of Ways of Cutting a Pizza 22.1% | HardH | Solve→ |
Number of Good Ways to Split a String 22.1% | MediumM | Solve→ |
Minimum Number of Vertices to Reach All Nodes 22.1% | MediumM | Solve→ |
Split a String Into the Max Number of Unique Substrings 22.1% | MediumM | Solve→ |
Special Array With X Elements Greater Than or Equal X 22.1% | EasyE | Solve→ |
Arithmetic Subarrays 22.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Checking Existence of Edge Length Limited Paths 22.1% | HardH | Solve→ |
Maximum XOR With an Element From Array 22.1% | HardH | Solve→ |
Sentence Similarity III 22.1% | MediumM | Solve→ |
Jump Game VII 22.1% | MediumM | Solve→ |
Final Value of Variable After Performing Operations 22.1% | EasyE | Solve→ |
Number of Zero-Filled Subarrays 22.1% | MediumM | Solve→ |
Number of Good Paths 22.1% | HardH | Solve→ |
Frog Jump II 22.1% | MediumM | Solve→ |
Check if There is a Path With Equal Number of 0's And 1's 22.1% | MediumM | Solve→ |
Find the Punishment Number of an Integer 22.1% | MediumM | Solve→ |
Repeated DNA Sequences 22.1% | MediumM | Solve→ |
Longest Substring with At Least K Repeating Characters 22.1% | MediumM | Solve→ |
Not Boring Movies 22.1% | EasyE | Solve→ |
Number of Atoms 22.1% | HardH | Solve→ |
Employee Free Time 22.1% | HardH | Solve→ |
Shortest Path to Get All Keys 22.1% | HardH | Solve→ |
Critical Connections in a Network 22.1% | HardH | Solve→ |
Path with Maximum Gold 22.1% | MediumM | Solve→ |
Search Suggestions System 22.1% | MediumM | Solve→ |
Convert Object to JSON String 22.1% | MediumM | Solve→ |
Corporate Flight Bookings 22.1% | MediumM | Solve→ |
Largest Odd Number in String 22.1% | EasyE | Solve→ |
Finding 3-Digit Even Numbers 22.1% | EasyE | Solve→ |
Design Task Manager 22.1% | MediumM | Solve→ |
Self Dividing Numbers 22.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Palindromic Subsequence After at Most K Operations 22.1% | MediumM | Solve→ |
Find the K-th Character in String Game I 22.1% | EasyE | Solve→ |
Solving Questions With Brainpower 22.1% | MediumM | Solve→ |
Maximum Erasure Value 22.1% | MediumM | Solve→ |
Fruits Into Baskets II 22.1% | EasyE | Solve→ |
Divide an Array Into Subarrays With Minimum Cost I 22.1% | EasyE | Solve→ |
Longest Balanced Subarray II 22.1% | HardH | Solve→ |
N-Queens II 20.9% | HardH | Solve→ |
Scramble String 20.9% | HardH | Solve→ |
Binary Tree Postorder Traversal 20.9% | EasyE | Solve→ |
3Sum Smaller 20.9% | MediumM | Solve→ |
Paint Fence 20.9% | MediumM | Solve→ |
Verify Preorder Serialization of a Binary Tree 20.9% | MediumM | Solve→ |
Perfect Rectangle 20.9% | HardH | Solve→ |
Sentence Screen Fitting 20.9% | MediumM | Solve→ |
Magical String 20.9% | MediumM | Solve→ |
Freedom Trail 20.9% | HardH | Solve→ |
Encode and Decode TinyURL 20.9% | MediumM | Solve→ |
Subtree of Another Tree 20.9% | EasyE | Solve→ |
Non-decreasing Array 20.9% | MediumM | Solve→ |
Sentence Similarity II 20.9% | MediumM | Solve→ |
Max Chunks To Make Sorted II 20.9% | HardH | Solve→ |
Basic Calculator III 20.9% | HardH | Solve→ |
Minimize Max Distance to Gas Station 20.9% | HardH | Solve→ |
Image Overlap 20.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Exam Room 20.9% | MediumM | Solve→ |
All Possible Full Binary Trees 20.9% | MediumM | Solve→ |
DI String Match 20.9% | EasyE | Solve→ |
Most Stones Removed with Same Row or Column 20.9% | MediumM | Solve→ |
Minimum Cost For Tickets 20.9% | MediumM | Solve→ |
Campus Bikes 20.9% | MediumM | Solve→ |
Video Stitching 20.9% | MediumM | Solve→ |
Divisor Game 20.9% | EasyE | Solve→ |
Letter Tile Possibilities 20.9% | MediumM | Solve→ |
Decompress Run-Length Encoded List 20.9% | EasyE | Solve→ |
Watering Plants 20.9% | MediumM | Solve→ |
Count Negative Numbers in a Sorted Matrix 20.9% | EasyE | Solve→ |
Min Cost to Connect All Points 20.9% | MediumM | Solve→ |
Cat and Mouse II 20.9% | HardH | Solve→ |
Latest Time by Replacing Hidden Digits 20.9% | EasyE | Solve→ |
Number of Restricted Paths From First to Last Node 20.9% | MediumM | Solve→ |
Maximum Score of a Good Subarray 20.9% | HardH | Solve→ |
Largest Color Value in a Directed Graph 20.9% | HardH | Solve→ |
Eliminate Maximum Number of Monsters 20.9% | MediumM | Solve→ |
The Number of Weak Characters in the Game 20.9% | MediumM | Solve→ |
Parallel Courses III 20.9% | HardH | Solve→ |
Maximum Number of Words Found in Sentences 20.9% | EasyE | Solve→ |
Destroying Asteroids 20.9% | MediumM | Solve→ |
Find All Lonely Numbers in the Array 20.9% | MediumM | Solve→ |
Build a Matrix With Conditions 20.9% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Paths in Matrix Whose Sum Is Divisible by K 20.9% | HardH | Solve→ |
Closest Nodes Queries in a Binary Search Tree 20.9% | MediumM | Solve→ |
Disconnect Path in a Binary Matrix by at Most One Flip 20.9% | MediumM | Solve→ |
Sleep 20.9% | EasyE | Solve→ |
Find the Largest Area of Square Inside Two Rectangles 20.9% | MediumM | Solve→ |
Find the Maximum Length of Valid Subsequence II 20.9% | MediumM | Solve→ |
Employees Whose Manager Left the Company 20.9% | EasyE | Solve→ |
Valid Phone Numbers 20.9% | EasyE | Solve→ |
Different Ways to Add Parentheses 20.9% | MediumM | Solve→ |
Binary Tree Longest Consecutive Sequence 20.9% | MediumM | Solve→ |
Smallest Rectangle Enclosing Black Pixels 20.9% | HardH | Solve→ |
Patching Array 20.9% | HardH | Solve→ |
Integer Break 20.9% | MediumM | Solve→ |
Count Subarrays With Score Less Than K 20.9% | HardH | Solve→ |
Water and Jug Problem 20.9% | MediumM | Solve→ |
Evaluate Boolean Binary Tree 20.9% | EasyE | Solve→ |
Largest Local Values in a Matrix 20.9% | EasyE | Solve→ |
Longest Nice Subarray 20.9% | MediumM | Solve→ |
License Key Formatting 20.9% | EasyE | Solve→ |
Next Closest Time 20.9% | MediumM | Solve→ |
Redundant Connection II 20.9% | HardH | Solve→ |
Random Point in Non-overlapping Rectangles 20.9% | MediumM | Solve→ |
Monotonic Array 20.9% | EasyE | Solve→ |
Range Sum of BST 20.9% | EasyE | Solve→ |
Distribute Coins in Binary Tree 20.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Parallel Courses 20.9% | MediumM | Solve→ |
Maximum Profit in Job Scheduling 20.9% | HardH | Solve→ |
Convert Binary Number in a Linked List to Integer 20.9% | EasyE | Solve→ |
Avoid Flood in The City 20.9% | MediumM | Solve→ |
Number of Students Unable to Eat Lunch 20.9% | EasyE | Solve→ |
Car Fleet II 20.9% | HardH | Solve→ |
Final Prices With a Special Discount in a Shop 20.9% | EasyE | Solve→ |
Return Length of Arguments Passed 20.9% | EasyE | Solve→ |
Swapping Nodes in a Linked List 20.9% | MediumM | Solve→ |
Last Stone Weight II 20.9% | MediumM | Solve→ |
Alternating Groups II 20.9% | MediumM | Solve→ |
Maximum Area Rectangle With Point Constraints I 20.9% | MediumM | Solve→ |
Perfect Number 20.9% | EasyE | Solve→ |
Partition Array According to Given Pivot 20.9% | MediumM | Solve→ |
Separate Squares II 20.9% | HardH | Solve→ |
Maximum Absolute Sum of Any Subarray 20.9% | MediumM | Solve→ |
Find the Minimum Amount of Time to Brew Potions 20.9% | MediumM | Solve→ |
Number of Equivalent Domino Pairs 20.9% | EasyE | Solve→ |
Maximize Subarray GCD Score 20.9% | HardH | Solve→ |
Partition String 20.9% | MediumM | Solve→ |
Department Highest Salary 20.9% | MediumM | Solve→ |
Left and Right Sum Differences 20.9% | EasyE | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 20.9% | MediumM | Solve→ |
Reordered Power of 2 20.9% | MediumM | Solve→ |
Smallest Missing Integer Greater Than Sequential Prefix Sum 20.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Stable Subsequences 20.9% | HardH | Solve→ |
Minimum Cost Path with Edge Reversals 20.9% | MediumM | Solve→ |
Insertion Sort List 19.5% | MediumM | Solve→ |
Read N Characters Given read4 II - Call Multiple Times 19.5% | HardH | Solve→ |
Longest Substring with At Most Two Distinct Characters 19.5% | MediumM | Solve→ |
Design Snake Game 19.5% | MediumM | Solve→ |
Line Reflection 19.5% | MediumM | Solve→ |
Rearrange String k Distance Apart 19.5% | HardH | Solve→ |
Range Addition 19.5% | MediumM | Solve→ |
Smallest Good Base 19.5% | HardH | Solve→ |
Max Consecutive Ones II 19.5% | MediumM | Solve→ |
IPO 19.5% | HardH | Solve→ |
The Maze II 19.5% | MediumM | Solve→ |
All Paths from Source Lead to Destination 19.5% | MediumM | Solve→ |
Output Contest Matches 19.5% | MediumM | Solve→ |
Next Greater Element III 19.5% | MediumM | Solve→ |
Design Compressed String Iterator 19.5% | EasyE | Solve→ |
Shopping Offers 19.5% | MediumM | Solve→ |
Partition to K Equal Sum Subsets 19.5% | MediumM | Solve→ |
Minimum Window Subsequence 19.5% | HardH | Solve→ |
My Calendar III 19.5% | HardH | Solve→ |
Sentence Similarity 19.5% | EasyE | Solve→ |
Flatten a Multilevel Doubly Linked List 19.5% | MediumM | Solve→ |
Search in a Sorted Array of Unknown Size 19.5% | MediumM | Solve→ |
Minimum Distance Between BST Nodes 19.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Bricks Falling When Hit 19.5% | HardH | Solve→ |
Largest Sum of Averages 19.5% | MediumM | Solve→ |
Linked List Components 19.5% | MediumM | Solve→ |
K-Similar Strings 19.5% | HardH | Solve→ |
Minimum Number of Refueling Stops 19.5% | HardH | Solve→ |
Delete Columns to Make Sorted III 19.5% | HardH | Solve→ |
Find the Town Judge 19.5% | EasyE | Solve→ |
Numbers With Repeated Digits 19.5% | HardH | Solve→ |
Best Sightseeing Pair 19.5% | MediumM | Solve→ |
Binary String With Substrings Representing 1 To N 19.5% | MediumM | Solve→ |
Valid Boomerang 19.5% | EasyE | Solve→ |
Partition Array for Maximum Sum 19.5% | MediumM | Solve→ |
Single-Row Keyboard 19.5% | EasyE | Solve→ |
Product Sales Analysis I 19.5% | EasyE | Solve→ |
Minimum Falling Path Sum II 19.5% | HardH | Solve→ |
Sum of Mutated Array Closest to Target 19.5% | MediumM | Solve→ |
Alphabet Board Path 19.5% | MediumM | Solve→ |
Number of Steps to Reduce a Number to Zero 19.5% | EasyE | Solve→ |
Pizza With 3n Slices 19.5% | HardH | Solve→ |
Longest Happy Prefix 19.5% | HardH | Solve→ |
Max Value of Equation 19.5% | HardH | Solve→ |
Last Moment Before All Ants Fall Out of a Plank 19.5% | MediumM | Solve→ |
Minimum Number of Days to Eat N Oranges 19.5% | HardH | Solve→ |
Maximum Non Negative Product in a Matrix 19.5% | MediumM | Solve→ |
Max Number of K-Sum Pairs 19.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Adjacent Swaps for K Consecutive Ones 19.5% | HardH | Solve→ |
Queries on Number of Points Inside a Circle 19.5% | MediumM | Solve→ |
Merge Triplets to Form Target Triplet 19.5% | MediumM | Solve→ |
Number of Wonderful Substrings 19.5% | MediumM | Solve→ |
Cutting Ribbons 19.5% | MediumM | Solve→ |
Find a Peak Element II 19.5% | MediumM | Solve→ |
Binary Searchable Numbers in an Unsorted Array 19.5% | MediumM | Solve→ |
Number of Unique Good Subsequences 19.5% | HardH | Solve→ |
Count Fertile Pyramids in a Land 19.5% | HardH | Solve→ |
Maximum Split of Positive Even Integers 19.5% | MediumM | Solve→ |
Create Binary Tree From Descriptions 19.5% | MediumM | Solve→ |
Most Frequent Number Following Key In an Array 19.5% | EasyE | Solve→ |
Check if Number Has Equal Digit Count and Digit Value 19.5% | EasyE | Solve→ |
Longest Binary Subsequence Less Than or Equal to K 19.5% | MediumM | Solve→ |
Sum of Prefix Scores of Strings 19.5% | HardH | Solve→ |
Longest Uploaded Prefix 19.5% | MediumM | Solve→ |
Count Number of Distinct Integers After Reverse Operations 19.5% | MediumM | Solve→ |
Determine if Two Events Have Conflict 19.5% | EasyE | Solve→ |
Prime Subtraction Operation 19.5% | MediumM | Solve→ |
String Transformation 19.5% | HardH | Solve→ |
Count K-Subsequences of a String With Maximum Beauty 19.5% | HardH | Solve→ |
Find Champion II 19.5% | MediumM | Solve→ |
Maximum Number That Sum of the Prices Is Less Than or Equal to K 19.5% | MediumM | Solve→ |
Find the Number of Ways to Place People II 19.5% | HardH | Solve→ |
Longest Common Suffix Queries 19.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Number of Ways to Partition an Array 19.5% | HardH | Solve→ |
Path Sum II 19.5% | MediumM | Solve→ |
Time Needed to Buy Tickets 19.5% | EasyE | Solve→ |
Step-By-Step Directions From a Binary Tree Node to Another 19.5% | MediumM | Solve→ |
Sum of Subarray Ranges 19.5% | MediumM | Solve→ |
Meeting Rooms 19.5% | EasyE | Solve→ |
Closest Binary Search Tree Value 19.5% | EasyE | Solve→ |
Root Equals Sum of Children 19.5% | EasyE | Solve→ |
Guess Number Higher or Lower II 19.5% | MediumM | Solve→ |
Number of Boomerangs 19.5% | MediumM | Solve→ |
Longest Uncommon Subsequence II 19.5% | MediumM | Solve→ |
Beautiful Arrangement 19.5% | MediumM | Solve→ |
Array Partition 19.5% | EasyE | Solve→ |
Erect the Fence 19.5% | HardH | Solve→ |
Valid Triangle Number 19.5% | MediumM | Solve→ |
Split Array into Consecutive Subsequences 19.5% | MediumM | Solve→ |
Minimize the Maximum Difference of Pairs 19.5% | MediumM | Solve→ |
Apply Transform Over Each Element in Array 19.5% | EasyE | Solve→ |
Find the Maximum Achievable Number 19.5% | EasyE | Solve→ |
Couples Holding Hands 19.5% | HardH | Solve→ |
Reaching Points 19.5% | HardH | Solve→ |
Rabbits in Forest 19.5% | MediumM | Solve→ |
Design HashMap 19.5% | EasyE | Solve→ |
Profitable Schemes 19.5% | HardH | Solve→ |
Super Egg Drop 19.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reverse Only Letters 19.5% | EasyE | Solve→ |
Reveal Cards In Increasing Order 19.5% | MediumM | Solve→ |
Unique Paths III 19.5% | HardH | Solve→ |
Parsing A Boolean Expression 19.5% | HardH | Solve→ |
All Ancestors of a Node in a Directed Acyclic Graph 19.5% | MediumM | Solve→ |
Determine if Two Strings Are Close 19.5% | MediumM | Solve→ |
Find the City With the Smallest Number of Neighbors at a Threshold Distance 19.5% | MediumM | Solve→ |
The Number of Employees Which Report to Each Employee 19.5% | EasyE | Solve→ |
Binary Tree Nodes 19.5% | MediumM | Solve→ |
Calculate Compressed Mean 19.5% | EasyE | Solve→ |
Find the Maximum Sequence Value of Array 19.5% | HardH | Solve→ |
Top Three Wineries 19.5% | HardH | Solve→ |
Find Expensive Cities 19.5% | EasyE | Solve→ |
Class Performance 19.5% | MediumM | Solve→ |
Loan Types 19.5% | EasyE | Solve→ |
Partition Labels 19.5% | MediumM | Solve→ |
Find Beautiful Indices in the Given Array II 19.5% | HardH | Solve→ |
Investments in 2016 19.5% | MediumM | Solve→ |
Ant on the Boundary 19.5% | EasyE | Solve→ |
Add Two Numbers II 19.5% | MediumM | Solve→ |
Minimum Absolute Difference 19.5% | EasyE | Solve→ |
Shifting Letters II 19.5% | MediumM | Solve→ |
Divisible and Non-divisible Sums Difference 19.5% | EasyE | Solve→ |
Minimum Time to Repair Cars 19.5% | MediumM | Solve→ |
Count Good Triplets 19.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Count of Monotonic Pairs I 19.5% | HardH | Solve→ |
Kth Smallest Product of Two Sorted Arrays 19.5% | HardH | Solve→ |
Count Cells in Overlapping Horizontal and Vertical Substrings 19.5% | MediumM | Solve→ |
Subdomain Visit Count 19.5% | MediumM | Solve→ |
Count Caesar Cipher Pairs 19.5% | MediumM | Solve→ |
Smallest Divisible Digit Product I 19.5% | EasyE | Solve→ |
Valid Number 18% | HardH | Solve→ |
Flatten 2D Vector 18% | MediumM | Solve→ |
Closest Binary Search Tree Value II 18% | HardH | Solve→ |
Peeking Iterator 18% | MediumM | Solve→ |
Super Ugly Number 18% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 18% | MediumM | Solve→ |
Design Tic-Tac-Toe 18% | MediumM | Solve→ |
Plus One Linked List 18% | MediumM | Solve→ |
Minimum Number of Arrows to Burst Balloons 18% | MediumM | Solve→ |
Word Abbreviation 18% | HardH | Solve→ |
Boundary of Binary Tree 18% | MediumM | Solve→ |
Longest Line of Consecutive One in Matrix 18% | MediumM | Solve→ |
2 Keys Keyboard 18% | MediumM | Solve→ |
Beautiful Arrangement II 18% | MediumM | Solve→ |
Kth Smallest Number in Multiplication Table 18% | HardH | Solve→ |
Number of Longest Increasing Subsequence 18% | MediumM | Solve→ |
Baseball Game 18% | EasyE | Solve→ |
K Empty Slots 18% | HardH | Solve→ |
Find K-th Smallest Pair Distance 18% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Completing Word 18% | EasyE | Solve→ |
Find Anagram Mappings 18% | EasyE | Solve→ |
Construct Quad Tree 18% | MediumM | Solve→ |
Positions of Large Groups 18% | EasyE | Solve→ |
Minimum Cost to Hire K Workers 18% | HardH | Solve→ |
Super Palindromes 18% | HardH | Solve→ |
Confusing Number 18% | EasyE | Solve→ |
Recover a Tree From Preorder Traversal 18% | HardH | Solve→ |
Minimum Cost to Connect Sticks 18% | MediumM | Solve→ |
Brace Expansion II 18% | HardH | Solve→ |
Divide Chocolate 18% | HardH | Solve→ |
Element Appearing More Than 25% In Sorted Array 18% | EasyE | Solve→ |
Distinct Echo Substrings 18% | HardH | Solve→ |
Longest Chunked Palindrome Decomposition 18% | HardH | Solve→ |
Deepest Leaves Sum 18% | MediumM | Solve→ |
Where Will the Ball Fall 18% | MediumM | Solve→ |
Maximum Value of K Coins From Piles 18% | HardH | Solve→ |
Number of Ways to Stay in the Same Place After Some Steps 18% | HardH | Solve→ |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K 18% | MediumM | Solve→ |
Simplified Fractions 18% | MediumM | Solve→ |
Form Largest Integer With Digits That Add up to Target 18% | HardH | Solve→ |
Find Two Non-overlapping Sub-arrays Each With Target Sum 18% | MediumM | Solve→ |
Range Sum of Sorted Subarray Sums 18% | MediumM | Solve→ |
Find Root of N-Ary Tree 18% | MediumM | Solve→ |
Number of Good Leaf Nodes Pairs 18% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Magnetic Force Between Two Balls 18% | MediumM | Solve→ |
Number of Ways to Reorder Array to Get Same BST 18% | HardH | Solve→ |
Strange Printer II 18% | HardH | Solve→ |
Rearrange Spaces Between Words 18% | EasyE | Solve→ |
Minimum Cost to Connect Two Groups of Points 18% | HardH | Solve→ |
Throne Inheritance 18% | MediumM | Solve→ |
Fancy Sequence 18% | HardH | Solve→ |
Number of Ways to Form a Target String Given a Dictionary 18% | HardH | Solve→ |
Distribute Repeating Integers 18% | HardH | Solve→ |
Minimum Operations to Make a Subsequence 18% | HardH | Solve→ |
Maximum Number of Events That Can Be Attended II 18% | HardH | Solve→ |
Find Kth Largest XOR Coordinate Value 18% | MediumM | Solve→ |
Map of Highest Peak 18% | MediumM | Solve→ |
Maximum Score from Performing Multiplication Operations 18% | HardH | Solve→ |
Maximum Number of Groups Getting Fresh Donuts 18% | HardH | Solve→ |
Minimum Path Cost in a Hidden Grid 18% | MediumM | Solve→ |
Kth Smallest Subarray Sum 18% | MediumM | Solve→ |
Operations on Tree 18% | MediumM | Solve→ |
Find Unique Binary String 18% | MediumM | Solve→ |
Minimum Operations to Convert Number 18% | MediumM | Solve→ |
Minimum Cost to Set Cooking Time 18% | MediumM | Solve→ |
Minimum Time to Remove All Cars Containing Illegal Goods 18% | HardH | Solve→ |
Maximum AND Sum of Array 18% | HardH | Solve→ |
Count Prefixes of a Given String 18% | EasyE | Solve→ |
Count Asterisks 18% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Merge Similar Items 18% | EasyE | Solve→ |
Finding the Number of Visible Mountains 18% | MediumM | Solve→ |
Number of Pairs Satisfying Inequality 18% | HardH | Solve→ |
Number of Beautiful Partitions 18% | HardH | Solve→ |
Make Number of Distinct Characters Equal 18% | MediumM | Solve→ |
Increment Submatrices by One 18% | MediumM | Solve→ |
Sum of Imbalance Numbers of All Subarrays 18% | HardH | Solve→ |
Minimum Absolute Difference Between Elements With Constraint 18% | MediumM | Solve→ |
Find Longest Special Substring That Occurs Thrice II 18% | MediumM | Solve→ |
Minimum Number of Operations to Make Word K-Periodic 18% | MediumM | Solve→ |
Sum of Digit Differences of All Pairs 18% | MediumM | Solve→ |
Maximum Twin Sum of a Linked List 18% | MediumM | Solve→ |
Rectangle Area 18% | MediumM | Solve→ |
Strobogrammatic Number II 18% | MediumM | Solve→ |
Single Number III 18% | MediumM | Solve→ |
Minimum Consecutive Cards to Pick Up 18% | MediumM | Solve→ |
Design Phone Directory 18% | MediumM | Solve→ |
Strictly Palindromic Number 18% | MediumM | Solve→ |
Arranging Coins 18% | EasyE | Solve→ |
Number of Valid Clock Times 18% | EasyE | Solve→ |
Add Bold Tag in String 18% | MediumM | Solve→ |
Maximum Length of Repeated Subarray 18% | MediumM | Solve→ |
Cherry Pickup 18% | HardH | Solve→ |
Counter II 18% | EasyE | Solve→ |
Serialize and Deserialize N-ary Tree 18% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Design HashSet 18% | EasyE | Solve→ |
Fair Candy Swap 18% | EasyE | Solve→ |
Find Common Characters 18% | EasyE | Solve→ |
Maximum Length of Semi-Decreasing Subarrays 18% | MediumM | Solve→ |
Last Person to Fit in the Bus 18% | MediumM | Solve→ |
Subtract the Product and Sum of Digits of an Integer 18% | EasyE | Solve→ |
Check If Array Pairs Are Divisible by k 18% | MediumM | Solve→ |
Shuffle String 18% | EasyE | Solve→ |
Matrix Diagonal Sum 18% | EasyE | Solve→ |
Find Valid Matrix Given Row and Column Sums 18% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 18% | EasyE | Solve→ |
Split Two Strings to Make Palindrome 18% | MediumM | Solve→ |
Fix Names in a Table 18% | EasyE | Solve→ |
Calculate Money in Leetcode Bank 18% | EasyE | Solve→ |
Check if the Sentence Is Pangram 18% | EasyE | Solve→ |
Find Smallest Letter Greater Than Target 18% | EasyE | Solve→ |
Minimum Deletions to Make String Balanced 18% | MediumM | Solve→ |
Excel Sheet Column Number 18% | EasyE | Solve→ |
Replace Elements with Greatest Element on Right Side 18% | EasyE | Solve→ |
Stone Game II 18% | MediumM | Solve→ |
Minimum Genetic Mutation 18% | MediumM | Solve→ |
Maximum Employees to Be Invited to a Meeting 18% | HardH | Solve→ |
Count Hills and Valleys in an Array 18% | EasyE | Solve→ |
Defuse the Bomb 18% | EasyE | Solve→ |
Combination Sum III 18% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Bitwise ORs of Subarrays 18% | MediumM | Solve→ |
Minimum Limit of Balls in a Bag 18% | MediumM | Solve→ |
Count Binary Substrings 18% | EasyE | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 18% | MediumM | Solve→ |
Special Binary String 18% | HardH | Solve→ |
Minimum Number of Flips to Make Binary Grid Palindromic II 18% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet II 18% | MediumM | Solve→ |
Longest Continuous Increasing Subsequence 18% | EasyE | Solve→ |
Find Words Containing Character 18% | EasyE | Solve→ |
Count Odd Numbers in an Interval Range 18% | EasyE | Solve→ |
Best Time to Buy and Sell Stock V 18% | MediumM | Solve→ |
Find the Original Typed String II 18% | HardH | Solve→ |
Range Product Queries of Powers 18% | MediumM | Solve→ |
Number of People Aware of a Secret 18% | MediumM | Solve→ |
Maximize Alternating Sum Using Swaps 18% | HardH | Solve→ |
Split Array With Minimum Difference 18% | MediumM | Solve→ |
Maximum Product of Splitted Binary Tree 18% | MediumM | Solve→ |
Minimum Number of Pushes to Type Word I 18% | EasyE | Solve→ |
Trionic Array I 18% | EasyE | Solve→ |
Minimum Bitwise OR From Grid 18% | MediumM | Solve→ |
Bitwise AND of Numbers Range 16.4% | MediumM | Solve→ |
Strobogrammatic Number 16.4% | EasyE | Solve→ |
Palindrome Permutation 16.4% | EasyE | Solve→ |
Zigzag Iterator 16.4% | MediumM | Solve→ |
Unique Word Abbreviation 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Flip Game 16.4% | EasyE | Solve→ |
Flip Game II 16.4% | MediumM | Solve→ |
Remove Invalid Parentheses 16.4% | HardH | Solve→ |
Generalized Abbreviation 16.4% | MediumM | Solve→ |
Bomb Enemy 16.4% | MediumM | Solve→ |
Minimum Unique Word Abbreviation 16.4% | HardH | Solve→ |
Valid Word Square 16.4% | EasyE | Solve→ |
Word Squares 16.4% | HardH | Solve→ |
Convex Polygon 16.4% | MediumM | Solve→ |
Encode String with Shortest Length 16.4% | HardH | Solve→ |
Find Permutation 16.4% | MediumM | Solve→ |
Count Subarrays With More Ones Than Zeros 16.4% | MediumM | Solve→ |
Longest Uncommon Subsequence I 16.4% | EasyE | Solve→ |
Lonely Pixel I 16.4% | MediumM | Solve→ |
Lonely Pixel II 16.4% | MediumM | Solve→ |
Binary Tree Longest Consecutive Sequence II 16.4% | MediumM | Solve→ |
Reverse Words in a String III 16.4% | EasyE | Solve→ |
Maximum Vacation Days 16.4% | HardH | Solve→ |
Median Employee Salary 16.4% | HardH | Solve→ |
Maximum Average Subarray II 16.4% | HardH | Solve→ |
4 Keys Keyboard 16.4% | MediumM | Solve→ |
Coin Path 16.4% | HardH | Solve→ |
Longest Univalue Path 16.4% | MediumM | Solve→ |
Employee Importance 16.4% | MediumM | Solve→ |
Bold Words in String 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Transform to Chessboard 16.4% | HardH | Solve→ |
Similar RGB Color 16.4% | EasyE | Solve→ |
Ambiguous Coordinates 16.4% | MediumM | Solve→ |
Random Pick with Blacklist 16.4% | HardH | Solve→ |
Random Flip Matrix 16.4% | MediumM | Solve→ |
Complete Binary Tree Inserter 16.4% | MediumM | Solve→ |
Array of Doubled Pairs 16.4% | MediumM | Solve→ |
Shortest Way to Form String 16.4% | MediumM | Solve→ |
Campus Bikes II 16.4% | MediumM | Solve→ |
Brace Expansion 16.4% | MediumM | Solve→ |
Confusing Number II 16.4% | HardH | Solve→ |
Camelcase Matching 16.4% | MediumM | Solve→ |
Divide Array Into Increasing Sequences 16.4% | HardH | Solve→ |
String Transforms Into Another String 16.4% | HardH | Solve→ |
Shortest Distance to Target Color 16.4% | MediumM | Solve→ |
Optimize Water Distribution in a Village 16.4% | HardH | Solve→ |
Number of Submatrices That Sum to Target 16.4% | HardH | Solve→ |
Occurrences After Bigram 16.4% | EasyE | Solve→ |
Minimum Time to Build Blocks 16.4% | HardH | Solve→ |
Largest Values From Labels 16.4% | MediumM | Solve→ |
Tree Diameter 16.4% | MediumM | Solve→ |
Mean of Array After Removing Some Elements 16.4% | EasyE | Solve→ |
Iterator for Combination 16.4% | MediumM | Solve→ |
Sequential Digits 16.4% | MediumM | Solve→ |
Decrease Elements To Make Array Zigzag 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Coloring Game 16.4% | MediumM | Solve→ |
Compare Strings by Frequency of the Smallest Character 16.4% | MediumM | Solve→ |
Distance Between Bus Stops 16.4% | EasyE | Solve→ |
Design Skiplist 16.4% | HardH | Solve→ |
Maximum Font to Fit a Sentence in a Screen 16.4% | MediumM | Solve→ |
Find Elements in a Contaminated Binary Tree 16.4% | MediumM | Solve→ |
Minimum Path Cost in a Grid 16.4% | MediumM | Solve→ |
All People Report to the Given Manager 16.4% | MediumM | Solve→ |
Minimum Number of Taps to Open to Water a Garden 16.4% | HardH | Solve→ |
Circle and Rectangle Overlapping 16.4% | MediumM | Solve→ |
Diagonal Traverse II 16.4% | MediumM | Solve→ |
People Whose List of Favorite Companies Is Not a Subset of Another List 16.4% | MediumM | Solve→ |
The k Strongest Values in an Array 16.4% | MediumM | Solve→ |
Number of Substrings With Only 1s 16.4% | MediumM | Solve→ |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target 16.4% | MediumM | Solve→ |
Move Sub-Tree of N-Ary Tree 16.4% | HardH | Solve→ |
Guess the Majority in a Hidden Array 16.4% | MediumM | Solve→ |
Find Latest Group of Size M 16.4% | MediumM | Solve→ |
The Most Similar Path in a Graph 16.4% | HardH | Solve→ |
Put Boxes Into the Warehouse I 16.4% | MediumM | Solve→ |
Check If String Is Transformable With Substring Sort Operations 16.4% | HardH | Solve→ |
Put Boxes Into the Warehouse II 16.4% | MediumM | Solve→ |
Find Nearest Right Node in Binary Tree 16.4% | MediumM | Solve→ |
Check If Two Expression Trees are Equivalent 16.4% | MediumM | Solve→ |
Correct a Binary Tree 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Change the Root of a Binary Tree 16.4% | MediumM | Solve→ |
Count Ways to Distribute Candies 16.4% | HardH | Solve→ |
Largest Subarray Length K 16.4% | EasyE | Solve→ |
Change Minimum Characters to Satisfy One of Three Conditions 16.4% | MediumM | Solve→ |
Checking Existence of Edge Length Limited Paths II 16.4% | HardH | Solve→ |
Tree of Coprimes 16.4% | HardH | Solve→ |
Maximum Score From Removing Stones 16.4% | MediumM | Solve→ |
Closest Dessert Cost 16.4% | MediumM | Solve→ |
Design Most Recently Used Queue 16.4% | MediumM | Solve→ |
Find the Subtasks That Did Not Execute 16.4% | HardH | Solve→ |
Minimum Number of Operations to Reinitialize a Permutation 16.4% | MediumM | Solve→ |
Count Pairs of Equal Substrings With Minimum Difference 16.4% | MediumM | Solve→ |
Find Customers With Positive Revenue this Year 16.4% | EasyE | Solve→ |
Minimum Adjacent Swaps to Reach the Kth Smallest Number 16.4% | MediumM | Solve→ |
Number of Ways to Rearrange Sticks With K Sticks Visible 16.4% | HardH | Solve→ |
Minimum Speed to Arrive on Time 16.4% | MediumM | Solve→ |
Minimum Cost to Change the Final Value of Expression 16.4% | HardH | Solve→ |
Longest Word With All Prefixes 16.4% | MediumM | Solve→ |
Minimum Skips to Arrive at Meeting On Time 16.4% | HardH | Solve→ |
Minimize Product Sum of Two Arrays 16.4% | MediumM | Solve→ |
Minimum Absolute Difference Queries 16.4% | MediumM | Solve→ |
Longest Common Subsequence Between Sorted Arrays 16.4% | MediumM | Solve→ |
Erect the Fence II 16.4% | HardH | Solve→ |
Process Restricted Friend Requests 16.4% | HardH | Solve→ |
Paths in Maze That Lead to Same Room 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Watering Plants II 16.4% | MediumM | Solve→ |
Recover the Original Array 16.4% | HardH | Solve→ |
Count Words Obtained After Adding a Letter 16.4% | MediumM | Solve→ |
All Divisions With the Highest Score of a Binary Array 16.4% | MediumM | Solve→ |
Remove All Ones With Row and Column Flips 16.4% | MediumM | Solve→ |
Minimum White Tiles After Covering With Carpets 16.4% | HardH | Solve→ |
Remove All Ones With Row and Column Flips II 16.4% | MediumM | Solve→ |
Minimum Number of Operations to Convert Time 16.4% | EasyE | Solve→ |
Check if There Is a Valid Parentheses String Path 16.4% | HardH | Solve→ |
Design an ATM Machine 16.4% | MediumM | Solve→ |
Maximum White Tiles Covered by a Carpet 16.4% | MediumM | Solve→ |
Minimum Lines to Represent a Line Chart 16.4% | MediumM | Solve→ |
Booking Concert Tickets in Groups 16.4% | HardH | Solve→ |
Count Positions on Street With Required Brightness 16.4% | MediumM | Solve→ |
Design Video Sharing Platform 16.4% | HardH | Solve→ |
Minimum Flips in Binary Tree to Get Result 16.4% | HardH | Solve→ |
Subarray With Elements Greater Than Varying Threshold 16.4% | HardH | Solve→ |
Shortest Impossible Sequence of Rolls 16.4% | HardH | Solve→ |
Sort Array by Moving Items to Empty Space 16.4% | HardH | Solve→ |
Minimize Maximum Value in a Grid 16.4% | HardH | Solve→ |
Count Subarrays With Median K 16.4% | HardH | Solve→ |
Extract Kth Character From The Rope Tree 16.4% | EasyE | Solve→ |
Count Houses in a Circular Street 16.4% | EasyE | Solve→ |
Count Pairs of Points With Distance k 16.4% | MediumM | Solve→ |
Determine if a Cell Is Reachable at a Given Time 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Increment Operations to Make Array Beautiful 16.4% | MediumM | Solve→ |
Find Champion I 16.4% | EasyE | Solve→ |
Maximum Score After Applying Operations on a Tree 16.4% | MediumM | Solve→ |
Count the Number of Good Partitions 16.4% | HardH | Solve→ |
Number of Equal Numbers Blocks 16.4% | MediumM | Solve→ |
Minimum Cost to Make Array Equalindromic 16.4% | MediumM | Solve→ |
Maximize Consecutive Elements in an Array After Modification 16.4% | HardH | Solve→ |
Most Frequent Prime 16.4% | MediumM | Solve→ |
Latest Time You Can Obtain After Replacing Characters 16.4% | EasyE | Solve→ |
Minimum Sum of Values by Dividing Array 16.4% | HardH | Solve→ |
Smallest Index With Equal Value 16.4% | EasyE | Solve→ |
Compare Version Numbers 16.4% | MediumM | Solve→ |
Rings and Rods 16.4% | EasyE | Solve→ |
Maximum Running Time of N Computers 16.4% | HardH | Solve→ |
Amount of New Area Painted Each Day 16.4% | HardH | Solve→ |
Ugly Number II 16.4% | MediumM | Solve→ |
Largest 3-Same-Digit Number in String 16.4% | EasyE | Solve→ |
Convert a Number to Hexadecimal 16.4% | EasyE | Solve→ |
Number of Unique Subjects Taught by Each Teacher 16.4% | EasyE | Solve→ |
Number of Common Factors 16.4% | EasyE | Solve→ |
Keyboard Row 16.4% | EasyE | Solve→ |
K-diff Pairs in an Array 16.4% | MediumM | Solve→ |
Delete and Earn 16.4% | MediumM | Solve→ |
Find the Shortest Superstring 16.4% | HardH | Solve→ |
Minimum Number of K Consecutive Bit Flips 16.4% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Product Sales Analysis III 16.4% | MediumM | Solve→ |
Relative Sort Array 16.4% | EasyE | Solve→ |
Number of Dice Rolls With Target Sum 16.4% | MediumM | Solve→ |
Find Positive Integer Solution for a Given Equation 16.4% | MediumM | Solve→ |
Maximize Total Cost of Alternating Subarrays 16.4% | MediumM | Solve→ |
Maximum Sum BST in Binary Tree 16.4% | HardH | Solve→ |
Frog Position After T Seconds 16.4% | HardH | Solve→ |
Replace All Digits with Characters 16.4% | EasyE | Solve→ |
Count the Number of Substrings With Dominant Ones 16.4% | MediumM | Solve→ |
Find Followers Count 16.4% | EasyE | Solve→ |
Minimum Moves to Equal Array Elements 16.4% | MediumM | Solve→ |
Additive Number 16.4% | MediumM | Solve→ |
Split Linked List in Parts 16.4% | MediumM | Solve→ |
Make Sum Divisible by P 16.4% | MediumM | Solve→ |
Sorted GCD Pair Queries 16.4% | HardH | Solve→ |
Minimum Number of Swaps to Make the String Balanced 16.4% | MediumM | Solve→ |
Remove Boxes 16.4% | HardH | Solve→ |
Meeting Scheduler 16.4% | MediumM | Solve→ |
Longest Happy String 16.4% | MediumM | Solve→ |
Find Minimum Time to Reach Last Room I 16.4% | MediumM | Solve→ |
Maximum Gap 16.4% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree III 16.4% | MediumM | Solve→ |
Rotating the Box 16.4% | MediumM | Solve→ |
Smallest String With Swaps 16.4% | MediumM | Solve→ |
Count the Number of Good Subarrays 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Subarray to be Removed to Make Array Sorted 16.4% | MediumM | Solve→ |
Movie Rating 16.4% | MediumM | Solve→ |
Nested List Weight Sum 16.4% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 16.4% | HardH | Solve→ |
Minimum Cost Walk in Weighted Graph 16.4% | HardH | Solve→ |
Ways to Express an Integer as Sum of Powers 16.4% | MediumM | Solve→ |
Largest Perimeter Triangle 16.4% | EasyE | Solve→ |
Minimum Increments to Equalize Leaf Paths 16.4% | MediumM | Solve→ |
N-Repeated Element in Size 2N Array 16.4% | EasyE | Solve→ |
Game Play Analysis I 16.4% | EasyE | Solve→ |
Maximize Subarrays After Removing One Conflicting Pair 16.4% | HardH | Solve→ |
Smallest Subarrays With Maximum Bitwise OR 16.4% | MediumM | Solve→ |
Rearranging Fruits 16.4% | HardH | Solve→ |
Threshold Majority Queries 16.4% | HardH | Solve→ |
Binary Number with Alternating Bits 16.4% | EasyE | Solve→ |
Convert Integer to the Sum of Two No-Zero Integers 16.4% | EasyE | Solve→ |
Minimum Sensors to Cover Grid 16.4% | MediumM | Solve→ |
Twisted Mirror Path Count 16.4% | MediumM | Solve→ |
Next Greater Numerically Balanced Number 16.4% | MediumM | Solve→ |
Minimum Number of Operations to Make All Array Elements Equal to 1 16.4% | MediumM | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum II 16.4% | MediumM | Solve→ |
Largest Prime from Consecutive Prime Sum 16.4% | MediumM | Solve→ |
Count Square Sum Triples 16.4% | EasyE | Solve→ |
GCD of Odd and Even Sums 16.4% | EasyE | Solve→ |
Power Update After K-th Largest Insertion I 16.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Earliest Finish Time for Land and Water Rides II 16.4% | MediumM | Solve→ |
Angle Between Hands of a Clock 16.4% | MediumM | Solve→ |
Filter Occupied Intervals 16.4% | MediumM | Solve→ |
Remove Covered Intervals 16.4% | MediumM | Solve→ |
Department Top Three Salaries 14.6% | HardH | Solve→ |
Shuffle an Array 14.6% | MediumM | Solve→ |
Sum of Left Leaves 14.6% | EasyE | Solve→ |
Battleships in a Board 14.6% | MediumM | Solve→ |
Complement of Base 10 Integer 14.6% | EasyE | Solve→ |
Minimum Time Visiting All Points 14.6% | EasyE | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 14.6% | MediumM | Solve→ |
Design Browser History 14.6% | MediumM | Solve→ |
Find Greatest Common Divisor of Array 14.6% | EasyE | Solve→ |
Maximum Difference Between Increasing Elements 14.6% | EasyE | Solve→ |
Extra Characters in a String 14.6% | MediumM | Solve→ |
Arithmetic Slices 14.6% | MediumM | Solve→ |
Base 7 14.6% | EasyE | Solve→ |
Maximum Subsequence Score 14.6% | MediumM | Solve→ |
Implement Rand10() Using Rand7() 14.6% | MediumM | Solve→ |
Satisfiability of Equality Equations 14.6% | MediumM | Solve→ |
Sort Array by Increasing Frequency 14.6% | EasyE | Solve→ |
Primary Department for Each Employee 14.6% | EasyE | Solve→ |
Sorting the Sentence 14.6% | EasyE | Solve→ |
Maximum Population Year 14.6% | EasyE | Solve→ |
Design Circular Deque 14.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Number of Operations to Move Ones to the End 14.6% | MediumM | Solve→ |
Reach a Number 14.6% | MediumM | Solve→ |
Dota2 Senate 14.6% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node II 14.6% | MediumM | Solve→ |
Count the Number of Consistent Strings 14.6% | EasyE | Solve→ |
XOR Queries of a Subarray 14.6% | MediumM | Solve→ |
Remove Nodes From Linked List 14.6% | MediumM | Solve→ |
Find a Safe Walk Through a Grid 14.6% | MediumM | Solve→ |
Minimum Time to Visit a Cell In a Grid 14.6% | HardH | Solve→ |
Find Kth Bit in Nth Binary String 14.6% | MediumM | Solve→ |
Count Number of Maximum Bitwise-OR Subsets 14.6% | MediumM | Solve→ |
Delete Characters to Make Fancy String 14.6% | EasyE | Solve→ |
Smallest Even Multiple 14.6% | EasyE | Solve→ |
Shortest Distance to a Character 14.6% | EasyE | Solve→ |
Minimum Value to Get Positive Step by Step Sum 14.6% | EasyE | Solve→ |
Take Gifts From the Richest Pile 14.6% | EasyE | Solve→ |
Maximum Average Pass Ratio 14.6% | MediumM | Solve→ |
Number of Ways to Split Array 14.6% | MediumM | Solve→ |
Detect Cycles in 2D Grid 14.6% | MediumM | Solve→ |
Day of the Year 14.6% | EasyE | Solve→ |
String Matching in an Array 14.6% | EasyE | Solve→ |
Minimize the Maximum Edge Weight of Graph 14.6% | MediumM | Solve→ |
Super Pow 14.6% | MediumM | Solve→ |
Degree of an Array 14.6% | EasyE | Solve→ |
Minimum Time to Complete Trips 14.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Construct the Lexicographically Largest Valid Sequence 14.6% | MediumM | Solve→ |
Hamming Distance 14.6% | EasyE | Solve→ |
Minimum Score of a Path Between Two Cities 14.6% | MediumM | Solve→ |
Apply Operations to an Array 14.6% | EasyE | Solve→ |
Minimum Recolors to Get K Consecutive Black Blocks 14.6% | EasyE | Solve→ |
Maximum Units on a Truck 14.6% | EasyE | Solve→ |
Find the Minimum Cost Array Permutation 14.6% | HardH | Solve→ |
Count the Number of Square-Free Subsets 14.6% | MediumM | Solve→ |
Walking Robot Simulation II 14.6% | MediumM | Solve→ |
Lowest Common Ancestor of Deepest Leaves 14.6% | MediumM | Solve→ |
Count the Number of Powerful Integers 14.6% | HardH | Solve→ |
Count Equal and Divisible Pairs in an Array 14.6% | EasyE | Solve→ |
Count Largest Group 14.6% | EasyE | Solve→ |
Smallest Number With All Set Bits 14.6% | EasyE | Solve→ |
Get the Maximum Score 14.6% | HardH | Solve→ |
Count Number of Balanced Permutations 14.6% | HardH | Solve→ |
Minimum Equal Sum of Two Arrays After Replacing Zeros 14.6% | MediumM | Solve→ |
Maximum Subarray Sum With Length Divisible by K 14.6% | MediumM | Solve→ |
Maximum Product of Two Digits 14.6% | EasyE | Solve→ |
Distribute Candies Among Children II 14.6% | MediumM | Solve→ |
Find the Lexicographically Largest String From the Box I 14.6% | MediumM | Solve→ |
Rotate Function 14.6% | MediumM | Solve→ |
Sum of k-Mirror Numbers 14.6% | HardH | Solve→ |
Trips and Users 14.6% | HardH | Solve→ |
Fruits Into Baskets III 14.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Paint House III 14.6% | HardH | Solve→ |
Find the Minimum Area to Cover All Ones I 14.6% | MediumM | Solve→ |
Binary Gap 14.6% | EasyE | Solve→ |
Path Existence Queries in a Graph II 14.6% | HardH | Solve→ |
Check If All 1's Are at Least Length K Places Away 14.6% | EasyE | Solve→ |
Minimum Operations to Make Array Sum Divisible by K 14.6% | EasyE | Solve→ |
Minimize Maximum Pair Sum in Array 14.6% | MediumM | Solve→ |
Find All Possible Stable Binary Arrays I 14.6% | MediumM | Solve→ |
Maximum Path Score in a Grid 14.6% | MediumM | Solve→ |
Block Placement Queries 14.6% | HardH | Solve→ |
Number of ZigZag Arrays I 14.6% | HardH | Solve→ |
Smallest Palindromic Rearrangement I 14.6% | MediumM | Solve→ |
Find the Lexicographically Smallest Valid Sequence 14.6% | MediumM | Solve→ |
Gray Code 12.6% | MediumM | Solve→ |
Find Largest Value in Each Tree Row 12.6% | MediumM | Solve→ |
Valid Square 12.6% | MediumM | Solve→ |
Validate Stack Sequences 12.6% | MediumM | Solve→ |
Minimum Number of Steps to Make Two Strings Anagram 12.6% | MediumM | Solve→ |
Find Users With Valid E-Mails 12.6% | EasyE | Solve→ |
Maximum Value at a Given Index in a Bounded Array 12.6% | MediumM | Solve→ |
Minimum Difference Between Highest and Lowest of K Scores 12.6% | EasyE | Solve→ |
Minimized Maximum of Products Distributed to Any Store 12.6% | MediumM | Solve→ |
Check if a Parentheses String Can Be Valid 12.6% | MediumM | Solve→ |
Longest Palindrome by Concatenating Two Letter Words 12.6% | MediumM | Solve→ |
Minimum Replacements to Sort the Array 12.6% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Subarrays With Fixed Bounds 12.6% | HardH | Solve→ |
Count Palindromic Subsequences 12.6% | HardH | Solve→ |
Minimum Common Value 12.6% | EasyE | Solve→ |
Add Two Promises 12.6% | EasyE | Solve→ |
Get the Size of a DataFrame 12.6% | EasyE | Solve→ |
Length of Longest Subarray With at Most K Frequency 12.6% | MediumM | Solve→ |
Find the Minimum and Maximum Number of Nodes Between Critical Points 12.6% | MediumM | Solve→ |
Contains Duplicate III 12.6% | HardH | Solve→ |
Design In-Memory File System 12.6% | HardH | Solve→ |
Merge Two Binary Trees 12.6% | EasyE | Solve→ |
Print Binary Tree 12.6% | MediumM | Solve→ |
Open the Lock 12.6% | MediumM | Solve→ |
Painting the Walls 12.6% | HardH | Solve→ |
Nth Magical Number 12.6% | HardH | Solve→ |
Sort Array By Parity II 12.6% | EasyE | Solve→ |
Long Pressed Name 12.6% | EasyE | Solve→ |
Design File System 12.6% | MediumM | Solve→ |
Number of Steps to Reduce a Number in Binary Representation to One 12.6% | MediumM | Solve→ |
Sum of All Subset XOR Totals 12.6% | EasyE | Solve→ |
To Lower Case 12.6% | EasyE | Solve→ |
Second Minimum Time to Reach Destination 12.6% | HardH | Solve→ |
Remove All Adjacent Duplicates in String II 12.6% | MediumM | Solve→ |
Maximum Distance in Arrays 12.6% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements II 12.6% | MediumM | Solve→ |
Customers Who Bought All Products 12.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Fraction Addition and Subtraction 12.6% | MediumM | Solve→ |
Count Elements With Maximum Frequency 12.6% | EasyE | Solve→ |
Customer Placing the Largest Number of Orders 12.6% | EasyE | Solve→ |
Reverse Prefix of Word 12.6% | EasyE | Solve→ |
Divide Nodes Into the Maximum Number of Groups 12.6% | HardH | Solve→ |
Group Sold Products By The Date 12.6% | EasyE | Solve→ |
Maximum Sum of Subsequence With Non-adjacent Elements 12.6% | HardH | Solve→ |
Smallest Number in Infinite Set 12.6% | MediumM | Solve→ |
Sort Integers by The Number of 1 Bits 12.6% | EasyE | Solve→ |
Cousins in Binary Tree II 12.6% | MediumM | Solve→ |
String Compression III 12.6% | MediumM | Solve→ |
Take K of Each Character From Left and Right 12.6% | MediumM | Solve→ |
Next Greater Node In Linked List 12.6% | MediumM | Solve→ |
Prime Palindrome 12.6% | MediumM | Solve→ |
Identify the Largest Outlier in an Array 12.6% | MediumM | Solve→ |
Adding Spaces to a String 12.6% | MediumM | Solve→ |
Construct String With Repeat Limit 12.6% | MediumM | Solve→ |
Classes With at Least 5 Students 12.6% | EasyE | Solve→ |
Reverse Odd Levels of Binary Tree 12.6% | MediumM | Solve→ |
Minimum Insertion Steps to Make a String Palindrome 12.6% | HardH | Solve→ |
Find Center of Star Graph 12.6% | EasyE | Solve→ |
First Completely Painted Row or Column 12.6% | MediumM | Solve→ |
Maximum Ascending Subarray Sum 12.6% | EasyE | Solve→ |
Find the Number of Distinct Colors Among the Balls 12.6% | MediumM | Solve→ |
Max Sum of a Pair With Equal Sum of Digits 12.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Jump Game V 12.6% | HardH | Solve→ |
Number of Sub-arrays With Odd Sum 12.6% | MediumM | Solve→ |
Two Furthest Houses With Different Colors 12.6% | EasyE | Solve→ |
Design Excel Sum Formula 12.6% | HardH | Solve→ |
Simple Bank System 12.6% | MediumM | Solve→ |
Merge In Between Linked Lists 12.6% | MediumM | Solve→ |
Calculate Special Bonus 12.6% | EasyE | Solve→ |
Put Marbles in Bags 12.6% | HardH | Solve→ |
Find the Count of Good Integers 12.6% | HardH | Solve→ |
Count Vowel Substrings of a String 12.6% | EasyE | Solve→ |
Count the Number of Ideal Arrays 12.6% | HardH | Solve→ |
Count Complete Subarrays in an Array 12.6% | MediumM | Solve→ |
Count Operations to Obtain Zero 12.6% | EasyE | Solve→ |
Maximum Students Taking Exam 12.6% | HardH | Solve→ |
Longest Subsequence Repeated k Times 12.6% | HardH | Solve→ |
Find the Original Typed String I 12.6% | EasyE | Solve→ |
Find Lucky Integer in an Array 12.6% | EasyE | Solve→ |
Maximum Fruits Harvested After at Most K Steps 12.6% | HardH | Solve→ |
Reorder Routes to Make All Paths Lead to the City Zero 12.6% | MediumM | Solve→ |
Maximum 69 Number 12.6% | EasyE | Solve→ |
Minimum Operations to Make Array Elements Zero 12.6% | HardH | Solve→ |
Minimum Operations to Make the Integer Zero 12.6% | MediumM | Solve→ |
The Two Sneaky Numbers of Digitville 12.6% | EasyE | Solve→ |
Find Resultant Array After Removing Anagrams 12.6% | EasyE | Solve→ |
Reshape the Matrix 12.6% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find and Replace Pattern 12.6% | MediumM | Solve→ |
Keep Multiplying Found Values by Two 12.6% | EasyE | Solve→ |
Set Intersection Size At Least Two 12.6% | HardH | Solve→ |
Count Covered Buildings 12.6% | MediumM | Solve→ |
Maximize Active Section with Trade I 12.6% | MediumM | Solve→ |
Four Divisors 12.6% | MediumM | Solve→ |
Max Dot Product of Two Subsequences 12.6% | HardH | Solve→ |
Design Parking System 12.6% | EasyE | Solve→ |
Smallest Divisible Digit Product II 12.6% | HardH | Solve→ |
Trionic Array II 12.6% | HardH | Solve→ |
Maximum Score From Grid Operations 12.6% | HardH | Solve→ |
Minimum Initial Energy to Finish Tasks 12.6% | HardH | Solve→ |
Binary Tree Level Order Traversal II 10.5% | MediumM | Solve→ |
Range Sum Query - Mutable 10.5% | MediumM | Solve→ |
4Sum II 10.5% | MediumM | Solve→ |
Brick Wall 10.5% | MediumM | Solve→ |
Knight Probability in Chessboard 10.5% | MediumM | Solve→ |
Most Common Word 10.5% | EasyE | Solve→ |
Leaf-Similar Trees 10.5% | EasyE | Solve→ |
Increasing Order Search Tree 10.5% | EasyE | Solve→ |
Check Completeness of a Binary Tree 10.5% | MediumM | Solve→ |
Minimum Score Triangulation of Polygon 10.5% | MediumM | Solve→ |
Minimum Cost Tree From Leaf Values 10.5% | MediumM | Solve→ |
Path Crossing 10.5% | EasyE | Solve→ |
Maximum Number of Visible Points 10.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Operations to Make Array Continuous 10.5% | HardH | Solve→ |
Maximize the Confusion of an Exam 10.5% | MediumM | Solve→ |
Escape the Spreading Fire 10.5% | HardH | Solve→ |
Find Closest Number to Zero 10.5% | EasyE | Solve→ |
Removing Stars From a String 10.5% | MediumM | Solve→ |
Minimum Penalty for a Shop 10.5% | MediumM | Solve→ |
Count Symmetric Integers 10.5% | EasyE | Solve→ |
Equal Row and Column Pairs 10.5% | MediumM | Solve→ |
Elimination Game 10.5% | MediumM | Solve→ |
Strong Password Checker 10.5% | HardH | Solve→ |
Remove Letter To Equalize Frequency 10.5% | EasyE | Solve→ |
Function Composition 10.5% | EasyE | Solve→ |
Allow One Function Call 10.5% | EasyE | Solve→ |
Count Pairs Whose Sum is Less than Target 10.5% | EasyE | Solve→ |
Possible Bipartition 10.5% | MediumM | Solve→ |
Verifying an Alien Dictionary 10.5% | EasyE | Solve→ |
Regions Cut By Slashes 10.5% | MediumM | Solve→ |
Binary Tree Cameras 10.5% | HardH | Solve→ |
Balance a Binary Search Tree 10.5% | MediumM | Solve→ |
Generate Binary Strings Without Adjacent Zeros 10.5% | MediumM | Solve→ |
Delete Leaves With a Given Value 10.5% | MediumM | Solve→ |
Count Good Nodes in Binary Tree 10.5% | MediumM | Solve→ |
Jump Game VI 10.5% | MediumM | Solve→ |
Find the Winner of the Circular Game 10.5% | MediumM | Solve→ |
Cousins in Binary Tree 10.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Spiral Matrix III 10.5% | MediumM | Solve→ |
Minimum Swaps to Make Strings Equal 10.5% | MediumM | Solve→ |
Reach End of Array With Max Score 10.5% | MediumM | Solve→ |
Number of Distinct Islands 10.5% | MediumM | Solve→ |
Longest Subarray With Maximum Bitwise AND 10.5% | MediumM | Solve→ |
Uncommon Words from Two Sentences 10.5% | EasyE | Solve→ |
Taking Maximum Energy From the Mystic Dungeon 10.5% | MediumM | Solve→ |
Maximum Height by Stacking Cuboids 10.5% | HardH | Solve→ |
Minimum String Length After Removing Substrings 10.5% | EasyE | Solve→ |
Score of Parentheses 10.5% | MediumM | Solve→ |
The Number of the Smallest Unoccupied Chair 10.5% | MediumM | Solve→ |
Divide Intervals Into Minimum Number of Groups 10.5% | MediumM | Solve→ |
Minimum Total Distance Traveled 10.5% | HardH | Solve→ |
Minimum Number of Changes to Make Binary String Beautiful 10.5% | MediumM | Solve→ |
Determine Whether Matrix Can Be Obtained By Rotation 10.5% | EasyE | Solve→ |
Minimum Array End 10.5% | MediumM | Solve→ |
Nested List Weight Sum II 10.5% | MediumM | Solve→ |
Flip Columns For Maximum Number of Equal Rows 10.5% | MediumM | Solve→ |
Count Unguarded Cells in the Grid 10.5% | MediumM | Solve→ |
Reconstruct Original Digits from English 10.5% | MediumM | Solve→ |
Sort By 10.5% | EasyE | Solve→ |
Find Minimum Diameter After Merging Two Trees 10.5% | HardH | Solve→ |
Word Frequency 10.5% | MediumM | Solve→ |
Maximize Subarray Sum After Removing All Occurrences of One Element 10.5% | HardH | Solve→ |
Minimize XOR 10.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Average of Levels in Binary Tree 10.5% | EasyE | Solve→ |
Maximum Total Damage With Spell Casting 10.5% | MediumM | Solve→ |
Univalued Binary Tree 10.5% | EasyE | Solve→ |
Minimum Number Game 10.5% | EasyE | Solve→ |
Sum of Distances 10.5% | MediumM | Solve→ |
Length of Longest Fibonacci Subsequence 10.5% | MediumM | Solve→ |
Find the Occurrence of First Almost Equal Substring 10.5% | HardH | Solve→ |
Apply Operations to Maximize Score 10.5% | HardH | Solve→ |
Three Divisors 10.5% | EasyE | Solve→ |
Tenth Line 10.5% | EasyE | Solve→ |
Minimum Operations to Make Array Values Equal to K 10.5% | EasyE | Solve→ |
Count Good Triplets in an Array 10.5% | HardH | Solve→ |
Reformat Department Table 10.5% | EasyE | Solve→ |
Process Tasks Using Servers 10.5% | MediumM | Solve→ |
Patients With a Condition 10.5% | EasyE | Solve→ |
Custom Sort String 10.5% | MediumM | Solve→ |
Available Captures for Rook 10.5% | EasyE | Solve→ |
Count Subarrays Where Max Element Appears at Least K Times 10.5% | MediumM | Solve→ |
Construct the Rectangle 10.5% | EasyE | Solve→ |
Find Most Frequent Vowel and Consonant 10.5% | EasyE | Solve→ |
Can I Win 10.5% | MediumM | Solve→ |
Maximize the Number of Target Nodes After Connecting Trees I 10.5% | MediumM | Solve→ |
Lexicographically Minimum String After Removing Stars 10.5% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency II 10.5% | HardH | Solve→ |
Find the Pivot Integer 10.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Subsequence of Length K With the Largest Sum 10.5% | EasyE | Solve→ |
Find the K-th Character in String Game II 10.5% | HardH | Solve→ |
Matchsticks to Square 10.5% | MediumM | Solve→ |
Valid Word 10.5% | EasyE | Solve→ |
Add to Array-Form of Integer 10.5% | EasyE | Solve→ |
Minimum Difference in Sums After Removal of Elements 10.5% | HardH | Solve→ |
Count Partitions With Max-Min Difference at Most K 10.5% | MediumM | Solve→ |
Maximum Unique Subarray Sum After Deletion 10.5% | EasyE | Solve→ |
Letter Case Permutation 10.5% | MediumM | Solve→ |
Transpose File 10.5% | MediumM | Solve→ |
Largest Number After Digit Swaps by Parity 10.5% | EasyE | Solve→ |
Invalid Transactions 10.5% | MediumM | Solve→ |
Sort Matrix by Diagonals 10.5% | MediumM | Solve→ |
Alice and Bob Playing Flower Game 10.5% | MediumM | Solve→ |
Find Common Elements Between Two Arrays 10.5% | EasyE | Solve→ |
Minimum Number of People to Teach 10.5% | MediumM | Solve→ |
Replace Non-Coprime Numbers in Array 10.5% | HardH | Solve→ |
Maximum Number of Words You Can Type 10.5% | EasyE | Solve→ |
Minimum Moves to Move a Box to Their Target Location 10.5% | HardH | Solve→ |
Successful Pairs of Spells and Potions 10.5% | MediumM | Solve→ |
Power Grid Maintenance 10.5% | MediumM | Solve→ |
Maximize the Minimum Powered City 10.5% | HardH | Solve→ |
Minimum Operations to Convert All Elements to Zero 10.5% | MediumM | Solve→ |
Count of Matches in Tournament 10.5% | EasyE | Solve→ |
1-bit and 2-bit Characters 10.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Greatest Sum Divisible by Three 10.5% | MediumM | Solve→ |
Process String with Special Operations II 10.5% | HardH | Solve→ |
Count Special Triplets 10.5% | MediumM | Solve→ |
Count the Number of Computer Unlocking Permutations 10.5% | MediumM | Solve→ |
Number of Smooth Descent Periods of a Stock 10.5% | MediumM | Solve→ |
Number of Ways to Paint N × 3 Grid 10.5% | HardH | Solve→ |
Tallest Billboard 10.5% | HardH | Solve→ |
Minimum ASCII Delete Sum for Two Strings 10.5% | MediumM | Solve→ |
Maximum Square Area by Removing Fences From a Field 10.5% | MediumM | Solve→ |
Find Players With Zero or One Losses 10.5% | MediumM | Solve→ |
Minimum Removals to Balance Array 10.5% | MediumM | Solve→ |
Restaurant Growth 10.5% | MediumM | Solve→ |
Longest Balanced Substring II 10.5% | MediumM | Solve→ |
Rearrange Products Table 10.5% | EasyE | Solve→ |
Jump Game IX 10.5% | MediumM | Solve→ |
Minimum Jumps to Reach End via Prime Teleportation 10.5% | MediumM | Solve→ |
Minimum Moves to Make Array Complementary 10.5% | MediumM | Solve→ |
Check if Array is Good 10.5% | EasyE | Solve→ |
Count the Number of Special Characters II 10.5% | MediumM | Solve→ |
Earliest Finish Time for Land and Water Rides I 10.5% | EasyE | Solve→ |
Number of Ways to Assign Edge Weights II 10.5% | HardH | Solve→ |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 10.5% | MediumM | Solve→ |
Count Subarrays With Majority Element I 10.5% | MediumM | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum I 10.5% | EasyE | Solve→ |
Maximize Active Section with Trade II 10.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Palindromic Rearrangement II 10.5% | HardH | Solve→ |
Data Stream as Disjoint Intervals 8.1% | HardH | Solve→ |
Find Right Interval 8.1% | MediumM | Solve→ |
Teemo Attacking 8.1% | EasyE | Solve→ |
Find the Closest Palindrome 8.1% | HardH | Solve→ |
K Inverse Pairs Array 8.1% | HardH | Solve→ |
Max Stack 8.1% | HardH | Solve→ |
Number of Days Between Two Dates 8.1% | EasyE | Solve→ |
Constrained Subsequence Sum 8.1% | HardH | Solve→ |
Three Consecutive Odds 8.1% | EasyE | Solve→ |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree 8.1% | HardH | Solve→ |
Delete Duplicate Folders in System 8.1% | HardH | Solve→ |
Count Number of Pairs With Absolute Difference K 8.1% | EasyE | Solve→ |
Most Frequent Even Element 8.1% | EasyE | Solve→ |
Remove Digit From Number to Maximize Result 8.1% | EasyE | Solve→ |
Design a Food Rating System 8.1% | MediumM | Solve→ |
Amount of Time for Binary Tree to Be Infected 8.1% | MediumM | Solve→ |
Count the Digits That Divide a Number 8.1% | EasyE | Solve→ |
Check if Object Instance of Class 8.1% | MediumM | Solve→ |
Max Increase to Keep City Skyline 8.1% | MediumM | Solve→ |
Sort Vowels in a String 8.1% | MediumM | Solve→ |
Most Profit Assigning Work 8.1% | MediumM | Solve→ |
Rectangle Area II 8.1% | HardH | Solve→ |
Height Checker 8.1% | EasyE | Solve→ |
Check If It Is a Good Array 8.1% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Widest Vertical Area Between Two Points Containing No Points 8.1% | EasyE | Solve→ |
Seat Reservation Manager 8.1% | MediumM | Solve→ |
Egg Drop With 2 Eggs and N Floors 8.1% | MediumM | Solve→ |
Nearest Exit from Entrance in Maze 8.1% | MediumM | Solve→ |
Longest Nice Substring 8.1% | EasyE | Solve→ |
Minimum Bit Flips to Convert Number 8.1% | EasyE | Solve→ |
Basic Calculator IV 8.1% | HardH | Solve→ |
Number Complement 8.1% | EasyE | Solve→ |
Count Sub Islands 8.1% | MediumM | Solve→ |
Find the Student that Will Replace the Chalk 8.1% | MediumM | Solve→ |
Find Minimum Operations to Make All Elements Divisible by Three 8.1% | EasyE | Solve→ |
Sort the People 8.1% | EasyE | Solve→ |
Count the Number of Special Characters I 8.1% | EasyE | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 8.1% | MediumM | Solve→ |
Find Winner on a Tic Tac Toe Game 8.1% | EasyE | Solve→ |
Pairs of Songs With Total Durations Divisible by 60 8.1% | MediumM | Solve→ |
Maximum Subarray Sum with One Deletion 8.1% | MediumM | Solve→ |
Tweet Counts Per Frequency 8.1% | MediumM | Solve→ |
Separate Black and White Balls 8.1% | MediumM | Solve→ |
Sort Items by Groups Respecting Dependencies 8.1% | HardH | Solve→ |
Two City Scheduling 8.1% | MediumM | Solve→ |
Best Meeting Point 8.1% | HardH | Solve→ |
Total Characters in String After Transformations II 8.1% | HardH | Solve→ |
Largest Combination With Bitwise AND Greater Than Zero 8.1% | MediumM | Solve→ |
Shortest Subarray With OR at Least K II 8.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Most Beautiful Item for Each Query 8.1% | MediumM | Solve→ |
Find the Power of K-Size Subarrays I 8.1% | MediumM | Solve→ |
Shortest Distance After Road Addition Queries I 8.1% | MediumM | Solve→ |
Find the Middle Index in Array 8.1% | EasyE | Solve→ |
Find Score of an Array After Marking All Elements 8.1% | MediumM | Solve→ |
Minimum Number of Operations to Sort a Binary Tree by Level 8.1% | MediumM | Solve→ |
Number of Segments in a String 8.1% | EasyE | Solve→ |
Row With Maximum Ones 8.1% | EasyE | Solve→ |
Convert BST to Greater Tree 8.1% | MediumM | Solve→ |
Analyze User Website Visit Pattern 8.1% | MediumM | Solve→ |
Max Pair Sum in an Array 8.1% | EasyE | Solve→ |
Grid Game 8.1% | MediumM | Solve→ |
Count Univalue Subtrees 8.1% | MediumM | Solve→ |
Course Schedule IV 8.1% | MediumM | Solve→ |
Count of Interesting Subarrays 8.1% | MediumM | Solve→ |
Maximum Frequency After Subarray Operation 8.1% | MediumM | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 8.1% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 8.1% | EasyE | Solve→ |
Minimum Operations to Make the Array Increasing 8.1% | EasyE | Solve→ |
Sum of Unique Elements 8.1% | EasyE | Solve→ |
Count Total Number of Colored Cells 8.1% | MediumM | Solve→ |
Find Indices of Stable Mountains 8.1% | EasyE | Solve→ |
Maximum Alternating Subsequence Sum 8.1% | MediumM | Solve→ |
Parse Lisp Expression 8.1% | HardH | Solve→ |
Divide Array Into Equal Pairs 8.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count the Number of Complete Components 8.1% | MediumM | Solve→ |
Maximum Repeating Substring 8.1% | EasyE | Solve→ |
Minimum Operations to Make a Uni-Value Grid 8.1% | MediumM | Solve→ |
Minimum Index of a Valid Split 8.1% | MediumM | Solve→ |
Maximum Number of Points From Grid Queries 8.1% | HardH | Solve→ |
Minimum Cuts to Divide a Circle 8.1% | EasyE | Solve→ |
Find the String with LCP 8.1% | HardH | Solve→ |
Filter Elements from Array 8.1% | EasyE | Solve→ |
Mirror Reflection 8.1% | MediumM | Solve→ |
Serialize and Deserialize BST 8.1% | MediumM | Solve→ |
Shifting Letters 8.1% | MediumM | Solve→ |
Check if Matrix Is X-Matrix 8.1% | EasyE | Solve→ |
Make Array Non-decreasing 8.1% | MediumM | Solve→ |
Count the Hidden Sequences 8.1% | MediumM | Solve→ |
All Paths From Source to Target 8.1% | MediumM | Solve→ |
Minimum Swaps to Sort by Digit Sum 8.1% | MediumM | Solve→ |
The Latest Login in 2020 8.1% | EasyE | Solve→ |
String Without AAA or BBB 8.1% | MediumM | Solve→ |
Maximize the Number of Target Nodes After Connecting Trees II 8.1% | HardH | Solve→ |
Lexicographically Smallest Equivalent String 8.1% | MediumM | Solve→ |
3Sum With Multiplicity 8.1% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency I 8.1% | EasyE | Solve→ |
Maximum Difference Between Adjacent Elements in a Circular Array 8.1% | EasyE | Solve→ |
Max Difference You Can Get From Changing an Integer 8.1% | MediumM | Solve→ |
Unique 3-Digit Even Numbers 8.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Weighted Median Node in Tree 8.1% | HardH | Solve→ |
Number of Squareful Arrays 8.1% | HardH | Solve→ |
Closest Subsequence Sum 8.1% | HardH | Solve→ |
Validate IP Address 8.1% | MediumM | Solve→ |
Finding Pairs With a Certain Sum 8.1% | MediumM | Solve→ |
Maximum Nesting Depth of Two Valid Parentheses Strings 8.1% | MediumM | Solve→ |
Decode the Message 8.1% | EasyE | Solve→ |
Maximum Subarray With Equal Products 8.1% | EasyE | Solve→ |
Vowel Spellchecker 8.1% | MediumM | Solve→ |
Friend Requests II: Who Has the Most Friends 8.1% | MediumM | Solve→ |
Subsequence Sum After Capping Elements 8.1% | MediumM | Solve→ |
Design Spreadsheet 8.1% | MediumM | Solve→ |
Find Minimum Time to Finish All Jobs 8.1% | HardH | Solve→ |
Minimum Cost to Reach Destination in Time 8.1% | HardH | Solve→ |
Check If Digits Are Equal in String After Operations I 8.1% | EasyE | Solve→ |
Make Array Elements Equal to Zero 8.1% | EasyE | Solve→ |
Largest Magic Square 8.1% | MediumM | Solve→ |
Find X-Sum of All K-Long Subarrays II 8.1% | HardH | Solve→ |
Minimum One Bit Operations to Make Integers Zero 8.1% | HardH | Solve→ |
Actors and Directors Who Cooperated At Least Three Times 8.1% | EasyE | Solve→ |
Count Partitions with Even Sum Difference 8.1% | EasyE | Solve→ |
Trim a Binary Search Tree 8.1% | MediumM | Solve→ |
Total Waviness of Numbers in Range I 8.1% | MediumM | Solve→ |
Design A Leaderboard 8.1% | MediumM | Solve→ |
Apple Redistribution into Boxes 8.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Subtree with all the Deepest Nodes 8.1% | MediumM | Solve→ |
Find Words That Can Be Formed by Characters 8.1% | EasyE | Solve→ |
Find Nth Smallest Integer With K One Bits 8.1% | HardH | Solve→ |
Minimum Cost Path with Teleportations 8.1% | HardH | Solve→ |
Human Traffic of Stadium 8.1% | HardH | Solve→ |
Maximize Cyclic Partition Score 8.1% | HardH | Solve→ |
Minimum Deletions to Make Array Divisible 8.1% | HardH | Solve→ |
Prime Number of Set Bits in Binary Representation 8.1% | EasyE | Solve→ |
Sum of Root To Leaf Binary Numbers 8.1% | EasyE | Solve→ |
Minimum Operations to Equalize Binary String 8.1% | HardH | Solve→ |
Market Analysis I 8.1% | MediumM | Solve→ |
Concatenation of Consecutive Binary Numbers 8.1% | MediumM | Solve→ |
Maximize Spanning Tree Stability with Upgrades 8.1% | HardH | Solve→ |
Reverse Nodes in Even Length Groups 8.1% | MediumM | Solve→ |
Get Biggest Three Rhombus Sums in a Grid 8.1% | MediumM | Solve→ |
Count Submatrices with Top-Left Element and Sum Less Than k 8.1% | MediumM | Solve→ |
Minimum Absolute Difference in Sliding Submatrix 8.1% | MediumM | Solve→ |
Equal Sum Grid Partition I 8.1% | MediumM | Solve→ |
Equal Sum Grid Partition II 8.1% | HardH | Solve→ |
Lexicographically Smallest Generated String 8.1% | HardH | Solve→ |
Maximize the Distance Between Points on a Square 8.1% | HardH | Solve→ |
Separate the Digits in an Array 8.1% | EasyE | Solve→ |
Circular Array Loop 8.1% | MediumM | Solve→ |
Sum of Variable Length Subarrays 8.1% | EasyE | Solve→ |
Total Waviness of Numbers in Range II 8.1% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of ZigZag Arrays II 8.1% | HardH | Solve→ |
Maximum Element After Decreasing and Rearranging 8.1% | MediumM | Solve→ |
Number of Strings That Appear as Substrings in Word 8.1% | EasyE | Solve→ |
Number of Paths with Max Score 8.1% | HardH | Solve→ |
Shift 2D Grid 8.1% | EasyE | Solve→ |
Number of Unique XOR Triplets I 8.1% | MediumM | Solve→ |
Longest Substring of One Repeating Character 8.1% | HardH | Solve→ |
Maximum Length Substring With Two Occurrences 8.1% | EasyE | Solve→ |
Longest Subsequence With Non-Zero Bitwise XOR 8.1% | MediumM | Solve→ |
Paint House 5.5% | MediumM | Solve→ |
Find the Celebrity 5.5% | MediumM | Solve→ |
Minesweeper 5.5% | MediumM | Solve→ |
Remove Comments 5.5% | MediumM | Solve→ |
Consecutive Numbers Sum 5.5% | HardH | Solve→ |
Distinct Subsequences II 5.5% | HardH | Solve→ |
Building H2O 5.5% | MediumM | Solve→ |
The K Weakest Rows in a Matrix 5.5% | EasyE | Solve→ |
Linked List in Binary Tree 5.5% | MediumM | Solve→ |
HTML Entity Parser 5.5% | MediumM | Solve→ |
Check If Two String Arrays are Equivalent 5.5% | EasyE | Solve→ |
Count Number of Homogenous Substrings 5.5% | MediumM | Solve→ |
Maximum Number of Accepted Invitations 5.5% | MediumM | Solve→ |
Count Nodes Equal to Average of Subtree 5.5% | MediumM | Solve→ |
Count Integers in Intervals 5.5% | HardH | Solve→ |
Longest Cycle in a Graph 5.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Optimal Partition of String 5.5% | MediumM | Solve→ |
Arithmetic Slices II - Subsequence 5.5% | HardH | Solve→ |
Find Bottom Left Tree Value 5.5% | MediumM | Solve→ |
Maximum Length of Pair Chain 5.5% | MediumM | Solve→ |
Strange Printer 5.5% | HardH | Solve→ |
N-ary Tree Level Order Traversal 5.5% | MediumM | Solve→ |
Robot Collisions 5.5% | HardH | Solve→ |
Number of Lines To Write String 5.5% | EasyE | Solve→ |
Score After Flipping Matrix 5.5% | MediumM | Solve→ |
Minimum Increment to Make Array Unique 5.5% | MediumM | Solve→ |
Find the Maximum Sum of Node Values 5.5% | HardH | Solve→ |
Remove Zero Sum Consecutive Nodes from Linked List 5.5% | MediumM | Solve→ |
Maximum Score Words Formed by Letters 5.5% | HardH | Solve→ |
Verbal Arithmetic Puzzle 5.5% | HardH | Solve→ |
Number of Operations to Make Network Connected 5.5% | MediumM | Solve→ |
Maximum Performance of a Team 5.5% | HardH | Solve→ |
Bank Account Summary II 5.5% | EasyE | Solve→ |
Minimum Cost to Convert String I 5.5% | MediumM | Solve→ |
Build Array Where You Can Find The Maximum Exactly K Comparisons 5.5% | HardH | Solve→ |
Number of Senior Citizens 5.5% | EasyE | Solve→ |
Maximum Odd Binary Number 5.5% | EasyE | Solve→ |
Minimum Number of Days to Disconnect Island 5.5% | HardH | Solve→ |
N-ary Tree Postorder Traversal 5.5% | EasyE | Solve→ |
N-ary Tree Preorder Traversal 5.5% | EasyE | Solve→ |
Modify Graph Edge Weights 5.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Moves to Convert String 5.5% | EasyE | Solve→ |
Sum of Digits of String After Convert 5.5% | EasyE | Solve→ |
Spiral Matrix IV 5.5% | MediumM | Solve→ |
Restore the Array From Adjacent Pairs 5.5% | MediumM | Solve→ |
Super Washing Machines 5.5% | HardH | Solve→ |
Shortest String That Contains Three Strings 5.5% | MediumM | Solve→ |
Chalkboard XOR Game 5.5% | HardH | Solve→ |
Projection Area of 3D Shapes 5.5% | EasyE | Solve→ |
Make Array Non-decreasing or Non-increasing 5.5% | HardH | Solve→ |
K-th Largest Perfect Subtree Size in Binary Tree 5.5% | MediumM | Solve→ |
Create Target Array in the Given Order 5.5% | EasyE | Solve→ |
Maximum Number of Moves in a Grid 5.5% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 5.5% | MediumM | Solve→ |
Day of the Week 5.5% | EasyE | Solve→ |
Sliding Puzzle 5.5% | HardH | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 5.5% | EasyE | Solve→ |
Binary Search Tree to Greater Sum Tree 5.5% | MediumM | Solve→ |
Determine if String Halves Are Alike 5.5% | EasyE | Solve→ |
Maximum Possible Number by Binary Concatenation 5.5% | MediumM | Solve→ |
Find Building Where Alice and Bob Can Meet 5.5% | HardH | Solve→ |
Find Triangular Sum of an Array 5.5% | MediumM | Solve→ |
Find the Key of the Numbers 5.5% | EasyE | Solve→ |
Convert the Temperature 5.5% | EasyE | Solve→ |
Count Ways To Build Good Strings 5.5% | MediumM | Solve→ |
Ways to Split Array Into Three Subarrays 5.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Coins From K Consecutive Bags 5.5% | MediumM | Solve→ |
Coloring A Border 5.5% | MediumM | Solve→ |
Construct K Palindrome Strings 5.5% | MediumM | Solve→ |
Bitwise XOR of All Pairings 5.5% | MediumM | Solve→ |
Manhattan Distances of All Arrangements of Pieces 5.5% | HardH | Solve→ |
Count Items Matching a Rule 5.5% | EasyE | Solve→ |
Swap For Longest Repeated Character Substring 5.5% | MediumM | Solve→ |
Uncrossed Lines 5.5% | MediumM | Solve→ |
Find Good Days to Rob the Bank 5.5% | MediumM | Solve→ |
Maximum Distance Between a Pair of Values 5.5% | MediumM | Solve→ |
Biggest Single Number 5.5% | EasyE | Solve→ |
Split Array into Fibonacci Sequence 5.5% | MediumM | Solve→ |
Goal Parser Interpretation 5.5% | EasyE | Solve→ |
Construct Smallest Number From DI String 5.5% | MediumM | Solve→ |
Select Data 5.5% | EasyE | Solve→ |
Length of Longest V-Shaped Diagonal Segment 5.5% | HardH | Solve→ |
Check Knight Tour Configuration 5.5% | MediumM | Solve→ |
Display the First Three Rows 5.5% | EasyE | Solve→ |
Maximum Subarray Min-Product 5.5% | MediumM | Solve→ |
Number of Distinct Islands II 5.5% | HardH | Solve→ |
Reshape Data: Concatenate 5.5% | EasyE | Solve→ |
Total Appeal of A String 5.5% | HardH | Solve→ |
Longest Non-decreasing Subarray From Two Arrays 5.5% | MediumM | Solve→ |
Hash Divided String 5.5% | MediumM | Solve→ |
Generate Fibonacci Sequence 5.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
A Number After a Double Reversal 5.5% | EasyE | Solve→ |
Top Travellers 5.5% | EasyE | Solve→ |
Contain Virus 5.5% | HardH | Solve→ |
Numbers With Same Consecutive Differences 5.5% | MediumM | Solve→ |
Find the Divisibility Array of a String 5.5% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet I 5.5% | EasyE | Solve→ |
Minimum Number of Operations to Make Elements in Array Distinct 5.5% | EasyE | Solve→ |
Inorder Successor in BST 5.5% | MediumM | Solve→ |
Divide a String Into Groups of Size k 5.5% | EasyE | Solve→ |
Longest Special Path II 5.5% | HardH | Solve→ |
Buildings With an Ocean View 5.5% | MediumM | Solve→ |
Missing Element in Sorted Array 5.5% | MediumM | Solve→ |
Maximum Number of Tasks You Can Assign 5.5% | HardH | Solve→ |
Stone Game VII 5.5% | MediumM | Solve→ |
Number of Subarrays with Bounded Maximum 5.5% | MediumM | Solve→ |
Generate a String With Characters That Have Odd Counts 5.5% | EasyE | Solve→ |
Delete Greatest Value in Each Row 5.5% | EasyE | Solve→ |
Design Underground System 5.5% | MediumM | Solve→ |
Find Closest Node to Given Two Nodes 5.5% | MediumM | Solve→ |
Maximum Candies You Can Get from Boxes 5.5% | HardH | Solve→ |
Make the XOR of All Segments Equal to Zero 5.5% | HardH | Solve→ |
Maximum Difference by Remapping a Digit 5.5% | EasyE | Solve→ |
Count Special Quadruplets 5.5% | EasyE | Solve→ |
Card Flipping Game 5.5% | MediumM | Solve→ |
Find Nearest Point That Has the Same X or Y Coordinate 5.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Word Distance II 5.5% | MediumM | Solve→ |
Partition Array Such That Maximum Difference Is K 5.5% | MediumM | Solve→ |
Longest Subsequence With Limited Sum 5.5% | EasyE | Solve→ |
Sum of Absolute Differences in a Sorted Array 5.5% | MediumM | Solve→ |
Sum of All Odd Length Subarrays 5.5% | EasyE | Solve→ |
Reducing Dishes 5.5% | HardH | Solve→ |
Unique Substrings in Wraparound String 5.5% | MediumM | Solve→ |
Count The Repetitions 5.5% | HardH | Solve→ |
Maximum Matching of Players With Trainers 5.5% | MediumM | Solve→ |
Task Scheduler II 5.5% | MediumM | Solve→ |
Zigzag Grid Traversal With Skip 5.5% | EasyE | Solve→ |
Vowels Game in a String 5.5% | MediumM | Solve→ |
Partition Array for Maximum XOR and AND 5.5% | HardH | Solve→ |
Find the Maximum Number of Fruits Collected 5.5% | HardH | Solve→ |
Collect Coins in a Tree 5.5% | HardH | Solve→ |
Allocate Mailboxes 5.5% | HardH | Solve→ |
Maximum Frequency Stack 5.5% | HardH | Solve→ |
Find the Minimum Area to Cover All Ones II 5.5% | HardH | Solve→ |
Maximum Area of Longest Diagonal Rectangle 5.5% | EasyE | Solve→ |
Count The Number of Winning Sequences 5.5% | HardH | Solve→ |
Find Closest Person 5.5% | EasyE | Solve→ |
Promise Time Limit 5.5% | MediumM | Solve→ |
Count Bowl Subarrays 5.5% | MediumM | Solve→ |
Maximum Product of the Length of Two Palindromic Subsequences 5.5% | MediumM | Solve→ |
Find the Number of Winning Players 5.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Highest Grade For Each Student 5.5% | MediumM | Solve→ |
Implement Router 5.5% | MediumM | Solve→ |
Minimize String Length 5.5% | EasyE | Solve→ |
Count Elements With Strictly Smaller and Greater Elements 5.5% | EasyE | Solve→ |
Maximum Area Rectangle With Point Constraints II 5.5% | HardH | Solve→ |
XOR Operation in an Array 5.5% | EasyE | Solve→ |
Water Bottles II 5.5% | MediumM | Solve→ |
Find Beautiful Indices in the Given Array I 5.5% | MediumM | Solve→ |
Minimum Difficulty of a Job Schedule 5.5% | HardH | Solve→ |
Maximum Count of Positive Integer and Negative Integer 5.5% | EasyE | Solve→ |
Candy Crush 5.5% | MediumM | Solve→ |
Number of Even and Odd Bits 5.5% | EasyE | Solve→ |
Find Students Who Improved 5.5% | MediumM | Solve→ |
Non-negative Integers without Consecutive Ones 5.5% | HardH | Solve→ |
Sort Even and Odd Indices Independently 5.5% | EasyE | Solve→ |
Count Distinct Integers After Removing Zeros 5.5% | MediumM | Solve→ |
Best Team With No Conflicts 5.5% | MediumM | Solve→ |
Count Collisions on a Road 5.5% | MediumM | Solve→ |
Zuma Game 5.5% | HardH | Solve→ |
Coupon Code Validator 5.5% | EasyE | Solve→ |
Maximum Profit from Trading Stocks with Discounts 5.5% | HardH | Solve→ |
Two-Letter Card Game 5.5% | MediumM | Solve→ |
Difference Between Element Sum and Digit Sum of an Array 5.5% | EasyE | Solve→ |
Broken Calculator 5.5% | MediumM | Solve→ |
Sales Analysis III 5.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Turbulent Subarray 5.5% | MediumM | Solve→ |
Merge BSTs to Create Single BST 5.5% | HardH | Solve→ |
Maximize Area of Square Hole in Grid 5.5% | MediumM | Solve→ |
Design Auction System 5.5% | MediumM | Solve→ |
Construct the Minimum Bitwise Array I 5.5% | EasyE | Solve→ |
Cache With Time Limit 5.5% | MediumM | Solve→ |
Divide an Array Into Subarrays With Minimum Cost II 5.5% | HardH | Solve→ |
Smallest Range I 5.5% | EasyE | Solve→ |
Reverse Degree of a String 5.5% | EasyE | Solve→ |
Apply Operations to Maximize Frequency Score 5.5% | HardH | Solve→ |
Second Largest Digit in a String 5.5% | EasyE | Solve→ |
Number of Black Blocks 5.5% | MediumM | Solve→ |
Find the Number of Subsequences With Equal GCD 5.5% | HardH | Solve→ |
Partitioning Into Minimum Number Of Deci-Binary Numbers 5.5% | MediumM | Solve→ |
Minimum Processing Time 5.5% | MediumM | Solve→ |
Flip Square Submatrix Vertically 5.5% | EasyE | Solve→ |
Construct Uniform Parity Array I 5.5% | EasyE | Solve→ |
Minimum Flips to Make a OR b Equal to c 5.5% | MediumM | Solve→ |
Check if Strings Can be Made Equal With Operations I 5.5% | EasyE | Solve→ |
Check if Strings Can be Made Equal With Operations II 5.5% | MediumM | Solve→ |
Maximum Amount of Money Robot Can Earn 5.5% | MediumM | Solve→ |
Decode the Slanted Ciphertext 5.5% | MediumM | Solve→ |
Walking Robot Simulation 5.5% | MediumM | Solve→ |
Minimum Operations to Transform Array into Alternating Prime 5.5% | MediumM | Solve→ |
Closest Equal Element Queries 5.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Ways to Reach a Position After Exactly k Steps 5.5% | MediumM | Solve→ |
Minimum Absolute Distance Between Mirror Pairs 5.5% | MediumM | Solve→ |
Mirror Distance of an Integer 5.5% | EasyE | Solve→ |
Furthest Point From Origin 5.5% | EasyE | Solve→ |
Apply Operations to Make All Array Elements Equal to Zero 5.5% | MediumM | Solve→ |
Cyclically Rotating a Grid 5.5% | MediumM | Solve→ |
Minimum Element After Replacement With Digit Sum 5.5% | EasyE | Solve→ |
Maximum Total Subarray Value I 5.5% | MediumM | Solve→ |
Weighted Word Mapping 5.5% | EasyE | Solve→ |
Count Salary Categories 5.5% | MediumM | Solve→ |
Maximum Building Height 5.5% | HardH | Solve→ |
Maximum Subarray Sum After at Most K Swaps 5.5% | HardH | Solve→ |
Count Special Integers 5.5% | HardH | Solve→ |
Smallest Rotation with Highest Score 5.5% | HardH | Solve→ |
Unique Morse Code Words 5.5% | EasyE | Solve→ |
K Items With the Maximum Sum 5.5% | EasyE | Solve→ |
Sum of GCD of Formed Pairs 5.5% | MediumM | Solve→ |
Unique Middle Element 5.5% | EasyE | Solve→ |
Count Valid Sequences 5.5% | MediumM | Solve→ |
Stone Game IV 5.5% | HardH | Solve→ |
Read N Characters Given Read4 5% | EasyE | Solve→ |
Tree Node 5% | MediumM | Solve→ |
Find Duplicate File in System 5% | MediumM | Solve→ |
Stickers to Spell Word 5% | HardH | Solve→ |
Binary Trees With Factors 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximize Sum Of Array After K Negations 5% | EasyE | Solve→ |
Longest Repeating Substring 5% | MediumM | Solve→ |
Count All Valid Pickup and Delivery Options 5% | HardH | Solve→ |
Minimum Deletions to Make Character Frequencies Unique 5% | MediumM | Solve→ |
Count Nice Pairs in an Array 5% | MediumM | Solve→ |
Count Unreachable Pairs of Nodes in an Undirected Graph 5% | MediumM | Solve→ |
Check if There is a Valid Partition For The Array 5% | MediumM | Solve→ |
Minimum Cost to Make Array Equal 5% | HardH | Solve→ |
Most Profitable Path in a Tree 5% | MediumM | Solve→ |
Pass the Pillow 5% | EasyE | Solve→ |
Minimum Time to Complete All Tasks 5% | HardH | Solve→ |
The Number of Beautiful Subsets 5% | MediumM | Solve→ |
Convert an Array Into a 2D Array With Conditions 5% | MediumM | Solve→ |
Minimum Additions to Make Valid String 5% | MediumM | Solve→ |
Array Reduce Transformation 5% | EasyE | Solve→ |
Number of Arithmetic Triplets 5% | EasyE | Solve→ |
Poor Pigs 5% | HardH | Solve→ |
Largest Positive Integer That Exists With Its Negative 5% | EasyE | Solve→ |
Append Characters to String to Make Subsequence 5% | MediumM | Solve→ |
Add One Row to Tree 5% | MediumM | Solve→ |
Replace Words 5% | MediumM | Solve→ |
Differences Between Two Objects 5% | MediumM | Solve→ |
Double a Number Represented as a Linked List 5% | MediumM | Solve→ |
Validate Binary Tree Nodes 5% | MediumM | Solve→ |
Count the Number of Inversions 5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Triplets That Can Form Two Arrays of Equal XOR 5% | MediumM | Solve→ |
Subrectangle Queries 5% | MediumM | Solve→ |
Least Number of Unique Integers after K Removals 5% | MediumM | Solve→ |
Remove Max Number of Edges to Keep Graph Fully Traversable 5% | HardH | Solve→ |
Count Number of Teams 5% | MediumM | Solve→ |
Minimum Swaps to Group All 1's Together II 5% | MediumM | Solve→ |
Prefix and Suffix Search 5% | HardH | Solve→ |
Number of Same-End Substrings 5% | MediumM | Solve→ |
Find the Largest Palindrome Divisible by K 5% | HardH | Solve→ |
Find Missing Observations 5% | MediumM | Solve→ |
Insert Greatest Common Divisors in Linked List 5% | MediumM | Solve→ |
K-th Nearest Obstacle Queries 5% | MediumM | Solve→ |
Distinct Prime Factors of Product of Array 5% | MediumM | Solve→ |
Snake in Matrix 5% | EasyE | Solve→ |
Maximal Score After Applying K Operations 5% | MediumM | Solve→ |
Maximum Number of Moves to Kill All Pawns 5% | HardH | Solve→ |
String Compression II 5% | HardH | Solve→ |
Minimum Division Operations to Make Array Non Decreasing 5% | MediumM | Solve→ |
Longest Square Streak in an Array 5% | MediumM | Solve→ |
Minimum Number of Removals to Make Mountain Array 5% | HardH | Solve→ |
Count Substrings With K-Frequency Characters I 5% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 5% | MediumM | Solve→ |
Minimum Operations to Reduce an Integer to 0 5% | MediumM | Solve→ |
Kth Largest Sum in a Binary Tree 5% | MediumM | Solve→ |
Sparse Matrix Multiplication 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Change Data Type 5% | EasyE | Solve→ |
Maximum Star Sum of a Graph 5% | MediumM | Solve→ |
Find Maximum Removals From Source String 5% | MediumM | Solve→ |
Maximize Amount After Two Days of Conversions 5% | MediumM | Solve→ |
Cells with Odd Values in a Matrix 5% | EasyE | Solve→ |
Count Prefix and Suffix Pairs I 5% | EasyE | Solve→ |
Neighboring Bitwise XOR 5% | MediumM | Solve→ |
Merge Nodes in Between Zeros 5% | MediumM | Solve→ |
Make Lexicographically Smallest Array by Swapping Elements 5% | MediumM | Solve→ |
Find the Distance Value Between Two Arrays 5% | EasyE | Solve→ |
Maximum Number of Fish in a Grid 5% | MediumM | Solve→ |
Longest Subsequence With Decreasing Adjacent Difference 5% | MediumM | Solve→ |
Minimum Operations to Exceed Threshold Value II 5% | MediumM | Solve→ |
Split a String in Balanced Strings 5% | EasyE | Solve→ |
Check if All Characters Have Equal Number of Occurrences 5% | EasyE | Solve→ |
Find the XOR of Numbers Which Appear Twice 5% | EasyE | Solve→ |
Closest Prime Numbers in Range 5% | MediumM | Solve→ |
Minimum Amount of Time to Fill Cups 5% | EasyE | Solve→ |
Find the Number of Copy Arrays 5% | MediumM | Solve→ |
Minimum Insertions to Balance a Parentheses String 5% | MediumM | Solve→ |
Count Vowel Strings in Ranges 5% | MediumM | Solve→ |
Minimum Fuel Cost to Report to the Capital 5% | MediumM | Solve→ |
Smallest Substring With Identical Characters I 5% | HardH | Solve→ |
Split With Minimum Sum 5% | EasyE | Solve→ |
Count Pairs That Form a Complete Day II 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Movement of Robots 5% | MediumM | Solve→ |
Zero Array Transformation IV 5% | MediumM | Solve→ |
Is Object Empty 5% | EasyE | Solve→ |
Encrypt and Decrypt Strings 5% | HardH | Solve→ |
Final Array State After K Multiplication Operations I 5% | EasyE | Solve→ |
Closest Node to Path in Tree 5% | HardH | Solve→ |
Minimize Malware Spread 5% | HardH | Solve→ |
Minimum Cost to Make Arrays Identical 5% | MediumM | Solve→ |
Count Subarrays of Length Three With a Condition 5% | EasyE | Solve→ |
Prime In Diagonal 5% | EasyE | Solve→ |
Length of the Longest Valid Substring 5% | HardH | Solve→ |
Merge Operations for Minimum Travel Time 5% | HardH | Solve→ |
Find Minimum Time to Reach Last Room II 5% | MediumM | Solve→ |
Minimum Moves to Spread Stones Over Grid 5% | MediumM | Solve→ |
Total Characters in String After Transformations I 5% | MediumM | Solve→ |
Web Crawler Multithreaded 5% | MediumM | Solve→ |
Inorder Successor in BST II 5% | MediumM | Solve→ |
Find All Groups of Farmland 5% | MediumM | Solve→ |
Robot Bounded In Circle 5% | MediumM | Solve→ |
Stone Game V 5% | HardH | Solve→ |
Shift Distance Between Two Strings 5% | MediumM | Solve→ |
Maximum Length of a Concatenated String with Unique Characters 5% | MediumM | Solve→ |
Sum of Good Numbers 5% | EasyE | Solve→ |
The Maze III 5% | HardH | Solve→ |
Count the Number of Arrays with K Matching Adjacent Elements 5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Deletions to Make String K-Special 5% | MediumM | Solve→ |
Find Maximum Area of a Triangle 5% | MediumM | Solve→ |
Earliest Second to Mark Indices II 5% | HardH | Solve→ |
Maximum Product After K Increments 5% | MediumM | Solve→ |
Non-decreasing Subsequences 5% | MediumM | Solve→ |
Distribute Candies 5% | EasyE | Solve→ |
Longest Palindrome After Substring Concatenation I 5% | MediumM | Solve→ |
Split the Array 5% | EasyE | Solve→ |
Find the Kth Largest Integer in the Array 5% | MediumM | Solve→ |
Find the K-Sum of an Array 5% | HardH | Solve→ |
Minimize Maximum Component Cost 5% | MediumM | Solve→ |
Restore The Array 5% | HardH | Solve→ |
Chunk Array 5% | EasyE | Solve→ |
Count Different Palindromic Subsequences 5% | HardH | Solve→ |
Minimum Score After Removals on a Tree 5% | HardH | Solve→ |
Partition Array Into Three Parts With Equal Sum 5% | EasyE | Solve→ |
Count Islands With Total Value Divisible by K 5% | MediumM | Solve→ |
Count Prime-Gap Balanced Subarrays 5% | MediumM | Solve→ |
Increasing Decreasing String 5% | EasyE | Solve→ |
Maximum Total from Optimal Activation Order 5% | MediumM | Solve→ |
Minimum Array Sum 5% | MediumM | Solve→ |
Check If Digits Are Equal in String After Operations II 5% | HardH | Solve→ |
Solve the Equation 5% | MediumM | Solve→ |
Maximum Path Quality of a Graph 5% | HardH | Solve→ |
Map Sum Pairs 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Index Sum of Two Lists 5% | EasyE | Solve→ |
Sum of Digits in Base K 5% | EasyE | Solve→ |
Find Substring With Given Hash Value 5% | HardH | Solve→ |
Partition Array Into K-Distinct Groups 5% | MediumM | Solve→ |
Find Mirror Score of a String 5% | MediumM | Solve→ |
Reorder Data in Log Files 5% | MediumM | Solve→ |
Minimum Average of Smallest and Largest Elements 5% | EasyE | Solve→ |
Shortest Path in a Hidden Grid 5% | MediumM | Solve→ |
Sum of Beautiful Subsequences 5% | HardH | Solve→ |
Print Zero Even Odd 5% | MediumM | Solve→ |
Fill Missing Data 5% | EasyE | Solve→ |
Balanced K-Factor Decomposition 5% | MediumM | Solve→ |
Group the People Given the Group Size They Belong To 5% | MediumM | Solve→ |
Longest Palindrome After Substring Concatenation II 5% | HardH | Solve→ |
Calculate Delayed Arrival Time 5% | EasyE | Solve→ |
Maximum Xor Product 5% | MediumM | Solve→ |
Binary Tree Upside Down 5% | MediumM | Solve→ |
Split Array With Same Average 5% | HardH | Solve→ |
Sum of Perfect Square Ancestors 5% | HardH | Solve→ |
Lexicographically Smallest Permutation Greater Than Target 5% | MediumM | Solve→ |
Number of Valid Move Combinations On Chessboard 5% | HardH | Solve→ |
Find Minimum Cost to Remove Array Elements 5% | MediumM | Solve→ |
Minimum Time to Complete All Deliveries 5% | MediumM | Solve→ |
Maximum Containers on a Ship 5% | EasyE | Solve→ |
Partition Array into Disjoint Intervals 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Make Array Empty 5% | HardH | Solve→ |
Escape a Large Maze 5% | HardH | Solve→ |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts 5% | MediumM | Solve→ |
Find the Largest Almost Missing Integer 5% | EasyE | Solve→ |
Count Number of Ways to Place Houses 5% | MediumM | Solve→ |
Smallest Index With Digit Sum Equal to Index 5% | EasyE | Solve→ |
Binary Prefix Divisible By 5 5% | EasyE | Solve→ |
Strong Friendship 5% | MediumM | Solve→ |
Find Servers That Handled Most Number of Requests 5% | HardH | Solve→ |
Sum of Squares of Special Elements 5% | EasyE | Solve→ |
Maximum Value of a String in an Array 5% | EasyE | Solve→ |
Append K Integers With Minimal Sum 5% | MediumM | Solve→ |
Maximize Happiness of Selected Children 5% | MediumM | Solve→ |
Flatten Deeply Nested Array 5% | MediumM | Solve→ |
IP to CIDR 5% | MediumM | Solve→ |
Find Valid Pair of Adjacent Digits in String 5% | EasyE | Solve→ |
Memoize II 5% | HardH | Solve→ |
Minimum Deletions for At Most K Distinct Characters 5% | EasyE | Solve→ |
Sort the Matrix Diagonally 5% | MediumM | Solve→ |
Count Paths That Can Form a Palindrome in a Tree 5% | HardH | Solve→ |
Count Residue Prefixes 5% | EasyE | Solve→ |
Dinner Plate Stacks 5% | HardH | Solve→ |
As Far from Land as Possible 5% | MediumM | Solve→ |
K-Concatenation Maximum Sum 5% | MediumM | Solve→ |
Number of Orders in the Backlog 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Pair Removal to Sort Array II 5% | HardH | Solve→ |
Largest Element in an Array after Merge Operations 5% | MediumM | Solve→ |
Count Sorted Vowel Strings 5% | MediumM | Solve→ |
Minimum Cost to Convert String II 5% | HardH | Solve→ |
Partition Array to Minimize XOR 5% | MediumM | Solve→ |
Minimum K to Reduce Array Within Limit 5% | MediumM | Solve→ |
Transformed Array 5% | EasyE | Solve→ |
Longest Balanced Subarray I 5% | MediumM | Solve→ |
Longest Balanced Substring I 5% | MediumM | Solve→ |
Find the K-Beauty of a Number 5% | EasyE | Solve→ |
Minimum Amount of Time to Collect Garbage 5% | MediumM | Solve→ |
DNA Pattern Recognition 5% | MediumM | Solve→ |
Find COVID Recovery Patients 5% | MediumM | Solve→ |
Number of Subarrays With LCM Equal to K 5% | MediumM | Solve→ |
Maximum Product of Three Elements After One Replacement 5% | MediumM | Solve→ |
K Radius Subarray Averages 5% | MediumM | Solve→ |
Decrypt String from Alphabet to Integer Mapping 5% | EasyE | Solve→ |
Check if Binary String Has at Most One Segment of Ones 5% | EasyE | Solve→ |
Count Sequences to K 5% | HardH | Solve→ |
Distribute Money to Maximum Children 5% | EasyE | Solve→ |
Minimum Number of Seconds to Make Mountain Height Zero 5% | MediumM | Solve→ |
Count Unhappy Friends 5% | MediumM | Solve→ |
Convert to Base -2 5% | MediumM | Solve→ |
Construct Product Matrix 5% | MediumM | Solve→ |
Matrix Similarity After Cyclic Shifts 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Beautiful Numbers 5% | HardH | Solve→ |
Daily Leads and Partners 5% | EasyE | Solve→ |
Reachable Nodes With Restrictions 5% | MediumM | Solve→ |
Maximum Partition Factor 5% | HardH | Solve→ |
Random Pick Index 5% | MediumM | Solve→ |
Numbers At Most N Given Digit Set 5% | HardH | Solve→ |
Timeout Cancellation 5% | EasyE | Solve→ |
Valid Arrangement of Pairs 5% | HardH | Solve→ |
Minimum Distance Between Three Equal Elements I 5% | EasyE | Solve→ |
Minimum XOR Path in a Grid 5% | MediumM | Solve→ |
Minimum Distance Between Three Equal Elements II 5% | MediumM | Solve→ |
Final Array State After K Multiplication Operations II 5% | HardH | Solve→ |
Minimum Distance to the Target Element 5% | EasyE | Solve→ |
Traffic Signal Color 5% | EasyE | Solve→ |
Minimum Edge Reversals So Every Node Is Reachable 5% | HardH | Solve→ |
Count Substrings Divisible By Last Digit 5% | HardH | Solve→ |
Find the Smallest Balanced Index 5% | MediumM | Solve→ |
Maximize Sum of Squares of Digits 5% | MediumM | Solve→ |
Fizz Buzz Multithreaded 5% | MediumM | Solve→ |
Longest Balanced Substring After One Swap 5% | MediumM | Solve→ |
Count Stepping Numbers in Range 5% | HardH | Solve→ |
Monotone Increasing Digits 5% | MediumM | Solve→ |
Check if There is a Valid Path in a Grid 5% | MediumM | Solve→ |
Find the Sum of the Power of All Subsequences 5% | HardH | Solve→ |
First Unique Number 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximize Count of Distinct Primes After Split 5% | HardH | Solve→ |
Maximum Binary Tree 5% | MediumM | Solve→ |
Sales Person 5% | EasyE | Solve→ |
Count K-th Roots in a Range 5% | MediumM | Solve→ |
Shortest Path with Alternating Colors 5% | MediumM | Solve→ |
Masking Personal Information 5% | MediumM | Solve→ |
Minimum Swaps To Make Sequences Increasing 5% | HardH | Solve→ |
Digit Operations to Make Two Integers Equal 5% | MediumM | Solve→ |
Maximum of Absolute Value Expression 5% | MediumM | Solve→ |
Find Subarrays With Equal Sum 5% | EasyE | Solve→ |
Longest Palindromic Path in Graph 5% | HardH | Solve→ |
Count Good Meals 5% | MediumM | Solve→ |
Find the Peaks 5% | EasyE | Solve→ |
Get Maximum in Generated Array 5% | EasyE | Solve→ |
Maximum Total Subarray Value II 5% | HardH | Solve→ |
Shortest Cycle in a Graph 5% | HardH | Solve→ |
Maximize Sum of Device Ratings 5% | MediumM | Solve→ |
Number of Pairs of Interchangeable Rectangles 5% | MediumM | Solve→ |
Process String with Special Operations I 5% | MediumM | Solve→ |
Minimize the Difference Between Target and Chosen Elements 5% | MediumM | Solve→ |
Queens That Can Attack the King 5% | MediumM | Solve→ |
Subarrays Distinct Element Sum of Squares I 5% | EasyE | Solve→ |
Reachable Nodes In Subdivided Graph 5% | HardH | Solve→ |
Longest Substring Of All Vowels in Order 5% | MediumM | Solve→ |
Maximum Ice Cream Bars 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Number of Balloons 5% | EasyE | Solve→ |
Maximum Sum Obtained of Any Permutation 5% | MediumM | Solve→ |
Maximum Number of Occurrences of a Substring 5% | MediumM | Solve→ |
Buy Two Chocolates 5% | EasyE | Solve→ |
Dice Roll Simulation 5% | HardH | Solve→ |
Average Value of Even Numbers That Are Divisible by Three 5% | EasyE | Solve→ |
Minimum Number of Moves to Seat Everyone 5% | EasyE | Solve→ |
Design Front Middle Back Queue 5% | MediumM | Solve→ |
The Dining Philosophers 5% | MediumM | Solve→ |
Memoize 5% | MediumM | Solve→ |
Odd and Even Transactions 5% | MediumM | Solve→ |
Array Nesting 5% | MediumM | Solve→ |
Binary Tree Pruning 5% | MediumM | Solve→ |
Maximum Subarray Sum After Multiplier 5% | MediumM | Solve→ |
Design Memory Allocator 5% | MediumM | Solve→ |
Restore Finishing Order 5% | EasyE | Solve→ |
Decode XORed Array 5% | EasyE | Solve→ |
Minimum Cost for Cutting Cake II 5% | HardH | Solve→ |
Find Maximum Non-decreasing Array Length 5% | HardH | Solve→ |
Maximum Walls Destroyed by Robots 5% | HardH | Solve→ |
Last Substring in Lexicographical Order 5% | HardH | Solve→ |
Rearrange Words in a Sentence 5% | MediumM | Solve→ |
Count of Substrings Containing Every Vowel and K Consonants I 5% | MediumM | Solve→ |
Remove Palindromic Subsequences 5% | EasyE | Solve→ |
Minimum Number of Coins to be Added 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rectangle Overlap 5% | EasyE | Solve→ |
Course Schedule III 5% | HardH | Solve→ |
Maximum Sum of Two Non-Overlapping Subarrays 5% | MediumM | Solve→ |
Minimum Number of Pushes to Type Word II 5% | MediumM | Solve→ |
Remove One Element to Make the Array Strictly Increasing 5% | EasyE | Solve→ |
Largest Palindrome Product 5% | HardH | Solve→ |
Longest Well-Performing Interval 5% | MediumM | Solve→ |
Remove Methods From Project 5% | MediumM | Solve→ |
Evaluate Valid Expressions 5% | HardH | Solve→ |
Make Array Zero by Subtracting Equal Amounts 5% | EasyE | Solve→ |
Jump Game III 5% | MediumM | Solve→ |
Sort Integers by Binary Reflection 5% | EasyE | Solve→ |
Subsequence After One Replacement 5% | MediumM | Solve→ |
Kth Distinct String in an Array 5% | EasyE | Solve→ |
Employees With Missing Information 5% | EasyE | Solve→ |
Number of Distinct Averages 5% | EasyE | Solve→ |
Count Number of Rectangles Containing Each Point 5% | MediumM | Solve→ |
H-Index II 5% | MediumM | Solve→ |
Minimum Operations to Make Array Equal to Target 5% | HardH | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Google?
Our current Google practice dataset contains 2344 tagged coding problems, including Two Sum, Add Two Numbers, Median of Two Sorted Arrays. The difficulty breakdown is 616 Easy, 1223 Medium, and 505 Hard problems.
How should I prepare for a Google coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Google interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Google coding interviews?
Based on our data, Google interviews include 616 Easy (26%), 1223 Medium (52%), and 505 Hard (22%) problems.
Ready to ace your Google interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required