Amazon LeetCode Interview Questions
Practice 2011 coding problems currently tagged to Amazon. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
536 Easy
1087 Medium
388 Hard
Top Topics at Amazon
Ace your Amazon interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Amazon Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Two Sum 100% | EasyE | Solve→ |
LRU Cache 88.5% | MediumM | Solve→ |
Trapping Rain Water 88% | HardH | Solve→ |
Number of Islands 85.6% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 84.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 83.8% | EasyE | Solve→ |
Group Anagrams 80.6% | MediumM | Solve→ |
Add Two Numbers 79.7% | MediumM | Solve→ |
Longest Palindromic Substring 78.5% | MediumM | Solve→ |
3Sum 78.3% | MediumM | Solve→ |
Reorganize String 78.3% | MediumM | Solve→ |
Median of Two Sorted Arrays 76.8% | HardH | Solve→ |
Container With Most Water 76.7% | MediumM | Solve→ |
Merge Intervals 76.6% | MediumM | Solve→ |
Course Schedule 75% | MediumM | Solve→ |
Koko Eating Bananas 74.9% | MediumM | Solve→ |
Valid Parentheses 74.4% | EasyE | Solve→ |
Merge k Sorted Lists 73.9% | HardH | Solve→ |
Rotting Oranges 73.9% | MediumM | Solve→ |
Longest Common Prefix 73% | EasyE | Solve→ |
Subarray Sum Equals K 72.9% | MediumM | Solve→ |
Maximum Subarray 72% | MediumM | Solve→ |
Top K Frequent Elements 71.7% | MediumM | Solve→ |
Search in Rotated Sorted Array 71.6% | MediumM | Solve→ |
Merge Sorted Array 70.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Palindrome Number 70.8% | EasyE | Solve→ |
Longest Consecutive Sequence 70.7% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 69.9% | MediumM | Solve→ |
Copy List with Random Pointer 69.8% | MediumM | Solve→ |
Majority Element 69.6% | EasyE | Solve→ |
Generate Parentheses 69.1% | MediumM | Solve→ |
Word Ladder 68.3% | HardH | Solve→ |
Jump Game 67.9% | MediumM | Solve→ |
Product of Array Except Self 67.5% | MediumM | Solve→ |
House Robber 67.3% | MediumM | Solve→ |
Climbing Stairs 67% | EasyE | Solve→ |
Letter Combinations of a Phone Number 66.9% | MediumM | Solve→ |
Merge Two Sorted Lists 66.7% | EasyE | Solve→ |
Course Schedule II 65.8% | MediumM | Solve→ |
Sliding Window Maximum 65.6% | HardH | Solve→ |
Spiral Matrix 65.3% | MediumM | Solve→ |
Word Search 65.3% | MediumM | Solve→ |
Valid Anagram 64.3% | EasyE | Solve→ |
Subsets 64% | MediumM | Solve→ |
Remove Duplicates from Sorted Array 63.6% | EasyE | Solve→ |
Fruit Into Baskets 63.6% | MediumM | Solve→ |
Rotate Image 63.5% | MediumM | Solve→ |
Next Permutation 63.3% | MediumM | Solve→ |
Find Median from Data Stream 63.1% | HardH | Solve→ |
Coin Change 63.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Task Scheduler 63.1% | MediumM | Solve→ |
Analyze User Website Visit Pattern 62.6% | MediumM | Solve→ |
Reverse Integer 62.3% | MediumM | Solve→ |
Kth Largest Element in an Array 62.1% | MediumM | Solve→ |
Minimum Window Substring 61.7% | HardH | Solve→ |
Meeting Rooms II 61.6% | MediumM | Solve→ |
First Missing Positive 61.4% | HardH | Solve→ |
Unique Paths 61.4% | MediumM | Solve→ |
Sort Colors 61.4% | MediumM | Solve→ |
Roman to Integer 61.2% | EasyE | Solve→ |
Find First and Last Position of Element in Sorted Array 60.8% | MediumM | Solve→ |
Pascal's Triangle 60.6% | EasyE | Solve→ |
Insert Delete GetRandom O(1) 60.6% | MediumM | Solve→ |
Largest Rectangle in Histogram 60.4% | HardH | Solve→ |
Find Peak Element 60.4% | MediumM | Solve→ |
Asteroid Collision 60.4% | MediumM | Solve→ |
N-Queens 60.2% | HardH | Solve→ |
Word Break 60.2% | MediumM | Solve→ |
Move Zeroes 60% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 59.8% | HardH | Solve→ |
Longest Repeating Character Replacement 59.8% | MediumM | Solve→ |
Merge Strings Alternately 59.6% | EasyE | Solve→ |
4Sum 59.4% | MediumM | Solve→ |
Jump Game II 59.4% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 59.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rotate Array 59% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 58.8% | MediumM | Solve→ |
Identify the Largest Outlier in an Array 58.8% | MediumM | Solve→ |
Single Number 58.6% | EasyE | Solve→ |
Min Stack 58.6% | MediumM | Solve→ |
Create Hello World Function 58.6% | EasyE | Solve→ |
Valid Sudoku 58.1% | MediumM | Solve→ |
Reverse Linked List 58.1% | EasyE | Solve→ |
Single Element in a Sorted Array 57.9% | MediumM | Solve→ |
Search a 2D Matrix 57.7% | MediumM | Solve→ |
Contains Duplicate 57.5% | EasyE | Solve→ |
Palindrome Linked List 57.2% | EasyE | Solve→ |
Zigzag Conversion 57% | MediumM | Solve→ |
Sqrt(x) 57% | EasyE | Solve→ |
Binary Tree Right Side View 57% | MediumM | Solve→ |
Daily Temperatures 57% | MediumM | Solve→ |
Recyclable and Low Fat Products 57% | EasyE | Solve→ |
Remove Element 56.5% | EasyE | Solve→ |
Search Insert Position 56.5% | EasyE | Solve→ |
Permutations 56.5% | MediumM | Solve→ |
Serialize and Deserialize Binary Tree 56.5% | HardH | Solve→ |
All Nodes Distance K in Binary Tree 56.5% | MediumM | Solve→ |
Reverse Nodes in k-Group 56% | HardH | Solve→ |
Max Consecutive Ones III 56% | MediumM | Solve→ |
Find the Duplicate Number 55.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Set Matrix Zeroes 55.5% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 55.5% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 55.5% | MediumM | Solve→ |
LFU Cache 55.5% | HardH | Solve→ |
First Unique Character in a String 55.2% | EasyE | Solve→ |
Find the Index of the First Occurrence in a String 55% | EasyE | Solve→ |
String Compression 55% | MediumM | Solve→ |
Next Greater Element I 54.7% | EasyE | Solve→ |
Binary Tree Level Order Traversal 54.4% | MediumM | Solve→ |
Missing Number 54.4% | EasyE | Solve→ |
Reorder List 54.1% | MediumM | Solve→ |
Next Greater Element II 54.1% | MediumM | Solve→ |
String to Integer (atoi) 53.8% | MediumM | Solve→ |
Gas Station 53.8% | MediumM | Solve→ |
Maximum Product Subarray 53.8% | MediumM | Solve→ |
Regular Expression Matching 53.6% | HardH | Solve→ |
Pow(x, n) 53.6% | MediumM | Solve→ |
Valid Palindrome 53.6% | EasyE | Solve→ |
Word Search II 53.6% | HardH | Solve→ |
Candy 53.3% | HardH | Solve→ |
Odd Even Linked List 53.3% | MediumM | Solve→ |
Concatenated Words 53% | HardH | Solve→ |
Flood Fill 53% | EasyE | Solve→ |
Remove Nth Node From End of List 52.7% | MediumM | Solve→ |
Combination Sum 52.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Edit Distance 52.7% | MediumM | Solve→ |
Longest Increasing Subsequence 52.7% | MediumM | Solve→ |
Integer to Roman 52.4% | MediumM | Solve→ |
Validate Binary Search Tree 52.4% | MediumM | Solve→ |
Split Array Largest Sum 52.4% | HardH | Solve→ |
Diameter of Binary Tree 52.4% | EasyE | Solve→ |
Partition Equal Subset Sum 52% | MediumM | Solve→ |
Basic Calculator 51.7% | HardH | Solve→ |
3Sum Closest 51.4% | MediumM | Solve→ |
Linked List Cycle 51.4% | EasyE | Solve→ |
Largest Number 51.4% | MediumM | Solve→ |
Max Consecutive Ones 51.4% | EasyE | Solve→ |
Middle of the Linked List 51.4% | EasyE | Solve→ |
Maximum Profit in Job Scheduling 51.4% | HardH | Solve→ |
Reverse Words in a String 51.1% | MediumM | Solve→ |
Combine Two Tables 51.1% | EasyE | Solve→ |
Intersection of Two Arrays 51.1% | EasyE | Solve→ |
Fibonacci Number 51.1% | EasyE | Solve→ |
Word Break II 50.7% | HardH | Solve→ |
Happy Number 50.7% | EasyE | Solve→ |
Search a 2D Matrix II 50.7% | MediumM | Solve→ |
Number of Provinces 50.7% | MediumM | Solve→ |
Sum of Subarray Minimums 50.7% | MediumM | Solve→ |
Plus One 50.4% | EasyE | Solve→ |
Add Binary 50.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Palindrome Partitioning 50.4% | MediumM | Solve→ |
Longest Valid Parentheses 50% | HardH | Solve→ |
Rotate List 50% | MediumM | Solve→ |
Balanced Binary Tree 50% | EasyE | Solve→ |
Basic Calculator II 50% | MediumM | Solve→ |
Evaluate Division 50% | MediumM | Solve→ |
Decode String 49.7% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 49.7% | EasyE | Solve→ |
Contains Duplicate II 49.3% | EasyE | Solve→ |
Remove Duplicates from Sorted Array II 48.9% | MediumM | Solve→ |
Minimum Size Subarray Sum 48.9% | MediumM | Solve→ |
Maximum Frequency After Subarray Operation 48.9% | MediumM | Solve→ |
Sudoku Solver 48.5% | HardH | Solve→ |
Integer to English Words 48.5% | HardH | Solve→ |
Concatenation of Array 48.5% | EasyE | Solve→ |
Same Tree 48.1% | EasyE | Solve→ |
Permutation in String 48.1% | MediumM | Solve→ |
Rotate String 48.1% | EasyE | Solve→ |
Second Highest Salary 47.7% | MediumM | Solve→ |
Time Based Key-Value Store 47.7% | MediumM | Solve→ |
Plates Between Candles 47.7% | MediumM | Solve→ |
Symmetric Tree 47.3% | EasyE | Solve→ |
Find Minimum in Rotated Sorted Array 47.3% | MediumM | Solve→ |
Isomorphic Strings 47.3% | EasyE | Solve→ |
K Closest Points to Origin 47.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Vertical Order Traversal of a Binary Tree 47.3% | HardH | Solve→ |
Maximum Coins From K Consecutive Bags 47.3% | MediumM | Solve→ |
Maximum Depth of Binary Tree 46.9% | EasyE | Solve→ |
Surrounded Regions 46.9% | MediumM | Solve→ |
Evaluate Reverse Polish Notation 46.9% | MediumM | Solve→ |
Count Primes 46.9% | MediumM | Solve→ |
Article Views I 46.5% | EasyE | Solve→ |
Search Suggestions System 46.5% | MediumM | Solve→ |
Make Array Zero by Subtracting Equal Amounts 46.5% | EasyE | Solve→ |
Sort List 46% | MediumM | Solve→ |
Intersection of Two Linked Lists 46% | EasyE | Solve→ |
Find All Anagrams in a String 46% | MediumM | Solve→ |
Peak Index in a Mountain Array 46% | MediumM | Solve→ |
Subarrays with K Different Integers 46% | HardH | Solve→ |
Reverse String 45.6% | EasyE | Solve→ |
Pacific Atlantic Water Flow 45.6% | MediumM | Solve→ |
Maximum Width of Binary Tree 45.6% | MediumM | Solve→ |
Random Pick with Weight 45.6% | MediumM | Solve→ |
Maximal Rectangle 45.1% | HardH | Solve→ |
Reverse Linked List II 45.1% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Inorder Traversal 45.1% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 45.1% | MediumM | Solve→ |
Kth Smallest Element in a BST 45.1% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 45.1% | MediumM | Solve→ |
Find K Closest Elements 45.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Path Sum 44.6% | MediumM | Solve→ |
Employees Earning More Than Their Managers 44.6% | EasyE | Solve→ |
House Robber III 44.6% | MediumM | Solve→ |
Reverse Pairs 44.6% | HardH | Solve→ |
Online Stock Span 44.6% | MediumM | Solve→ |
Squares of a Sorted Array 44.6% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree III 44.6% | MediumM | Solve→ |
Frequency of the Most Frequent Element 44.6% | MediumM | Solve→ |
Rearrange Array Elements by Sign 44.6% | MediumM | Solve→ |
Minimum Time to Complete All Deliveries 44.6% | MediumM | Solve→ |
Divide Two Integers 44.1% | MediumM | Solve→ |
Simplify Path 44.1% | MediumM | Solve→ |
Word Ladder II 44.1% | HardH | Solve→ |
Target Sum 44.1% | MediumM | Solve→ |
Contiguous Array 44.1% | MediumM | Solve→ |
Cheapest Flights Within K Stops 44.1% | MediumM | Solve→ |
Length of Last Word 43.6% | EasyE | Solve→ |
Linked List Cycle II 43.6% | MediumM | Solve→ |
Top K Frequent Words 43.6% | MediumM | Solve→ |
Binary Search 43.6% | EasyE | Solve→ |
The kth Factor of n 43.6% | MediumM | Solve→ |
Minimum Health to Beat Game 43.6% | MediumM | Solve→ |
Remove Duplicates from Sorted List 43.1% | EasyE | Solve→ |
Subsets II 43.1% | MediumM | Solve→ |
Non-overlapping Intervals 43.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Min Cost Climbing Stairs 43.1% | EasyE | Solve→ |
Majority Element II 42.5% | MediumM | Solve→ |
Managers with at Least 5 Direct Reports 42.5% | MediumM | Solve→ |
Maximum Average Subarray I 42.5% | EasyE | Solve→ |
Valid Palindrome II 42.5% | EasyE | Solve→ |
Running Sum of 1d Array 42.5% | EasyE | Solve→ |
Minimum Number of Days to Make m Bouquets 42.5% | MediumM | Solve→ |
Average Time of Process per Machine 42.5% | EasyE | Solve→ |
Power of Two 42% | EasyE | Solve→ |
Remove K Digits 42% | MediumM | Solve→ |
Fizz Buzz 42% | EasyE | Solve→ |
Accounts Merge 42% | MediumM | Solve→ |
Boats to Save People 42% | MediumM | Solve→ |
Rising Temperature 41.4% | EasyE | Solve→ |
Invert Binary Tree 41.4% | EasyE | Solve→ |
Is Subsequence 41.4% | EasyE | Solve→ |
Sort Characters By Frequency 41.4% | MediumM | Solve→ |
Set Mismatch 41.4% | EasyE | Solve→ |
Open the Lock 41.4% | MediumM | Solve→ |
Partition Labels 41.4% | MediumM | Solve→ |
Snakes and Ladders 41.4% | MediumM | Solve→ |
Design Parking System 41.4% | EasyE | Solve→ |
Add Two Integers 41.4% | EasyE | Solve→ |
Swap Nodes in Pairs 40.8% | MediumM | Solve→ |
Count and Say 40.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Unique Paths II 40.8% | MediumM | Solve→ |
Search in Rotated Sorted Array II 40.8% | MediumM | Solve→ |
Binary Tree Inorder Traversal 40.8% | EasyE | Solve→ |
House Robber II 40.8% | MediumM | Solve→ |
Trapping Rain Water II 40.8% | HardH | Solve→ |
Kth Largest Element in a Stream 40.8% | EasyE | Solve→ |
Maximum Points You Can Obtain from Cards 40.8% | MediumM | Solve→ |
Kth Missing Positive Number 40.8% | EasyE | Solve→ |
Furthest Building You Can Reach 40.8% | MediumM | Solve→ |
Find Triangular Sum of an Array 40.8% | MediumM | Solve→ |
Ransom Note 40.2% | EasyE | Solve→ |
Assign Cookies 40.2% | EasyE | Solve→ |
01 Matrix 40.2% | MediumM | Solve→ |
Exclusive Time of Functions 40.2% | MediumM | Solve→ |
Max Area of Island 40.2% | MediumM | Solve→ |
Critical Connections in a Network 40.2% | HardH | Solve→ |
Sum of Total Strength of Wizards 40.2% | HardH | Solve→ |
Clone Graph 39.5% | MediumM | Solve→ |
Design Twitter 39.5% | MediumM | Solve→ |
Big Countries 39.5% | EasyE | Solve→ |
Smallest Range Covering Elements from K Lists 39.5% | HardH | Solve→ |
Palindromic Substrings 39.5% | MediumM | Solve→ |
Making A Large Island 39.5% | HardH | Solve→ |
Monthly Transactions I 39.5% | MediumM | Solve→ |
Average Selling Price 39.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum of Subarray Ranges 39.5% | MediumM | Solve→ |
Wildcard Matching 38.9% | HardH | Solve→ |
Decode Ways 38.9% | MediumM | Solve→ |
Recover Binary Search Tree 38.9% | MediumM | Solve→ |
Convert Sorted Array to Binary Search Tree 38.9% | EasyE | Solve→ |
Implement Queue using Stacks 38.9% | EasyE | Solve→ |
Delete Node in a Linked List 38.9% | MediumM | Solve→ |
First Bad Version 38.9% | EasyE | Solve→ |
Reverse Vowels of a String 38.9% | EasyE | Solve→ |
Delete Node in a BST 38.9% | MediumM | Solve→ |
Design HashMap 38.9% | EasyE | Solve→ |
Maximum Width Ramp 38.9% | MediumM | Solve→ |
Kids With the Greatest Number of Candies 38.9% | EasyE | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 38.9% | MediumM | Solve→ |
Count Good Numbers 38.9% | MediumM | Solve→ |
Minimum Operations to Make Array Non Decreasing 38.9% | MediumM | Solve→ |
Substring with Concatenation of All Words 38.2% | HardH | Solve→ |
Partition List 38.2% | MediumM | Solve→ |
Implement Trie (Prefix Tree) 38.2% | MediumM | Solve→ |
Alien Dictionary 38.2% | HardH | Solve→ |
Design Tic-Tac-Toe 38.2% | MediumM | Solve→ |
Russian Doll Envelopes 38.2% | HardH | Solve→ |
Find K Pairs with Smallest Sums 38.2% | MediumM | Solve→ |
Longest Palindromic Subsequence 38.2% | MediumM | Solve→ |
Coin Change II 38.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Customer Referee 38.2% | EasyE | Solve→ |
Valid Parenthesis String 38.2% | MediumM | Solve→ |
Subarray Product Less Than K 38.2% | MediumM | Solve→ |
Design Circular Queue 38.2% | MediumM | Solve→ |
Sort an Array 38.2% | MediumM | Solve→ |
Product Sales Analysis III 38.2% | MediumM | Solve→ |
Shortest Path in Binary Matrix 38.2% | MediumM | Solve→ |
Amount of Time for Binary Tree to Be Infected 38.2% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 38.2% | MediumM | Solve→ |
Insert Interval 37.4% | MediumM | Solve→ |
Triangle 37.4% | MediumM | Solve→ |
Can Place Flowers 37.4% | EasyE | Solve→ |
Construct Binary Search Tree from Preorder Traversal 37.4% | MediumM | Solve→ |
Greatest Common Divisor of Strings 37.4% | EasyE | Solve→ |
Longest Common Subsequence 37.4% | MediumM | Solve→ |
Unique Number of Occurrences 37.4% | EasyE | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 37.4% | MediumM | Solve→ |
Find Missing and Repeated Values 37.4% | EasyE | Solve→ |
Minimum Difference in Sums After Removal of Elements 37.4% | HardH | Solve→ |
Maximum K to Sort a Permutation 37.4% | MediumM | Solve→ |
Lexicographically Smallest Negated Permutation that Sums to Target 37.4% | MediumM | Solve→ |
Interleaving String 36.7% | MediumM | Solve→ |
Maximal Square 36.7% | MediumM | Solve→ |
Add Digits 36.7% | EasyE | Solve→ |
Range Sum Query - Immutable 36.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Predict the Winner 36.7% | MediumM | Solve→ |
Design In-Memory File System 36.7% | HardH | Solve→ |
Bus Routes 36.7% | HardH | Solve→ |
Maximum Units on a Truck 36.7% | EasyE | Solve→ |
Distinct Subsequences 35.9% | HardH | Solve→ |
Single Number II 35.9% | MediumM | Solve→ |
Implement Stack using Queues 35.9% | EasyE | Solve→ |
Burst Balloons 35.9% | HardH | Solve→ |
Diagonal Traverse 35.9% | MediumM | Solve→ |
Number of Distinct Islands 35.9% | MediumM | Solve→ |
Count Binary Substrings 35.9% | EasyE | Solve→ |
Find Pivot Index 35.9% | EasyE | Solve→ |
First Unique Number 35.9% | MediumM | Solve→ |
Process String with Special Operations I 35.9% | MediumM | Solve→ |
Permutation Sequence 35.1% | HardH | Solve→ |
Text Justification 35.1% | HardH | Solve→ |
Flatten Binary Tree to Linked List 35.1% | MediumM | Solve→ |
Department Top Three Salaries 35.1% | HardH | Solve→ |
Design Add and Search Words Data Structure 35.1% | MediumM | Solve→ |
Increasing Triplet Subsequence 35.1% | MediumM | Solve→ |
Sum of Two Integers 35.1% | MediumM | Solve→ |
Find Eventual Safe States 35.1% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 35.1% | MediumM | Solve→ |
Binary Tree Cameras 35.1% | HardH | Solve→ |
Smallest Subsequence of Distinct Characters 35.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove All Adjacent Duplicates in String II 35.1% | MediumM | Solve→ |
Find the Smallest Divisor Given a Threshold 35.1% | MediumM | Solve→ |
Maximum Sum BST in Binary Tree 35.1% | HardH | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 35.1% | EasyE | Solve→ |
Confirmation Rate 35.1% | MediumM | Solve→ |
Apply Discount to Prices 35.1% | MediumM | Solve→ |
Find the Number of Possible Ways for an Event 35.1% | HardH | Solve→ |
Minimum Number of Primes to Sum to Target 35.1% | MediumM | Solve→ |
Permutations II 34.2% | MediumM | Solve→ |
Remove Duplicate Letters 34.2% | MediumM | Solve→ |
Number of Connected Components in an Undirected Graph 34.2% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 34.2% | MediumM | Solve→ |
Repeated Substring Pattern 34.2% | EasyE | Solve→ |
Swapping Nodes in a Linked List 34.2% | MediumM | Solve→ |
Two Sum IV - Input is a BST 34.2% | EasyE | Solve→ |
Is Graph Bipartite? 34.2% | MediumM | Solve→ |
Minimum Falling Path Sum 34.2% | MediumM | Solve→ |
Remove All Adjacent Duplicates In String 34.2% | EasyE | Solve→ |
Students and Examinations 34.2% | EasyE | Solve→ |
Maximum Number of Events That Can Be Attended 34.2% | MediumM | Solve→ |
Replace Employee ID With The Unique Identifier 34.2% | EasyE | Solve→ |
Count Square Submatrices with All Ones 34.2% | MediumM | Solve→ |
Combination Sum II 33.3% | MediumM | Solve→ |
Multiply Strings 33.3% | MediumM | Solve→ |
Spiral Matrix II 33.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Combinations 33.3% | MediumM | Solve→ |
Compare Version Numbers 33.3% | MediumM | Solve→ |
Excel Sheet Column Title 33.3% | EasyE | Solve→ |
Rank Scores 33.3% | MediumM | Solve→ |
Consecutive Numbers 33.3% | MediumM | Solve→ |
Duplicate Emails 33.3% | EasyE | Solve→ |
Remove Linked List Elements 33.3% | EasyE | Solve→ |
Reconstruct Itinerary 33.3% | HardH | Solve→ |
Frog Jump 33.3% | HardH | Solve→ |
Path Sum III 33.3% | MediumM | Solve→ |
Find All Numbers Disappeared in an Array 33.3% | EasyE | Solve→ |
Employee Bonus 33.3% | EasyE | Solve→ |
Jewels and Stones 33.3% | EasyE | Solve→ |
Immediate Food Delivery II 33.3% | MediumM | Solve→ |
Magnetic Force Between Two Balls 33.3% | MediumM | Solve→ |
Put Marbles in Bags 33.3% | HardH | Solve→ |
Most Expensive Item That Can Not Be Bought 33.3% | MediumM | Solve→ |
Find Longest Self-Contained Substring 33.3% | HardH | Solve→ |
Gray Code 32.3% | MediumM | Solve→ |
Best Time to Buy and Sell Stock III 32.3% | HardH | Solve→ |
Different Ways to Add Parentheses 32.3% | MediumM | Solve→ |
H-Index 32.3% | MediumM | Solve→ |
Find the Difference 32.3% | EasyE | Solve→ |
Third Maximum Number 32.3% | EasyE | Solve→ |
Add Strings 32.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Next Greater Element III 32.3% | MediumM | Solve→ |
Domino and Tromino Tiling 32.3% | MediumM | Solve→ |
Minimum Number of Refueling Stops 32.3% | HardH | Solve→ |
Reorder Data in Log Files 32.3% | MediumM | Solve→ |
Customers Who Bought All Products 32.3% | MediumM | Solve→ |
Shuffle the Array 32.3% | EasyE | Solve→ |
Partition Array According to Given Pivot 32.3% | MediumM | Solve→ |
Removing Stars From a String 32.3% | MediumM | Solve→ |
Create a DataFrame from List 32.3% | EasyE | Solve→ |
Maximum Number of Groups With Increasing Length 32.3% | HardH | Solve→ |
Sell Diminishing-Valued Colored Balls 32.3% | MediumM | Solve→ |
Longest Arithmetic Sequence After Changing At Most One Element 32.3% | MediumM | Solve→ |
Path Sum II 31.3% | MediumM | Solve→ |
Dungeon Game 31.3% | HardH | Solve→ |
Nth Highest Salary 31.3% | MediumM | Solve→ |
Reverse Bits 31.3% | EasyE | Solve→ |
Longest Substring with At Least K Repeating Characters 31.3% | MediumM | Solve→ |
Rotate Function 31.3% | MediumM | Solve→ |
132 Pattern 31.3% | MediumM | Solve→ |
Boundary of Binary Tree 31.3% | MediumM | Solve→ |
Maximum Sum Circular Subarray 31.3% | MediumM | Solve→ |
Binary Subarrays With Sum 31.3% | MediumM | Solve→ |
Remove Outermost Parentheses 31.3% | EasyE | Solve→ |
Binary Search Tree to Greater Sum Tree 31.3% | MediumM | Solve→ |
Angle Between Hands of a Clock 31.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Cost to Cut a Stick 31.3% | HardH | Solve→ |
Substring With Largest Variance 31.3% | HardH | Solve→ |
Make String a Subsequence Using Cyclic Increments 31.3% | MediumM | Solve→ |
Length of Longest V-Shaped Diagonal Segment 31.3% | HardH | Solve→ |
Count Bowl Subarrays 31.3% | MediumM | Solve→ |
Unique Binary Search Trees 30.2% | MediumM | Solve→ |
Path Sum 30.2% | EasyE | Solve→ |
Binary Search Tree Iterator 30.2% | MediumM | Solve→ |
Customers Who Never Order 30.2% | EasyE | Solve→ |
Repeated DNA Sequences 30.2% | MediumM | Solve→ |
Summary Ranges 30.2% | EasyE | Solve→ |
Find All Duplicates in an Array 30.2% | MediumM | Solve→ |
Array Partition 30.2% | EasyE | Solve→ |
Merge Two Binary Trees 30.2% | EasyE | Solve→ |
Maximum Product of Three Numbers 30.2% | EasyE | Solve→ |
Flatten a Multilevel Doubly Linked List 30.2% | MediumM | Solve→ |
Custom Sort String 30.2% | MediumM | Solve→ |
Car Fleet 30.2% | MediumM | Solve→ |
Flip String to Monotone Increasing 30.2% | MediumM | Solve→ |
Subarray Sums Divisible by K 30.2% | MediumM | Solve→ |
Product Sales Analysis I 30.2% | EasyE | Solve→ |
Replace Elements with Greatest Element on Right Side 30.2% | EasyE | Solve→ |
Make Sum Divisible by P 30.2% | MediumM | Solve→ |
Sum of Beauty of All Substrings 30.2% | MediumM | Solve→ |
Maximum Average Pass Ratio 30.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find if Path Exists in Graph 30.2% | EasyE | Solve→ |
Partition Array Into Two Arrays to Minimize Sum Difference 30.2% | HardH | Solve→ |
Using a Robot to Print the Lexicographically Smallest String 30.2% | MediumM | Solve→ |
Distribute Candies Among Children II 30.2% | MediumM | Solve→ |
Restore IP Addresses 29.1% | MediumM | Solve→ |
Number of 1 Bits 29.1% | EasyE | Solve→ |
All O`one Data Structure 29.1% | HardH | Solve→ |
Reverse Words in a String III 29.1% | EasyE | Solve→ |
Image Smoother 29.1% | EasyE | Solve→ |
Split Linked List in Parts 29.1% | MediumM | Solve→ |
Swim in Rising Water 29.1% | HardH | Solve→ |
Keys and Rooms 29.1% | MediumM | Solve→ |
Lemonade Change 29.1% | EasyE | Solve→ |
Shortest Subarray with Sum at Least K 29.1% | HardH | Solve→ |
Most Stones Removed with Same Row or Column 29.1% | MediumM | Solve→ |
Interval List Intersections 29.1% | MediumM | Solve→ |
Shortest Common Supersequence 29.1% | HardH | Solve→ |
Number of Equivalent Domino Pairs 29.1% | EasyE | Solve→ |
Product Price at a Given Date 29.1% | MediumM | Solve→ |
Count Negative Numbers in a Sorted Matrix 29.1% | EasyE | Solve→ |
Design Browser History 29.1% | MediumM | Solve→ |
Path Crossing 29.1% | EasyE | Solve→ |
Min Cost to Connect All Points 29.1% | MediumM | Solve→ |
Number of Students Unable to Eat Lunch 29.1% | EasyE | Solve→ |
Sum of All Subset XOR Totals 29.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find All Possible Recipes from Given Supplies 29.1% | MediumM | Solve→ |
Count Number of Rectangles Containing Each Point 29.1% | MediumM | Solve→ |
Best Poker Hand 29.1% | EasyE | Solve→ |
Max Sum of a Pair With Equal Sum of Digits 29.1% | MediumM | Solve→ |
Meeting Rooms III 29.1% | HardH | Solve→ |
Maximum Number of Books You Can Take 29.1% | HardH | Solve→ |
Kth Largest Sum in a Binary Tree 29.1% | MediumM | Solve→ |
Row With Maximum Ones 29.1% | EasyE | Solve→ |
Maximum Sum With at Most K Elements 29.1% | MediumM | Solve→ |
Minimum Operations to Make the Array Alternating 29.1% | MediumM | Solve→ |
Count Subarrays With Median K 29.1% | HardH | Solve→ |
Minimum Swaps to Avoid Forbidden Values 29.1% | HardH | Solve→ |
Divide an Array Into Subarrays With Minimum Cost I 29.1% | EasyE | Solve→ |
Sum of GCD of Formed Pairs 29.1% | MediumM | Solve→ |
N-Queens II 27.8% | HardH | Solve→ |
Pascal's Triangle II 27.8% | EasyE | Solve→ |
Palindrome Partitioning II 27.8% | HardH | Solve→ |
Department Highest Salary 27.8% | MediumM | Solve→ |
Shortest Palindrome 27.8% | HardH | Solve→ |
Combination Sum III 27.8% | MediumM | Solve→ |
Meeting Rooms 27.8% | EasyE | Solve→ |
Find the Celebrity 27.8% | MediumM | Solve→ |
Bulb Switcher 27.8% | MediumM | Solve→ |
Flatten Nested List Iterator 27.8% | MediumM | Solve→ |
Arranging Coins 27.8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Heaters 27.8% | MediumM | Solve→ |
IPO 27.8% | HardH | Solve→ |
Super Washing Machines 27.8% | HardH | Solve→ |
Subtree of Another Tree 27.8% | EasyE | Solve→ |
Maximum Length of Pair Chain 27.8% | MediumM | Solve→ |
Baseball Game 27.8% | EasyE | Solve→ |
Redundant Connection 27.8% | MediumM | Solve→ |
Partition to K Equal Sum Subsets 27.8% | MediumM | Solve→ |
Backspace String Compare 27.8% | EasyE | Solve→ |
Number of Recent Calls 27.8% | EasyE | Solve→ |
Minimum Cost For Tickets 27.8% | MediumM | Solve→ |
Recover a Tree From Preorder Traversal 27.8% | HardH | Solve→ |
Last Stone Weight 27.8% | EasyE | Solve→ |
Remove Covered Intervals 27.8% | MediumM | Solve→ |
Balance a Binary Search Tree 27.8% | MediumM | Solve→ |
Shortest Path in a Grid with Obstacles Elimination 27.8% | HardH | Solve→ |
Number of Operations to Make Network Connected 27.8% | MediumM | Solve→ |
How Many Numbers Are Smaller Than the Current Number 27.8% | EasyE | Solve→ |
Allocate Mailboxes 27.8% | HardH | Solve→ |
Design an Expression Tree With Evaluate Function 27.8% | MediumM | Solve→ |
Maximum Erasure Value 27.8% | MediumM | Solve→ |
Find the Highest Altitude 27.8% | EasyE | Solve→ |
The Number of the Smallest Unoccupied Chair 27.8% | MediumM | Solve→ |
Partition Array Such That Maximum Difference Is K 27.8% | MediumM | Solve→ |
Count Unreachable Pairs of Nodes in an Undirected Graph 27.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Move Pieces to Obtain a String 27.8% | MediumM | Solve→ |
Construct Smallest Number From DI String 27.8% | MediumM | Solve→ |
Strictly Palindromic Number 27.8% | MediumM | Solve→ |
Count Zero Request Servers 27.8% | MediumM | Solve→ |
Count Covered Buildings 27.8% | MediumM | Solve→ |
Valid Number 26.5% | HardH | Solve→ |
Sum Root to Leaf Numbers 26.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock IV 26.5% | HardH | Solve→ |
Single Number III 26.5% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 26.5% | MediumM | Solve→ |
Logger Rate Limiter 26.5% | EasyE | Solve→ |
Design Hit Counter 26.5% | MediumM | Solve→ |
Lexicographical Numbers 26.5% | MediumM | Solve→ |
Battleships in a Board 26.5% | MediumM | Solve→ |
Most Frequent Subtree Sum 26.5% | MediumM | Solve→ |
Continuous Subarray Sum 26.5% | MediumM | Solve→ |
Triangle Judgement 26.5% | EasyE | Solve→ |
Exchange Seats 26.5% | MediumM | Solve→ |
My Calendar I 26.5% | MediumM | Solve→ |
Delete and Earn 26.5% | MediumM | Solve→ |
Network Delay Time 26.5% | MediumM | Solve→ |
Insert into a Binary Search Tree 26.5% | MediumM | Solve→ |
Most Common Word 26.5% | EasyE | Solve→ |
Loud and Rich 26.5% | MediumM | Solve→ |
Sort Array By Parity II 26.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Common Characters 26.5% | EasyE | Solve→ |
Maximum Difference Between Node and Ancestor 26.5% | MediumM | Solve→ |
Longest Duplicate Substring 26.5% | HardH | Solve→ |
Design File System 26.5% | MediumM | Solve→ |
Actors and Directors Who Cooperated At Least Three Times 26.5% | EasyE | Solve→ |
Sales Analysis III 26.5% | EasyE | Solve→ |
Shortest Path with Alternating Colors 26.5% | MediumM | Solve→ |
User Activity for the Past 30 Days I 26.5% | EasyE | Solve→ |
List the Products Ordered in a Period 26.5% | EasyE | Solve→ |
Clone Binary Tree With Random Pointer 26.5% | MediumM | Solve→ |
Can Make Arithmetic Progression From Sequence 26.5% | EasyE | Solve→ |
Shortest Subarray to be Removed to Make Array Sorted 26.5% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 26.5% | EasyE | Solve→ |
Max Number of K-Sum Pairs 26.5% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree IV 26.5% | MediumM | Solve→ |
Find Minimum Time to Finish All Jobs 26.5% | HardH | Solve→ |
Invalid Tweets 26.5% | EasyE | Solve→ |
Maximum Element After Decreasing and Rearranging 26.5% | MediumM | Solve→ |
Determine Whether Matrix Can Be Obtained By Rotation 26.5% | EasyE | Solve→ |
Largest Odd Number in String 26.5% | EasyE | Solve→ |
Build Array from Permutation 26.5% | EasyE | Solve→ |
Count Number of Pairs With Absolute Difference K 26.5% | EasyE | Solve→ |
GCD Sort of an Array 26.5% | HardH | Solve→ |
Number of Ways to Select Buildings 26.5% | MediumM | Solve→ |
Total Appeal of A String 26.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Ways to Split Array 26.5% | MediumM | Solve→ |
Minimum Rounds to Complete All Tasks 26.5% | MediumM | Solve→ |
Smallest Number in Infinite Set 26.5% | MediumM | Solve→ |
Maximum Number of Robots Within Budget 26.5% | HardH | Solve→ |
Find the K-Sum of an Array 26.5% | HardH | Solve→ |
Design Memory Allocator 26.5% | MediumM | Solve→ |
Cousins in Binary Tree II 26.5% | MediumM | Solve→ |
Minimum Number of Pushes to Type Word I 26.5% | EasyE | Solve→ |
Minimum Number of Pushes to Type Word II 26.5% | MediumM | Solve→ |
Count the Number of Special Characters I 26.5% | EasyE | Solve→ |
Minimum Array Sum 26.5% | MediumM | Solve→ |
Minimum Number of Operations to Make Elements in Array Distinct 26.5% | EasyE | Solve→ |
Substring Matching Pattern 26.5% | EasyE | Solve→ |
Check If Digits Are Equal in String After Operations I 26.5% | EasyE | Solve→ |
Maximum Total from Optimal Activation Order 26.5% | MediumM | Solve→ |
Trionic Array I 26.5% | EasyE | Solve→ |
Minimum Removals to Balance Array 26.5% | MediumM | Solve→ |
Maximize Fixed Points After Deletions 26.5% | HardH | Solve→ |
Unique Binary Search Trees II 25.1% | MediumM | Solve→ |
Binary Tree Preorder Traversal 25.1% | EasyE | Solve→ |
Delete Duplicate Emails 25.1% | EasyE | Solve→ |
Ugly Number 25.1% | EasyE | Solve→ |
Bulls and Cows 25.1% | MediumM | Solve→ |
Count of Smaller Numbers After Self 25.1% | HardH | Solve→ |
Power of Three 25.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Increasing Path in a Matrix 25.1% | HardH | Solve→ |
Nested List Weight Sum 25.1% | MediumM | Solve→ |
Moving Average from Data Stream 25.1% | EasyE | Solve→ |
Intersection of Two Arrays II 25.1% | EasyE | Solve→ |
Largest Divisible Subset 25.1% | MediumM | Solve→ |
Longest Palindrome 25.1% | EasyE | Solve→ |
Minimum Genetic Mutation 25.1% | MediumM | Solve→ |
Serialize and Deserialize BST 25.1% | MediumM | Solve→ |
Minimum Number of Arrows to Burst Balloons 25.1% | MediumM | Solve→ |
Minesweeper 25.1% | MediumM | Solve→ |
K-diff Pairs in an Array 25.1% | MediumM | Solve→ |
Encode and Decode TinyURL 25.1% | MediumM | Solve→ |
Convert BST to Greater Tree 25.1% | MediumM | Solve→ |
Valid Triangle Number 25.1% | MediumM | Solve→ |
Design Search Autocomplete System 25.1% | HardH | Solve→ |
Number of Distinct Islands II 25.1% | HardH | Solve→ |
Max Stack 25.1% | HardH | Solve→ |
Serialize and Deserialize N-ary Tree 25.1% | HardH | Solve→ |
All Paths From Source to Target 25.1% | MediumM | Solve→ |
Find and Replace Pattern 25.1% | MediumM | Solve→ |
Maximum Frequency Stack 25.1% | HardH | Solve→ |
Orderly Queue 25.1% | HardH | Solve→ |
Shortest Bridge 25.1% | MediumM | Solve→ |
Sum of Root To Leaf Binary Numbers 25.1% | EasyE | Solve→ |
Uncrossed Lines 25.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum of Nodes with Even-Valued Grandparent 25.1% | MediumM | Solve→ |
Number of Dice Rolls With Target Sum 25.1% | MediumM | Solve→ |
Maximum Subarray Sum with One Deletion 25.1% | MediumM | Solve→ |
Reformat Department Table 25.1% | EasyE | Solve→ |
Queries Quality and Percentage 25.1% | EasyE | Solve→ |
Maximum Score Words Formed by Letters 25.1% | HardH | Solve→ |
Fair Distribution of Cookies 25.1% | MediumM | Solve→ |
Get Watched Videos by Your Friends 25.1% | MediumM | Solve→ |
Number of Substrings Containing All Three Characters 25.1% | MediumM | Solve→ |
Check If Array Pairs Are Divisible by k 25.1% | MediumM | Solve→ |
Path With Minimum Effort 25.1% | MediumM | Solve→ |
Concatenation of Consecutive Binary Numbers 25.1% | MediumM | Solve→ |
Maximum Ice Cream Bars 25.1% | MediumM | Solve→ |
Remove All Occurrences of a Substring 25.1% | MediumM | Solve→ |
Number of Smooth Descent Periods of a Stock 25.1% | MediumM | Solve→ |
Maximum Twin Sum of a Linked List 25.1% | MediumM | Solve→ |
Count the Hidden Sequences 25.1% | MediumM | Solve→ |
Minimum Sum of Four Digit Number After Splitting Digits 25.1% | EasyE | Solve→ |
Minimum Sum of Squared Difference 25.1% | MediumM | Solve→ |
Optimal Partition of String 25.1% | MediumM | Solve→ |
Minimum Number of Operations to Sort a Binary Tree by Level 25.1% | MediumM | Solve→ |
Count Stepping Numbers in Range 25.1% | HardH | Solve→ |
Find the Maximum Number of Elements in Subset 25.1% | MediumM | Solve→ |
Maximize Happiness of Selected Children 25.1% | MediumM | Solve→ |
Design an Array Statistics Tracker 25.1% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Moves to Make Palindrome 25.1% | HardH | Solve→ |
Maximum Candies Allocated to K Children 25.1% | MediumM | Solve→ |
Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values 25.1% | MediumM | Solve→ |
Maximum Bitwise AND After Increment Operations 25.1% | HardH | Solve→ |
Minimum Operations to Sort a String 25.1% | MediumM | Solve→ |
Lexicographically Maximum MEX Array 25.1% | HardH | Solve→ |
Minimum Operations to Sort a Permutation 25.1% | MediumM | Solve→ |
Construct Binary Tree from Inorder and Postorder Traversal 23.6% | MediumM | Solve→ |
Max Points on a Line 23.6% | HardH | Solve→ |
Excel Sheet Column Number 23.6% | EasyE | Solve→ |
Reverse Words in a String II 23.6% | MediumM | Solve→ |
The Skyline Problem 23.6% | HardH | Solve→ |
Number of Digit One 23.6% | HardH | Solve→ |
Perfect Squares 23.6% | MediumM | Solve→ |
Walls and Gates 23.6% | MediumM | Solve→ |
Game of Life 23.6% | MediumM | Solve→ |
Word Pattern 23.6% | EasyE | Solve→ |
Counting Bits 23.6% | EasyE | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 23.6% | HardH | Solve→ |
Base 7 23.6% | EasyE | Solve→ |
Maximum Alternating Subarray Sum 23.6% | MediumM | Solve→ |
Reverse String II 23.6% | EasyE | Solve→ |
Course Schedule III 23.6% | HardH | Solve→ |
Solve the Equation 23.6% | MediumM | Solve→ |
2 Keys Keyboard 23.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Swap 23.6% | MediumM | Solve→ |
Cut Off Trees for Golf Event 23.6% | HardH | Solve→ |
Monotone Increasing Digits 23.6% | MediumM | Solve→ |
Design Linked List 23.6% | MediumM | Solve→ |
Unique Paths III 23.6% | HardH | Solve→ |
Minimum Cost to Merge Stones 23.6% | HardH | Solve→ |
Longest Repeating Substring 23.6% | MediumM | Solve→ |
High Five 23.6% | EasyE | Solve→ |
Two Sum Less Than K 23.6% | EasyE | Solve→ |
Path With Maximum Minimum Value 23.6% | MediumM | Solve→ |
Distant Barcodes 23.6% | MediumM | Solve→ |
Two Sum BSTs 23.6% | MediumM | Solve→ |
Game Play Analysis IV 23.6% | MediumM | Solve→ |
Car Pooling 23.6% | MediumM | Solve→ |
Snapshot Array 23.6% | MediumM | Solve→ |
Remove Sub-Folders from the Filesystem 23.6% | MediumM | Solve→ |
All Elements in Two Binary Search Trees 23.6% | MediumM | Solve→ |
Remove Palindromic Subsequences 23.6% | EasyE | Solve→ |
Minimum Difficulty of a Job Schedule 23.6% | HardH | Solve→ |
The K Weakest Rows in a Matrix 23.6% | EasyE | Solve→ |
Movie Rating 23.6% | MediumM | Solve→ |
Reorder Routes to Make All Paths Lead to the City Zero 23.6% | MediumM | Solve→ |
Number of Subsequences That Satisfy the Given Sum Condition 23.6% | MediumM | Solve→ |
Minimum Operations to Reduce X to Zero 23.6% | MediumM | Solve→ |
Minimum Length of String After Deleting Similar Ends 23.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The Number of Employees Which Report to Each Employee 23.6% | EasyE | Solve→ |
Find Distance in a Binary Tree 23.6% | MediumM | Solve→ |
Next Palindrome Using Same Digits 23.6% | HardH | Solve→ |
Find a Peak Element II 23.6% | MediumM | Solve→ |
Longest Common Subpath 23.6% | HardH | Solve→ |
Unique Length-3 Palindromic Subsequences 23.6% | MediumM | Solve→ |
Check for Contradictions in Equations 23.6% | HardH | Solve→ |
Find Missing Observations 23.6% | MediumM | Solve→ |
Minimized Maximum of Products Distributed to Any Store 23.6% | MediumM | Solve→ |
Number of Laser Beams in a Bank 23.6% | MediumM | Solve→ |
Maximize Number of Subsequences in a String 23.6% | MediumM | Solve→ |
K Divisible Elements Subarrays 23.6% | MediumM | Solve→ |
Minimum Average Difference 23.6% | MediumM | Solve→ |
Count Number of Texts 23.6% | MediumM | Solve→ |
Maximum Consecutive Floors Without Special Floors 23.6% | MediumM | Solve→ |
Maximum Bags With Full Capacity of Rocks 23.6% | MediumM | Solve→ |
Design a Text Editor 23.6% | HardH | Solve→ |
Design a Food Rating System 23.6% | MediumM | Solve→ |
Product Sales Analysis IV 23.6% | MediumM | Solve→ |
Minimum Adjacent Swaps to Make a Valid Array 23.6% | MediumM | Solve→ |
Maximum Matching of Players With Trainers 23.6% | MediumM | Solve→ |
Smallest Subarrays With Maximum Bitwise OR 23.6% | MediumM | Solve→ |
Remove Nodes From Linked List 23.6% | MediumM | Solve→ |
Split With Minimum Sum 23.6% | EasyE | Solve→ |
Find the Prefix Common Array of Two Arrays 23.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
To Be Or Not To Be 23.6% | EasyE | Solve→ |
Length of the Longest Valid Substring 23.6% | HardH | Solve→ |
Maximize the Profit as the Salesman 23.6% | MediumM | Solve→ |
Minimum Number of Operations to Make Array Empty 23.6% | MediumM | Solve→ |
Count Beautiful Substrings I 23.6% | MediumM | Solve→ |
Most Frequent IDs 23.6% | MediumM | Solve→ |
Generate Binary Strings Without Adjacent Zeros 23.6% | MediumM | Solve→ |
Percentage of Users Attended a Contest 23.6% | EasyE | Solve→ |
Maximum Matrix Sum 23.6% | MediumM | Solve→ |
Two Best Non-Overlapping Events 23.6% | MediumM | Solve→ |
Max Chunks To Make Sorted 23.6% | MediumM | Solve→ |
Shortest Matching Substring 23.6% | HardH | Solve→ |
Minimum Stability Factor of Array 23.6% | HardH | Solve→ |
Trionic Array II 23.6% | HardH | Solve→ |
Avoid Flood in The City 23.6% | MediumM | Solve→ |
Maximum Capacity Within Budget 23.6% | MediumM | Solve→ |
Minimize Array Sum Using Divisible Replacements 23.6% | MediumM | Solve→ |
Scramble String 21.9% | HardH | Solve→ |
Convert Sorted List to Binary Search Tree 21.9% | MediumM | Solve→ |
Binary Tree Paths 21.9% | EasyE | Solve→ |
Encode and Decode Strings 21.9% | MediumM | Solve→ |
Range Sum Query 2D - Immutable 21.9% | MediumM | Solve→ |
Minimum Height Trees 21.9% | MediumM | Solve→ |
Valid Perfect Square 21.9% | EasyE | Solve→ |
Valid Word Abbreviation 21.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Optimal Division 21.9% | MediumM | Solve→ |
Longest Harmonious Subsequence 21.9% | EasyE | Solve→ |
Construct String from Binary Tree 21.9% | MediumM | Solve→ |
Minimum Swaps To Make Sequences Increasing 21.9% | HardH | Solve→ |
Split Array into Fibonacci Sequence 21.9% | MediumM | Solve→ |
Transpose Matrix 21.9% | EasyE | Solve→ |
Prison Cells After N Days 21.9% | MediumM | Solve→ |
Distribute Coins in Binary Tree 21.9% | MediumM | Solve→ |
Missing Element in Sorted Array 21.9% | MediumM | Solve→ |
Find Words That Can Be Formed by Characters 21.9% | EasyE | Solve→ |
Grumpy Bookstore Owner 21.9% | MediumM | Solve→ |
Insufficient Nodes in Root to Leaf Paths 21.9% | MediumM | Solve→ |
Find in Mountain Array 21.9% | HardH | Solve→ |
Parsing A Boolean Expression 21.9% | HardH | Solve→ |
Handshakes That Don't Cross 21.9% | HardH | Solve→ |
Closest Divisors 21.9% | MediumM | Solve→ |
Shift 2D Grid 21.9% | EasyE | Solve→ |
Delete Leaves With a Given Value 21.9% | MediumM | Solve→ |
Minimum Number of Taps to Open to Water a Garden 21.9% | HardH | Solve→ |
Restaurant Growth 21.9% | MediumM | Solve→ |
Check If N and Its Double Exist 21.9% | EasyE | Solve→ |
Longest Happy Prefix 21.9% | HardH | Solve→ |
Number of Steps to Reduce a Number in Binary Representation to One 21.9% | MediumM | Solve→ |
String Matching in an Array 21.9% | EasyE | Solve→ |
NPV Queries 21.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Product of Two Elements in an Array 21.9% | EasyE | Solve→ |
Sales by Day of the Week 21.9% | HardH | Solve→ |
Number of Good Pairs 21.9% | EasyE | Solve→ |
Maximum Number of Non-Overlapping Substrings 21.9% | HardH | Solve→ |
Customer Order Frequency 21.9% | EasyE | Solve→ |
Find the Index of the Large Integer 21.9% | MediumM | Solve→ |
Maximum Number of Achievable Transfer Requests 21.9% | HardH | Solve→ |
Defuse the Bomb 21.9% | EasyE | Solve→ |
Form Array by Concatenating Subarrays of Another Array 21.9% | MediumM | Solve→ |
Closest Room 21.9% | HardH | Solve→ |
Check if Move is Legal 21.9% | MediumM | Solve→ |
Sum of Beauty in the Array 21.9% | MediumM | Solve→ |
Decode the Slanted Ciphertext 21.9% | MediumM | Solve→ |
Find Good Days to Rob the Bank 21.9% | MediumM | Solve→ |
Adding Spaces to a String 21.9% | MediumM | Solve→ |
Replace Non-Coprime Numbers in Array 21.9% | HardH | Solve→ |
Replace Elements in an Array 21.9% | MediumM | Solve→ |
Minimum Score After Removals on a Tree 21.9% | HardH | Solve→ |
Minimum Number of Keypresses 21.9% | MediumM | Solve→ |
Find Minimum Time to Finish All Jobs II 21.9% | MediumM | Solve→ |
Design SQL 21.9% | MediumM | Solve→ |
Number of Distinct Averages 21.9% | EasyE | Solve→ |
Append Characters to String to Make Subsequence 21.9% | MediumM | Solve→ |
Maximum Star Sum of a Graph 21.9% | MediumM | Solve→ |
Difference Between Ones and Zeros in Row and Column 21.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Customers With Strictly Increasing Purchases 21.9% | HardH | Solve→ |
Time Taken to Cross the Door 21.9% | HardH | Solve→ |
Find the Substring With Maximum Cost 21.9% | MediumM | Solve→ |
Count the Number of Fair Pairs 21.9% | MediumM | Solve→ |
Find the Divisibility Array of a String 21.9% | MediumM | Solve→ |
Find the K-or of an Array 21.9% | EasyE | Solve→ |
Find Maximum Non-decreasing Array Length 21.9% | HardH | Solve→ |
Find Number of Coins to Place in Tree Nodes 21.9% | HardH | Solve→ |
Length of Longest Subarray With at Most K Frequency 21.9% | MediumM | Solve→ |
Count Elements With Maximum Frequency 21.9% | EasyE | Solve→ |
Replace Question Marks in String to Minimize Its Value 21.9% | MediumM | Solve→ |
Find the Median of the Uniqueness Array 21.9% | HardH | Solve→ |
Find Number of Ways to Reach the K-th Stair 21.9% | HardH | Solve→ |
Magic Squares In Grid 21.9% | MediumM | Solve→ |
Rank Transform of an Array 21.9% | EasyE | Solve→ |
Separate Black and White Balls 21.9% | MediumM | Solve→ |
Number of Zero-Filled Subarrays 21.9% | MediumM | Solve→ |
Count Servers that Communicate 21.9% | MediumM | Solve→ |
Final Prices With a Special Discount in a Shop 21.9% | EasyE | Solve→ |
House Robber IV 21.9% | MediumM | Solve→ |
Minimum Distance to the Target Element 21.9% | EasyE | Solve→ |
Count the Number of Substrings With Dominant Ones 21.9% | MediumM | Solve→ |
Find the K-th Character in String Game I 21.9% | EasyE | Solve→ |
Minimum Time to Activate String 21.9% | MediumM | Solve→ |
Maximum Median Sum of Subsequences of Size 3 21.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Groups to Create a Valid Assignment 21.9% | MediumM | Solve→ |
Total Sum of Interaction Cost in Tree Groups 21.9% | HardH | Solve→ |
Minimum Flips to Make Binary String Coherent 21.9% | MediumM | Solve→ |
Remove Duplicates from Sorted List II 20% | MediumM | Solve→ |
Minimum Depth of Binary Tree 20% | EasyE | Solve→ |
Populating Next Right Pointers in Each Node II 20% | MediumM | Solve→ |
Binary Tree Postorder Traversal 20% | EasyE | Solve→ |
Factorial Trailing Zeroes 20% | MediumM | Solve→ |
Trips and Users 20% | HardH | Solve→ |
Count of Range Sum 20% | HardH | Solve→ |
Power of Four 20% | EasyE | Solve→ |
Combination Sum IV 20% | MediumM | Solve→ |
Island Perimeter 20% | EasyE | Solve→ |
Sliding Window Median 20% | HardH | Solve→ |
Construct Binary Tree from String 20% | MediumM | Solve→ |
Complex Number Multiplication 20% | MediumM | Solve→ |
Find Cumulative Salary of an Employee 20% | HardH | Solve→ |
Sum of Square Numbers 20% | MediumM | Solve→ |
Find Duplicate Subtrees 20% | MediumM | Solve→ |
Equal Tree Partition 20% | MediumM | Solve→ |
Find K-th Smallest Pair Distance 20% | HardH | Solve→ |
Number of Atoms 20% | HardH | Solve→ |
Closest Leaf in a Binary Tree 20% | MediumM | Solve→ |
Prime Number of Set Bits in Binary Representation 20% | EasyE | Solve→ |
Search in a Binary Search Tree 20% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Basic Calculator III 20% | HardH | Solve→ |
Global and Local Inversions 20% | MediumM | Solve→ |
Split BST 20% | MediumM | Solve→ |
Guess the Word 20% | HardH | Solve→ |
Maximize Distance to Closest Person 20% | MediumM | Solve→ |
Nth Magical Number 20% | HardH | Solve→ |
Numbers At Most N Given Digit Set 20% | HardH | Solve→ |
Pairs of Songs With Total Durations Divisible by 60 20% | MediumM | Solve→ |
Digit Count in Range 20% | HardH | Solve→ |
Index Pairs of a String 20% | EasyE | Solve→ |
Sum of Digits in the Minimum Number 20% | EasyE | Solve→ |
Find K-Length Substrings With No Repeated Characters 20% | MediumM | Solve→ |
Divisor Game 20% | EasyE | Solve→ |
Number of Days in a Month 20% | EasyE | Solve→ |
Remove Vowels from a String 20% | EasyE | Solve→ |
Armstrong Number 20% | EasyE | Solve→ |
Maximum Average Subtree 20% | MediumM | Solve→ |
Largest Unique Number 20% | EasyE | Solve→ |
Connecting Cities With Minimum Cost 20% | MediumM | Solve→ |
Minimum Cost to Connect Sticks 20% | MediumM | Solve→ |
Number of Submatrices That Sum to Target 20% | HardH | Solve→ |
Product Sales Analysis II 20% | EasyE | Solve→ |
Sales Analysis I 20% | EasyE | Solve→ |
Sales Analysis II 20% | EasyE | Solve→ |
N-th Tribonacci Number 20% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Stone Game II 20% | MediumM | Solve→ |
Largest Multiple of Three 20% | HardH | Solve→ |
Prime Arrangements 20% | EasyE | Solve→ |
Diet Plan Performance 20% | EasyE | Solve→ |
Minimum Garden Perimeter to Collect Enough Apples 20% | MediumM | Solve→ |
Number of Visible People in a Queue 20% | HardH | Solve→ |
Count Number of Nice Subarrays 20% | MediumM | Solve→ |
Find Numbers with Even Number of Digits 20% | EasyE | Solve→ |
Find N Unique Integers Sum up to Zero 20% | EasyE | Solve→ |
Find the Team Size 20% | EasyE | Solve→ |
Students With Invalid Departments 20% | EasyE | Solve→ |
Count Number of Teams 20% | MediumM | Solve→ |
Queries on a Permutation With Key 20% | MediumM | Solve→ |
Pseudo-Palindromic Paths in a Binary Tree 20% | MediumM | Solve→ |
Max Dot Product of Two Subsequences 20% | HardH | Solve→ |
Longest Subarray of 1's After Deleting One Element 20% | MediumM | Solve→ |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree 20% | HardH | Solve→ |
Minimum Number of Increments on Subarrays to Form a Target Array 20% | HardH | Solve→ |
Clone N-ary Tree 20% | MediumM | Solve→ |
Friendly Movies Streamed Last Month 20% | EasyE | Solve→ |
Minimum Numbers of Function Calls to Make Target Array 20% | MediumM | Solve→ |
Matrix Diagonal Sum 20% | EasyE | Solve→ |
Warehouse Manager 20% | EasyE | Solve→ |
Number of Sets of K Non-Overlapping Line Segments 20% | MediumM | Solve→ |
Build Binary Expression Tree From Infix Expression 20% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Missing IDs 20% | MediumM | Solve→ |
All Valid Triplets That Can Represent a Country 20% | EasyE | Solve→ |
Design Front Middle Back Queue 20% | MediumM | Solve→ |
Add Two Polynomials Represented as Linked Lists 20% | MediumM | Solve→ |
Decode XORed Permutation 20% | MediumM | Solve→ |
Count Ways to Make Array With Product 20% | HardH | Solve→ |
Number of Calls Between Two Persons 20% | MediumM | Solve→ |
Minimum Limit of Balls in a Bag 20% | MediumM | Solve→ |
Minimum Degree of a Connected Trio in a Graph 20% | HardH | Solve→ |
Find Nearest Point That Has the Same X or Y Coordinate 20% | EasyE | Solve→ |
Count Pairs Of Nodes 20% | HardH | Solve→ |
Find Total Time Spent by Each Employee 20% | EasyE | Solve→ |
Sort Features by Popularity 20% | MediumM | Solve→ |
Product's Price for Each Store 20% | EasyE | Solve→ |
Grand Slam Titles 20% | MediumM | Solve→ |
Maximize the Beauty of the Garden 20% | HardH | Solve→ |
Rearrange Products Table 20% | EasyE | Solve→ |
Ad-Free Sessions 20% | EasyE | Solve→ |
Find Interview Candidates 20% | MediumM | Solve→ |
Distinct Numbers in Each Subarray 20% | MediumM | Solve→ |
Minimum Space Wasted From Packaging 20% | HardH | Solve→ |
Nearest Exit from Entrance in Maze 20% | MediumM | Solve→ |
Jump Game VIII 20% | MediumM | Solve→ |
Maximum of Minimum Values in All Subarrays 20% | MediumM | Solve→ |
Count Number of Special Subsequences 20% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Ways to Arrive at Destination 20% | MediumM | Solve→ |
Minimize the Difference Between Target and Chosen Elements 20% | MediumM | Solve→ |
Minimum Difference Between Highest and Lowest of K Scores 20% | EasyE | Solve→ |
Kth Distinct String in an Array 20% | EasyE | Solve→ |
Sequentially Ordinal Rank Tracker 20% | HardH | Solve→ |
Delete the Middle Node of a Linked List 20% | MediumM | Solve→ |
Minimum Operations to Make the Array K-Increasing 20% | HardH | Solve→ |
Minimum Swaps to Group All 1's Together II 20% | MediumM | Solve→ |
Minimum Operations to Remove Adjacent Ones in Matrix 20% | HardH | Solve→ |
Append K Integers With Minimal Sum 20% | MediumM | Solve→ |
Longest Winning Streak 20% | HardH | Solve→ |
Sum of Scores of Built Strings 20% | HardH | Solve→ |
Maximum Sum Score of Array 20% | MediumM | Solve→ |
Users With Two Purchases Within Seven Days 20% | MediumM | Solve→ |
Rearrange Characters to Make Target String 20% | EasyE | Solve→ |
Number of Times a Driver Was a Passenger 20% | MediumM | Solve→ |
Successful Pairs of Spells and Potions 20% | MediumM | Solve→ |
Products With Three or More Orders in Two Consecutive Years 20% | MediumM | Solve→ |
Count Number of Bad Pairs 20% | MediumM | Solve→ |
Product Sales Analysis V 20% | EasyE | Solve→ |
Time Needed to Rearrange a Binary String 20% | MediumM | Solve→ |
Valid Palindrome IV 20% | MediumM | Solve→ |
Minimum Money Required Before Transactions 20% | HardH | Solve→ |
Employees With Deductions 20% | MediumM | Solve→ |
Sum of Number and Its Reverse 20% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Merge Operations to Turn Array Into a Palindrome 20% | MediumM | Solve→ |
Find the Pivot Integer 20% | EasyE | Solve→ |
Longest Square Streak in an Array 20% | MediumM | Solve→ |
Find Xor-Beauty of Array 20% | MediumM | Solve→ |
Count the Number of K-Big Indices 20% | HardH | Solve→ |
Counter 20% | EasyE | Solve→ |
Count the Number of K-Free Subsets 20% | MediumM | Solve→ |
Filter Elements from Array 20% | EasyE | Solve→ |
Return Length of Arguments Passed 20% | EasyE | Solve→ |
Relocate Marbles 20% | MediumM | Solve→ |
Continuous Subarrays 20% | MediumM | Solve→ |
Double a Number Represented as a Linked List 20% | MediumM | Solve→ |
Maximum Sum of Almost Unique Subarray 20% | MediumM | Solve→ |
Number of Unique Categories 20% | MediumM | Solve→ |
Minimum Right Shifts to Sort the Array 20% | EasyE | Solve→ |
Maximal Range That Each Element Is Maximum in It 20% | MediumM | Solve→ |
Subarrays Distinct Element Sum of Squares II 20% | HardH | Solve→ |
Maximum Linear Stock Score 20% | MediumM | Solve→ |
Maximum Balanced Subsequence Sum 20% | HardH | Solve→ |
Distribute Candies Among Children I 20% | EasyE | Solve→ |
Make Three Strings Equal 20% | EasyE | Solve→ |
Count Beautiful Substrings II 20% | HardH | Solve→ |
Distribute Candies Among Children III 20% | HardH | Solve→ |
Count Numbers With Unique Digits II 20% | EasyE | Solve→ |
Find the Number of Subarrays Where Boundary Elements Are Maximum 20% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count the Number of Special Characters II 20% | MediumM | Solve→ |
Minimum Average of Smallest and Largest Elements 20% | EasyE | Solve→ |
Count Triplets with Even XOR Set Bits I 20% | EasyE | Solve→ |
Count Triplets with Even XOR Set Bits II 20% | MediumM | Solve→ |
Primary Department for Each Employee 20% | EasyE | Solve→ |
Find the Length of the Longest Common Prefix 20% | MediumM | Solve→ |
Last Stone Weight II 20% | MediumM | Solve→ |
Parallel Courses III 20% | HardH | Solve→ |
Maximum Performance of a Team 20% | HardH | Solve→ |
Course Schedule IV 20% | MediumM | Solve→ |
Clear Digits 20% | EasyE | Solve→ |
Separate Squares I 20% | MediumM | Solve→ |
Lexicographically Minimum String After Removing Stars 20% | MediumM | Solve→ |
Insertion Sort List 20% | MediumM | Solve→ |
Count Subarrays of Length Three With a Condition 20% | EasyE | Solve→ |
Find the Maximum Length of Valid Subsequence I 20% | MediumM | Solve→ |
Fix Names in a Table 20% | EasyE | Solve→ |
Maximize Subarrays After Removing One Conflicting Pair 20% | HardH | Solve→ |
Soup Servings 20% | MediumM | Solve→ |
Threshold Majority Queries 20% | HardH | Solve→ |
New 21 Game 20% | MediumM | Solve→ |
Find the Minimum Area to Cover All Ones II 20% | HardH | Solve→ |
Minimum Sensors to Cover Grid 20% | MediumM | Solve→ |
Maximum Calories Burnt from Jumps 20% | MediumM | Solve→ |
Maximize Points After Choosing K Tasks 20% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Score After Binary Swaps 20% | MediumM | Solve→ |
Reverse String Prefix 20% | EasyE | Solve→ |
Minimum Cost to Partition a Binary String 20% | HardH | Solve→ |
Maximum Total Value of Covered Indices 20% | MediumM | Solve→ |
Maximum Subarray Sum After Multiplier 20% | MediumM | Solve→ |
Maximum Gap 18% | MediumM | Solve→ |
Valid Phone Numbers 18% | EasyE | Solve→ |
Ugly Number II 18% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Cooldown 18% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 18% | MediumM | Solve→ |
Elimination Game 18% | MediumM | Solve→ |
Sum of Left Leaves 18% | EasyE | Solve→ |
Add Two Numbers II 18% | MediumM | Solve→ |
Can I Win 18% | MediumM | Solve→ |
Perfect Number 18% | EasyE | Solve→ |
Find Largest Value in Each Tree Row 18% | MediumM | Solve→ |
Minimum Time Difference 18% | MediumM | Solve→ |
Find the Closest Palindrome 18% | HardH | Solve→ |
Human Traffic of Stadium 18% | HardH | Solve→ |
Not Boring Movies 18% | EasyE | Solve→ |
Trim a Binary Search Tree 18% | MediumM | Solve→ |
K-th Symbol in Grammar 18% | MediumM | Solve→ |
Hand of Straights 18% | MediumM | Solve→ |
Minimum Cost to Hire K Workers 18% | HardH | Solve→ |
Reordered Power of 2 18% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Walking Robot Simulation 18% | MediumM | Solve→ |
Sort Array By Parity 18% | EasyE | Solve→ |
Valid Mountain Array 18% | EasyE | Solve→ |
Find the Town Judge 18% | EasyE | Solve→ |
Next Greater Node In Linked List 18% | MediumM | Solve→ |
As Far from Land as Possible 18% | MediumM | Solve→ |
Robot Bounded In Circle 18% | MediumM | Solve→ |
Game Play Analysis I 18% | EasyE | Solve→ |
Longest Happy String 18% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 18% | MediumM | Solve→ |
Find the Difference of Two Arrays 18% | EasyE | Solve→ |
Find Winner on a Tic Tac Toe Game 18% | EasyE | Solve→ |
Maximum Product of Splitted Binary Tree 18% | MediumM | Solve→ |
Cherry Pickup II 18% | HardH | Solve→ |
Buildings With an Ocean View 18% | MediumM | Solve→ |
Find the Winner of the Circular Game 18% | MediumM | Solve→ |
Detonate the Maximum Bombs 18% | MediumM | Solve→ |
Create Binary Tree From Descriptions 18% | MediumM | Solve→ |
Longest Nice Subarray 18% | MediumM | Solve→ |
Smallest Even Multiple 18% | EasyE | Solve→ |
Apply Operations to an Array 18% | EasyE | Solve→ |
Minimize the Maximum Difference of Pairs 18% | MediumM | Solve→ |
Find the Maximum Achievable Number 18% | EasyE | Solve→ |
Nth Digit 18% | MediumM | Solve→ |
Minimum Fuel Cost to Report to the Capital 18% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Delete Nodes From Linked List Present in Array 18% | MediumM | Solve→ |
Lexicographically Smallest String After Applying Operations 18% | MediumM | Solve→ |
String Compression III 18% | MediumM | Solve→ |
Most Beautiful Item for Each Query 18% | MediumM | Solve→ |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 18% | MediumM | Solve→ |
Jump Game VII 18% | MediumM | Solve→ |
Largest 1-Bordered Square 18% | MediumM | Solve→ |
Special Binary String 18% | HardH | Solve→ |
Nim Game 18% | EasyE | Solve→ |
Count Vowel Strings in Ranges 18% | MediumM | Solve→ |
Map of Highest Peak 18% | MediumM | Solve→ |
Even Odd Tree 18% | MediumM | Solve→ |
Maximum Absolute Sum of Any Subarray 18% | MediumM | Solve→ |
Robot Return to Origin 18% | EasyE | Solve→ |
Detect Cycles in 2D Grid 18% | MediumM | Solve→ |
Possible Bipartition 18% | MediumM | Solve→ |
Greatest Sum Divisible by Three 18% | MediumM | Solve→ |
Unique 3-Digit Even Numbers 18% | EasyE | Solve→ |
Maximum Number of Tasks You Can Assign 18% | HardH | Solve→ |
Minimum Equal Sum of Two Arrays After Replacing Zeros 18% | MediumM | Solve→ |
Total Characters in String After Transformations I 18% | MediumM | Solve→ |
Lexicographically Smallest Equivalent String 18% | MediumM | Solve→ |
Find All K-Distant Indices in an Array 18% | EasyE | Solve→ |
Kth Smallest Product of Two Sorted Arrays 18% | HardH | Solve→ |
Minimum Cost to Reach Destination in Time 18% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reschedule Meetings for Maximum Free Time I 18% | MediumM | Solve→ |
Cherry Pickup 18% | HardH | Solve→ |
Fruits Into Baskets II 18% | EasyE | Solve→ |
Rotating the Box 18% | MediumM | Solve→ |
Vowel Spellchecker 18% | MediumM | Solve→ |
Design Task Manager 18% | MediumM | Solve→ |
Lexicographically Smallest Permutation Greater Than Target 18% | MediumM | Solve→ |
Transformed Array 18% | EasyE | Solve→ |
Longest Balanced Substring I 18% | MediumM | Solve→ |
Champagne Tower 18% | MediumM | Solve→ |
Minimum Initial Energy to Finish Tasks 18% | HardH | Solve→ |
Total Waviness of Numbers in Range I 18% | MediumM | Solve→ |
Number of ZigZag Arrays I 18% | HardH | Solve→ |
Maximize Active Section with Trade I 18% | MediumM | Solve→ |
Fraction to Recurring Decimal 15.7% | MediumM | Solve→ |
Bitwise AND of Numbers Range 15.7% | MediumM | Solve→ |
Count Complete Tree Nodes 15.7% | MediumM | Solve→ |
Shortest Word Distance 15.7% | EasyE | Solve→ |
Remove Invalid Parentheses 15.7% | HardH | Solve→ |
Shortest Distance from All Buildings 15.7% | HardH | Solve→ |
Guess Number Higher or Lower 15.7% | EasyE | Solve→ |
Optimal Account Balancing 15.7% | HardH | Solve→ |
Brick Wall 15.7% | MediumM | Solve→ |
Shortest Unsorted Continuous Subarray 15.7% | MediumM | Solve→ |
Investments in 2016 15.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Friend Requests II: Who Has the Most Friends 15.7% | MediumM | Solve→ |
Dota2 Senate 15.7% | MediumM | Solve→ |
Number of Longest Increasing Subsequence 15.7% | MediumM | Solve→ |
Find Smallest Letter Greater Than Target 15.7% | EasyE | Solve→ |
Employee Free Time 15.7% | HardH | Solve→ |
Number of Matching Subsequences 15.7% | MediumM | Solve→ |
Fair Candy Swap 15.7% | EasyE | Solve→ |
Monotonic Array 15.7% | EasyE | Solve→ |
Reveal Cards In Increasing Order 15.7% | MediumM | Solve→ |
Verifying an Alien Dictionary 15.7% | EasyE | Solve→ |
Cousins in Binary Tree 15.7% | EasyE | Solve→ |
Maximum Level Sum of a Binary Tree 15.7% | MediumM | Solve→ |
Partition Array for Maximum Sum 15.7% | MediumM | Solve→ |
Minimum Knight Moves 15.7% | MediumM | Solve→ |
Project Employees I 15.7% | EasyE | Solve→ |
Defanging an IP Address 15.7% | EasyE | Solve→ |
Invalid Transactions 15.7% | MediumM | Solve→ |
Last Person to Fit in the Bus 15.7% | MediumM | Solve→ |
Find Resultant Array After Removing Anagrams 15.7% | EasyE | Solve→ |
Minimum Insertion Steps to Make a String Palindrome 15.7% | HardH | Solve→ |
Jump Game IV 15.7% | HardH | Solve→ |
Design a Stack With Increment Operation 15.7% | MediumM | Solve→ |
Count Good Nodes in Binary Tree 15.7% | MediumM | Solve→ |
Find Kth Bit in Nth Binary String 15.7% | MediumM | Solve→ |
Maximum Length of Subarray With Positive Product 15.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sort Array by Increasing Frequency 15.7% | EasyE | Solve→ |
Sum of Absolute Differences in a Sorted Array 15.7% | MediumM | Solve→ |
Richest Customer Wealth 15.7% | EasyE | Solve→ |
Maximum Number of Events That Can Be Attended II 15.7% | HardH | Solve→ |
Maximum Population Year 15.7% | EasyE | Solve→ |
Minimum Number of Swaps to Make the String Balanced 15.7% | MediumM | Solve→ |
Final Value of Variable After Performing Operations 15.7% | EasyE | Solve→ |
Step-By-Step Directions From a Binary Tree Node to Another 15.7% | MediumM | Solve→ |
Check if a Parentheses String Can Be Valid 15.7% | MediumM | Solve→ |
Solving Questions With Brainpower 15.7% | MediumM | Solve→ |
Root Equals Sum of Children 15.7% | EasyE | Solve→ |
Number of Unique Subjects Taught by Each Teacher 15.7% | EasyE | Solve→ |
Score of a String 15.7% | EasyE | Solve→ |
Split a String in Balanced Strings 15.7% | EasyE | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 15.7% | MediumM | Solve→ |
Add to Array-Form of Integer 15.7% | EasyE | Solve→ |
Valid Tic-Tac-Toe State 15.7% | MediumM | Solve→ |
K-th Smallest in Lexicographical Order 15.7% | HardH | Solve→ |
Check if Number is a Sum of Powers of Three 15.7% | MediumM | Solve→ |
Maximum Sum of 3 Non-Overlapping Subarrays 15.7% | HardH | Solve→ |
Word Subsets 15.7% | MediumM | Solve→ |
Make Lexicographically Smallest Array by Swapping Elements 15.7% | MediumM | Solve→ |
Maximum Subarray Min-Product 15.7% | MediumM | Solve→ |
Maximum Tastiness of Candy Basket 15.7% | MediumM | Solve→ |
Design Snake Game 15.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The k-th Lexicographical String of All Happy Strings of Length n 15.7% | MediumM | Solve→ |
Number of Sub-arrays With Odd Sum 15.7% | MediumM | Solve→ |
Separate Squares II 15.7% | HardH | Solve→ |
Length of Longest Fibonacci Subsequence 15.7% | MediumM | Solve→ |
Minimum Domino Rotations For Equal Row 15.7% | MediumM | Solve→ |
Zero Array Transformation I 15.7% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency I 15.7% | EasyE | Solve→ |
Maximum Difference Between Increasing Elements 15.7% | EasyE | Solve→ |
Minimum Time to Complete Trips 15.7% | MediumM | Solve→ |
Maximum Balanced Shipments 15.7% | MediumM | Solve→ |
Range Product Queries of Powers 15.7% | MediumM | Solve→ |
Ways to Express an Integer as Sum of Powers 15.7% | MediumM | Solve→ |
Find the Minimum Area to Cover All Ones I 15.7% | MediumM | Solve→ |
Number of People Aware of a Secret 15.7% | MediumM | Solve→ |
Find Target Indices After Sorting Array 15.7% | EasyE | Solve→ |
Maximum Total Damage With Spell Casting 15.7% | MediumM | Solve→ |
Maximum Subarray Sum With Length Divisible by K 15.7% | MediumM | Solve→ |
Minimum Penalty for a Shop 15.7% | MediumM | Solve→ |
Ones and Zeroes 15.7% | MediumM | Solve→ |
Minimum Pair Removal to Sort Array II 15.7% | HardH | Solve→ |
Minimum Cost Path with Edge Reversals 15.7% | MediumM | Solve→ |
Minimum Moves to Make Array Complementary 15.7% | MediumM | Solve→ |
Minimum Cost of Buying Candies With Discount 15.7% | EasyE | Solve→ |
Earliest Finish Time for Land and Water Rides I 15.7% | EasyE | Solve→ |
Earliest Finish Time for Land and Water Rides II 15.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Process String with Special Operations II 15.7% | HardH | Solve→ |
Distance Between Bus Stops 15.7% | EasyE | Solve→ |
Sequential Digits 15.7% | MediumM | Solve→ |
Binary Tree Level Order Traversal II 13.2% | MediumM | Solve→ |
Contains Duplicate III 13.2% | HardH | Solve→ |
Best Meeting Point 13.2% | HardH | Solve→ |
Arithmetic Slices 13.2% | MediumM | Solve→ |
Maximum XOR of Two Numbers in an Array 13.2% | MediumM | Solve→ |
Find Right Interval 13.2% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements 13.2% | MediumM | Solve→ |
Relative Ranks 13.2% | EasyE | Solve→ |
Kill Process 13.2% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 13.2% | MediumM | Solve→ |
Reach a Number 13.2% | MediumM | Solve→ |
Rabbits in Forest 13.2% | MediumM | Solve→ |
Most Profit Assigning Work 13.2% | MediumM | Solve→ |
Profitable Schemes 13.2% | HardH | Solve→ |
All Possible Full Binary Trees 13.2% | MediumM | Solve→ |
Range Sum of BST 13.2% | EasyE | Solve→ |
Minimum Increment to Make Array Unique 13.2% | MediumM | Solve→ |
Validate Stack Sequences 13.2% | MediumM | Solve→ |
Relative Sort Array 13.2% | EasyE | Solve→ |
Convert Binary Number in a Linked List to Integer 13.2% | EasyE | Solve→ |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold 13.2% | MediumM | Solve→ |
Number of Steps to Reduce a Number to Zero 13.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Least Number of Unique Integers after K Removals 13.2% | MediumM | Solve→ |
Partitioning Into Minimum Number Of Deci-Binary Numbers 13.2% | MediumM | Solve→ |
Minimum Number of Operations to Move All Balls to Each Box 13.2% | MediumM | Solve→ |
Find Center of Star Graph 13.2% | EasyE | Solve→ |
Single-Threaded CPU 13.2% | MediumM | Solve→ |
Reverse Prefix of Word 13.2% | EasyE | Solve→ |
Detect Squares 13.2% | MediumM | Solve→ |
Find Subsequence of Length K With the Largest Sum 13.2% | EasyE | Solve→ |
Escape the Spreading Fire 13.2% | HardH | Solve→ |
Find Closest Number to Zero 13.2% | EasyE | Solve→ |
Convert the Temperature 13.2% | EasyE | Solve→ |
Array Prototype Last 13.2% | EasyE | Solve→ |
Count Complete Subarrays in an Array 13.2% | MediumM | Solve→ |
Divide Array Into Arrays With Max Difference 13.2% | MediumM | Solve→ |
Find the Maximum Length of Valid Subsequence II 13.2% | MediumM | Solve→ |
Valid Word 13.2% | EasyE | Solve→ |
Minimum Index Sum of Two Lists 13.2% | EasyE | Solve→ |
Out of Boundary Paths 13.2% | MediumM | Solve→ |
Longest Continuous Increasing Subsequence 13.2% | EasyE | Solve→ |
Minimum Obstacle Removal to Reach Corner 13.2% | HardH | Solve→ |
All Ancestors of a Node in a Directed Acyclic Graph 13.2% | MediumM | Solve→ |
Sum of Prefix Scores of Strings 13.2% | HardH | Solve→ |
Biggest Single Number 13.2% | EasyE | Solve→ |
Divide Players Into Teams of Equal Skill 13.2% | MediumM | Solve→ |
Rearrange String k Distance Apart 13.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Number of Maximum Bitwise-OR Subsets 13.2% | MediumM | Solve→ |
Take K of Each Character From Left and Right 13.2% | MediumM | Solve→ |
The Most Frequently Ordered Products for Each Customer 13.2% | MediumM | Solve→ |
Sum of Unique Elements 13.2% | EasyE | Solve→ |
Best Sightseeing Pair 13.2% | MediumM | Solve→ |
Minimize XOR 13.2% | MediumM | Solve→ |
Tree Diameter 13.2% | MediumM | Solve→ |
Delete Columns to Make Sorted 13.2% | EasyE | Solve→ |
Number of Subarrays with Bounded Maximum 13.2% | MediumM | Solve→ |
Maximum Good Subarray Sum 13.2% | MediumM | Solve→ |
Find the Punishment Number of an Integer 13.2% | MediumM | Solve→ |
Self Dividing Numbers 13.2% | EasyE | Solve→ |
Maximum Sum of Two Non-Overlapping Subarrays 13.2% | MediumM | Solve→ |
Count Total Number of Colored Cells 13.2% | MediumM | Solve→ |
Find Duplicate File in System 13.2% | MediumM | Solve→ |
Zero Array Transformation II 13.2% | MediumM | Solve→ |
Minimum Time to Repair Cars 13.2% | MediumM | Solve→ |
Count Vowel Substrings of a String 13.2% | EasyE | Solve→ |
Count Palindromic Subsequences 13.2% | HardH | Solve→ |
Minimum Absolute Difference 13.2% | EasyE | Solve→ |
Market Analysis I 13.2% | MediumM | Solve→ |
Number of Pairs Satisfying Inequality 13.2% | HardH | Solve→ |
Binary Watch 13.2% | EasyE | Solve→ |
Divisible and Non-divisible Sums Difference 13.2% | EasyE | Solve→ |
Maximum Height by Stacking Cuboids 13.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Closest Node to Given Two Nodes 13.2% | MediumM | Solve→ |
Max Difference You Can Get From Changing an Integer 13.2% | MediumM | Solve→ |
Find the Original Typed String I 13.2% | EasyE | Solve→ |
Find the Original Typed String II 13.2% | HardH | Solve→ |
Minimum Pair Removal to Sort Array I 13.2% | EasyE | Solve→ |
Count Hills and Valleys in an Array 13.2% | EasyE | Solve→ |
Fruits Into Baskets III 13.2% | MediumM | Solve→ |
Count Submatrices With All Ones 13.2% | MediumM | Solve→ |
Find the Number of Ways to Place People I 13.2% | MediumM | Solve→ |
Minimum Operations to Make the Integer Zero 13.2% | MediumM | Solve→ |
Convert Integer to the Sum of Two No-Zero Integers 13.2% | EasyE | Solve→ |
Maximum Number of Words Found in Sentences 13.2% | EasyE | Solve→ |
Taking Maximum Energy From the Mystic Dungeon 13.2% | MediumM | Solve→ |
Smallest Missing Non-negative Integer After Operations 13.2% | MediumM | Solve→ |
Best Time to Buy and Sell Stock V 13.2% | MediumM | Solve→ |
Set Intersection Size At Least Two 13.2% | HardH | Solve→ |
Pyramid Transition Matrix 13.2% | MediumM | Solve→ |
N-Repeated Element in Size 2N Array 13.2% | EasyE | Solve→ |
Maximize Area of Square Hole in Grid 13.2% | MediumM | Solve→ |
Construct the Minimum Bitwise Array II 13.2% | MediumM | Solve→ |
Minimum Cost Path with Teleportations 13.2% | HardH | Solve→ |
Longest Balanced Subarray I 13.2% | MediumM | Solve→ |
Longest Balanced Substring II 13.2% | MediumM | Solve→ |
Customer Placing the Largest Number of Orders 13.2% | EasyE | Solve→ |
Check If a String Contains All Binary Codes of Size K 13.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Buddy Strings 13.2% | EasyE | Solve→ |
Web Crawler 13.2% | MediumM | Solve→ |
First Completely Painted Row or Column 13.2% | MediumM | Solve→ |
Count Subarrays With Majority Element I 13.2% | MediumM | Solve→ |
Maximum Length Substring With Two Occurrences 13.2% | EasyE | Solve→ |
Find Minimum in Rotated Sorted Array II 10.3% | HardH | Solve→ |
Create Maximum Number 10.3% | HardH | Solve→ |
Wiggle Sort II 10.3% | MediumM | Solve→ |
Palindrome Pairs 10.3% | HardH | Solve→ |
Integer Break 10.3% | MediumM | Solve→ |
Find Leaves of Binary Tree 10.3% | MediumM | Solve→ |
Super Pow 10.3% | MediumM | Solve→ |
Queue Reconstruction by Height 10.3% | MediumM | Solve→ |
Arithmetic Slices II - Subsequence 10.3% | HardH | Solve→ |
4Sum II 10.3% | MediumM | Solve→ |
Delete Operation for Two Strings 10.3% | MediumM | Solve→ |
Swap Sex of Employees 10.3% | EasyE | Solve→ |
Repeated String Match 10.3% | MediumM | Solve→ |
Range Module 10.3% | HardH | Solve→ |
Maximum Length of Repeated Subarray 10.3% | MediumM | Solve→ |
N-ary Tree Level Order Traversal 10.3% | MediumM | Solve→ |
Construct Quad Tree 10.3% | MediumM | Solve→ |
Rotated Digits 10.3% | MediumM | Solve→ |
Largest Triangle Area 10.3% | EasyE | Solve→ |
Binary Tree Pruning 10.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Linked List Components 10.3% | MediumM | Solve→ |
Flipping an Image 10.3% | EasyE | Solve→ |
Robot Room Cleaner 10.3% | HardH | Solve→ |
Rectangle Overlap 10.3% | EasyE | Solve→ |
Shortest Path Visiting All Nodes 10.3% | HardH | Solve→ |
Leaf-Similar Trees 10.3% | EasyE | Solve→ |
Smallest Range II 10.3% | MediumM | Solve→ |
Knight Dialer 10.3% | MediumM | Solve→ |
Largest Perimeter Triangle 10.3% | EasyE | Solve→ |
Longest Arithmetic Subsequence 10.3% | MediumM | Solve→ |
Two City Scheduling 10.3% | MediumM | Solve→ |
Minimum Score Triangulation of Polygon 10.3% | MediumM | Solve→ |
Longest String Chain 10.3% | MediumM | Solve→ |
Last Substring in Lexicographical Order 10.3% | HardH | Solve→ |
Duplicate Zeros 10.3% | EasyE | Solve→ |
Design A Leaderboard 10.3% | MediumM | Solve→ |
Delete Nodes And Return Forest 10.3% | MediumM | Solve→ |
Maximum 69 Number 10.3% | EasyE | Solve→ |
Find the City With the Smallest Number of Neighbors at a Threshold Distance 10.3% | MediumM | Solve→ |
Sort Integers by The Number of 1 Bits 10.3% | EasyE | Solve→ |
Product of the Last K Numbers 10.3% | MediumM | Solve→ |
Design Underground System 10.3% | MediumM | Solve→ |
Destination City 10.3% | EasyE | Solve→ |
Water Bottles 10.3% | EasyE | Solve→ |
Count Good Triplets 10.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Deletions to Make Character Frequencies Unique 10.3% | MediumM | Solve→ |
Count of Matches in Tournament 10.3% | EasyE | Solve→ |
Construct the Lexicographically Largest Valid Sequence 10.3% | MediumM | Solve→ |
Check if One String Swap Can Make Strings Equal 10.3% | EasyE | Solve→ |
Check if the Sentence Is Pangram 10.3% | EasyE | Solve→ |
Substrings of Size Three with Distinct Characters 10.3% | EasyE | Solve→ |
Remove One Element to Make the Array Strictly Increasing 10.3% | EasyE | Solve→ |
Find the Minimum and Maximum Number of Nodes Between Critical Points 10.3% | MediumM | Solve→ |
Time Needed to Buy Tickets 10.3% | EasyE | Solve→ |
Largest Positive Integer That Exists With Its Negative 10.3% | EasyE | Solve→ |
Count Subarrays With Fixed Bounds 10.3% | HardH | Solve→ |
Sliding Subarray Beauty 10.3% | MediumM | Solve→ |
Extra Characters in a String 10.3% | MediumM | Solve→ |
Cache With Time Limit 10.3% | MediumM | Solve→ |
Counter II 10.3% | EasyE | Solve→ |
Painting the Walls 10.3% | HardH | Solve→ |
Count Pairs Whose Sum is Less than Target 10.3% | EasyE | Solve→ |
Count Subarrays Where Max Element Appears at Least K Times 10.3% | MediumM | Solve→ |
Minimum Number of Operations to Make Array XOR Equal to K 10.3% | MediumM | Solve→ |
Minimum Cost to Convert String I 10.3% | MediumM | Solve→ |
Count the Number of Complete Components 10.3% | MediumM | Solve→ |
Super Ugly Number 10.3% | MediumM | Solve→ |
Task Scheduler II 10.3% | MediumM | Solve→ |
Finding 3-Digit Even Numbers 10.3% | EasyE | Solve→ |
Water and Jug Problem 10.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Length of the Longest Subsequence That Sums to Target 10.3% | MediumM | Solve→ |
Find Servers That Handled Most Number of Requests 10.3% | HardH | Solve→ |
N-ary Tree Postorder Traversal 10.3% | EasyE | Solve→ |
Minimum Operations to Make All Array Elements Equal 10.3% | MediumM | Solve→ |
Longest Subarray With Maximum Bitwise AND 10.3% | MediumM | Solve→ |
Sort By 10.3% | EasyE | Solve→ |
Number of Good Ways to Split a String 10.3% | MediumM | Solve→ |
Largest Sum of Averages 10.3% | MediumM | Solve→ |
Minimum String Length After Removing Substrings 10.3% | EasyE | Solve→ |
The Maze 10.3% | MediumM | Solve→ |
Numbers With Same Consecutive Differences 10.3% | MediumM | Solve→ |
Minimum Subsequence in Non-Increasing Order 10.3% | EasyE | Solve→ |
Design Log Storage System 10.3% | MediumM | Solve→ |
Lexicographically Smallest Beautiful String 10.3% | HardH | Solve→ |
DI String Match 10.3% | EasyE | Solve→ |
Adjacent Increasing Subarrays Detection I 10.3% | EasyE | Solve→ |
Zigzag Iterator 10.3% | MediumM | Solve→ |
Find Score of an Array After Marking All Elements 10.3% | MediumM | Solve→ |
Shifting Letters II 10.3% | MediumM | Solve→ |
Rearrange Array to Maximize Prefix Score 10.3% | MediumM | Solve→ |
Employee Importance 10.3% | MediumM | Solve→ |
Find Users With Valid E-Mails 10.3% | EasyE | Solve→ |
Neighboring Bitwise XOR 10.3% | MediumM | Solve→ |
Most Profitable Path in a Tree 10.3% | MediumM | Solve→ |
Apply Operations to Make All Array Elements Equal to Zero 10.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Max Chunks To Make Sorted II 10.3% | HardH | Solve→ |
Design Excel Sum Formula 10.3% | HardH | Solve→ |
Count Univalue Subtrees 10.3% | MediumM | Solve→ |
Bitwise ORs of Subarrays 10.3% | MediumM | Solve→ |
Closest Prime Numbers in Range 10.3% | MediumM | Solve→ |
Teemo Attacking 10.3% | EasyE | Solve→ |
Number of Adjacent Elements With the Same Color 10.3% | MediumM | Solve→ |
Alternating Groups I 10.3% | EasyE | Solve→ |
Expression Add Operators 10.3% | HardH | Solve→ |
Count Subarrays With Score Less Than K 10.3% | HardH | Solve→ |
Find the Middle Index in Array 10.3% | EasyE | Solve→ |
Range Sum Query 2D - Mutable 10.3% | MediumM | Solve→ |
Number of Segments in a String 10.3% | EasyE | Solve→ |
Minimum Cuts to Divide a Circle 10.3% | EasyE | Solve→ |
Average of Levels in Binary Tree 10.3% | EasyE | Solve→ |
Shortest Distance to a Character 10.3% | EasyE | Solve→ |
Number of Islands II 10.3% | HardH | Solve→ |
Mirror Reflection 10.3% | MediumM | Solve→ |
Number of Pairs of Interchangeable Rectangles 10.3% | MediumM | Solve→ |
Minimum Operations to Reduce an Integer to 0 10.3% | MediumM | Solve→ |
Delete Characters to Make Fancy String 10.3% | EasyE | Solve→ |
Last Day Where You Can Still Cross 10.3% | HardH | Solve→ |
Maximum Unique Subarray Sum After Deletion 10.3% | EasyE | Solve→ |
Jump Game III 10.3% | MediumM | Solve→ |
A Number After a Double Reversal 10.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rearranging Fruits 10.3% | HardH | Solve→ |
Rectangle Area 10.3% | MediumM | Solve→ |
Minimum Operations to Convert All Elements to Zero 10.3% | MediumM | Solve→ |
Find Lucky Integer in an Array 10.3% | EasyE | Solve→ |
Distinct Subsequences II 10.3% | HardH | Solve→ |
Sort Matrix by Diagonals 10.3% | MediumM | Solve→ |
Minimum Operations to Equalize Binary String 10.3% | HardH | Solve→ |
Remove Boxes 10.3% | HardH | Solve→ |
Minimum Number of People to Teach 10.3% | MediumM | Solve→ |
Find the Minimum Amount of Time to Brew Potions 10.3% | MediumM | Solve→ |
Maximum Number of Distinct Elements After Operations 10.3% | MediumM | Solve→ |
Maximum Frequency of an Element After Performing Operations I 10.3% | MediumM | Solve→ |
Make Array Elements Equal to Zero 10.3% | EasyE | Solve→ |
The Two Sneaky Numbers of Digitville 10.3% | EasyE | Solve→ |
Find X-Sum of All K-Long Subarrays I 10.3% | EasyE | Solve→ |
Smallest Palindromic Rearrangement I 10.3% | MediumM | Solve→ |
Maximize the Minimum Powered City 10.3% | HardH | Solve→ |
Smallest Integer Divisible by K 10.3% | MediumM | Solve→ |
Count Partitions With Max-Min Difference at Most K 10.3% | MediumM | Solve→ |
Minimum Operations to Make Array Sum Divisible by K 10.3% | EasyE | Solve→ |
Count the Digits That Divide a Number 10.3% | EasyE | Solve→ |
Best Time to Buy and Sell Stock using Strategy 10.3% | MediumM | Solve→ |
Construct Product Matrix 10.3% | MediumM | Solve→ |
Delete Columns to Make Sorted II 10.3% | MediumM | Solve→ |
Paint House 10.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Partition Array Into Three Parts With Equal Sum 10.3% | EasyE | Solve→ |
Number of Ways to Paint N × 3 Grid 10.3% | HardH | Solve→ |
Construct the Minimum Bitwise Array I 10.3% | EasyE | Solve→ |
Split Array With Same Average 10.3% | HardH | Solve→ |
Minimize Maximum Pair Sum in Array 10.3% | MediumM | Solve→ |
Find Greatest Common Divisor of Array 10.3% | EasyE | Solve→ |
Largest Magic Square 10.3% | MediumM | Solve→ |
Smallest String Starting From Leaf 10.3% | MediumM | Solve→ |
Binary Gap 10.3% | EasyE | Solve→ |
Satisfiability of Equality Equations 10.3% | MediumM | Solve→ |
Minimum Swaps to Arrange a Binary Grid 10.3% | MediumM | Solve→ |
Check if Binary String Has at Most One Segment of Ones 10.3% | EasyE | Solve→ |
Find Unique Binary String 10.3% | MediumM | Solve→ |
Complement of Base 10 Integer 10.3% | EasyE | Solve→ |
Get Biggest Three Rhombus Sums in a Grid 10.3% | MediumM | Solve→ |
Maximum Non Negative Product in a Matrix 10.3% | MediumM | Solve→ |
Daily Leads and Partners 10.3% | EasyE | Solve→ |
XOR After Range Multiplication Queries I 10.3% | MediumM | Solve→ |
Largest Palindromic Number 10.3% | MediumM | Solve→ |
Minimum Cost to Make Array Equal 10.3% | HardH | Solve→ |
Closest Equal Element Queries 10.3% | MediumM | Solve→ |
Minimum Absolute Distance Between Mirror Pairs 10.3% | MediumM | Solve→ |
Two Furthest Houses With Different Colors 10.3% | EasyE | Solve→ |
Sum of Distances 10.3% | MediumM | Solve→ |
Maximum Score From Grid Operations 10.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Number of Jumps to Reach the Last Index 10.3% | MediumM | Solve→ |
Reshape the Matrix 10.3% | EasyE | Solve→ |
Pancake Sorting 10.3% | MediumM | Solve→ |
Total Waviness of Numbers in Range II 10.3% | HardH | Solve→ |
Maximum Total Subarray Value I 10.3% | MediumM | Solve→ |
Number of Strings That Appear as Substrings in Word 10.3% | EasyE | Solve→ |
Network Recovery Pathways 10.3% | HardH | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum II 10.3% | MediumM | Solve→ |
Sorted GCD Pair Queries 10.3% | HardH | Solve→ |
Maximum Product of Two Digits 10.3% | EasyE | Solve→ |
Smallest Missing Integer Greater Than Sequential Prefix Sum 10.3% | EasyE | Solve→ |
Graph Valid Tree 7.2% | MediumM | Solve→ |
Closest Binary Search Tree Value II 7.2% | HardH | Solve→ |
Maximum Product of Word Lengths 7.2% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 7.2% | MediumM | Solve→ |
Patching Array 7.2% | HardH | Solve→ |
Plus One Linked List 7.2% | MediumM | Solve→ |
Shuffle an Array 7.2% | MediumM | Solve→ |
Mini Parser 7.2% | MediumM | Solve→ |
Longest Absolute File Path 7.2% | MediumM | Solve→ |
Random Pick Index 7.2% | MediumM | Solve→ |
Convert a Number to Hexadecimal 7.2% | EasyE | Solve→ |
Strong Password Checker 7.2% | HardH | Solve→ |
Circular Array Loop 7.2% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements II 7.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Keyboard Row 7.2% | EasyE | Solve→ |
Find Bottom Left Tree Value 7.2% | MediumM | Solve→ |
Shopping Offers 7.2% | MediumM | Solve→ |
Strange Printer 7.2% | HardH | Solve→ |
My Calendar II 7.2% | MediumM | Solve→ |
Reaching Points 7.2% | HardH | Solve→ |
Design HashSet 7.2% | EasyE | Solve→ |
Count Unique Characters of All Substrings of a Given String 7.2% | HardH | Solve→ |
Super Egg Drop 7.2% | HardH | Solve→ |
Increasing Order Search Tree 7.2% | EasyE | Solve→ |
Regions Cut By Slashes 7.2% | MediumM | Solve→ |
Minimum Number of K Consecutive Bit Flips 7.2% | HardH | Solve→ |
Stream of Characters 7.2% | HardH | Solve→ |
Height Checker 7.2% | EasyE | Solve→ |
Sort the Matrix Diagonally 7.2% | MediumM | Solve→ |
Remove Zero Sum Consecutive Nodes from Linked List 7.2% | MediumM | Solve→ |
Three Consecutive Odds 7.2% | EasyE | Solve→ |
Kth Ancestor of a Tree Node 7.2% | HardH | Solve→ |
Path with Maximum Gold 7.2% | MediumM | Solve→ |
Check If It Is a Straight Line 7.2% | EasyE | Solve→ |
Report Contiguous Dates 7.2% | HardH | Solve→ |
Group the People Given the Group Size They Belong To 7.2% | MediumM | Solve→ |
Minimum Number of Steps to Make Two Strings Anagram 7.2% | MediumM | Solve→ |
Time Needed to Inform All Employees 7.2% | MediumM | Solve→ |
Maximum Score After Splitting a String 7.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Odd Numbers in an Interval Range 7.2% | EasyE | Solve→ |
Dot Product of Two Sparse Vectors 7.2% | MediumM | Solve→ |
Widest Vertical Area Between Two Points Containing No Points 7.2% | EasyE | Solve→ |
Merge In Between Linked Lists 7.2% | MediumM | Solve→ |
Get Maximum in Generated Array 7.2% | EasyE | Solve→ |
Determine if Two Strings Are Close 7.2% | MediumM | Solve→ |
Check If Two String Arrays are Equivalent 7.2% | EasyE | Solve→ |
Calculate Money in Leetcode Bank 7.2% | EasyE | Solve→ |
Process Tasks Using Servers 7.2% | MediumM | Solve→ |
Minimum Number of Moves to Seat Everyone 7.2% | EasyE | Solve→ |
Maximum Employees to Be Invited to a Meeting 7.2% | HardH | Solve→ |
Merge Nodes in Between Zeros 7.2% | MediumM | Solve→ |
Minimum Bit Flips to Convert Number 7.2% | EasyE | Solve→ |
Longest Path With Different Adjacent Characters 7.2% | HardH | Solve→ |
Decode the Message 7.2% | EasyE | Solve→ |
Longest Cycle in a Graph 7.2% | HardH | Solve→ |
Minimize Maximum of Array 7.2% | MediumM | Solve→ |
Difference Between Element Sum and Digit Sum of an Array 7.2% | EasyE | Solve→ |
Count the Number of Good Subarrays 7.2% | MediumM | Solve→ |
Maximum Subsequence Score 7.2% | MediumM | Solve→ |
Sleep 7.2% | EasyE | Solve→ |
Apply Transform Over Each Element in Array 7.2% | EasyE | Solve→ |
Number of Employees Who Met the Target 7.2% | EasyE | Solve→ |
Display the First Three Rows 7.2% | EasyE | Solve→ |
Find Words Containing Character 7.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Array End 7.2% | MediumM | Solve→ |
Group Sold Products By The Date 7.2% | EasyE | Solve→ |
Longest Turbulent Subarray 7.2% | MediumM | Solve→ |
Minimum Deletions to Make String Balanced 7.2% | MediumM | Solve→ |
Degree of an Array 7.2% | EasyE | Solve→ |
Dinner Plate Stacks 7.2% | HardH | Solve→ |
Maximize Score of Numbers in Ranges 7.2% | MediumM | Solve→ |
Check if Two Chessboard Squares Have the Same Color 7.2% | EasyE | Solve→ |
Count Nodes With the Highest Score 7.2% | MediumM | Solve→ |
Robot Collisions 7.2% | HardH | Solve→ |
Prime Palindrome 7.2% | MediumM | Solve→ |
Maximal Score After Applying K Operations 7.2% | MediumM | Solve→ |
Split a String Into the Max Number of Unique Substrings 7.2% | MediumM | Solve→ |
Sort the People 7.2% | EasyE | Solve→ |
Finding the Users Active Minutes 7.2% | MediumM | Solve→ |
Grid Game 7.2% | MediumM | Solve→ |
Largest Combination With Bitwise AND Greater Than Zero 7.2% | MediumM | Solve→ |
Flip Columns For Maximum Number of Equal Rows 7.2% | MediumM | Solve→ |
Maximum Number of Removable Characters 7.2% | MediumM | Solve→ |
Minimum Operations to Make a Subsequence 7.2% | HardH | Solve→ |
Find Building Where Alice and Bob Can Meet 7.2% | HardH | Solve→ |
All People Report to the Given Manager 7.2% | MediumM | Solve→ |
Count Ways To Build Good Strings 7.2% | MediumM | Solve→ |
Construct K Palindrome Strings 7.2% | MediumM | Solve→ |
Minimum Cost to Make at Least One Valid Path in a Grid 7.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Paint House IV 7.2% | MediumM | Solve→ |
Maximum Ascending Subarray Sum 7.2% | EasyE | Solve→ |
Tuple with Same Product 7.2% | MediumM | Solve→ |
Find the Number of Distinct Colors Among the Balls 7.2% | MediumM | Solve→ |
Stock Price Fluctuation 7.2% | MediumM | Solve→ |
Minimum Operations to Exceed Threshold Value II 7.2% | MediumM | Solve→ |
Escape a Large Maze 7.2% | HardH | Solve→ |
Minimum Score of a Path Between Two Cities 7.2% | MediumM | Solve→ |
Divide Nodes Into the Maximum Number of Groups 7.2% | HardH | Solve→ |
Minimum Operations to Make the Array Increasing 7.2% | EasyE | Solve→ |
Rank Teams by Votes 7.2% | MediumM | Solve→ |
Minimum Recolors to Get K Consecutive Black Blocks 7.2% | EasyE | Solve→ |
Sliding Puzzle 7.2% | HardH | Solve→ |
N-ary Tree Preorder Traversal 7.2% | EasyE | Solve→ |
Divide Array Into Equal Pairs 7.2% | EasyE | Solve→ |
Parallel Courses 7.2% | MediumM | Solve→ |
Data Stream as Disjoint Intervals 7.2% | HardH | Solve→ |
Find the Kth Smallest Sum of a Matrix With Sorted Rows 7.2% | HardH | Solve→ |
Check if Grid can be Cut into Sections 7.2% | MediumM | Solve→ |
Count of Substrings Containing Every Vowel and K Consonants II 7.2% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet II 7.2% | MediumM | Solve→ |
Binary Tree Tilt 7.2% | EasyE | Solve→ |
String Without AAA or BBB 7.2% | MediumM | Solve→ |
Finding Pairs With a Certain Sum 7.2% | MediumM | Solve→ |
Count the Number of Ideal Arrays 7.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Push Dominoes 7.2% | MediumM | Solve→ |
Find Minimum Time to Reach Last Room II 7.2% | MediumM | Solve→ |
Count Collisions of Monkeys on a Polygon 7.2% | MediumM | Solve→ |
Max Pair Sum in an Array 7.2% | EasyE | Solve→ |
Find the Lexicographically Largest String From the Box I 7.2% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency II 7.2% | HardH | Solve→ |
Maximum Difference Between Adjacent Elements in a Circular Array 7.2% | EasyE | Solve→ |
Surface Area of 3D Shapes 7.2% | EasyE | Solve→ |
Check if All Characters Have Equal Number of Occurrences 7.2% | EasyE | Solve→ |
Check if All the Integers in a Range Are Covered 7.2% | EasyE | Solve→ |
Count Nodes Equal to Average of Subtree 7.2% | MediumM | Solve→ |
Longest Binary Subsequence Less Than or Equal to K 7.2% | MediumM | Solve→ |
Minimum Distance Between BST Nodes 7.2% | EasyE | Solve→ |
Find the K-th Character in String Game II 7.2% | HardH | Solve→ |
Minimum Cost to Move Chips to The Same Position 7.2% | EasyE | Solve→ |
Reschedule Meetings for Maximum Free Time II 7.2% | MediumM | Solve→ |
The Earliest and Latest Rounds Where Players Compete 7.2% | HardH | Solve→ |
Minimize Malware Spread 7.2% | HardH | Solve→ |
Construct the Rectangle 7.2% | EasyE | Solve→ |
Check Balanced String 7.2% | EasyE | Solve→ |
Longest Non-decreasing Subarray From Two Arrays 7.2% | MediumM | Solve→ |
Maximum Depth of N-ary Tree 7.2% | EasyE | Solve→ |
Maximum Fruits Harvested After at Most K Steps 7.2% | HardH | Solve→ |
Patients With a Condition 7.2% | EasyE | Solve→ |
Analyze Organization Hierarchy 7.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Matchsticks to Square 7.2% | MediumM | Solve→ |
Count Salary Categories 7.2% | MediumM | Solve→ |
Minimum Time Visiting All Points 7.2% | EasyE | Solve→ |
Maximum Number of Occurrences of a Substring 7.2% | MediumM | Solve→ |
Find Closest Person 7.2% | EasyE | Solve→ |
Find Most Frequent Vowel and Consonant 7.2% | EasyE | Solve→ |
Maximum Number of Words You Can Type 7.2% | EasyE | Solve→ |
Unique Email Addresses 7.2% | EasyE | Solve→ |
Ugly Number III 7.2% | MediumM | Solve→ |
Alternating Digit Sum 7.2% | EasyE | Solve→ |
Friends Of Appropriate Ages 7.2% | MediumM | Solve→ |
Binary Tree Coloring Game 7.2% | MediumM | Solve→ |
Maximum Frequency of an Element After Performing Operations II 7.2% | HardH | Solve→ |
Smallest Number With All Set Bits 7.2% | EasyE | Solve→ |
Number of Good Paths 7.2% | HardH | Solve→ |
Maximum and Minimum Sums of at Most Size K Subsequences 7.2% | MediumM | Solve→ |
Minimum Time to Make Rope Colorful 7.2% | MediumM | Solve→ |
Power Grid Maintenance 7.2% | MediumM | Solve→ |
Count Operations to Obtain Zero 7.2% | EasyE | Solve→ |
Minimum Number of Operations to Make All Array Elements Equal to 1 7.2% | MediumM | Solve→ |
Maximum Number of Operations to Move Ones to the End 7.2% | MediumM | Solve→ |
Find Minimum Operations to Make All Elements Divisible by Three 7.2% | EasyE | Solve→ |
Paths in Matrix Whose Sum Is Divisible by K 7.2% | HardH | Solve→ |
Car Fleet II 7.2% | HardH | Solve→ |
Maximum Running Time of N Computers 7.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sign of the Product of an Array 7.2% | EasyE | Solve→ |
Count Largest Group 7.2% | EasyE | Solve→ |
Find Followers Count 7.2% | EasyE | Solve→ |
Perfect Rectangle 7.2% | HardH | Solve→ |
Smallest Good Base 7.2% | HardH | Solve→ |
Count Symmetric Integers 7.2% | EasyE | Solve→ |
Divide an Array Into Subarrays With Minimum Cost II 7.2% | HardH | Solve→ |
Non-negative Integers without Consecutive Ones 7.2% | HardH | Solve→ |
3Sum With Multiplicity 7.2% | MediumM | Solve→ |
Minimum Edge Reversals So Every Node Is Reachable 7.2% | HardH | Solve→ |
Minimum Absolute Difference in BST 7.2% | EasyE | Solve→ |
Longest Balanced Subarray II 7.2% | HardH | Solve→ |
Happy Students 7.2% | MediumM | Solve→ |
Binary Number with Alternating Bits 7.2% | EasyE | Solve→ |
Special Positions in a Binary Matrix 7.2% | EasyE | Solve→ |
Minimum Number of Flips to Make the Binary String Alternating 7.2% | MediumM | Solve→ |
Merge BSTs to Create Single BST 7.2% | HardH | Solve→ |
Find All Possible Stable Binary Arrays II 7.2% | HardH | Solve→ |
Maximize Spanning Tree Stability with Upgrades 7.2% | HardH | Solve→ |
Minimum Number of Seconds to Make Mountain Height Zero 7.2% | MediumM | Solve→ |
Fancy Sequence 7.2% | HardH | Solve→ |
Largest Submatrix With Rearrangements 7.2% | MediumM | Solve→ |
Grid Teleportation Traversal 7.2% | MediumM | Solve→ |
Maximum Amount of Money Robot Can Earn 7.2% | MediumM | Solve→ |
Maximum Walls Destroyed by Robots 7.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
XOR After Range Multiplication Queries II 7.2% | HardH | Solve→ |
Minimum Deletions to Make Array Divisible 7.2% | HardH | Solve→ |
Find Mode in Binary Search Tree 7.2% | EasyE | Solve→ |
Reverse Only Letters 7.2% | EasyE | Solve→ |
Shortest Distance to Target String in a Circular Array 7.2% | EasyE | Solve→ |
Subtract the Product and Sum of Digits of an Integer 7.2% | EasyE | Solve→ |
Minimum Operations to Make a Uni-Value Grid 7.2% | MediumM | Solve→ |
Score After Flipping Matrix 7.2% | MediumM | Solve→ |
Jump Game IX 7.2% | MediumM | Solve→ |
Minimum Jumps to Reach End via Prime Teleportation 7.2% | MediumM | Solve→ |
Parallel Courses II 7.2% | HardH | Solve→ |
Minimum Swaps to Group All 1's Together 7.2% | MediumM | Solve→ |
Jump Game V 7.2% | HardH | Solve→ |
Longest Common Suffix Queries 7.2% | HardH | Solve→ |
Odd Even Jump 7.2% | HardH | Solve→ |
Minimum Number Game 7.2% | EasyE | Solve→ |
Left and Right Sum Differences 7.2% | EasyE | Solve→ |
Bag of Tokens 7.2% | MediumM | Solve→ |
Number of Ways to Assign Edge Weights I 7.2% | MediumM | Solve→ |
Maximum Building Height 7.2% | HardH | Solve→ |
Maximum Number of Balloons 7.2% | EasyE | Solve→ |
Find the Safest Path in a Grid 7.2% | MediumM | Solve→ |
Minimum Adjacent Swaps for K Consecutive Ones 7.2% | HardH | Solve→ |
Path Existence Queries in a Graph I 7.2% | MediumM | Solve→ |
Maximum Count of Positive Integer and Negative Integer 7.2% | EasyE | 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 7.2% | HardH | Solve→ |
Matrix Block Sum 7.2% | MediumM | Solve→ |
Number of Unique XOR Triplets II 7.2% | MediumM | Solve→ |
Stone Game III 7.2% | HardH | Solve→ |
Remove Methods From Project 7.2% | MediumM | Solve→ |
Find the Lexicographically Smallest Valid Sequence 7.2% | MediumM | Solve→ |
Longest Substring with At Most Two Distinct Characters 5% | MediumM | Solve→ |
Hamming Distance 5% | EasyE | Solve→ |
Validate IP Address 5% | MediumM | Solve→ |
Magical String 5% | MediumM | Solve→ |
Beautiful Arrangement 5% | MediumM | Solve→ |
Erect the Fence 5% | HardH | Solve→ |
Print Binary Tree 5% | MediumM | Solve→ |
Longest Word in Dictionary 5% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 5% | MediumM | Solve→ |
Letter Case Permutation 5% | MediumM | Solve→ |
Sum of Distances in Tree 5% | HardH | Solve→ |
Similar String Groups 5% | HardH | Solve→ |
Longest Mountain in Array 5% | MediumM | Solve→ |
Advantage Shuffle 5% | MediumM | Solve→ |
Decoded String at Index 5% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 5% | MediumM | Solve→ |
Beautiful Array 5% | MediumM | Solve→ |
Flip Equivalent Binary Trees 5% | MediumM | Solve→ |
Check Completeness of a Binary Tree 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Enclaves 5% | MediumM | Solve→ |
Meeting Scheduler 5% | MediumM | Solve→ |
Lowest Common Ancestor of Deepest Leaves 5% | MediumM | Solve→ |
Element Appearing More Than 25% In Sorted Array 5% | EasyE | Solve→ |
Number of Days Between Two Dates 5% | EasyE | Solve→ |
Reverse Substrings Between Each Pair of Parentheses 5% | MediumM | Solve→ |
Minimum Moves to Reach Target Score 5% | MediumM | Solve→ |
Path with Maximum Probability 5% | MediumM | Solve→ |
Number of Closed Islands 5% | MediumM | Solve→ |
XOR Queries of a Subarray 5% | MediumM | Solve→ |
Longest ZigZag Path in a Binary Tree 5% | MediumM | Solve→ |
Linked List in Binary Tree 5% | MediumM | Solve→ |
Diagonal Traverse II 5% | MediumM | Solve→ |
Minimum Difference Between Largest and Smallest Value in Three Moves 5% | MediumM | Solve→ |
String Compression II 5% | HardH | Solve→ |
Minimum Suffix Flips 5% | MediumM | Solve→ |
Make The String Great 5% | EasyE | Solve→ |
Maximum Number of Coins You Can Get 5% | MediumM | Solve→ |
Sum of All Odd Length Subarrays 5% | EasyE | Solve→ |
Special Array With X Elements Greater Than or Equal X 5% | EasyE | Solve→ |
Maximum Repeating Substring 5% | EasyE | Solve→ |
Minimum Number of Removals to Make Mountain Array 5% | HardH | Solve→ |
Maximum Score From Removing Substrings 5% | MediumM | Solve→ |
Sorting the Sentence 5% | EasyE | Solve→ |
Minimum Non-Zero Product of the Array Elements 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Work Sessions to Finish the Tasks 5% | MediumM | Solve→ |
Convert 1D Array Into 2D Array 5% | EasyE | Solve→ |
Remove Digit From Number to Maximize Result 5% | EasyE | Solve→ |
Minimum Number of Operations to Make Arrays Similar 5% | HardH | Solve→ |
Split Message Based on Limit 5% | HardH | Solve→ |
Take Gifts From the Richest Pile 5% | EasyE | Solve→ |
The Number of Beautiful Subsets 5% | MediumM | Solve→ |
Function Composition 5% | EasyE | Solve→ |
Buy Two Chocolates 5% | EasyE | Solve→ |
Minimum Cost Walk in Weighted Graph 5% | HardH | Solve→ |
Special Array II 5% | MediumM | Solve→ |
Find the Number of Good Pairs II 5% | MediumM | Solve→ |
Minimum Interval to Include Each Query 5% | HardH | Solve→ |
Minimum Cost to Convert String II 5% | HardH | Solve→ |
Check if the Rectangle Corner Is Reachable 5% | HardH | Solve→ |
HTML Entity Parser 5% | MediumM | Solve→ |
Find Elements in a Contaminated Binary Tree 5% | MediumM | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 5% | EasyE | Solve→ |
Lexicographically Smallest String After Substring Operation 5% | MediumM | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 5% | MediumM | Solve→ |
Count the Number of Inversions 5% | HardH | Solve→ |
Uncommon Words from Two Sentences 5% | EasyE | Solve→ |
Two Sum III - Data structure design 5% | EasyE | Solve→ |
Encrypt and Decrypt Strings 5% | HardH | Solve→ |
Design Circular Deque 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimize Max Distance to Gas Station 5% | HardH | Solve→ |
Sentence Similarity III 5% | MediumM | Solve→ |
Number of Changing Keys 5% | EasyE | Solve→ |
Minimum Insertions to Balance a Parentheses String 5% | MediumM | Solve→ |
Word Pattern II 5% | MediumM | Solve→ |
Divide Intervals Into Minimum Number of Groups 5% | MediumM | Solve→ |
Random Pick with Blacklist 5% | HardH | Solve→ |
Complete Binary Tree Inserter 5% | MediumM | Solve→ |
Minimum Division Operations to Make Array Non Decreasing 5% | MediumM | Solve→ |
The Most Recent Orders for Each Product 5% | MediumM | Solve→ |
Find if Array Can Be Sorted 5% | MediumM | Solve→ |
Simple Bank System 5% | MediumM | Solve→ |
Prime Subtraction Operation 5% | MediumM | Solve→ |
Length of the Longest Alphabetical Continuous Substring 5% | MediumM | Solve→ |
The Maze II 5% | MediumM | Solve→ |
Reshape Data: Pivot 5% | EasyE | Solve→ |
Minimum Time to Visit a Cell In a Grid 5% | HardH | Solve→ |
Valid Arrangement of Pairs 5% | HardH | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 5% | EasyE | Solve→ |
Minimum Operations to Make Array Equal to Target 5% | HardH | Solve→ |
Maximum Number of K-Divisible Components 5% | HardH | Solve→ |
Maximum Strength of K Disjoint Subarrays 5% | HardH | Solve→ |
Count Collisions on a Road 5% | MediumM | Solve→ |
Button with Longest Push Time 5% | EasyE | Solve→ |
Largest Element in an Array after Merge Operations 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Time to Collect All Apples in a Tree 5% | MediumM | Solve→ |
Maximum XOR After Operations 5% | MediumM | Solve→ |
Maximum Number of Fish in a Grid 5% | MediumM | Solve→ |
Maximum Possible Number by Binary Concatenation 5% | MediumM | Solve→ |
Range Addition 5% | MediumM | Solve→ |
Check if Matrix Is X-Matrix 5% | EasyE | Solve→ |
Select K Disjoint Special Substrings 5% | MediumM | Solve→ |
Sentence Similarity II 5% | MediumM | Solve→ |
Find Common Elements Between Two Arrays 5% | EasyE | Solve→ |
Count Days Without Meetings 5% | MediumM | Solve→ |
Minimum Index of a Valid Split 5% | MediumM | Solve→ |
Maximum Score of Non-overlapping Intervals 5% | HardH | Solve→ |
Remove Stones to Minimize the Total 5% | MediumM | Solve→ |
Number of Subarrays That Match a Pattern I 5% | MediumM | Solve→ |
Describe the Painting 5% | MediumM | Solve→ |
Zuma Game 5% | HardH | Solve→ |
Merge Two 2D Arrays by Summing Values 5% | EasyE | Solve→ |
Pizza Toppings Cost Analysis 5% | MediumM | Solve→ |
Maximum Profit From Trading Stocks 5% | MediumM | Solve→ |
Minimum Number of Swaps to Make the Binary String Alternating 5% | MediumM | Solve→ |
Minimum Amount of Damage Dealt to Bob 5% | HardH | Solve→ |
Painting a Grid With Three Different Colors 5% | HardH | Solve→ |
Manhattan Distances of All Arrangements of Pieces 5% | HardH | Solve→ |
Integer Replacement 5% | MediumM | Solve→ |
Tiling a Rectangle with the Fewest Squares 5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Beautiful Splits in an Array 5% | MediumM | Solve→ |
Binary Tree Longest Consecutive Sequence 5% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet I 5% | EasyE | Solve→ |
Zero Array Transformation III 5% | MediumM | Solve→ |
Year on Year Growth Rate 5% | HardH | Solve→ |
Count the Number of Arrays with K Matching Adjacent Elements 5% | HardH | Solve→ |
Delete Greatest Value in Each Row 5% | EasyE | Solve→ |
Longest Subsequence Repeated k Times 5% | HardH | Solve→ |
Longest Nice Substring 5% | EasyE | Solve→ |
Longest Common Prefix Between Adjacent Strings After Removals 5% | MediumM | Solve→ |
Kth Smallest Instructions 5% | HardH | Solve→ |
Maximum Beauty of an Array After Applying Operation 5% | MediumM | Solve→ |
Find Special Substring of Length K 5% | EasyE | Solve→ |
Game Play Analysis II 5% | EasyE | Solve→ |
Check Knight Tour Configuration 5% | MediumM | Solve→ |
Maximum Number of Visible Points 5% | HardH | Solve→ |
Minimize the Maximum Adjacent Element Difference 5% | HardH | Solve→ |
Inorder Successor in BST 5% | MediumM | Solve→ |
Maximum Size of a Set After Removals 5% | MediumM | Solve→ |
Maximum Difference by Remapping a Digit 5% | EasyE | Solve→ |
Find Valid Pair of Adjacent Digits in String 5% | EasyE | Solve→ |
Collecting Chocolates 5% | MediumM | Solve→ |
Number of Ways to Form a Target String Given a Dictionary 5% | HardH | Solve→ |
Remove Duplicates From an Unsorted Linked List 5% | MediumM | Solve→ |
Alice and Bob Playing Flower Game 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Balanced K-Factor Decomposition 5% | MediumM | Solve→ |
Find the Largest Palindrome Divisible by K 5% | HardH | Solve→ |
Reshape Data: Melt 5% | EasyE | Solve→ |
Sort the Students by Their Kth Score 5% | MediumM | Solve→ |
Maximize Greatness of an Array 5% | MediumM | Solve→ |
Water Bottles II 5% | MediumM | Solve→ |
Count Substrings That Can Be Rearranged to Contain a String I 5% | MediumM | Solve→ |
Sort Items by Groups Respecting Dependencies 5% | HardH | Solve→ |
Minimum Number of Chairs in a Waiting Room 5% | EasyE | Solve→ |
Minimum Operations to Write the Letter Y on a Grid 5% | MediumM | Solve→ |
Count Number of Ways to Place Houses 5% | MediumM | Solve→ |
Two-Letter Card Game 5% | MediumM | Solve→ |
Sequence Reconstruction 5% | MediumM | Solve→ |
Maximum Value after Insertion 5% | MediumM | Solve→ |
Delete Duplicate Folders in System 5% | HardH | Solve→ |
Longest Subsequence With Limited Sum 5% | EasyE | Solve→ |
Sum of Perfect Square Ancestors 5% | HardH | Solve→ |
Consecutive Characters 5% | EasyE | Solve→ |
Non-decreasing Subsequences 5% | MediumM | Solve→ |
Stable Subarrays With Equal Boundary and Interior Sum 5% | MediumM | Solve→ |
Count Unguarded Cells in the Grid 5% | MediumM | Solve→ |
Wiggle Sort 5% | MediumM | Solve→ |
Minimum Unique Word Abbreviation 5% | HardH | Solve→ |
Minimum Time for K Connected Components 5% | MediumM | Solve→ |
Minimum Operations to Make Array Equal 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Partitions with Even Sum Difference 5% | EasyE | Solve→ |
Shortest Distance After Road Addition Queries I 5% | MediumM | Solve→ |
Count the Number of Computer Unlocking Permutations 5% | MediumM | Solve→ |
Find the Array Concatenation Value 5% | EasyE | Solve→ |
Binary Prefix Divisible By 5 5% | EasyE | Solve→ |
Operations on Tree 5% | MediumM | Solve→ |
Maximize Cyclic Partition Score 5% | HardH | Solve→ |
Implement Router 5% | MediumM | Solve→ |
Range Addition II 5% | EasyE | Solve→ |
Delete Columns to Make Sorted III 5% | HardH | Solve→ |
Four Divisors 5% | MediumM | Solve→ |
Lucky Numbers in a Matrix 5% | EasyE | Solve→ |
Sparse Matrix Multiplication 5% | MediumM | Solve→ |
Smallest Subtree with all the Deepest Nodes 5% | MediumM | Solve→ |
Restore the Array From Adjacent Pairs 5% | MediumM | Solve→ |
Find Original Array From Doubled Array 5% | MediumM | Solve→ |
Number of Substrings With Only 1s 5% | MediumM | Solve→ |
Promise Time Limit 5% | MediumM | Solve→ |
Maximum Sum of Three Numbers Divisible by Three 5% | MediumM | Solve→ |
Non-decreasing Array 5% | MediumM | Solve→ |
Implement Trie II (Prefix Tree) 5% | MediumM | Solve→ |
Minimize the Maximum of Two Arrays 5% | MediumM | Solve→ |
Minimum Value to Get Positive Step by Step Sum 5% | EasyE | Solve→ |
Frog Jump II 5% | MediumM | Solve→ |
Design Spreadsheet 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Array Nesting 5% | MediumM | Solve→ |
Max Sum of Rectangle No Larger Than K 5% | HardH | Solve→ |
Vowels Game in a String 5% | MediumM | Solve→ |
Minimum Addition to Make Integer Beautiful 5% | MediumM | Solve→ |
Minimum Hours of Training to Win a Competition 5% | EasyE | Solve→ |
Ant on the Boundary 5% | EasyE | Solve→ |
Maximum Number of Points From Grid Queries 5% | HardH | Solve→ |
Find Maximum Value in a Constrained Sequence 5% | MediumM | Solve→ |
Unique Morse Code Words 5% | EasyE | Solve→ |
Longest Univalue Path 5% | MediumM | Solve→ |
Minimum Seconds to Equalize a Circular Array 5% | MediumM | Solve→ |
Number Complement 5% | EasyE | Solve→ |
Longest Palindrome by Concatenating Two Letter Words 5% | MediumM | Solve→ |
Split Strings by Separator 5% | EasyE | Solve→ |
Tallest Billboard 5% | HardH | Solve→ |
Word Abbreviation 5% | HardH | Solve→ |
Find Product Recommendation Pairs 5% | MediumM | Solve→ |
Median Employee Salary 5% | HardH | Solve→ |
Minimum Changes To Make Alternating Binary String 5% | EasyE | Solve→ |
Missing Number In Arithmetic Progression 5% | EasyE | Solve→ |
Find All Possible Stable Binary Arrays I 5% | MediumM | Solve→ |
Minimum Subarray Length With Distinct Sum At Least K 5% | MediumM | Solve→ |
Sum of Variable Length Subarrays 5% | EasyE | Solve→ |
Maximum Number of Weeks for Which You Can Work 5% | MediumM | Solve→ |
Minimum Impossible OR 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Absolute Difference in Sliding Submatrix 5% | MediumM | Solve→ |
Exam Room 5% | MediumM | Solve→ |
Count Good Meals 5% | MediumM | Solve→ |
Equal Sum Grid Partition I 5% | MediumM | Solve→ |
Count Submatrices With Equal Frequency of X and Y 5% | MediumM | Solve→ |
Design Movie Rental System 5% | HardH | Solve→ |
Matrix Similarity After Cyclic Shifts 5% | EasyE | Solve→ |
Add Two Promises 5% | EasyE | Solve→ |
Check if Strings Can be Made Equal With Operations II 5% | MediumM | Solve→ |
Lexicographically Smallest Generated String 5% | HardH | Solve→ |
Stone Game 5% | MediumM | Solve→ |
Final Element After Subarray Deletions 5% | MediumM | Solve→ |
The Time When the Network Becomes Idle 5% | MediumM | Solve→ |
Minimum Distance Between Three Equal Elements I 5% | EasyE | Solve→ |
Minimum Distance Between Three Equal Elements II 5% | MediumM | Solve→ |
Properties Graph 5% | MediumM | Solve→ |
Final Array State After K Multiplication Operations II 5% | HardH | Solve→ |
Minimum Total Distance Traveled 5% | HardH | Solve→ |
Maximize the Confusion of an Exam 5% | MediumM | Solve→ |
Largest Color Value in a Directed Graph 5% | HardH | Solve→ |
Words Within Two Edits of Dictionary 5% | MediumM | Solve→ |
Put Boxes Into the Warehouse I 5% | MediumM | Solve→ |
Number of Subarrays With LCM Equal to K 5% | MediumM | Solve→ |
Minimum Cost to Split into Ones 5% | MediumM | Solve→ |
Jump Game VI 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Design Skiplist 5% | HardH | Solve→ |
Cyclically Rotating a Grid 5% | MediumM | Solve→ |
Minimum Cost to Buy Apples II 5% | HardH | Solve→ |
Smallest Index With Equal Value 5% | EasyE | Solve→ |
Sum of Digits of String After Convert 5% | EasyE | Solve→ |
K-Similar Strings 5% | HardH | Solve→ |
Student Attendance Record I 5% | EasyE | Solve→ |
Find the Distinct Difference Array 5% | EasyE | Solve→ |
Binary Trees With Factors 5% | MediumM | Solve→ |
Score of Parentheses 5% | MediumM | Solve→ |
Maximum Total Subarray Value II 5% | HardH | Solve→ |
Build an Array With Stack Operations 5% | MediumM | Solve→ |
Find Mirror Score of a String 5% | MediumM | Solve→ |
Kth Smallest Number in Multiplication Table 5% | HardH | Solve→ |
Number of Ways to Assign Edge Weights II 5% | HardH | Solve→ |
Maximize Sum of Device Ratings 5% | MediumM | Solve→ |
Find Minimum Cost to Remove Array Elements 5% | MediumM | Solve→ |
Maximize Sum Of Array After K Negations 5% | EasyE | Solve→ |
Number of Unique Good Subsequences 5% | HardH | Solve→ |
Number of ZigZag Arrays II 5% | HardH | Solve→ |
Collect Coins in a Tree 5% | HardH | Solve→ |
X of a Kind in a Deck of Cards 5% | EasyE | Solve→ |
First and Last Call On the Same Day 5% | HardH | Solve→ |
Good Subsequence Queries 5% | HardH | Solve→ |
Maximum Area of Longest Diagonal Rectangle 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Subarrays With Majority Element II 5% | HardH | Solve→ |
Count Numbers with Unique Digits 5% | MediumM | Solve→ |
Design Authentication Manager 5% | MediumM | Solve→ |
Decode Ways II 5% | HardH | Solve→ |
Remove Max Number of Edges to Keep Graph Fully Traversable 5% | HardH | Solve→ |
Number of Paths with Max Score 5% | HardH | Solve→ |
Count Sub Islands 5% | MediumM | Solve→ |
Shortest Path to Get All Keys 5% | HardH | Solve→ |
Maximum White Tiles Covered by a Carpet 5% | MediumM | Solve→ |
Wiggle Subsequence 5% | MediumM | Solve→ |
Race Car 5% | HardH | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum I 5% | EasyE | Solve→ |
Long Pressed Name 5% | EasyE | Solve→ |
Get the Maximum Score 5% | HardH | Solve→ |
Check if a String Is an Acronym of Words 5% | EasyE | Solve→ |
Path Existence Queries in a Graph II 5% | HardH | Solve→ |
Total Distance Traveled 5% | EasyE | Solve→ |
Second Minimum Time to Reach Destination 5% | HardH | Solve→ |
Find the Number of Subsequences With Equal GCD 5% | HardH | Solve→ |
Market Analysis II 5% | HardH | Solve→ |
Three Divisors 5% | EasyE | Solve→ |
1-bit and 2-bit Characters 5% | EasyE | Solve→ |
Minimize Deviation in Array 5% | HardH | Solve→ |
Couples Holding Hands 5% | HardH | Solve→ |
Split Array into Consecutive Subsequences 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximize Active Section with Trade II 5% | HardH | Solve→ |
Second Minimum Node In a Binary Tree 5% | EasyE | Solve→ |
Number of Unique XOR Triplets I 5% | MediumM | Solve→ |
Odd String Difference 5% | EasyE | Solve→ |
Find the Power of K-Size Subarrays I 5% | MediumM | Solve→ |
Check Distances Between Same Letters 5% | EasyE | Solve→ |
Longest Increasing Subsequence II 5% | HardH | Solve→ |
Maximum Product of First and Last Elements of a Subsequence 5% | MediumM | Solve→ |
Minimum Cost to Convert String III 5% | HardH | Solve→ |
Univalued Binary Tree 5% | EasyE | Solve→ |
Minimum Swaps to Make Strings Equal 5% | MediumM | Solve→ |
Lexicographically Smallest Palindrome 5% | EasyE | Solve→ |
Widest Possible Fence 5% | MediumM | Solve→ |
Smallest String With Swaps 5% | MediumM | Solve→ |
Find Missing Elements 5% | EasyE | Solve→ |
Minimum Moves to Spread Stones Over Grid 5% | MediumM | Solve→ |
Divide Chocolate 5% | HardH | Solve→ |
Count Prefix and Suffix Pairs I 5% | EasyE | Solve→ |
Minimum Total Cost to Make Arrays Unequal 5% | HardH | Solve→ |
Smallest Divisible Digit Product II 5% | HardH | Solve→ |
Sum Multiples 5% | EasyE | Solve→ |
Range Sum Query - Mutable 5% | MediumM | Solve→ |
Make K-Subarray Sums Equal 5% | MediumM | Solve→ |
Video Stitching 5% | MediumM | Solve→ |
Block Placement Queries 5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Array Pairs Divisible by K 5% | HardH | Solve→ |
Maximum Substrings With Distinct Start 5% | MediumM | Solve→ |
Concatenate Array With Reverse 5% | EasyE | Solve→ |
Memoize 5% | MediumM | Solve→ |
Range Frequency Queries 5% | MediumM | Solve→ |
Design Exam Scores Tracker 5% | MediumM | Solve→ |
Count Anagrams 5% | HardH | Solve→ |
Longest Substring of One Repeating Character 5% | HardH | Solve→ |
Smallest Divisible Digit Product I 5% | EasyE | Solve→ |
Maximum Compatibility Score Sum 5% | MediumM | Solve→ |
Count Good Triplets in an Array 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 Amazon?
Our current Amazon practice dataset contains 2011 tagged coding problems, including Two Sum, LRU Cache, Trapping Rain Water. The difficulty breakdown is 536 Easy, 1087 Medium, and 388 Hard problems.
How should I prepare for a Amazon coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Amazon interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Amazon coding interviews?
Based on our data, Amazon interviews include 536 Easy (27%), 1087 Medium (54%), and 388 Hard (19%) problems.
Ready to ace your Amazon interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required