Meta LeetCode Interview Questions
Practice 1399 coding problems currently tagged to Meta. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
427 Easy
763 Medium
209 Hard
Top Topics at Meta
Ace your Meta interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Meta LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Minimum Remove to Make Valid Parentheses 100% | MediumM | Solve→ |
Valid Word Abbreviation 96.8% | EasyE | Solve→ |
Valid Palindrome II 95.1% | EasyE | Solve→ |
Binary Tree Vertical Order Traversal 93.4% | MediumM | Solve→ |
Kth Largest Element in an Array 93.3% | MediumM | Solve→ |
Two Sum 90.2% | EasyE | Solve→ |
Basic Calculator II 89.3% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree III 88.5% | MediumM | Solve→ |
Nested List Weight Sum 87.9% | MediumM | Solve→ |
Random Pick with Weight 87.7% | MediumM | Solve→ |
Subarray Sum Equals K 87.2% | MediumM | Solve→ |
Diameter of Binary Tree 86.8% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree 86.4% | MediumM | Solve→ |
Merge Sorted Array 86.3% | EasyE | Solve→ |
Find Peak Element 85.8% | MediumM | Solve→ |
Binary Tree Right Side View 85.4% | MediumM | Solve→ |
Merge Intervals 84.6% | MediumM | Solve→ |
Pow(x, n) 84.1% | MediumM | Solve→ |
Simplify Path 83.7% | MediumM | Solve→ |
Valid Palindrome 82.6% | EasyE | Solve→ |
Buildings With an Ocean View 82.6% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 82.2% | EasyE | Solve→ |
Top K Frequent Elements 81.3% | MediumM | Solve→ |
Shortest Path in Binary Matrix 80.9% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 79.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Next Permutation 79% | MediumM | Solve→ |
LRU Cache 78.5% | MediumM | Solve→ |
Sum Root to Leaf Numbers 78.4% | MediumM | Solve→ |
Copy List with Random Pointer 78.1% | MediumM | Solve→ |
Range Sum of BST 78% | EasyE | Solve→ |
K Closest Points to Origin 77.1% | MediumM | Solve→ |
Merge k Sorted Lists 75.1% | HardH | Solve→ |
Max Consecutive Ones III 74.6% | MediumM | Solve→ |
Valid Parentheses 73.9% | EasyE | Solve→ |
Add Two Numbers 73.6% | MediumM | Solve→ |
Interval List Intersections 73.6% | MediumM | Solve→ |
Find First and Last Position of Element in Sorted Array 73.1% | MediumM | Solve→ |
Moving Average from Data Stream 73.1% | EasyE | Solve→ |
Custom Sort String 72.8% | MediumM | Solve→ |
Making A Large Island 72.8% | HardH | Solve→ |
Minimum Window Substring 71.9% | HardH | Solve→ |
Minimum Add to Make Parentheses Valid 71.8% | MediumM | Solve→ |
Maximum Swap 71.7% | MediumM | Solve→ |
3Sum 71.1% | MediumM | Solve→ |
Clone Graph 70.5% | MediumM | Solve→ |
Longest Common Prefix 69.7% | EasyE | Solve→ |
Vertical Order Traversal of a Binary Tree 69.1% | HardH | Solve→ |
Longest Substring Without Repeating Characters 68.9% | MediumM | Solve→ |
Kth Missing Positive Number 68.6% | EasyE | Solve→ |
Valid Number 68.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Exclusive Time of Functions 67.4% | MediumM | Solve→ |
Longest Palindromic Substring 67.1% | MediumM | Solve→ |
Remove Duplicates from Sorted Array 67.1% | EasyE | Solve→ |
Diagonal Traverse 67% | MediumM | Solve→ |
Median of Two Sorted Arrays 66.8% | HardH | Solve→ |
Course Schedule 65.7% | MediumM | Solve→ |
All Nodes Distance K in Binary Tree 65.7% | MediumM | Solve→ |
Number of Islands 65.5% | MediumM | Solve→ |
Move Zeroes 65.3% | EasyE | Solve→ |
Remove Nth Node From End of List 64.7% | MediumM | Solve→ |
Palindrome Number 64.1% | EasyE | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 63.7% | MediumM | Solve→ |
Add Strings 63.6% | EasyE | Solve→ |
Insert into a Sorted Circular Linked List 63.4% | MediumM | Solve→ |
Palindromic Substrings 63% | MediumM | Solve→ |
Trapping Rain Water 62.6% | HardH | Solve→ |
Robot Room Cleaner 62.4% | HardH | Solve→ |
Container With Most Water 62.2% | MediumM | Solve→ |
Subsets 61.8% | MediumM | Solve→ |
Closest Binary Search Tree Value 61.8% | EasyE | Solve→ |
Group Shifted Strings 61.4% | MediumM | Solve→ |
Accounts Merge 61.4% | MediumM | Solve→ |
Roman to Integer 61.1% | EasyE | Solve→ |
Goat Latin 61.1% | EasyE | Solve→ |
Binary Search Tree Iterator 60.9% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Subarray 60.5% | MediumM | Solve→ |
Continuous Subarray Sum 59.8% | MediumM | Solve→ |
Random Pick Index 59.1% | MediumM | Solve→ |
Expression Add Operators 58.8% | HardH | Solve→ |
Generate Parentheses 58.6% | MediumM | Solve→ |
Group Anagrams 58.6% | MediumM | Solve→ |
Koko Eating Bananas 58.6% | MediumM | Solve→ |
Contains Duplicate II 58.4% | EasyE | Solve→ |
Merge Two Sorted Lists 58.1% | EasyE | Solve→ |
Search in Rotated Sorted Array 58.1% | MediumM | Solve→ |
Letter Combinations of a Phone Number 57.8% | MediumM | Solve→ |
Majority Element 57.8% | EasyE | Solve→ |
Valid Palindrome III 57.8% | HardH | Solve→ |
Merge Strings Alternately 57.8% | EasyE | Solve→ |
Word Ladder 57.6% | HardH | Solve→ |
Sliding Window Median 57.6% | HardH | Solve→ |
String to Integer (atoi) 57.3% | MediumM | Solve→ |
Climbing Stairs 56.8% | EasyE | Solve→ |
Sort Colors 56.8% | MediumM | Solve→ |
Longest Consecutive Sequence 56.8% | MediumM | Solve→ |
Recyclable and Low Fat Products 56.8% | EasyE | Solve→ |
Set Matrix Zeroes 55.9% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 55.9% | MediumM | Solve→ |
Remove All Adjacent Duplicates In String 55.6% | EasyE | Solve→ |
Reverse Integer 55.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Missing Ranges 54.7% | EasyE | Solve→ |
Create Hello World Function 54.7% | EasyE | Solve→ |
Check Completeness of a Binary Tree 54.4% | MediumM | Solve→ |
Word Break 54.1% | MediumM | Solve→ |
Toeplitz Matrix 54.1% | EasyE | Solve→ |
Squares of a Sorted Array 54.1% | EasyE | Solve→ |
Product of Array Except Self 53.4% | MediumM | Solve→ |
Sliding Window Maximum 53.4% | HardH | Solve→ |
Meeting Rooms II 53.4% | MediumM | Solve→ |
Alien Dictionary 53.4% | HardH | Solve→ |
Rotate Image 53.1% | MediumM | Solve→ |
Plus One 53.1% | EasyE | Solve→ |
Valid Anagram 53.1% | EasyE | Solve→ |
Count Nodes Equal to Average of Subtree 52.7% | MediumM | Solve→ |
Decode String 52% | MediumM | Solve→ |
Longest Valid Parentheses 51.7% | HardH | Solve→ |
Spiral Matrix 51.7% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 51.7% | HardH | Solve→ |
Palindrome Linked List 51.7% | EasyE | Solve→ |
Reverse Linked List 50.5% | EasyE | Solve→ |
Strobogrammatic Number 50.5% | EasyE | Solve→ |
Friends Of Appropriate Ages 50.5% | MediumM | Solve→ |
3Sum Closest 50.1% | MediumM | Solve→ |
Jump Game 50.1% | MediumM | Solve→ |
Add Binary 50.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Pascal's Triangle 50.1% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 50.1% | MediumM | Solve→ |
Remove Invalid Parentheses 50.1% | HardH | Solve→ |
Unique Paths 49.7% | MediumM | Solve→ |
Find Median from Data Stream 49.7% | HardH | Solve→ |
Insert Delete GetRandom O(1) 49.7% | MediumM | Solve→ |
4Sum 49.3% | MediumM | Solve→ |
Multiply Strings 49.3% | MediumM | Solve→ |
Coin Change 49.3% | MediumM | Solve→ |
Design Tic-Tac-Toe 49.3% | MediumM | Solve→ |
Boundary of Binary Tree 49.3% | MediumM | Solve→ |
Can Place Flowers 49.3% | EasyE | Solve→ |
Regular Expression Matching 48.8% | HardH | Solve→ |
Populating Next Right Pointers in Each Node 48.8% | MediumM | Solve→ |
Basic Calculator 48.4% | HardH | Solve→ |
Find the Index of the First Occurrence in a String 48% | EasyE | Solve→ |
Sqrt(x) 48% | EasyE | Solve→ |
Binary Tree Level Order Traversal 48% | MediumM | Solve→ |
Remove Element 47.5% | EasyE | Solve→ |
Best Time to Buy and Sell Stock II 47.5% | MediumM | Solve→ |
Contains Duplicate 47.5% | EasyE | Solve→ |
Battleships in a Board 47.5% | MediumM | Solve→ |
Construct Binary Tree from String 47.5% | MediumM | Solve→ |
Maximum Average Subarray I 47.5% | EasyE | Solve→ |
Largest Rectangle in Histogram 47% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rotate Array 47% | MediumM | Solve→ |
Single Element in a Sorted Array 47% | MediumM | Solve→ |
Find K Closest Elements 47% | MediumM | Solve→ |
Search Insert Position 46.5% | EasyE | Solve→ |
Palindrome Partitioning 46.5% | MediumM | Solve→ |
Minimum Size Subarray Sum 46.5% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 46.5% | HardH | Solve→ |
Longest Repeating Character Replacement 46.5% | MediumM | Solve→ |
Max Area of Island 46.5% | MediumM | Solve→ |
Daily Temperatures 46.5% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 46.5% | MediumM | Solve→ |
Diagonal Traverse II 46.5% | MediumM | Solve→ |
Product of Two Run-Length Encoded Arrays 46.5% | MediumM | Solve→ |
N-Queens 46% | HardH | Solve→ |
Two Sum II - Input Array Is Sorted 46% | MediumM | Solve→ |
Contiguous Array 46% | MediumM | Solve→ |
Combination Sum 45% | MediumM | Solve→ |
Validate Binary Search Tree 45% | MediumM | Solve→ |
Single Number 45% | EasyE | Solve→ |
Reorder List 45% | MediumM | Solve→ |
Course Schedule II 45% | MediumM | Solve→ |
Power of Two 45% | EasyE | Solve→ |
First Bad Version 45% | EasyE | Solve→ |
Serialize and Deserialize Binary Tree 45% | HardH | Solve→ |
Intersection of Two Arrays 45% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Search 45% | EasyE | Solve→ |
Add Two Integers 45% | EasyE | Solve→ |
Best Time to Buy and Sell Stock III 45% | HardH | Solve→ |
Reverse Words in a String 44.4% | MediumM | Solve→ |
House Robber 44.4% | MediumM | Solve→ |
Range Sum Query - Immutable 44.4% | EasyE | Solve→ |
Split Array Largest Sum 44.4% | HardH | Solve→ |
Minesweeper 44.4% | MediumM | Solve→ |
Missing Element in Sorted Array 44.4% | MediumM | Solve→ |
Permutations 43.8% | MediumM | Solve→ |
Happy Number 43.8% | EasyE | Solve→ |
String Compression 43.8% | MediumM | Solve→ |
Peak Index in a Mountain Array 43.8% | MediumM | Solve→ |
Remove All Adjacent Duplicates in String II 43.8% | MediumM | Solve→ |
Word Search 43.3% | MediumM | Solve→ |
Is Subsequence 43.3% | EasyE | Solve→ |
Target Sum 43.3% | MediumM | Solve→ |
Divide Two Integers 42.6% | MediumM | Solve→ |
Decode Ways 42.6% | MediumM | Solve→ |
Shortest Distance from All Buildings 42.6% | HardH | Solve→ |
Zigzag Conversion 42% | MediumM | Solve→ |
Min Stack 42% | MediumM | Solve→ |
Walls and Gates 42% | MediumM | Solve→ |
Find Pivot Index 42% | EasyE | Solve→ |
Middle of the Linked List 42% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Bridge 42% | MediumM | Solve→ |
Fibonacci Number 42% | EasyE | Solve→ |
Search a 2D Matrix 41.4% | MediumM | Solve→ |
Remove Duplicates from Sorted Array II 41.4% | MediumM | Solve→ |
Subsets II 41.4% | MediumM | Solve→ |
Rising Temperature 41.4% | EasyE | Solve→ |
Asteroid Collision 41.4% | MediumM | Solve→ |
Reverse Nodes in k-Group 40.7% | HardH | Solve→ |
Count and Say 40.7% | MediumM | Solve→ |
First Missing Positive 40.7% | HardH | Solve→ |
Maximal Rectangle 40.7% | HardH | Solve→ |
Find Minimum in Rotated Sorted Array 40.7% | MediumM | Solve→ |
Odd Even Linked List 40.7% | MediumM | Solve→ |
Increasing Triplet Subsequence 40.7% | MediumM | Solve→ |
Max Consecutive Ones 40.7% | EasyE | Solve→ |
Next Greater Element I 40.7% | EasyE | Solve→ |
Car Pooling 40.7% | MediumM | Solve→ |
Article Views I 40.7% | EasyE | Solve→ |
Minimum Time to Collect All Apples in a Tree 40.7% | MediumM | Solve→ |
Binary Tree Inorder Traversal 40% | EasyE | Solve→ |
Populating Next Right Pointers in Each Node II 40% | MediumM | Solve→ |
Sparse Matrix Multiplication 40% | MediumM | Solve→ |
Swim in Rising Water 40% | HardH | Solve→ |
Shortest Path in a Hidden Grid 40% | MediumM | Solve→ |
Integer to Roman 39.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Word Ladder II 39.2% | HardH | Solve→ |
Linked List Cycle 39.2% | EasyE | Solve→ |
Missing Number 39.2% | EasyE | Solve→ |
Sort Characters By Frequency 39.2% | MediumM | Solve→ |
Rotting Oranges 39.2% | MediumM | Solve→ |
Simple Bank System 39.2% | MediumM | Solve→ |
Combination Sum II 38.5% | MediumM | Solve→ |
Text Justification 38.5% | HardH | Solve→ |
Search in Rotated Sorted Array II 38.5% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 38.5% | MediumM | Solve→ |
Maximum Depth of Binary Tree 38.5% | EasyE | Solve→ |
Isomorphic Strings 38.5% | EasyE | Solve→ |
Find the Duplicate Number 38.5% | MediumM | Solve→ |
Next Greater Element II 38.5% | MediumM | Solve→ |
Smallest Subtree with all the Deepest Nodes 38.5% | MediumM | Solve→ |
Concatenation of Array 38.5% | EasyE | Solve→ |
Wildcard Matching 37.7% | HardH | Solve→ |
Jump Game II 37.7% | MediumM | Solve→ |
Insert Interval 37.7% | MediumM | Solve→ |
Combinations 37.7% | MediumM | Solve→ |
Maximum Product Subarray 37.7% | MediumM | Solve→ |
Largest Number 37.7% | MediumM | Solve→ |
Flatten Nested List Iterator 37.7% | MediumM | Solve→ |
Partition Equal Subset Sum 37.7% | MediumM | Solve→ |
Permutation in String 37.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Verifying an Alien Dictionary 37.7% | EasyE | Solve→ |
Valid Sudoku 36.8% | MediumM | Solve→ |
Same Tree 36.8% | EasyE | Solve→ |
Word Break II 36.8% | HardH | Solve→ |
Sort List 36.8% | MediumM | Solve→ |
Reverse String 36.8% | EasyE | Solve→ |
Friend Requests II: Who Has the Most Friends 36.8% | MediumM | Solve→ |
Valid Parenthesis String 36.8% | MediumM | Solve→ |
Maximum Sum of 3 Non-Overlapping Subarrays 36.8% | HardH | Solve→ |
Kth Largest Element in a Stream 36.8% | EasyE | Solve→ |
Frequency of the Most Frequent Element 36.8% | MediumM | Solve→ |
Cutting Ribbons 36.8% | MediumM | Solve→ |
Unique Binary Search Trees 36.8% | MediumM | Solve→ |
Symmetric Tree 36% | EasyE | Solve→ |
Gas Station 36% | MediumM | Solve→ |
Second Highest Salary 36% | MediumM | Solve→ |
Kth Smallest Element in a BST 36% | MediumM | Solve→ |
Search a 2D Matrix II 36% | MediumM | Solve→ |
Longest Increasing Subsequence 36% | MediumM | Solve→ |
Task Scheduler 36% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 36% | EasyE | Solve→ |
Length of Last Word 35% | EasyE | Solve→ |
Rotate List 35% | MediumM | Solve→ |
Combine Two Tables 35% | EasyE | Solve→ |
Maximum Size Subarray Sum Equals k 35% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove K Digits 35% | MediumM | Solve→ |
Letter Case Permutation 35% | MediumM | Solve→ |
Monotonic Array 35% | EasyE | Solve→ |
Sort Array By Parity 35% | EasyE | Solve→ |
Greatest Common Divisor of Strings 35% | EasyE | Solve→ |
Kids With the Greatest Number of Candies 35% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree II 35% | MediumM | Solve→ |
Average Time of Process per Machine 35% | EasyE | Solve→ |
Edit Distance 34% | MediumM | Solve→ |
Reverse Linked List II 34% | MediumM | Solve→ |
Balanced Binary Tree 34% | EasyE | Solve→ |
Implement Trie (Prefix Tree) 34% | MediumM | Solve→ |
Majority Element II 34% | MediumM | Solve→ |
Next Greater Element III 34% | MediumM | Solve→ |
Big Countries 34% | EasyE | Solve→ |
Rotate String 34% | EasyE | Solve→ |
Lowest Common Ancestor of Deepest Leaves 34% | MediumM | Solve→ |
Longest Common Subsequence 34% | MediumM | Solve→ |
Path Sum II 33% | MediumM | Solve→ |
Flatten Binary Tree to Linked List 33% | MediumM | Solve→ |
Candy 33% | HardH | Solve→ |
Count Primes 33% | MediumM | Solve→ |
Delete Node in a Linked List 33% | MediumM | Solve→ |
Strobogrammatic Number II 33% | MediumM | Solve→ |
Meeting Rooms 33% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Paths 33% | EasyE | Solve→ |
Integer to English Words 33% | HardH | Solve→ |
Find All Anagrams in a String 33% | MediumM | Solve→ |
The Maze 33% | MediumM | Solve→ |
Reverse Pairs 33% | HardH | Solve→ |
Two Sum IV - Input is a BST 33% | EasyE | Solve→ |
Minimum Cost For Tickets 33% | MediumM | Solve→ |
Rearrange Array Elements by Sign 33% | MediumM | Solve→ |
Surrounded Regions 31.9% | MediumM | Solve→ |
Evaluate Reverse Polish Notation 31.9% | MediumM | Solve→ |
Intersection of Two Linked Lists 31.9% | EasyE | Solve→ |
Excel Sheet Column Title 31.9% | EasyE | Solve→ |
Ransom Note 31.9% | EasyE | Solve→ |
Number of Provinces 31.9% | MediumM | Solve→ |
Subtree of Another Tree 31.9% | EasyE | Solve→ |
Is Graph Bipartite? 31.9% | MediumM | Solve→ |
Defanging an IP Address 31.9% | EasyE | Solve→ |
Average Selling Price 31.9% | EasyE | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 31.9% | EasyE | Solve→ |
Monthly Transactions I 31.9% | MediumM | Solve→ |
Russian Doll Envelopes 31.9% | HardH | Solve→ |
Sudoku Solver 30.7% | HardH | Solve→ |
Construct Binary Tree from Preorder and Inorder Traversal 30.7% | MediumM | Solve→ |
Convert Sorted Array to Binary Search Tree 30.7% | EasyE | Solve→ |
Customers Who Never Order 30.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
House Robber II 30.7% | MediumM | Solve→ |
The Skyline Problem 30.7% | HardH | Solve→ |
Non-overlapping Intervals 30.7% | MediumM | Solve→ |
Fruit Into Baskets 30.7% | MediumM | Solve→ |
Sort an Array 30.7% | MediumM | Solve→ |
Binary Tree Cameras 30.7% | HardH | Solve→ |
Running Sum of 1d Array 30.7% | EasyE | Solve→ |
Check If Two String Arrays are Equivalent 30.7% | EasyE | Solve→ |
Students and Examinations 30.7% | EasyE | Solve→ |
Number of Recent Calls 30.7% | EasyE | Solve→ |
Min Cost Climbing Stairs 30.7% | EasyE | Solve→ |
Minimum Path Sum 29.5% | MediumM | Solve→ |
Single Number II 29.5% | MediumM | Solve→ |
Employees Earning More Than Their Managers 29.5% | EasyE | Solve→ |
Maximal Square 29.5% | MediumM | Solve→ |
Fizz Buzz 29.5% | EasyE | Solve→ |
Triangle Judgement 29.5% | EasyE | Solve→ |
Stickers to Spell Word 29.5% | HardH | Solve→ |
Add to Array-Form of Integer 29.5% | EasyE | Solve→ |
User Activity for the Past 30 Days I 29.5% | EasyE | Solve→ |
Rank Transform of an Array 29.5% | EasyE | Solve→ |
Minimum Time Visiting All Points 29.5% | EasyE | Solve→ |
Triangle 29.5% | MediumM | Solve→ |
Implement Stack using Queues 29.5% | EasyE | Solve→ |
Largest Divisible Subset 29.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Swap Nodes in Pairs 28.1% | MediumM | Solve→ |
Unique Binary Search Trees II 28.1% | MediumM | Solve→ |
Linked List Cycle II 28.1% | MediumM | Solve→ |
Max Points on a Line 28.1% | HardH | Solve→ |
Invert Binary Tree 28.1% | EasyE | Solve→ |
Find the Celebrity 28.1% | MediumM | Solve→ |
Integer Break 28.1% | MediumM | Solve→ |
Combination Sum IV 28.1% | MediumM | Solve→ |
Sum of Left Leaves 28.1% | EasyE | Solve→ |
Managers with at Least 5 Direct Reports 28.1% | MediumM | Solve→ |
Find Customer Referee 28.1% | EasyE | Solve→ |
Sum of Subarray Minimums 28.1% | MediumM | Solve→ |
Binary Subarrays With Sum 28.1% | MediumM | Solve→ |
Delete Nodes And Return Forest 28.1% | MediumM | Solve→ |
Replace Employee ID With The Unique Identifier 28.1% | EasyE | Solve→ |
Create a DataFrame from List 28.1% | EasyE | Solve→ |
Find the Length of the Longest Common Prefix 28.1% | MediumM | Solve→ |
Remove Duplicates from Sorted List 28.1% | EasyE | Solve→ |
Identify the Largest Outlier in an Array 28.1% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 26.7% | MediumM | Solve→ |
One Edit Distance 26.7% | MediumM | Solve→ |
Remove Linked List Elements 26.7% | EasyE | Solve→ |
Word Search II 26.7% | HardH | Solve→ |
Graph Valid Tree 26.7% | MediumM | Solve→ |
Reverse Vowels of a String 26.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find All Duplicates in an Array 26.7% | MediumM | Solve→ |
01 Matrix 26.7% | MediumM | Solve→ |
Brick Wall 26.7% | MediumM | Solve→ |
Longest Continuous Increasing Subsequence 26.7% | EasyE | Solve→ |
Reorganize String 26.7% | MediumM | Solve→ |
Remove Outermost Parentheses 26.7% | EasyE | Solve→ |
Minimum Knight Moves 26.7% | MediumM | Solve→ |
Intersection of Three Sorted Arrays 26.7% | EasyE | Solve→ |
Product Sales Analysis III 26.7% | MediumM | Solve→ |
Project Employees I 26.7% | EasyE | Solve→ |
Unique Number of Occurrences 26.7% | EasyE | Solve→ |
Queries Quality and Percentage 26.7% | EasyE | Solve→ |
Maximum Length of a Concatenated String with Unique Characters 26.7% | MediumM | Solve→ |
Leftmost Column with at Least a One 26.7% | MediumM | Solve→ |
Angle Between Hands of a Clock 26.7% | MediumM | Solve→ |
Count Negative Numbers in a Sorted Matrix 26.7% | EasyE | Solve→ |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree 26.7% | EasyE | Solve→ |
Longest Subarray of 1's After Deleting One Element 26.7% | MediumM | Solve→ |
Number of Subsequences That Satisfy the Given Sum Condition 26.7% | MediumM | Solve→ |
Diameter of N-Ary Tree 26.7% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 26.7% | EasyE | Solve→ |
Sum of Unique Elements 26.7% | EasyE | Solve→ |
Check if One String Swap Can Make Strings Equal 26.7% | EasyE | Solve→ |
Minimum Path Cost in a Hidden Grid 26.7% | MediumM | Solve→ |
Count Good Numbers 26.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Hills and Valleys in an Array 26.7% | EasyE | Solve→ |
Partition List 26.7% | MediumM | Solve→ |
Employee Bonus 26.7% | EasyE | Solve→ |
Minimum Time Difference 26.7% | MediumM | Solve→ |
Find the Smallest Divisor Given a Threshold 26.7% | MediumM | Solve→ |
Online Stock Span 26.7% | MediumM | Solve→ |
Distinct Subsequences 26.7% | HardH | Solve→ |
Rank Scores 26.7% | MediumM | Solve→ |
Find the Most Common Response 26.7% | MediumM | Solve→ |
Longest Substring with At Most Two Distinct Characters 26.7% | MediumM | Solve→ |
Unique Paths II 25.1% | MediumM | Solve→ |
Restore IP Addresses 25.1% | MediumM | Solve→ |
Design Add and Search Words Data Structure 25.1% | MediumM | Solve→ |
Summary Ranges 25.1% | EasyE | Solve→ |
H-Index 25.1% | MediumM | Solve→ |
H-Index II 25.1% | MediumM | Solve→ |
Word Pattern 25.1% | EasyE | Solve→ |
Power of Three 25.1% | EasyE | Solve→ |
Largest BST Subtree 25.1% | MediumM | Solve→ |
Intersection of Two Arrays II 25.1% | EasyE | Solve→ |
Valid Perfect Square 25.1% | EasyE | Solve→ |
First Unique Character in a String 25.1% | EasyE | Solve→ |
Assign Cookies 25.1% | EasyE | Solve→ |
Total Hamming Distance 25.1% | MediumM | Solve→ |
Friend Requests I: Overall Acceptance Rate 25.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Average of Levels in Binary Tree 25.1% | EasyE | Solve→ |
Decode Ways II 25.1% | HardH | Solve→ |
Design Search Autocomplete System 25.1% | HardH | Solve→ |
Number of Longest Increasing Subsequence 25.1% | MediumM | Solve→ |
Top K Frequent Words 25.1% | MediumM | Solve→ |
Subarray Product Less Than K 25.1% | MediumM | Solve→ |
Flood Fill 25.1% | EasyE | Solve→ |
Largest Plus Sign 25.1% | MediumM | Solve→ |
Cheapest Flights Within K Stops 25.1% | MediumM | Solve→ |
Design Circular Queue 25.1% | MediumM | Solve→ |
Maximum Sum Circular Subarray 25.1% | MediumM | Solve→ |
Partition Array for Maximum Sum 25.1% | MediumM | Solve→ |
Validate Binary Tree Nodes 25.1% | MediumM | Solve→ |
Web Crawler Multithreaded 25.1% | MediumM | Solve→ |
Calculate Amount Paid in Taxes 25.1% | EasyE | Solve→ |
Page Recommendations 25.1% | MediumM | Solve→ |
Number of Substrings Containing All Three Characters 25.1% | MediumM | Solve→ |
Minimum Number of Days to Make m Bouquets 25.1% | MediumM | Solve→ |
Binary Search Tree Iterator II 25.1% | MediumM | Solve→ |
Max Number of K-Sum Pairs 25.1% | MediumM | Solve→ |
Minimum Cost to Reach Destination in Time 25.1% | HardH | Solve→ |
Page Recommendations II 25.1% | HardH | Solve→ |
Build Array from Permutation 25.1% | EasyE | Solve→ |
Strong Friendship 25.1% | MediumM | Solve→ |
Count Pairs Whose Sum is Less than Target 25.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Lemonade Change 25.1% | EasyE | Solve→ |
Find Winner on a Tic Tac Toe Game 25.1% | EasyE | Solve→ |
N-Queens II 25.1% | HardH | Solve→ |
Find Kth Bit in Nth Binary String 25.1% | MediumM | Solve→ |
Redundant Connection 25.1% | MediumM | Solve→ |
Largest Odd Number in String 25.1% | EasyE | Solve→ |
Reverse String II 25.1% | EasyE | Solve→ |
Unique Paths III 25.1% | HardH | Solve→ |
Immediate Food Delivery II 25.1% | MediumM | Solve→ |
Fraction to Recurring Decimal 25.1% | MediumM | Solve→ |
Find Missing and Repeated Values 25.1% | EasyE | Solve→ |
Find Numbers with Even Number of Digits 25.1% | EasyE | Solve→ |
Minimum Deletions for At Most K Distinct Characters 25.1% | EasyE | Solve→ |
Substring with Concatenation of All Words 23.4% | HardH | Solve→ |
Minimum Depth of Binary Tree 23.4% | EasyE | Solve→ |
Path Sum 23.4% | EasyE | Solve→ |
Read N Characters Given Read4 23.4% | EasyE | Solve→ |
Duplicate Emails 23.4% | EasyE | Solve→ |
Repeated DNA Sequences 23.4% | MediumM | Solve→ |
Reverse Bits 23.4% | EasyE | Solve→ |
Paint House II 23.4% | HardH | Solve→ |
Remove Duplicate Letters 23.4% | MediumM | Solve→ |
Sum of Two Integers 23.4% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 23.4% | MediumM | Solve→ |
Convert a Number to Hexadecimal 23.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Palindrome 23.4% | EasyE | Solve→ |
Pacific Atlantic Water Flow 23.4% | MediumM | Solve→ |
Delete Node in a BST 23.4% | MediumM | Solve→ |
Longest Palindromic Subsequence 23.4% | MediumM | Solve→ |
Get Highest Answer Rate Question 23.4% | MediumM | Solve→ |
Set Mismatch 23.4% | EasyE | Solve→ |
Baseball Game 23.4% | EasyE | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 23.4% | MediumM | Solve→ |
Prefix and Suffix Search 23.4% | HardH | Solve→ |
Open the Lock 23.4% | MediumM | Solve→ |
Minimum Swaps To Make Sequences Increasing 23.4% | HardH | Solve→ |
Subarray Sums Divisible by K 23.4% | MediumM | Solve→ |
Maximum Binary Tree II 23.4% | MediumM | Solve→ |
Maximum Level Sum of a Binary Tree 23.4% | MediumM | Solve→ |
Element Appearing More Than 25% In Sorted Array 23.4% | EasyE | Solve→ |
Reported Posts II 23.4% | MediumM | Solve→ |
Balance a Binary Search Tree 23.4% | MediumM | Solve→ |
Number of Visible People in a Queue 23.4% | HardH | Solve→ |
Apply Discount Every n Orders 23.4% | MediumM | Solve→ |
Product of the Last K Numbers 23.4% | MediumM | Solve→ |
Find the Kth Smallest Sum of a Matrix With Sorted Rows 23.4% | HardH | Solve→ |
Construct the Lexicographically Largest Valid Sequence 23.4% | MediumM | Solve→ |
Invalid Tweets 23.4% | EasyE | Solve→ |
Count Items Matching a Rule 23.4% | EasyE | Solve→ |
Faulty Sensor 23.4% | EasyE | 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 23.4% | MediumM | Solve→ |
Separate the Digits in an Array 23.4% | EasyE | Solve→ |
Product Price at a Given Date 23.4% | MediumM | Solve→ |
All O`one Data Structure 23.4% | HardH | Solve→ |
Check if the Sentence Is Pangram 23.4% | EasyE | Solve→ |
Inorder Successor in BST II 23.4% | MediumM | Solve→ |
Add Digits 23.4% | EasyE | Solve→ |
Investments in 2016 23.4% | MediumM | Solve→ |
Maximum Points You Can Obtain from Cards 23.4% | MediumM | Solve→ |
Threshold Majority Queries 23.4% | HardH | Solve→ |
Minimum Cost Path with Edge Reversals 23.4% | MediumM | Solve→ |
Read N Characters Given read4 II - Call Multiple Times 21.5% | HardH | Solve→ |
Number of 1 Bits 21.5% | EasyE | Solve→ |
Implement Queue using Stacks 21.5% | EasyE | Solve→ |
Inorder Successor in BST 21.5% | MediumM | Solve→ |
Range Sum Query 2D - Immutable 21.5% | MediumM | Solve→ |
Counting Bits 21.5% | EasyE | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 21.5% | HardH | Solve→ |
Path Sum III 21.5% | MediumM | Solve→ |
132 Pattern 21.5% | MediumM | Solve→ |
Hamming Distance 21.5% | EasyE | Solve→ |
Minimum Absolute Difference in BST 21.5% | EasyE | Solve→ |
Encode and Decode TinyURL 21.5% | MediumM | Solve→ |
Number Of Corner Rectangles 21.5% | MediumM | Solve→ |
Jewels and Stones 21.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Search in a Binary Search Tree 21.5% | EasyE | Solve→ |
Design HashMap 21.5% | EasyE | Solve→ |
Backspace String Compare 21.5% | EasyE | Solve→ |
Boats to Save People 21.5% | MediumM | Solve→ |
Groups of Special-Equivalent Strings 21.5% | MediumM | Solve→ |
Time Based Key-Value Store 21.5% | MediumM | Solve→ |
Moving Stones Until Consecutive 21.5% | MediumM | Solve→ |
Moving Stones Until Consecutive II 21.5% | MediumM | Solve→ |
Project Employees II 21.5% | EasyE | Solve→ |
Project Employees III 21.5% | MediumM | Solve→ |
Game Play Analysis IV 21.5% | MediumM | Solve→ |
Reported Posts 21.5% | EasyE | Solve→ |
User Activity for the Past 30 Days II 21.5% | EasyE | Solve→ |
Web Crawler 21.5% | MediumM | Solve→ |
Report Contiguous Dates 21.5% | HardH | Solve→ |
Count Number of Nice Subarrays 21.5% | MediumM | Solve→ |
Number of Comments per Post 21.5% | EasyE | Solve→ |
Ads Performance 21.5% | EasyE | Solve→ |
Maximum Number of Events That Can Be Attended 21.5% | MediumM | Solve→ |
Customers Who Bought Products A and B but Not C 21.5% | MediumM | Solve→ |
Make Two Arrays Equal by Reversing Subarrays 21.5% | EasyE | Solve→ |
Maximum Number of Darts Inside of a Circular Dartboard 21.5% | HardH | Solve→ |
Apples & Oranges 21.5% | MediumM | Solve→ |
Sum of Beauty of All Substrings 21.5% | MediumM | Solve→ |
Maximum Compatibility Score Sum 21.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Nodes Equal to Sum of Descendants 21.5% | MediumM | Solve→ |
Longest Subsequence Repeated k Times 21.5% | HardH | Solve→ |
Finding the Topic of Each Post 21.5% | HardH | Solve→ |
Steps to Make Array Non-decreasing 21.5% | MediumM | Solve→ |
Task Scheduler II 21.5% | MediumM | Solve→ |
Words Within Two Edits of Dictionary 21.5% | MediumM | Solve→ |
Check Knight Tour Configuration 21.5% | MediumM | Solve→ |
Burst Balloons 21.5% | HardH | Solve→ |
Remove Duplicates from Sorted List II 21.5% | MediumM | Solve→ |
Customers Who Bought All Products 21.5% | MediumM | Solve→ |
Count Complete Tree Nodes 21.5% | MediumM | Solve→ |
Delete Duplicate Emails 21.5% | EasyE | Solve→ |
Movie Rating 21.5% | MediumM | Solve→ |
Even Odd Tree 21.5% | MediumM | Solve→ |
Remove Sub-Folders from the Filesystem 21.5% | MediumM | Solve→ |
Count Binary Substrings 21.5% | EasyE | Solve→ |
Tenth Line 21.5% | EasyE | Solve→ |
Number of Operations to Make Network Connected 21.5% | MediumM | Solve→ |
Not Boring Movies 21.5% | EasyE | Solve→ |
Shifting Letters II 21.5% | MediumM | Solve→ |
Transpose Matrix 21.5% | EasyE | Solve→ |
Palindrome Partitioning II 21.5% | HardH | Solve→ |
Find the Highest Altitude 21.5% | EasyE | Solve→ |
Arranging Coins 21.5% | EasyE | Solve→ |
Find the K-th Character in String Game I 21.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Subsequence of Length K With the Largest Sum 21.5% | EasyE | Solve→ |
Find Lucky Integer in an Array 21.5% | EasyE | Solve→ |
Coin Change II 21.5% | MediumM | Solve→ |
Fruits Into Baskets II 21.5% | EasyE | Solve→ |
Bitwise OR of Even Numbers in an Array 21.5% | EasyE | Solve→ |
Stone Game 21.5% | MediumM | Solve→ |
Design Ride Sharing System 21.5% | MediumM | Solve→ |
Find the Smallest Balanced Index 21.5% | MediumM | Solve→ |
All the Pairs With the Maximum Number of Common Followers 21.5% | MediumM | Solve→ |
Spiral Matrix II 19.4% | MediumM | Solve→ |
Binary Tree Preorder Traversal 19.4% | EasyE | Solve→ |
Consecutive Numbers 19.4% | MediumM | Solve→ |
Encode and Decode Strings 19.4% | MediumM | Solve→ |
Game of Life 19.4% | MediumM | Solve→ |
Longest Absolute File Path 19.4% | MediumM | Solve→ |
Evaluate Division 19.4% | MediumM | Solve→ |
Trapping Rain Water II 19.4% | HardH | Solve→ |
Find All Numbers Disappeared in an Array 19.4% | EasyE | Solve→ |
Validate IP Address 19.4% | MediumM | Solve→ |
Add Bold Tag in String 19.4% | MediumM | Solve→ |
Merge Two Binary Trees 19.4% | EasyE | Solve→ |
Sum of Square Numbers 19.4% | MediumM | Solve→ |
Maximum Width of Binary Tree 19.4% | MediumM | Solve→ |
Candy Crush 19.4% | MediumM | Solve→ |
Construct Binary Search Tree from Preorder Traversal 19.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Nearest Exit from Entrance in Maze 19.4% | MediumM | Solve→ |
Find a Peak Element II 19.4% | MediumM | Solve→ |
Find if Path Exists in Graph 19.4% | EasyE | Solve→ |
K Radius Subarray Averages 19.4% | MediumM | Solve→ |
Ugly Number 19.4% | EasyE | Solve→ |
Minimum Falling Path Sum 19.4% | MediumM | Solve→ |
Lexicographical Numbers 19.4% | MediumM | Solve→ |
Stock Price Fluctuation 19.4% | MediumM | Solve→ |
Count of Smaller Numbers After Self 19.4% | HardH | Solve→ |
Binary Tree Pruning 19.4% | MediumM | Solve→ |
Defuse the Bomb 19.4% | EasyE | Solve→ |
Sequential Digits 19.4% | MediumM | Solve→ |
Divisor Game 19.4% | EasyE | Solve→ |
Maximum Score After Splitting a String 19.4% | EasyE | Solve→ |
Minimum Number of Operations to Move All Balls to Each Box 19.4% | MediumM | Solve→ |
Find the Prefix Common Array of Two Arrays 19.4% | MediumM | Solve→ |
Find Eventual Safe States 19.4% | MediumM | Solve→ |
Valid Mountain Array 19.4% | EasyE | Solve→ |
Longest Harmonious Subsequence 19.4% | EasyE | Solve→ |
Shuffle the Array 19.4% | EasyE | Solve→ |
Meeting Scheduler 19.4% | MediumM | Solve→ |
Rabbits in Forest 19.4% | MediumM | Solve→ |
Count the Hidden Sequences 19.4% | MediumM | Solve→ |
Finding 3-Digit Even Numbers 19.4% | EasyE | Solve→ |
Maximum Difference by Remapping a Digit 19.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Interleaving String 19.4% | MediumM | Solve→ |
Richest Customer Wealth 19.4% | EasyE | Solve→ |
Can Make Arithmetic Progression From Sequence 19.4% | EasyE | Solve→ |
Minimum Pair Removal to Sort Array I 19.4% | EasyE | Solve→ |
Binary Tree Postorder Traversal 17% | EasyE | Solve→ |
Palindrome Permutation 17% | EasyE | Solve→ |
Bulb Switcher 17% | MediumM | Solve→ |
Maximum Product of Three Numbers 17% | EasyE | Solve→ |
Partition Labels 17% | MediumM | Solve→ |
Shortest Subarray with Sum at Least K 17% | HardH | Solve→ |
Tree Diameter 17% | MediumM | Solve→ |
Parsing A Boolean Expression 17% | HardH | Solve→ |
Shortest Path in a Grid with Obstacles Elimination 17% | HardH | Solve→ |
Count Good Nodes in Binary Tree 17% | MediumM | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 17% | MediumM | Solve→ |
Path With Minimum Effort 17% | MediumM | Solve→ |
Unique Length-3 Palindromic Subsequences 17% | MediumM | Solve→ |
To Be Or Not To Be 17% | EasyE | Solve→ |
Sum of Subarray Ranges 17% | MediumM | Solve→ |
Find Duplicate File in System 17% | MediumM | Solve→ |
Consecutive Characters 17% | EasyE | Solve→ |
Guess the Word 17% | HardH | Solve→ |
Shortest Palindrome 17% | HardH | Solve→ |
Final Prices With a Special Discount in a Shop 17% | EasyE | Solve→ |
Arithmetic Slices 17% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Score of Parentheses 17% | MediumM | Solve→ |
Reshape the Matrix 17% | EasyE | Solve→ |
Sort Array by Increasing Frequency 17% | EasyE | Solve→ |
Minimum Number of Changes to Make Binary String Beautiful 17% | MediumM | Solve→ |
Perfect Number 17% | EasyE | Solve→ |
Percentage of Users Attended a Contest 17% | EasyE | Solve→ |
Rotating the Box 17% | MediumM | Solve→ |
Check if a Parentheses String Can Be Valid 17% | MediumM | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 17% | EasyE | Solve→ |
Minimum Absolute Difference 17% | EasyE | Solve→ |
Snakes and Ladders 17% | MediumM | Solve→ |
Minimum Operations to Exceed Threshold Value II 17% | MediumM | Solve→ |
Longest Duplicate Substring 17% | HardH | Solve→ |
Zero Array Transformation II 17% | MediumM | Solve→ |
Validate Stack Sequences 17% | MediumM | Solve→ |
Maximum Absolute Sum of Any Subarray 17% | MediumM | Solve→ |
Minimum Deletions to Make String Balanced 17% | MediumM | Solve→ |
Count Equal and Divisible Pairs in an Array 17% | EasyE | Solve→ |
Largest Color Value in a Directed Graph 17% | HardH | Solve→ |
Last Person to Fit in the Bus 17% | MediumM | Solve→ |
Third Maximum Number 17% | EasyE | Solve→ |
Minimize the Maximum Difference of Pairs 17% | MediumM | Solve→ |
Repeated Substring Pattern 17% | EasyE | Solve→ |
New 21 Game 17% | MediumM | Solve→ |
Maximum Average Pass Ratio 17% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Best Time to Buy and Sell Stock using Strategy 17% | MediumM | Solve→ |
Minimum Absolute Difference Between Elements With Constraint 17% | MediumM | Solve→ |
Greatest Sum Divisible by Three 17% | MediumM | Solve→ |
Find the Safest Path in a Grid 17% | MediumM | Solve→ |
Maximum Length Substring With Two Occurrences 17% | EasyE | Solve→ |
Dungeon Game 14.4% | HardH | Solve→ |
Department Highest Salary 14.4% | MediumM | Solve→ |
Best Time to Buy and Sell Stock IV 14.4% | HardH | Solve→ |
Best Meeting Point 14.4% | HardH | Solve→ |
Power of Four 14.4% | EasyE | Solve→ |
Find the Difference 14.4% | EasyE | Solve→ |
Add Two Numbers II 14.4% | MediumM | Solve→ |
LFU Cache 14.4% | HardH | Solve→ |
Island Perimeter 14.4% | EasyE | Solve→ |
Flatten a Multilevel Doubly Linked List 14.4% | MediumM | Solve→ |
Hand of Straights 14.4% | MediumM | Solve→ |
Leaf-Similar Trees 14.4% | EasyE | Solve→ |
Last Stone Weight 14.4% | EasyE | Solve→ |
Shortest Common Supersequence 14.4% | HardH | Solve→ |
Maximum Candies Allocated to K Children 14.4% | MediumM | Solve→ |
Design Skiplist 14.4% | HardH | Solve→ |
Number of Closed Islands 14.4% | MediumM | Solve→ |
All Elements in Two Binary Search Trees 14.4% | MediumM | Solve→ |
Maximum Sum BST in Binary Tree 14.4% | HardH | Solve→ |
Maximum Population Year 14.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Confirmation Rate 14.4% | MediumM | Solve→ |
Root Equals Sum of Children 14.4% | EasyE | Solve→ |
Sort the People 14.4% | EasyE | Solve→ |
Counter 14.4% | EasyE | Solve→ |
Array Prototype Last 14.4% | EasyE | Solve→ |
Permutation Sequence 14.4% | HardH | Solve→ |
Count Largest Group 14.4% | EasyE | Solve→ |
Split Linked List in Parts 14.4% | MediumM | Solve→ |
Fix Names in a Table 14.4% | EasyE | Solve→ |
Make Sum Divisible by P 14.4% | MediumM | Solve→ |
Delete the Middle Node of a Linked List 14.4% | MediumM | Solve→ |
Number of Ways to Form a Target String Given a Dictionary 14.4% | HardH | Solve→ |
Partition Array Into Two Arrays to Minimize Sum Difference 14.4% | HardH | Solve→ |
Check If N and Its Double Exist 14.4% | EasyE | Solve→ |
Nim Game 14.4% | EasyE | Solve→ |
Count Square Submatrices with All Ones 14.4% | MediumM | Solve→ |
Sign of the Product of an Array 14.4% | EasyE | Solve→ |
Number of Islands II 14.4% | HardH | Solve→ |
Block Placement Queries 14.4% | HardH | Solve→ |
Exchange Seats 14.4% | MediumM | Solve→ |
Word Subsets 14.4% | MediumM | Solve→ |
Mini Parser 14.4% | MediumM | Solve→ |
Number of Zero-Filled Subarrays 14.4% | MediumM | Solve→ |
Maximum Gap 14.4% | MediumM | Solve→ |
Find Smallest Letter Greater Than Target 14.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
How Many Numbers Are Smaller Than the Current Number 14.4% | EasyE | Solve→ |
Minimum Distance Between BST Nodes 14.4% | EasyE | Solve→ |
Letter Tile Possibilities 14.4% | MediumM | Solve→ |
The k-th Lexicographical String of All Happy Strings of Length n 14.4% | MediumM | Solve→ |
Successful Pairs of Spells and Potions 14.4% | MediumM | Solve→ |
Merge Two 2D Arrays by Summing Values 14.4% | EasyE | Solve→ |
Count Total Number of Colored Cells 14.4% | MediumM | Solve→ |
Put Marbles in Bags 14.4% | HardH | Solve→ |
Maximum Profit in Job Scheduling 14.4% | HardH | Solve→ |
Find the Count of Good Integers 14.4% | HardH | Solve→ |
Count Symmetric Integers 14.4% | EasyE | Solve→ |
Count Square Sum Triples 14.4% | EasyE | Solve→ |
Count of Range Sum 14.4% | HardH | Solve→ |
Find Words Containing Character 14.4% | EasyE | Solve→ |
Domino and Tromino Tiling 14.4% | MediumM | Solve→ |
Three Consecutive Odds 14.4% | EasyE | Solve→ |
Find the Maximum Sum of Node Values 14.4% | HardH | Solve→ |
Divisible and Non-divisible Sums Difference 14.4% | EasyE | Solve→ |
Recover Binary Search Tree 14.4% | MediumM | Solve→ |
Distribute Candies Among Children II 14.4% | MediumM | Solve→ |
Number of Matching Subsequences 14.4% | MediumM | Solve→ |
Product Sales Analysis I 14.4% | EasyE | Solve→ |
To Lower Case 14.4% | EasyE | Solve→ |
Maximum Difference Between Increasing Elements 14.4% | EasyE | Solve→ |
Maximum Product of Two Elements in an Array 14.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Number in Infinite Set 14.4% | MediumM | Solve→ |
Sum of k-Mirror Numbers 14.4% | HardH | Solve→ |
Collect Coins in a Tree 14.4% | HardH | Solve→ |
Repeated String Match 14.4% | MediumM | Solve→ |
Count Number of Trapezoids II 14.4% | HardH | Solve→ |
Game Play Analysis I 14.4% | EasyE | Solve→ |
Reorder Routes to Make All Paths Lead to the City Zero 14.4% | MediumM | Solve→ |
Find Most Frequent Vowel and Consonant 14.4% | EasyE | Solve→ |
Valid Triangle Number 14.4% | MediumM | Solve→ |
Find Books with No Available Copies 14.4% | EasyE | Solve→ |
Maximum Number of Operations to Move Ones to the End 14.4% | MediumM | Solve→ |
Maximum Product of Splitted Binary Tree 14.4% | MediumM | Solve→ |
Number of Strings That Appear as Substrings in Word 14.4% | EasyE | Solve→ |
Maximize Active Section with Trade I 14.4% | MediumM | Solve→ |
Binary Tree Level Order Traversal II 11.4% | MediumM | Solve→ |
Pascal's Triangle II 11.4% | EasyE | Solve→ |
Department Top Three Salaries 11.4% | HardH | Solve→ |
Number of Digit One 11.4% | HardH | Solve→ |
Minimum Height Trees 11.4% | MediumM | Solve→ |
Number of Connected Components in an Undirected Graph 11.4% | MediumM | Solve→ |
Patching Array 11.4% | HardH | Solve→ |
Reconstruct Itinerary 11.4% | HardH | Solve→ |
UTF-8 Validation 11.4% | MediumM | Solve→ |
Queue Reconstruction by Height 11.4% | MediumM | Solve→ |
Find Largest Value in Each Tree Row 11.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Swapping Nodes in a Linked List 11.4% | MediumM | Solve→ |
Array Partition 11.4% | EasyE | Solve→ |
Human Traffic of Stadium 11.4% | HardH | Solve→ |
Dota2 Senate 11.4% | MediumM | Solve→ |
Partition to K Equal Sum Subsets 11.4% | MediumM | Solve→ |
Design HashSet 11.4% | EasyE | Solve→ |
Most Common Word 11.4% | EasyE | Solve→ |
Subarrays with K Different Integers 11.4% | HardH | Solve→ |
Cousins in Binary Tree 11.4% | EasyE | Solve→ |
Two City Scheduling 11.4% | MediumM | Solve→ |
Find in Mountain Array 11.4% | HardH | Solve→ |
Minimum Insertions to Balance a Parentheses String 11.4% | MediumM | Solve→ |
Crawler Log Folder 11.4% | EasyE | Solve→ |
Primary Department for Each Employee 11.4% | EasyE | Solve→ |
Check if an Original String Exists Given Two Encoded Strings 11.4% | HardH | Solve→ |
Count Subarrays With Score Less Than K 11.4% | HardH | Solve→ |
Remove Nodes From Linked List 11.4% | MediumM | Solve→ |
Count Elements With Maximum Frequency 11.4% | EasyE | Solve→ |
Ugly Number II 11.4% | MediumM | Solve→ |
Stone Game II 11.4% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 11.4% | MediumM | Solve→ |
Find Closest Number to Zero 11.4% | EasyE | Solve→ |
Insert Greatest Common Divisors in Linked List 11.4% | MediumM | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 11.4% | MediumM | Solve→ |
Check If Array Pairs Are Divisible by k 11.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Max Stack 11.4% | HardH | Solve→ |
Equal Row and Column Pairs 11.4% | MediumM | Solve→ |
Split a String in Balanced Strings 11.4% | EasyE | Solve→ |
Smallest Range Covering Elements from K Lists 11.4% | HardH | Solve→ |
Minimum Moves to Equal Array Elements 11.4% | MediumM | Solve→ |
Longest String Chain 11.4% | MediumM | Solve→ |
Find if Array Can Be Sorted 11.4% | MediumM | Solve→ |
Add Two Promises 11.4% | EasyE | Solve→ |
Shortest Subarray With OR at Least K II 11.4% | MediumM | Solve→ |
Nested List Weight Sum II 11.4% | MediumM | Solve→ |
Design Hit Counter 11.4% | MediumM | Solve→ |
Number of Common Factors 11.4% | EasyE | Solve→ |
Sliding Puzzle 11.4% | HardH | Solve→ |
Move Pieces to Obtain a String 11.4% | MediumM | Solve→ |
Valid Phone Numbers 11.4% | EasyE | Solve→ |
Minimum Limit of Balls in a Bag 11.4% | MediumM | Solve→ |
Find Longest Special Substring That Occurs Thrice I 11.4% | MediumM | Solve→ |
Possible Bipartition 11.4% | MediumM | Solve→ |
Maximum Earnings From Taxi 11.4% | MediumM | Solve→ |
All Ancestors of a Node in a Directed Acyclic Graph 11.4% | MediumM | Solve→ |
My Calendar I 11.4% | MediumM | Solve→ |
Determine Whether Matrix Can Be Obtained By Rotation 11.4% | EasyE | Solve→ |
Car Fleet 11.4% | MediumM | Solve→ |
Best Sightseeing Pair 11.4% | MediumM | Solve→ |
Count Ways To Build Good Strings 11.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Counting Words With a Given Prefix 11.4% | EasyE | Solve→ |
Find the Difference of Two Arrays 11.4% | EasyE | Solve→ |
Meeting Rooms III 11.4% | HardH | Solve→ |
Clear Digits 11.4% | EasyE | Solve→ |
Remove All Occurrences of a Substring 11.4% | MediumM | Solve→ |
Rank Transform of a Matrix 11.4% | HardH | Solve→ |
Delete and Earn 11.4% | MediumM | Solve→ |
Second Minimum Node In a Binary Tree 11.4% | EasyE | Solve→ |
Delete Nodes From Linked List Present in Array 11.4% | MediumM | Solve→ |
Water Bottles 11.4% | EasyE | Solve→ |
Restaurant Growth 11.4% | MediumM | Solve→ |
Design Parking System 11.4% | EasyE | Solve→ |
House Robber IV 11.4% | MediumM | Solve→ |
Construct String from Binary Tree 11.4% | MediumM | Solve→ |
Flatten Deeply Nested Array 11.4% | MediumM | Solve→ |
Matchsticks to Square 11.4% | MediumM | Solve→ |
Keys and Rooms 11.4% | MediumM | Solve→ |
Push Dominoes 11.4% | MediumM | Solve→ |
Zero Array Transformation III 11.4% | MediumM | Solve→ |
Minimum Cost of Buying Candies With Discount 11.4% | EasyE | Solve→ |
Binary Watch 11.4% | EasyE | Solve→ |
Network Delay Time 11.4% | MediumM | Solve→ |
Find the Lexicographically Largest String From the Box I 11.4% | MediumM | Solve→ |
Minimum Number of Vertices to Reach All Nodes 11.4% | MediumM | Solve→ |
Find the Peaks 11.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Original Typed String I 11.4% | EasyE | Solve→ |
Maximum XOR of Two Numbers in an Array 11.4% | MediumM | Solve→ |
Maximum Matching of Players With Trainers 11.4% | MediumM | Solve→ |
Sum of Root To Leaf Binary Numbers 11.4% | EasyE | Solve→ |
Maximum 69 Number 11.4% | EasyE | Solve→ |
24 Game 11.4% | HardH | Solve→ |
Minimum Time to Repair Cars 11.4% | MediumM | Solve→ |
Binary Tree Longest Consecutive Sequence 11.4% | MediumM | Solve→ |
Jump Game IV 11.4% | HardH | Solve→ |
Find the XOR of Numbers Which Appear Twice 11.4% | EasyE | Solve→ |
Largest Perimeter Triangle 11.4% | EasyE | Solve→ |
Minimum Genetic Mutation 11.4% | MediumM | Solve→ |
4Sum II 11.4% | MediumM | Solve→ |
Count Unguarded Cells in the Grid 11.4% | MediumM | Solve→ |
Power Grid Maintenance 11.4% | MediumM | Solve→ |
Restore the Array From Adjacent Pairs 11.4% | MediumM | Solve→ |
Unpopular Books 11.4% | MediumM | Solve→ |
Contains Duplicate III 11.4% | HardH | Solve→ |
Flipping an Image 11.4% | EasyE | Solve→ |
Count Partitions With Max-Min Difference at Most K 11.4% | MediumM | Solve→ |
Count Special Triplets 11.4% | MediumM | Solve→ |
Nth Highest Salary 11.4% | MediumM | Solve→ |
Minimum Operations to Make Array Sum Divisible by K 11.4% | EasyE | Solve→ |
Delete Columns to Make Sorted 11.4% | EasyE | Solve→ |
Minimum Bit Flips to Convert Number 11.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Last Day Where You Can Still Cross 11.4% | HardH | Solve→ |
Four Divisors 11.4% | MediumM | Solve→ |
Maximum Matrix Sum 11.4% | MediumM | Solve→ |
Separate Squares I 11.4% | MediumM | Solve→ |
Find the Largest Area of Square Inside Two Rectangles 11.4% | MediumM | Solve→ |
Minimum Cost Path with Teleportations 11.4% | HardH | Solve→ |
Trionic Array II 11.4% | HardH | Solve→ |
Longest Happy Prefix 11.4% | HardH | Solve→ |
Longest Balanced Substring I 11.4% | MediumM | Solve→ |
Longest Balanced Substring II 11.4% | MediumM | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 11.4% | MediumM | Solve→ |
Number of Steps to Reduce a Number in Binary Representation to One 11.4% | MediumM | Solve→ |
Minimum Number of Flips to Make the Binary String Alternating 11.4% | MediumM | Solve→ |
Number of Steps to Reduce a Number to Zero 11.4% | EasyE | Solve→ |
Minimum Absolute Distance Between Mirror Pairs 11.4% | MediumM | Solve→ |
Minimum Element After Replacement With Digit Sum 11.4% | EasyE | Solve→ |
Maximum Building Height 11.4% | HardH | Solve→ |
Perfect Squares 11.4% | MediumM | Solve→ |
Find the Number of Subsequences With Equal GCD 11.4% | HardH | Solve→ |
Smallest Palindromic Rearrangement I 11.4% | MediumM | Solve→ |
Predict the Winner 11.4% | MediumM | Solve→ |
Permutations II 8% | MediumM | Solve→ |
Factorial Trailing Zeroes 8% | MediumM | Solve→ |
Bulls and Cows 8% | MediumM | Solve→ |
House Robber III 8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shuffle an Array 8% | MediumM | Solve→ |
Find Mode in Binary Search Tree 8% | EasyE | Solve→ |
IPO 8% | HardH | Solve→ |
Minimum Window Subsequence 8% | HardH | Solve→ |
Basic Calculator III 8% | HardH | Solve→ |
K-th Symbol in Grammar 8% | MediumM | Solve→ |
All Paths From Source to Target 8% | MediumM | Solve→ |
Rectangle Overlap 8% | EasyE | Solve→ |
Find Common Characters 8% | EasyE | Solve→ |
Maximum Difference Between Node and Ancestor 8% | MediumM | Solve→ |
Recover a Tree From Preorder Traversal 8% | HardH | Solve→ |
Grumpy Bookstore Owner 8% | MediumM | Solve→ |
Relative Sort Array 8% | EasyE | Solve→ |
N-th Tribonacci Number 8% | EasyE | Solve→ |
Number of Dice Rolls With Target Sum 8% | MediumM | Solve→ |
Search Suggestions System 8% | MediumM | Solve→ |
Subtract the Product and Sum of Digits of an Integer 8% | EasyE | Solve→ |
Number of Good Pairs 8% | EasyE | Solve→ |
Find Users With Valid E-Mails 8% | EasyE | Solve→ |
The Number of Employees Which Report to Each Employee 8% | EasyE | Solve→ |
Minimize Maximum Pair Sum in Array 8% | MediumM | Solve→ |
Find Unique Binary String 8% | MediumM | Solve→ |
Time Needed to Buy Tickets 8% | EasyE | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 8% | MediumM | Solve→ |
Design Memory Allocator 8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Apply Transform Over Each Element in Array 8% | EasyE | Solve→ |
Event Emitter 8% | MediumM | Solve→ |
Find Common Elements Between Two Arrays 8% | EasyE | Solve→ |
Count Subarrays Where Max Element Appears at Least K Times 8% | MediumM | Solve→ |
Length of the Longest Subsequence That Sums to Target 8% | MediumM | Solve→ |
Shortest Unsorted Continuous Subarray 8% | MediumM | Solve→ |
Spiral Matrix III 8% | MediumM | Solve→ |
Sum of Digits of String After Convert 8% | EasyE | Solve→ |
Find Words That Can Be Formed by Characters 8% | EasyE | Solve→ |
Score of a String 8% | EasyE | Solve→ |
Guess Number Higher or Lower 8% | EasyE | Solve→ |
Longest Subarray With Maximum Bitwise AND 8% | MediumM | Solve→ |
Extra Characters in a String 8% | MediumM | Solve→ |
Linked List in Binary Tree 8% | MediumM | Solve→ |
Find the Minimum and Maximum Number of Nodes Between Critical Points 8% | MediumM | Solve→ |
Scramble String 8% | HardH | Solve→ |
Divide Intervals Into Minimum Number of Groups 8% | MediumM | Solve→ |
Ones and Zeroes 8% | MediumM | Solve→ |
Insert into a Binary Search Tree 8% | MediumM | Solve→ |
Minimum Array End 8% | MediumM | Solve→ |
Nth Digit 8% | MediumM | Solve→ |
The Maze II 8% | MediumM | Solve→ |
Longest Substring with At Least K Repeating Characters 8% | MediumM | Solve→ |
Find Score of an Array After Marking All Elements 8% | MediumM | Solve→ |
Stone Game III 8% | 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 8% | MediumM | Solve→ |
String Matching in an Array 8% | EasyE | Solve→ |
Sort Vowels in a String 8% | MediumM | Solve→ |
Construct K Palindrome Strings 8% | MediumM | Solve→ |
2 Keys Keyboard 8% | MediumM | Solve→ |
Detect Squares 8% | MediumM | Solve→ |
Spiral Matrix IV 8% | MediumM | Solve→ |
Minimum Cost to Make at Least One Valid Path in a Grid 8% | HardH | Solve→ |
Long Pressed Name 8% | EasyE | Solve→ |
Course Schedule IV 8% | MediumM | Solve→ |
Maximum Number of Fish in a Grid 8% | MediumM | Solve→ |
Divide Nodes Into the Maximum Number of Groups 8% | HardH | Solve→ |
Special Array I 8% | EasyE | Solve→ |
Tuple with Same Product 8% | MediumM | Solve→ |
Max Sum of a Pair With Equal Sum of Digits 8% | MediumM | Solve→ |
Max Chunks To Make Sorted 8% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 8% | MediumM | Solve→ |
Number of Sub-arrays With Odd Sum 8% | MediumM | Solve→ |
Number of Submatrices That Sum to Target 8% | HardH | Solve→ |
Number of Students Unable to Eat Lunch 8% | EasyE | Solve→ |
Apply Operations to an Array 8% | EasyE | Solve→ |
Most Stones Removed with Same Row or Column 8% | MediumM | Solve→ |
Magnetic Force Between Two Balls 8% | MediumM | Solve→ |
Image Smoother 8% | EasyE | Solve→ |
Display the First Three Rows 8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Nice Subarray 8% | MediumM | Solve→ |
Minimum Cost Walk in Weighted Graph 8% | HardH | Solve→ |
Shortest Path Visiting All Nodes 8% | HardH | Solve→ |
Two Furthest Houses With Different Colors 8% | EasyE | Solve→ |
Group Sold Products By The Date 8% | EasyE | Solve→ |
Convert BST to Greater Tree 8% | MediumM | Solve→ |
Find Building Where Alice and Bob Can Meet 8% | HardH | Solve→ |
Logger Rate Limiter 8% | EasyE | Solve→ |
Number of Valid Words in a Sentence 8% | EasyE | Solve→ |
Count the Number of Good Subarrays 8% | MediumM | Solve→ |
Count the Number of Fair Pairs 8% | MediumM | Solve→ |
String Compression III 8% | MediumM | Solve→ |
Word Frequency 8% | MediumM | Solve→ |
Nth Magical Number 8% | HardH | Solve→ |
Find the Closest Palindrome 8% | HardH | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 8% | MediumM | Solve→ |
Concatenated Divisibility 8% | HardH | Solve→ |
Painting the Walls 8% | HardH | Solve→ |
Count Number of Balanced Permutations 8% | HardH | Solve→ |
Find Minimum Time to Finish All Jobs 8% | HardH | Solve→ |
Painting a Grid With Three Different Colors 8% | HardH | Solve→ |
Maximum Units on a Truck 8% | EasyE | Solve→ |
Timeout Cancellation 8% | EasyE | Solve→ |
Lexicographically Smallest Equivalent String 8% | MediumM | Solve→ |
Design File System 8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Kth Smallest Number in Multiplication Table 8% | HardH | Solve→ |
Lexicographically Minimum String After Removing Stars 8% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency II 8% | HardH | Solve→ |
Maximum Difference Between Adjacent Elements in a Circular Array 8% | EasyE | Solve→ |
Minimum Time to Complete Trips 8% | MediumM | Solve→ |
Count the Number of Arrays with K Matching Adjacent Elements 8% | HardH | Solve→ |
Rotated Digits 8% | MediumM | Solve→ |
Find All K-Distant Indices in an Array 8% | EasyE | Solve→ |
Furthest Building You Can Reach 8% | MediumM | Solve→ |
Continuous Subarrays 8% | MediumM | Solve→ |
Sales Person 8% | EasyE | Solve→ |
Find Root of N-Ary Tree 8% | MediumM | Solve→ |
Sum of Absolute Differences in a Sorted Array 8% | MediumM | Solve→ |
Valid Word 8% | EasyE | Solve→ |
Minimum Difference in Sums After Removal of Elements 8% | HardH | Solve→ |
Minimum Number Game 8% | EasyE | Solve→ |
Single-Threaded CPU 8% | MediumM | Solve→ |
Maximum Unique Subarray Sum After Deletion 8% | EasyE | Solve→ |
Resulting String After Adjacent Removals 8% | MediumM | Solve→ |
Shortest Cycle in a Graph 8% | HardH | Solve→ |
Check If a String Contains All Binary Codes of Size K 8% | MediumM | Solve→ |
Longest Arithmetic Subsequence of Given Difference 8% | MediumM | Solve→ |
Maximum Number of Occurrences of a Substring 8% | MediumM | Solve→ |
Count Submatrices With All Ones 8% | MediumM | Solve→ |
Count the Number of Powerful Integers 8% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Operations to Make the Integer Zero 8% | MediumM | Solve→ |
Vowel Spellchecker 8% | MediumM | Solve→ |
Replace Elements with Greatest Element on Right Side 8% | EasyE | Solve→ |
Distant Barcodes 8% | MediumM | Solve→ |
Minimum Score Triangulation of Polygon 8% | MediumM | Solve→ |
Avoid Flood in The City 8% | MediumM | Solve→ |
Find the Minimum Amount of Time to Brew Potions 8% | MediumM | Solve→ |
Min Cost to Connect All Points 8% | MediumM | Solve→ |
The Two Sneaky Numbers of Digitville 8% | EasyE | Solve→ |
Finding Pairs With a Certain Sum 8% | MediumM | Solve→ |
Maximum Number of Distinct Elements After Operations 8% | MediumM | Solve→ |
Maximum Height by Stacking Cuboids 8% | HardH | Solve→ |
Check If Digits Are Equal in String After Operations I 8% | EasyE | Solve→ |
Make Array Elements Equal to Zero 8% | EasyE | Solve→ |
Find X-Sum of All K-Long Subarrays I 8% | EasyE | Solve→ |
Cherry Pickup II 8% | HardH | Solve→ |
Tree Node 8% | MediumM | Solve→ |
Maximum Subarray Sum With Length Divisible by K 8% | MediumM | Solve→ |
Longest Even Odd Subarray With Threshold 8% | EasyE | Solve→ |
Maximum Running Time of N Computers 8% | HardH | Solve→ |
Corporate Flight Bookings 8% | MediumM | Solve→ |
Decoded String at Index 8% | MediumM | Solve→ |
Best Time to Buy and Sell Stock V 8% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array II 8% | HardH | Solve→ |
Fair Candy Swap 8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Max Dot Product of Two Subsequences 8% | HardH | Solve→ |
Last Stone Weight II 8% | MediumM | Solve→ |
Find Bottom Left Tree Value 8% | MediumM | Solve→ |
Maximize the Confusion of an Exam 8% | MediumM | Solve→ |
Minimum Removals to Balance Array 8% | MediumM | Solve→ |
Reverse Words in a String III 8% | EasyE | Solve→ |
Stream of Characters 8% | HardH | Solve→ |
Minimum Changes To Make Alternating Binary String 8% | EasyE | Solve→ |
Binary Tree Longest Consecutive Sequence II 8% | MediumM | Solve→ |
Furthest Point From Origin 8% | EasyE | Solve→ |
Cyclically Rotating a Grid 8% | MediumM | Solve→ |
Minimum Moves to Make Array Complementary 8% | MediumM | Solve→ |
Jump Game VII 8% | MediumM | Solve→ |
Construct Quad Tree 8% | MediumM | Solve→ |
Left and Right Sum Differences 8% | EasyE | Solve→ |
Create Binary Tree From Descriptions 8% | MediumM | Solve→ |
Maximum Total Subarray Value I 8% | MediumM | Solve→ |
Number of Ways to Assign Edge Weights I 8% | MediumM | Solve→ |
Minimum String Length After Removing Substrings 8% | EasyE | Solve→ |
Count Subarrays With Majority Element I 8% | MediumM | Solve→ |
Find the Maximum Number of Elements in Subset 8% | MediumM | Solve→ |
Minimum Cost to Move Chips to The Same Position 8% | EasyE | Solve→ |
Path Existence Queries in a Graph I 8% | MediumM | Solve→ |
Count Numbers with Unique Digits 8% | MediumM | Solve→ |
Find Missing Elements 8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Divisible Digit Product I 8% | EasyE | Solve→ |
Find the Lexicographically Smallest Valid Sequence 8% | MediumM | Solve→ |
Rectangle Area 5% | MediumM | Solve→ |
Range Module 5% | HardH | Solve→ |
Bus Routes 5% | HardH | Solve→ |
Most Profit Assigning Work 5% | MediumM | Solve→ |
Complete Binary Tree Inserter 5% | MediumM | Solve→ |
Sum of Nodes with Even-Valued Grandparent 5% | MediumM | Solve→ |
Snapshot Array 5% | MediumM | Solve→ |
Convert Binary Number in a Linked List to Integer 5% | EasyE | Solve→ |
Destination City 5% | EasyE | Solve→ |
Average Waiting Time 5% | MediumM | Solve→ |
Count of Matches in Tournament 5% | EasyE | Solve→ |
Step-By-Step Directions From a Binary Tree Node to Another 5% | MediumM | Solve→ |
Adding Spaces to a String 5% | MediumM | Solve→ |
Largest Local Values in a Matrix 5% | EasyE | Solve→ |
Count Subarrays With Fixed Bounds 5% | HardH | Solve→ |
Find the Pivot Integer 5% | EasyE | Solve→ |
Debounce 5% | MediumM | Solve→ |
Find the Maximum Length of Valid Subsequence II 5% | MediumM | Solve→ |
Path with Maximum Probability 5% | MediumM | Solve→ |
Convert 1D Array Into 2D Array 5% | EasyE | Solve→ |
Design In-Memory File System 5% | HardH | Solve→ |
K Inverse Pairs Array 5% | HardH | Solve→ |
Shortest Way to Form String 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count the Number of Substrings With Dominant Ones 5% | MediumM | Solve→ |
Maximum Total Damage With Spell Casting 5% | MediumM | Solve→ |
K-th Smallest in Lexicographical Order 5% | HardH | Solve→ |
Remove Max Number of Edges to Keep Graph Fully Traversable 5% | HardH | Solve→ |
Split a String Into the Max Number of Unique Substrings 5% | MediumM | Solve→ |
Insertion Sort List 5% | MediumM | Solve→ |
Maximum Vacation Days 5% | HardH | Solve→ |
Longest Square Streak in an Array 5% | MediumM | Solve→ |
Longest Subsequence With Limited Sum 5% | EasyE | Solve→ |
Minimum Number of Removals to Make Mountain Array 5% | HardH | Solve→ |
Seat Reservation Manager 5% | MediumM | Solve→ |
Shortest Subarray to be Removed to Make Array Sorted 5% | MediumM | Solve→ |
Find the Power of K-Size Subarrays I 5% | MediumM | Solve→ |
Self Dividing Numbers 5% | EasyE | Solve→ |
Find Champion II 5% | MediumM | Solve→ |
Take Gifts From the Richest Pile 5% | EasyE | Solve→ |
Linked List Random Node 5% | MediumM | Solve→ |
Number of Laser Beams in a Bank 5% | MediumM | Solve→ |
Design Circular Deque 5% | MediumM | Solve→ |
Number Complement 5% | EasyE | Solve→ |
Maximum Frequency Stack 5% | HardH | Solve→ |
Heaters 5% | MediumM | Solve→ |
Count Prefix and Suffix Pairs I 5% | EasyE | Solve→ |
Longest Repeating Substring 5% | MediumM | Solve→ |
Maximum and Minimum Sums of at Most Size K Subsequences 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Print Binary Tree 5% | MediumM | Solve→ |
Count Servers that Communicate 5% | MediumM | Solve→ |
Maximum Twin Sum of a Linked List 5% | MediumM | Solve→ |
Count Number of Maximum Bitwise-OR Subsets 5% | MediumM | Solve→ |
Minimum Area Rectangle 5% | MediumM | Solve→ |
Similar String Groups 5% | HardH | Solve→ |
Find the Punishment Number of an Integer 5% | MediumM | Solve→ |
Max Consecutive Ones II 5% | MediumM | Solve→ |
Most Profitable Path in a Tree 5% | MediumM | Solve→ |
Length of Longest Fibonacci Subsequence 5% | MediumM | Solve→ |
Find the Town Judge 5% | EasyE | Solve→ |
Check if Number is a Sum of Powers of Three 5% | MediumM | Solve→ |
Closest Prime Numbers in Range 5% | MediumM | Solve→ |
Function Composition 5% | EasyE | Solve→ |
Minimum Recolors to Get K Consecutive Black Blocks 5% | EasyE | Solve→ |
Beautiful Array 5% | MediumM | Solve→ |
Final Array State After K Multiplication Operations II 5% | HardH | Solve→ |
Detect Capital 5% | EasyE | Solve→ |
Minimum Operations to Make a Uni-Value Grid 5% | MediumM | Solve→ |
Generate Random Point in a Circle 5% | MediumM | Solve→ |
Maximum Number of Points From Grid Queries 5% | HardH | Solve→ |
Apply Operations to Maximize Score 5% | HardH | Solve→ |
Transpose File 5% | MediumM | Solve→ |
Solving Questions With Brainpower 5% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet I 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove Boxes 5% | HardH | Solve→ |
Divide Array Into Equal Pairs 5% | EasyE | Solve→ |
Minimum Number of Operations to Make Elements in Array Distinct 5% | EasyE | Solve→ |
Maximum Odd Binary Number 5% | EasyE | Solve→ |
Minimum Average Difference 5% | MediumM | Solve→ |
Longest Palindrome After Substring Concatenation I 5% | MediumM | Solve→ |
Count Special Quadruplets 5% | EasyE | Solve→ |
Find Maximal Uncovered Ranges 5% | MediumM | Solve→ |
Count Nice Pairs in an Array 5% | MediumM | Solve→ |
Knight Dialer 5% | MediumM | Solve→ |
Count Complete Subarrays in an Array 5% | MediumM | Solve→ |
Count of Interesting Subarrays 5% | MediumM | Solve→ |
Minimum Cost to Cut a Stick 5% | HardH | Solve→ |
Reverse Nodes in Even Length Groups 5% | MediumM | Solve→ |
Count Subarrays of Length Three With a Condition 5% | EasyE | Solve→ |
A Number After a Double Reversal 5% | EasyE | Solve→ |
Satisfiability of Equality Equations 5% | MediumM | Solve→ |
Calculate Money in Leetcode Bank 5% | EasyE | Solve→ |
Maximum Number of Tasks You Can Assign 5% | HardH | Solve→ |
Minimum Moves to Reach Target Score 5% | MediumM | Solve→ |
Minimum Number of Taps to Open to Water a Garden 5% | HardH | Solve→ |
Remove Digit From Number to Maximize Result 5% | EasyE | Solve→ |
Longest Uncommon Subsequence I 5% | EasyE | Solve→ |
Minimum Domino Rotations For Equal Row 5% | MediumM | Solve→ |
Longest Unequal Adjacent Groups Subsequence II 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Minimum Time to Reach Last Room I 5% | MediumM | Solve→ |
Longest Palindrome by Concatenating Two Letter Words 5% | MediumM | Solve→ |
Minimum Adjacent Swaps to Reach the Kth Smallest Number 5% | MediumM | Solve→ |
Total Distance Traveled 5% | EasyE | Solve→ |
Clone Binary Tree With Random Pointer 5% | MediumM | Solve→ |
Using a Robot to Print the Lexicographically Smallest String 5% | MediumM | Solve→ |
Bitwise AND of Numbers Range 5% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency I 5% | EasyE | Solve→ |
Group the People Given the Group Size They Belong To 5% | MediumM | Solve→ |
Flip String to Monotone Increasing 5% | MediumM | Solve→ |
Transform Array to All Equal Elements 5% | MediumM | Solve→ |
Max Difference You Can Get From Changing an Integer 5% | MediumM | Solve→ |
Divide Array Into Arrays With Max Difference 5% | MediumM | Solve→ |
Maximum Manhattan Distance After K Changes 5% | MediumM | Solve→ |
Minimum Fuel Cost to Report to the Capital 5% | MediumM | Solve→ |
Reach End of Array With Max Score 5% | MediumM | Solve→ |
Find Duplicate Subtrees 5% | MediumM | Solve→ |
Find Original Array From Doubled Array 5% | MediumM | Solve→ |
Find the Original Typed String II 5% | HardH | Solve→ |
Fraction Addition and Subtraction 5% | MediumM | Solve→ |
Ways to Express an Integer as Sum of Powers 5% | MediumM | Solve→ |
Prime Palindrome 5% | MediumM | Solve→ |
Paint Fence 5% | MediumM | Solve→ |
Count Odd Numbers in an Interval Range 5% | EasyE | Solve→ |
Reschedule Meetings for Maximum Free Time I 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The Earliest and Latest Rounds Where Players Compete 5% | HardH | Solve→ |
Construct Binary Tree from Inorder and Postorder Traversal 5% | MediumM | Solve→ |
Height of Binary Tree After Subtree Removal Queries 5% | HardH | Solve→ |
Smallest Range II 5% | MediumM | Solve→ |
Find the Maximum Length of Valid Subsequence I 5% | MediumM | Solve→ |
Find N Unique Integers Sum up to Zero 5% | EasyE | Solve→ |
Sort Items by Groups Respecting Dependencies 5% | HardH | Solve→ |
Super Pow 5% | MediumM | Solve→ |
Maximum Erasure Value 5% | MediumM | Solve→ |
Minimum Score After Removals on a Tree 5% | HardH | Solve→ |
Maximum Score From Removing Substrings 5% | MediumM | Solve→ |
Complement of Base 10 Integer 5% | EasyE | Solve→ |
Palindrome Pairs 5% | HardH | Solve→ |
Smallest Subarrays With Maximum Bitwise OR 5% | MediumM | Solve→ |
Minimum Addition to Make Integer Beautiful 5% | MediumM | Solve→ |
Bitwise ORs of Subarrays 5% | MediumM | Solve→ |
Minimum Number of Operations to Make Array Empty 5% | MediumM | Solve→ |
Rearranging Fruits 5% | HardH | Solve→ |
Reach a Number 5% | MediumM | Solve→ |
Complex Number Multiplication 5% | MediumM | Solve→ |
Reordered Power of 2 5% | MediumM | Solve→ |
Partition Array into Two Equal Product Subsets 5% | MediumM | Solve→ |
Swap Sex of Employees 5% | EasyE | Solve→ |
Design Linked List 5% | MediumM | Solve→ |
Transformed Array 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Alternating Subsequence Sum 5% | MediumM | Solve→ |
Max Pair Sum in an Array 5% | EasyE | Solve→ |
Check if Two Chessboard Squares Have the Same Color 5% | EasyE | Solve→ |
Non-decreasing Array 5% | MediumM | Solve→ |
Maximum Area of Longest Diagonal Rectangle 5% | EasyE | Solve→ |
Reformat Department Table 5% | EasyE | Solve→ |
Sort Matrix by Diagonals 5% | MediumM | Solve→ |
Reorder Data in Log Files 5% | MediumM | Solve→ |
Find the Number of Ways to Place People I 5% | MediumM | Solve→ |
Find the Number of Ways to Place People II 5% | HardH | Solve→ |
Find Closest Person 5% | EasyE | Solve→ |
3Sum With Multiplicity 5% | MediumM | Solve→ |
Cherry Pickup 5% | HardH | Solve→ |
Vowels Game in a String 5% | MediumM | Solve→ |
Grid Teleportation Traversal 5% | MediumM | Solve→ |
Additive Number 5% | MediumM | Solve→ |
Decode the Message 5% | EasyE | Solve→ |
Perfect Rectangle 5% | HardH | Solve→ |
Water Bottles II 5% | MediumM | Solve→ |
Loud and Rich 5% | MediumM | Solve→ |
Zigzag Grid Traversal With Skip 5% | EasyE | Solve→ |
Count the Number of Infection Sequences 5% | HardH | Solve→ |
Compute Decimal Representation 5% | EasyE | Solve→ |
Can I Win 5% | MediumM | Solve→ |
Number of Pairs Satisfying Inequality 5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Sum of Array Product of Magical Sequences 5% | HardH | Solve→ |
Lowest Common Ancestor of a Binary Tree IV 5% | MediumM | Solve→ |
Minimum Difference Between Highest and Lowest of K Scores 5% | EasyE | Solve→ |
Eliminate Maximum Number of Monsters 5% | MediumM | Solve→ |
Design an Ordered Stream 5% | EasyE | Solve→ |
Maximum Frequency of an Element After Performing Operations I 5% | MediumM | Solve→ |
Next Greater Numerically Balanced Number 5% | MediumM | Solve→ |
Length of the Longest Valid Substring 5% | HardH | Solve→ |
Count Number of Rectangles Containing Each Point 5% | MediumM | Solve→ |
Number of Days Between Two Dates 5% | EasyE | Solve→ |
Design a Text Editor 5% | HardH | Solve→ |
Find Missing Observations 5% | MediumM | Solve→ |
Minimum Operations to Convert All Elements to Zero 5% | MediumM | Solve→ |
Increment Submatrices by One 5% | MediumM | Solve→ |
Check If All 1's Are at Least Length K Places Away 5% | EasyE | Solve→ |
The K Weakest Rows in a Matrix 5% | EasyE | Solve→ |
Keep Multiplying Found Values by Two 5% | EasyE | Solve→ |
3Sum Smaller 5% | MediumM | Solve→ |
Set Intersection Size At Least Two 5% | HardH | Solve→ |
Maximum Binary Tree 5% | MediumM | Solve→ |
Shortest Distance in a Plane 5% | MediumM | Solve→ |
Smallest Integer Divisible by K 5% | MediumM | Solve→ |
Minimum Length of String After Deleting Similar Ends 5% | MediumM | Solve→ |
Capital Gain/Loss 5% | MediumM | Solve→ |
Count Number of Trapezoids I 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Operations to Make Array Elements Zero 5% | HardH | Solve→ |
Count the Number of Computer Unlocking Permutations 5% | MediumM | Solve→ |
Jump Game VI 5% | MediumM | Solve→ |
Two Best Non-Overlapping Events 5% | MediumM | Solve→ |
Maximum Product of Three Elements After One Replacement 5% | MediumM | Solve→ |
Split and Merge Array Transformation 5% | MediumM | Solve→ |
Rearrange Products Table 5% | EasyE | Solve→ |
Maximum Profit from Trading Stocks with Discounts 5% | HardH | Solve→ |
Binary Tree Tilt 5% | EasyE | Solve→ |
N-Repeated Element in Size 2N Array 5% | EasyE | Solve→ |
Number of Ways to Paint N × 3 Grid 5% | HardH | Solve→ |
Parallel Courses 5% | MediumM | Solve→ |
Employee Free Time 5% | HardH | Solve→ |
Minimum ASCII Delete Sum for Two Strings 5% | MediumM | Solve→ |
Super Ugly Number 5% | MediumM | Solve→ |
Maximize Area of Square Hole in Grid 5% | MediumM | Solve→ |
Construct the Minimum Bitwise Array II 5% | MediumM | Solve→ |
Minimum Number of Seconds to Make Mountain Height Zero 5% | MediumM | Solve→ |
Divide an Array Into Subarrays With Minimum Cost I 5% | EasyE | Solve→ |
Trionic Array I 5% | EasyE | Solve→ |
Longest Mountain in Array 5% | MediumM | Solve→ |
Matrix Similarity After Cyclic Shifts 5% | EasyE | Solve→ |
Champagne Tower 5% | MediumM | Solve→ |
Largest Prime from Consecutive Prime Sum 5% | MediumM | Solve→ |
Reshape Data: Pivot 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Distinct Prime Factors of Product of Array 5% | MediumM | Solve→ |
Prime Subtraction Operation 5% | MediumM | Solve→ |
Matrix Diagonal Sum 5% | EasyE | Solve→ |
Lexicographically Smallest String After Deleting Duplicate Characters 5% | HardH | Solve→ |
Maximum Ascending Subarray Sum 5% | EasyE | Solve→ |
Ways to Make a Fair Array 5% | MediumM | Solve→ |
Sum of Distances in Tree 5% | HardH | Solve→ |
Number of Adjacent Elements With the Same Color 5% | MediumM | Solve→ |
Sort Transformed Array 5% | MediumM | Solve→ |
Count Triplets That Can Form Two Arrays of Equal XOR 5% | MediumM | Solve→ |
Lexicographically Smallest Palindrome 5% | EasyE | Solve→ |
Largest Submatrix With Rearrangements 5% | MediumM | Solve→ |
Distribute Coins in Binary Tree 5% | MediumM | Solve→ |
Flip Square Submatrix Vertically 5% | EasyE | Solve→ |
Sort Array By Parity II 5% | EasyE | Solve→ |
The Latest Time to Catch a Bus 5% | MediumM | Solve→ |
Largest 3-Same-Digit Number in String 5% | EasyE | Solve→ |
Find All Possible Stable Binary Arrays I 5% | MediumM | Solve→ |
Clumsy Factorial 5% | MediumM | Solve→ |
Inverse Coin Change 5% | MediumM | Solve→ |
Type of Triangle 5% | EasyE | Solve→ |
Robot Collisions 5% | HardH | Solve→ |
Minimum Falling Path Sum II 5% | HardH | Solve→ |
Course Schedule III 5% | HardH | Solve→ |
Buddy Strings 5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
The kth Factor of n 5% | MediumM | Solve→ |
Sum of Distances 5% | MediumM | Solve→ |
Minimum Number of Swaps to Make the String Balanced 5% | MediumM | Solve→ |
Split the Array 5% | EasyE | Solve→ |
Detect Cycles in 2D Grid 5% | MediumM | Solve→ |
Rotate Function 5% | MediumM | Solve→ |
Intersection of Multiple Arrays 5% | EasyE | Solve→ |
Total Characters in String After Transformations I 5% | MediumM | Solve→ |
Minimum Value to Get Positive Step by Step Sum 5% | EasyE | Solve→ |
Minimum Jumps to Reach End via Prime Teleportation 5% | MediumM | Solve→ |
Coupon Code Validator 5% | EasyE | Solve→ |
Maximum Number of Jumps to Reach the Last Index 5% | MediumM | Solve→ |
Count Good Triplets 5% | EasyE | Solve→ |
Count K-th Roots in a Range 5% | MediumM | Solve→ |
Smallest Even Multiple 5% | EasyE | Solve→ |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree 5% | HardH | Solve→ |
K Items With the Maximum Sum 5% | EasyE | Solve→ |
Earliest Finish Time for Land and Water Rides I 5% | EasyE | Solve→ |
Smallest Subsequence of Distinct Characters 5% | MediumM | Solve→ |
Partition Array According to Given Pivot 5% | MediumM | Solve→ |
Bag of Tokens 5% | MediumM | Solve→ |
Matrix Block Sum 5% | MediumM | Solve→ |
Maximum Non Negative Product in a Matrix 5% | MediumM | Solve→ |
Minimum Penalty for a Shop 5% | MediumM | Solve→ |
Find Target Indices After Sorting Array 5% | EasyE | 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 5% | HardH | Solve→ |
Day of the Year 5% | EasyE | Solve→ |
Count Vowel Strings in Ranges 5% | MediumM | Solve→ |
Create Target Array in the Given Order 5% | EasyE | Solve→ |
Maximum Number of Balloons 5% | EasyE | Solve→ |
Maximum Beauty of an Array After Applying Operation 5% | MediumM | Solve→ |
Max Increase to Keep City Skyline 5% | MediumM | Solve→ |
Number of ZigZag Arrays I 5% | HardH | Solve→ |
Strong Password Checker 5% | HardH | Solve→ |
Find a Safe Walk Through a Grid 5% | MediumM | Solve→ |
Second Largest Digit in a String 5% | EasyE | Solve→ |
Remove Comments 5% | MediumM | Solve→ |
Remove Covered Intervals 5% | MediumM | Solve→ |
Frequency Balance Subarray 5% | MediumM | Solve→ |
Number of Enclaves 5% | MediumM | Solve→ |
Path Existence Queries in a Graph II 5% | HardH | Solve→ |
Minimum Number of Moves to Seat Everyone 5% | EasyE | Solve→ |
Count the Number of Complete Components 5% | MediumM | Solve→ |
Next Greater Element IV 5% | HardH | Solve→ |
Special Array With X Elements Greater Than or Equal X 5% | EasyE | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum I 5% | EasyE | Solve→ |
Restore Finishing Order 5% | EasyE | Solve→ |
Critical Connections in a Network 5% | HardH | Solve→ |
Limit Occurrences in Sorted Array 5% | EasyE | Solve→ |
Maximum Value at a Given Index in a Bounded Array 5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimized Maximum of Products Distributed to Any Store 5% | MediumM | Solve→ |
Sliding Subarray Beauty 5% | MediumM | Solve→ |
Number of Different Subsequences GCDs 5% | HardH | Solve→ |
Calculate Special Bonus 5% | EasyE | Solve→ |
Number of Unique XOR Triplets I 5% | MediumM | Solve→ |
Number of Even and Odd Bits 5% | EasyE | Solve→ |
Maximum Subarray Sum with One Deletion 5% | MediumM | Solve→ |
Maximum Product of Two Digits 5% | EasyE | Solve→ |
Integer Replacement 5% | MediumM | Solve→ |
Biggest Single Number 5% | EasyE | Solve→ |
Smallest Palindromic Rearrangement II 5% | HardH | Solve→ |
Minimum Number of K Consecutive Bit Flips 5% | HardH | Solve→ |
Truncate Sentence 5% | EasyE | Solve→ |
Number of Changing Keys 5% | EasyE | Solve→ |
Find the Winner of the Circular Game 5% | MediumM | Solve→ |
Find the Kth Largest Integer in the Array 5% | MediumM | Solve→ |
Patients With a Condition 5% | EasyE | Solve→ |
Minimum Cost Path with Alternating Directions III 5% | HardH | Solve→ |
Count Beautiful Numbers 5% | HardH | Solve→ |
Smallest Divisible Digit Product II 5% | HardH | Solve→ |
Sum Multiples 5% | EasyE | Solve→ |
Height Checker 5% | EasyE | Solve→ |
Count Subarrays With K Distinct Integers 5% | HardH | Solve→ |
Minimum Number of Coins to be Added 5% | MediumM | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Meta?
Our current Meta practice dataset contains 1399 tagged coding problems, including Minimum Remove to Make Valid Parentheses, Valid Word Abbreviation, Valid Palindrome II. The difficulty breakdown is 427 Easy, 763 Medium, and 209 Hard problems.
How should I prepare for a Meta coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Meta interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Meta coding interviews?
Based on our data, Meta interviews include 427 Easy (31%), 763 Medium (55%), and 209 Hard (15%) problems.
Ready to ace your Meta interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required