Microsoft LeetCode Interview Questions
Practice 1384 coding problems currently tagged to Microsoft. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
393 Easy
757 Medium
234 Hard
Top Topics at Microsoft
Ace your Microsoft interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Microsoft LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Two Sum 100% | EasyE | Solve→ |
Add Two Numbers 81.4% | MediumM | Solve→ |
Longest Palindromic Substring 80.5% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 79.7% | MediumM | Solve→ |
Trapping Rain Water 78.7% | HardH | Solve→ |
LRU Cache 77.9% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 77.7% | EasyE | Solve→ |
Median of Two Sorted Arrays 75.2% | HardH | Solve→ |
3Sum 74.9% | MediumM | Solve→ |
Maximum Subarray 74.9% | MediumM | Solve→ |
Merge Sorted Array 74.3% | EasyE | Solve→ |
Number of Islands 73.3% | MediumM | Solve→ |
Subarray Sum Equals K 73.3% | MediumM | Solve→ |
Merge Intervals 73.1% | MediumM | Solve→ |
Longest Common Prefix 71.7% | EasyE | Solve→ |
Palindrome Number 71.6% | EasyE | Solve→ |
Container With Most Water 71.4% | MediumM | Solve→ |
Valid Parentheses 71.4% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 70.8% | EasyE | Solve→ |
Majority Element 70.4% | EasyE | Solve→ |
Group Anagrams 70% | MediumM | Solve→ |
Roman to Integer 69.2% | EasyE | Solve→ |
Search in Rotated Sorted Array 68.5% | MediumM | Solve→ |
Next Permutation 66.9% | MediumM | Solve→ |
Rotate Image 66.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Spiral Matrix 66.7% | MediumM | Solve→ |
Climbing Stairs 66.5% | EasyE | Solve→ |
Merge Two Sorted Lists 66.2% | EasyE | Solve→ |
Create Hello World Function 65.7% | EasyE | Solve→ |
Merge k Sorted Lists 65.2% | HardH | Solve→ |
Reverse Linked List 65.2% | EasyE | Solve→ |
Merge Strings Alternately 65.2% | EasyE | Solve→ |
Koko Eating Bananas 64.9% | MediumM | Solve→ |
Generate Parentheses 64.7% | MediumM | Solve→ |
Product of Array Except Self 64.4% | MediumM | Solve→ |
Move Zeroes 64.4% | EasyE | Solve→ |
Sort Colors 64.1% | MediumM | Solve→ |
Reverse Integer 63% | MediumM | Solve→ |
Longest Consecutive Sequence 62.7% | MediumM | Solve→ |
Reverse Nodes in k-Group 62% | HardH | Solve→ |
Find Peak Element 62% | MediumM | Solve→ |
Valid Anagram 62% | EasyE | Solve→ |
Rotate Array 61.7% | MediumM | Solve→ |
Kth Largest Element in an Array 60.4% | MediumM | Solve→ |
Recyclable and Low Fat Products 60% | EasyE | Solve→ |
Valid Palindrome 59.7% | EasyE | Solve→ |
Single Element in a Sorted Array 59.7% | MediumM | Solve→ |
Serialize and Deserialize Binary Tree 59.3% | HardH | Solve→ |
House Robber 59% | MediumM | Solve→ |
Letter Combinations of a Phone Number 58.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Jump Game 58.6% | MediumM | Solve→ |
Reverse Words in a String 58.6% | MediumM | Solve→ |
N-Queens 58.2% | HardH | Solve→ |
Contains Duplicate 57.8% | EasyE | Solve→ |
Rotting Oranges 57.4% | MediumM | Solve→ |
Search Insert Position 57% | EasyE | Solve→ |
Remove Element 56.6% | EasyE | Solve→ |
Set Matrix Zeroes 56.6% | MediumM | Solve→ |
Meeting Rooms II 56.6% | MediumM | Solve→ |
Minimum Edge Reversals So Every Node Is Reachable 56.6% | HardH | Solve→ |
Permutations 56.1% | MediumM | Solve→ |
Min Stack 56.1% | MediumM | Solve→ |
Pow(x, n) 55.7% | MediumM | Solve→ |
Copy List with Random Pointer 55.7% | MediumM | Solve→ |
Top K Frequent Elements 55.7% | MediumM | Solve→ |
Find the Index of the First Occurrence in a String 55.2% | EasyE | Solve→ |
Subsets 55.2% | MediumM | Solve→ |
Word Search 55.2% | MediumM | Solve→ |
Largest Rectangle in Histogram 55.2% | HardH | Solve→ |
Happy Number 55.2% | EasyE | Solve→ |
Longest Increasing Subsequence 55.2% | MediumM | Solve→ |
Coin Change 55.2% | MediumM | Solve→ |
Sliding Window Maximum 54.8% | HardH | Solve→ |
Find First and Last Position of Element in Sorted Array 53.8% | MediumM | Solve→ |
Jump Game II 53.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Window Substring 53.8% | HardH | Solve→ |
Binary Tree Level Order Traversal 53.8% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 53.8% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 53.8% | MediumM | Solve→ |
Find Median from Data Stream 53.8% | HardH | Solve→ |
Longest Repeating Character Replacement 53.8% | MediumM | Solve→ |
String to Integer (atoi) 53.3% | MediumM | Solve→ |
Minimum Path Sum 53.3% | MediumM | Solve→ |
Daily Temperatures 53.3% | MediumM | Solve→ |
Integer to Roman 52.8% | MediumM | Solve→ |
4Sum 52.8% | MediumM | Solve→ |
Remove Nth Node From End of List 52.8% | MediumM | Solve→ |
Search a 2D Matrix 52.8% | MediumM | Solve→ |
Validate Binary Search Tree 52.8% | MediumM | Solve→ |
Pascal's Triangle 52.8% | EasyE | Solve→ |
Linked List Cycle 52.8% | EasyE | Solve→ |
Integer to English Words 52.8% | HardH | Solve→ |
String Compression 52.8% | MediumM | Solve→ |
Permutation in String 52.8% | MediumM | Solve→ |
Combine Two Tables 52.3% | EasyE | Solve→ |
Course Schedule 52.3% | MediumM | Solve→ |
Fibonacci Number 51.7% | EasyE | Solve→ |
Max Consecutive Ones III 51.7% | MediumM | Solve→ |
Word Break 51.1% | MediumM | Solve→ |
Unique Paths 50.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Restore IP Addresses 50.6% | MediumM | Solve→ |
Course Schedule II 50.6% | MediumM | Solve→ |
Basic Calculator 50.6% | HardH | Solve→ |
Add Two Integers 50.6% | EasyE | Solve→ |
Combination Sum 50% | MediumM | Solve→ |
First Missing Positive 50% | HardH | Solve→ |
Add Binary 50% | EasyE | Solve→ |
Symmetric Tree 50% | EasyE | Solve→ |
Gas Station 50% | MediumM | Solve→ |
Single Number 50% | EasyE | Solve→ |
Find Minimum in Rotated Sorted Array 50% | MediumM | Solve→ |
Maximum Depth of Binary Tree 49.3% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 49.3% | HardH | Solve→ |
Minimum Size Subarray Sum 49.3% | MediumM | Solve→ |
Zigzag Conversion 48.7% | MediumM | Solve→ |
Swap Nodes in Pairs 48.7% | MediumM | Solve→ |
Plus One 48.7% | EasyE | Solve→ |
Best Time to Buy and Sell Stock II 48% | MediumM | Solve→ |
Palindrome Partitioning 48% | MediumM | Solve→ |
Candy 48% | HardH | Solve→ |
Two Sum II - Input Array Is Sorted 48% | MediumM | Solve→ |
Rising Temperature 48% | EasyE | Solve→ |
Isomorphic Strings 48% | EasyE | Solve→ |
Missing Number 48% | EasyE | Solve→ |
Intersection of Two Arrays 48% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Regular Expression Matching 47.3% | HardH | Solve→ |
Longest Valid Parentheses 47.3% | HardH | Solve→ |
Sudoku Solver 47.3% | HardH | Solve→ |
Excel Sheet Column Title 47.3% | EasyE | Solve→ |
Count Primes 47.3% | MediumM | Solve→ |
Contains Duplicate II 47.3% | EasyE | Solve→ |
Next Greater Element I 47.3% | EasyE | Solve→ |
Binary Search 47.3% | EasyE | Solve→ |
Frequency of the Most Frequent Element 47.3% | MediumM | Solve→ |
Ransom Note 47.3% | EasyE | Solve→ |
Design Authentication Manager 47.3% | MediumM | Solve→ |
Valid Sudoku 46.6% | MediumM | Solve→ |
Edit Distance 46.6% | MediumM | Solve→ |
Reorder List 46.6% | MediumM | Solve→ |
Maximum Product Subarray 46.6% | MediumM | Solve→ |
Implement Trie (Prefix Tree) 46.6% | MediumM | Solve→ |
Implement Queue using Stacks 46.6% | EasyE | Solve→ |
Palindrome Linked List 46.6% | EasyE | Solve→ |
First Unique Character in a String 46.6% | EasyE | Solve→ |
Middle of the Linked List 46.6% | EasyE | Solve→ |
Longest Common Subsequence 46.6% | MediumM | Solve→ |
Wildcard Matching 45.8% | HardH | Solve→ |
Sqrt(x) 45.8% | EasyE | Solve→ |
Simplify Path 45.8% | MediumM | Solve→ |
Largest Number 45.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Duplicate Number 45.8% | MediumM | Solve→ |
Online Stock Span 45.8% | MediumM | Solve→ |
Final Prices With a Special Discount in a Shop 45.8% | EasyE | Solve→ |
Divide Two Integers 45% | MediumM | Solve→ |
Same Tree 45% | EasyE | Solve→ |
Linked List Cycle II 45% | MediumM | Solve→ |
Intersection of Two Linked Lists 45% | EasyE | Solve→ |
House Robber II 45% | MediumM | Solve→ |
Delete Node in a Linked List 45% | MediumM | Solve→ |
Reverse String 45% | EasyE | Solve→ |
Decode String 45% | MediumM | Solve→ |
Split Array Largest Sum 45% | HardH | Solve→ |
Maximal Rectangle 44.2% | HardH | Solve→ |
Subsets II 44.2% | MediumM | Solve→ |
Binary Tree Inorder Traversal 44.2% | EasyE | Solve→ |
Excel Sheet Column Number 44.2% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 44.2% | MediumM | Solve→ |
Design Tic-Tac-Toe 44.2% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 44.2% | MediumM | Solve→ |
Next Greater Element II 44.2% | MediumM | Solve→ |
Task Scheduler 44.2% | MediumM | Solve→ |
All Nodes Distance K in Binary Tree 44.2% | MediumM | Solve→ |
Max Consecutive Ones 44.2% | EasyE | Solve→ |
Remove Duplicates from Sorted List 43.3% | EasyE | Solve→ |
Decode Ways 43.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Reverse Linked List II 43.3% | MediumM | Solve→ |
Word Ladder 43.3% | HardH | Solve→ |
Add Digits 43.3% | EasyE | Solve→ |
Reverse Vowels of a String 43.3% | EasyE | Solve→ |
LFU Cache 43.3% | HardH | Solve→ |
Asteroid Collision 43.3% | MediumM | Solve→ |
Concatenation of Array 43.3% | EasyE | Solve→ |
Minimum Operations to Reduce an Integer to 0 43.3% | MediumM | Solve→ |
3Sum Closest 42.4% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Inorder Traversal 42.4% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 42.4% | MediumM | Solve→ |
Word Search II 42.4% | HardH | Solve→ |
Diameter of Binary Tree 42.4% | EasyE | Solve→ |
Maximum Average Subarray I 42.4% | EasyE | Solve→ |
Capacity To Ship Packages Within D Days 42.4% | MediumM | Solve→ |
Number of Provinces 42.4% | MediumM | Solve→ |
Permutations II 41.5% | MediumM | Solve→ |
Balanced Binary Tree 41.5% | EasyE | Solve→ |
Kth Smallest Element in a BST 41.5% | MediumM | Solve→ |
Search a 2D Matrix II 41.5% | MediumM | Solve→ |
Odd Even Linked List 41.5% | MediumM | Solve→ |
Partition Equal Subset Sum 41.5% | MediumM | Solve→ |
Battleships in a Board 41.5% | MediumM | Solve→ |
Can Place Flowers 41.5% | EasyE | Solve→ |
Flood Fill 41.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Subarrays with K Different Integers 41.5% | HardH | Solve→ |
Article Views I 41.5% | EasyE | Solve→ |
Reorder Routes to Make All Paths Lead to the City Zero 41.5% | MediumM | Solve→ |
Minimum Difficulty of a Job Schedule 41.5% | HardH | Solve→ |
Multiply Strings 40.5% | MediumM | Solve→ |
Path Sum 40.5% | EasyE | Solve→ |
Flatten Binary Tree to Linked List 40.5% | MediumM | Solve→ |
Single Number II 40.5% | MediumM | Solve→ |
Binary Search Tree Iterator 40.5% | MediumM | Solve→ |
Employees Earning More Than Their Managers 40.5% | EasyE | Solve→ |
Majority Element II 40.5% | MediumM | Solve→ |
Fizz Buzz 40.5% | EasyE | Solve→ |
Find All Anagrams in a String 40.5% | MediumM | Solve→ |
Target Sum 40.5% | MediumM | Solve→ |
Set Mismatch 40.5% | EasyE | Solve→ |
Shortest Common Supersequence 40.5% | HardH | Solve→ |
Shuffle the Array 40.5% | EasyE | Solve→ |
Kth Missing Positive Number 40.5% | EasyE | Solve→ |
Insert Interval 39.4% | MediumM | Solve→ |
Length of Last Word 39.4% | EasyE | Solve→ |
Rotate List 39.4% | MediumM | Solve→ |
Remove Duplicates from Sorted Array II 39.4% | MediumM | Solve→ |
Recover Binary Search Tree 39.4% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node II 39.4% | MediumM | Solve→ |
Evaluate Reverse Polish Notation 39.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
H-Index 39.4% | MediumM | Solve→ |
Is Subsequence 39.4% | EasyE | Solve→ |
Sort Characters By Frequency 39.4% | MediumM | Solve→ |
Find Customer Referee 39.4% | EasyE | Solve→ |
Valid Palindrome II 39.4% | EasyE | Solve→ |
Peak Index in a Mountain Array 39.4% | MediumM | Solve→ |
Greatest Common Divisor of Strings 39.4% | EasyE | Solve→ |
Average Time of Process per Machine 39.4% | EasyE | Solve→ |
Construct Binary Tree from Inorder and Postorder Traversal 38.2% | MediumM | Solve→ |
Best Time to Buy and Sell Stock III 38.2% | HardH | Solve→ |
Sort List 38.2% | MediumM | Solve→ |
Compare Version Numbers 38.2% | MediumM | Solve→ |
Implement Stack using Queues 38.2% | EasyE | Solve→ |
Perfect Squares 38.2% | MediumM | Solve→ |
Add Two Numbers II 38.2% | MediumM | Solve→ |
Palindromic Substrings 38.2% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 38.2% | HardH | Solve→ |
Average Selling Price 38.2% | EasyE | Solve→ |
Running Sum of 1d Array 38.2% | EasyE | Solve→ |
Check if Array Is Sorted and Rotated 38.2% | EasyE | Solve→ |
Minimum Cost to Equalize Array 38.2% | HardH | Solve→ |
Count Binary Substrings 38.2% | EasyE | Solve→ |
Maximum Number of Events That Can Be Attended 38.2% | MediumM | Solve→ |
Combination Sum II 37% | MediumM | Solve→ |
Spiral Matrix II 37% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Convert Sorted Array to Binary Search Tree 37% | EasyE | Solve→ |
Binary Tree Right Side View 37% | MediumM | Solve→ |
The Skyline Problem 37% | HardH | Solve→ |
Remove K Digits 37% | MediumM | Solve→ |
Managers with at Least 5 Direct Reports 37% | MediumM | Solve→ |
Accounts Merge 37% | MediumM | Solve→ |
Sum of Subarray Minimums 37% | MediumM | Solve→ |
Minimum Deletions to Make String Balanced 37% | MediumM | Solve→ |
Longest Path With Different Adjacent Characters 37% | HardH | Solve→ |
Increasing Triplet Subsequence 37% | MediumM | Solve→ |
Diagonal Traverse 37% | MediumM | Solve→ |
Special Binary String 37% | HardH | Solve→ |
Interleaving String 35.7% | MediumM | Solve→ |
Triangle 35.7% | MediumM | Solve→ |
Second Highest Salary 35.7% | MediumM | Solve→ |
Number of 1 Bits 35.7% | EasyE | Solve→ |
Remove Duplicate Letters 35.7% | MediumM | Solve→ |
Assign Cookies 35.7% | EasyE | Solve→ |
Reverse Pairs 35.7% | HardH | Solve→ |
Big Countries 35.7% | EasyE | Solve→ |
Design Search Autocomplete System 35.7% | HardH | Solve→ |
Two Sum IV - Input is a BST 35.7% | EasyE | Solve→ |
Find K Closest Elements 35.7% | MediumM | Solve→ |
Reorganize String 35.7% | MediumM | Solve→ |
Longest Arithmetic Subsequence 35.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find N Unique Integers Sum up to Zero 35.7% | EasyE | Solve→ |
Replace Employee ID With The Unique Identifier 35.7% | EasyE | Solve→ |
Find Lucky Integer in an Array 35.7% | EasyE | Solve→ |
Count Good Nodes in Binary Tree 35.7% | MediumM | Solve→ |
Count Odd Numbers in an Interval Range 35.7% | EasyE | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 35.7% | EasyE | Solve→ |
Maximum Population Year 35.7% | EasyE | Solve→ |
Create a DataFrame from List 35.7% | EasyE | Solve→ |
Making A Large Island 35.7% | HardH | Solve→ |
Employee Bonus 35.7% | EasyE | Solve→ |
Design Circular Queue 35.7% | MediumM | Solve→ |
Count Palindromic Subsequences 35.7% | HardH | Solve→ |
Longest Palindromic Subsequence 35.7% | MediumM | Solve→ |
Path Sum II 34.3% | MediumM | Solve→ |
Surrounded Regions 34.3% | MediumM | Solve→ |
Basic Calculator II 34.3% | MediumM | Solve→ |
Minimum Number of Arrows to Burst Balloons 34.3% | MediumM | Solve→ |
Remove Comments 34.3% | MediumM | Solve→ |
Basic Calculator III 34.3% | HardH | Solve→ |
Rotate String 34.3% | EasyE | Solve→ |
Split Array With Same Average 34.3% | HardH | Solve→ |
Sort an Array 34.3% | MediumM | Solve→ |
Product Sales Analysis I 34.3% | EasyE | Solve→ |
Print in Order 34.3% | EasyE | Solve→ |
Jump Game III 34.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Points You Can Obtain from Cards 34.3% | MediumM | Solve→ |
Water Bottles 34.3% | EasyE | Solve→ |
Longest Nice Substring 34.3% | EasyE | Solve→ |
Find Center of Star Graph 34.3% | EasyE | Solve→ |
Merge Nodes in Between Zeros 34.3% | MediumM | Solve→ |
Divide Array Into Equal Pairs 34.3% | EasyE | Solve→ |
Text Justification 32.8% | HardH | Solve→ |
Distinct Subsequences 32.8% | HardH | Solve→ |
Dungeon Game 32.8% | HardH | Solve→ |
Rank Scores 32.8% | MediumM | Solve→ |
Remove Linked List Elements 32.8% | EasyE | Solve→ |
Shortest Palindrome 32.8% | HardH | Solve→ |
Burst Balloons 32.8% | HardH | Solve→ |
Water and Jug Problem 32.8% | MediumM | Solve→ |
Non-overlapping Intervals 32.8% | MediumM | Solve→ |
Contiguous Array 32.8% | MediumM | Solve→ |
Valid Tic-Tac-Toe State 32.8% | MediumM | Solve→ |
Design HashMap 32.8% | EasyE | Solve→ |
Minimum Number of Refueling Stops 32.8% | HardH | Solve→ |
Possible Bipartition 32.8% | MediumM | Solve→ |
Subarray Sums Divisible by K 32.8% | MediumM | Solve→ |
Squares of a Sorted Array 32.8% | EasyE | Solve→ |
Time Based Key-Value Store 32.8% | MediumM | Solve→ |
Next Greater Node In Linked List 32.8% | MediumM | Solve→ |
Maximum Profit in Job Scheduling 32.8% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Flips to Make a OR b Equal to c 32.8% | MediumM | Solve→ |
The k-th Lexicographical String of All Happy Strings of Length n 32.8% | MediumM | Solve→ |
Minimum Number of Days to Make m Bouquets 32.8% | MediumM | Solve→ |
Maximal Network Rank 32.8% | MediumM | Solve→ |
Find if Path Exists in Graph 32.8% | EasyE | Solve→ |
Maximum Number of Potholes That Can Be Fixed 32.8% | MediumM | Solve→ |
Maximal Square 32.8% | MediumM | Solve→ |
Count Good Numbers 32.8% | MediumM | Solve→ |
Digit Operations to Make Two Integers Equal 32.8% | MediumM | Solve→ |
Number of Substrings Containing All Three Characters 32.8% | MediumM | Solve→ |
Backspace String Compare 32.8% | EasyE | Solve→ |
Valid Word 32.8% | EasyE | Solve→ |
Substring with Concatenation of All Words 31.1% | HardH | Solve→ |
Invert Binary Tree 31.1% | EasyE | Solve→ |
Power of Two 31.1% | EasyE | Solve→ |
Counting Bits 31.1% | EasyE | Solve→ |
Valid Perfect Square 31.1% | EasyE | Solve→ |
Longest Substring with At Least K Repeating Characters 31.1% | MediumM | Solve→ |
Arranging Coins 31.1% | EasyE | Solve→ |
IPO 31.1% | HardH | Solve→ |
Coin Change II 31.1% | MediumM | Solve→ |
2 Keys Keyboard 31.1% | MediumM | Solve→ |
4 Keys Keyboard 31.1% | MediumM | Solve→ |
Find Pivot Index 31.1% | EasyE | Solve→ |
Design Linked List 31.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Fruit Into Baskets 31.1% | MediumM | Solve→ |
Partition Array Into Three Parts With Equal Sum 31.1% | EasyE | Solve→ |
Shortest Path in Binary Matrix 31.1% | MediumM | Solve→ |
Monthly Transactions I 31.1% | MediumM | Solve→ |
Students and Examinations 31.1% | EasyE | Solve→ |
Angle Between Hands of a Clock 31.1% | MediumM | Solve→ |
Print Words Vertically 31.1% | MediumM | Solve→ |
Maximum Product of Splitted Binary Tree 31.1% | MediumM | Solve→ |
Minimum Time to Make Rope Colorful 31.1% | MediumM | Solve→ |
Number of Students Unable to Eat Lunch 31.1% | EasyE | Solve→ |
Minimum Adjacent Swaps for K Consecutive Ones 31.1% | HardH | Solve→ |
Reduction Operations to Make the Array Elements Equal 31.1% | MediumM | Solve→ |
Sum of Digits of String After Convert 31.1% | EasyE | Solve→ |
Find Missing Observations 31.1% | MediumM | Solve→ |
Remove Digit From Number to Maximize Result 31.1% | EasyE | Solve→ |
Design Memory Allocator 31.1% | MediumM | Solve→ |
Minimum Common Value 31.1% | EasyE | Solve→ |
The Knight’s Tour 31.1% | MediumM | Solve→ |
Max Pair Sum in an Array 31.1% | EasyE | Solve→ |
Smallest Missing Integer Greater Than Sequential Prefix Sum 31.1% | EasyE | Solve→ |
Maximum Number of Operations With the Same Score II 31.1% | MediumM | Solve→ |
Find All Numbers Disappeared in an Array 31.1% | EasyE | Solve→ |
Count Paths With the Given XOR Value 31.1% | MediumM | Solve→ |
Partition Array According to Given Pivot 31.1% | MediumM | Solve→ |
Minimum Absolute Difference 31.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count the Number of Infection Sequences 31.1% | HardH | Solve→ |
Smallest String With Swaps 31.1% | MediumM | Solve→ |
Search in Rotated Sorted Array II 29.3% | MediumM | Solve→ |
Word Ladder II 29.3% | HardH | Solve→ |
Consecutive Numbers 29.3% | MediumM | Solve→ |
Reverse Words in a String II 29.3% | MediumM | Solve→ |
Design Add and Search Words Data Structure 29.3% | MediumM | Solve→ |
Meeting Rooms 29.3% | EasyE | Solve→ |
Count of Smaller Numbers After Self 29.3% | HardH | Solve→ |
Find All Duplicates in an Array 29.3% | MediumM | Solve→ |
Find Bottom Left Tree Value 29.3% | MediumM | Solve→ |
Bulb Switcher II 29.3% | MediumM | Solve→ |
Valid Parenthesis String 29.3% | MediumM | Solve→ |
Insert into a Binary Search Tree 29.3% | MediumM | Solve→ |
Find Eventual Safe States 29.3% | MediumM | Solve→ |
Binary Subarrays With Sum 29.3% | MediumM | Solve→ |
Minimum Falling Path Sum 29.3% | MediumM | Solve→ |
Clumsy Factorial 29.3% | MediumM | Solve→ |
Find the Start and End Number of Continuous Ranges 29.3% | MediumM | Solve→ |
Cinema Seat Allocation 29.3% | MediumM | Solve→ |
Number of Times Binary String Is Prefix-Aligned 29.3% | MediumM | Solve→ |
Kids With the Greatest Number of Candies 29.3% | EasyE | Solve→ |
Stone Game IV 29.3% | HardH | Solve→ |
Shuffle String 29.3% | EasyE | Solve→ |
Widest Vertical Area Between Two Points Containing No Points 29.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 29.3% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree III 29.3% | MediumM | Solve→ |
Remove Duplicates From an Unsorted Linked List 29.3% | MediumM | Solve→ |
Maximum Employees to Be Invited to a Meeting 29.3% | HardH | Solve→ |
Number of Unique Flavors After Sharing K Candies 29.3% | MediumM | Solve→ |
Minimum Sum of Squared Difference 29.3% | MediumM | Solve→ |
Largest Palindromic Number 29.3% | MediumM | Solve→ |
Optimal Partition of String 29.3% | MediumM | Solve→ |
Minimum Fuel Cost to Report to the Capital 29.3% | MediumM | Solve→ |
Friend Requests II: Who Has the Most Friends 29.3% | MediumM | Solve→ |
Bus Routes 29.3% | HardH | Solve→ |
Maximum Width of Binary Tree 29.3% | MediumM | Solve→ |
Find Missing and Repeated Values 29.3% | EasyE | Solve→ |
Duplicate Emails 29.3% | EasyE | Solve→ |
Customers Who Never Order 29.3% | EasyE | Solve→ |
Sliding Window Median 29.3% | HardH | Solve→ |
Maximum Number of Alloys 29.3% | MediumM | Solve→ |
Minimum Operations to Make Array Equal to Target 29.3% | HardH | Solve→ |
Maximum Subgraph Score in a Tree 29.3% | HardH | Solve→ |
N-Queens II 27.3% | HardH | Solve→ |
Remove Duplicates from Sorted List II 27.3% | MediumM | Solve→ |
Partition List 27.3% | MediumM | Solve→ |
Word Break II 27.3% | HardH | Solve→ |
Repeated DNA Sequences 27.3% | MediumM | Solve→ |
Closest Binary Search Tree Value 27.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
First Bad Version 27.3% | EasyE | Solve→ |
Inorder Successor in BST 27.3% | MediumM | Solve→ |
Game of Life 27.3% | MediumM | Solve→ |
Range Sum Query - Immutable 27.3% | EasyE | Solve→ |
Longest Increasing Path in a Matrix 27.3% | HardH | Solve→ |
Largest BST Subtree 27.3% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 27.3% | MediumM | Solve→ |
Largest Divisible Subset 27.3% | MediumM | Solve→ |
Add Strings 27.3% | EasyE | Solve→ |
All O`one Data Structure 27.3% | HardH | Solve→ |
Path Sum III 27.3% | MediumM | Solve→ |
Heaters 27.3% | MediumM | Solve→ |
Widest Pair of Indices With Equal Range Sum 27.3% | MediumM | Solve→ |
01 Matrix 27.3% | MediumM | Solve→ |
Boundary of Binary Tree 27.3% | MediumM | Solve→ |
Tag Validator 27.3% | HardH | Solve→ |
Design Excel Sum Formula 27.3% | HardH | Solve→ |
Maximum Binary Tree 27.3% | MediumM | Solve→ |
Max Area of Island 27.3% | MediumM | Solve→ |
Partition Labels 27.3% | MediumM | Solve→ |
Kth Largest Element in a Stream 27.3% | EasyE | Solve→ |
Is Graph Bipartite? 27.3% | MediumM | Solve→ |
Cheapest Flights Within K Stops 27.3% | MediumM | Solve→ |
Car Fleet 27.3% | MediumM | Solve→ |
Transpose Matrix 27.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Random Pick with Weight 27.3% | MediumM | Solve→ |
Equal Rational Numbers 27.3% | HardH | Solve→ |
Remove Outermost Parentheses 27.3% | EasyE | Solve→ |
Previous Permutation With One Swap 27.3% | MediumM | Solve→ |
Find Smallest Common Element in All Rows 27.3% | MediumM | Solve→ |
Statistics from a Large Sample 27.3% | MediumM | Solve→ |
Delete Tree Nodes 27.3% | MediumM | Solve→ |
Palindrome Removal 27.3% | HardH | Solve→ |
Maximum of Absolute Value Expression 27.3% | MediumM | Solve→ |
Design Skiplist 27.3% | HardH | Solve→ |
Maximum Score Of Spliced Array 27.3% | HardH | Solve→ |
Minimum Deletions to Make Array Beautiful 27.3% | MediumM | Solve→ |
Minimum Number of Moves to Make Palindrome 27.3% | HardH | Solve→ |
Greatest English Letter in Upper and Lower Case 27.3% | EasyE | Solve→ |
Count Number of Nice Subarrays 27.3% | MediumM | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 27.3% | MediumM | Solve→ |
Get the Second Most Recent Activity 27.3% | HardH | Solve→ |
Reformat The String 27.3% | EasyE | Solve→ |
Max Dot Product of Two Subsequences 27.3% | HardH | Solve→ |
Find All The Lonely Nodes 27.3% | EasyE | Solve→ |
Delete N Nodes After M Nodes of a Linked List 27.3% | EasyE | Solve→ |
Minimum Cost to Cut a Stick 27.3% | HardH | Solve→ |
Number of Ways to Split a String 27.3% | MediumM | Solve→ |
Replace All ?'s to Avoid Consecutive Repeating Characters 27.3% | EasyE | Solve→ |
Count Substrings That Differ by One Character 27.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Removals to Make Mountain Array 27.3% | HardH | Solve→ |
Lowest Common Ancestor of a Binary Tree II 27.3% | MediumM | Solve→ |
Minimum Incompatibility 27.3% | HardH | Solve→ |
Maximum Value at a Given Index in a Bounded Array 27.3% | MediumM | Solve→ |
Maximize Number of Nice Divisors 27.3% | HardH | Solve→ |
Primary Department for Each Employee 27.3% | EasyE | Solve→ |
Sign of the Product of an Array 27.3% | EasyE | Solve→ |
The Number of Full Rounds You Have Played 27.3% | MediumM | Solve→ |
Minimum Cost to Separate Sentence Into Rows 27.3% | MediumM | Solve→ |
Three Divisors 27.3% | EasyE | Solve→ |
Average Height of Buildings in Each Segment 27.3% | MediumM | Solve→ |
Subsequence of Size K With the Largest Even Sum 27.3% | MediumM | Solve→ |
Check if All A's Appears Before All B's 27.3% | EasyE | Solve→ |
Minimum Operations to Halve Array Sum 27.3% | MediumM | Solve→ |
All the Matches of the League 27.3% | EasyE | Solve→ |
Amount of Time for Binary Tree to Be Infected 27.3% | MediumM | Solve→ |
Minimum Amount of Time to Collect Garbage 27.3% | MediumM | Solve→ |
Largest Positive Integer That Exists With Its Negative 27.3% | EasyE | Solve→ |
Number of Distinct Binary Strings After Applying Operations 27.3% | MediumM | Solve→ |
Make the Prefix Sum Non-negative 27.3% | MediumM | Solve→ |
Maximum Price to Fill a Bag 27.3% | MediumM | Solve→ |
Counter 27.3% | EasyE | Solve→ |
To Be Or Not To Be 27.3% | EasyE | Solve→ |
Smallest Number With Given Digit Product 27.3% | MediumM | Solve→ |
Maximum Size of a Set After Removals 27.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Subtree of the Same Color 27.3% | MediumM | Solve→ |
Maximum Number of Intersections on the Chart 27.3% | HardH | Solve→ |
Maximum Number of Operations With the Same Score I 27.3% | EasyE | Solve→ |
Find the Median of the Uniqueness Array 27.3% | HardH | Solve→ |
Minimum Rectangles to Cover Points 27.3% | MediumM | Solve→ |
Find the Level of Tree with Minimum Sum 27.3% | MediumM | Solve→ |
Count Submatrices With Equal Frequency of X and Y 27.3% | MediumM | Solve→ |
Find the Difference 27.3% | EasyE | Solve→ |
Palindrome Partitioning II 27.3% | HardH | Solve→ |
Confirmation Rate 27.3% | MediumM | Solve→ |
Number of Visible People in a Queue 27.3% | HardH | Solve→ |
Nth Highest Salary 27.3% | MediumM | Solve→ |
The Number of Employees Which Report to Each Employee 27.3% | EasyE | Solve→ |
Game Play Analysis IV 27.3% | MediumM | Solve→ |
Smallest Range Covering Elements from K Lists 27.3% | HardH | Solve→ |
Longest Subarray of 1's After Deleting One Element 27.3% | MediumM | Solve→ |
Find the Smallest Divisor Given a Threshold 27.3% | MediumM | Solve→ |
Bitwise ORs of Subarrays 27.3% | MediumM | Solve→ |
Pacific Atlantic Water Flow 27.3% | MediumM | Solve→ |
Delete Duplicate Emails 27.3% | EasyE | Solve→ |
Minimum Value to Get Positive Step by Step Sum 27.3% | EasyE | Solve→ |
Maximum Number of Non-overlapping Palindrome Substrings 27.3% | HardH | Solve→ |
Bitwise OR of Even Numbers in an Array 27.3% | EasyE | Solve→ |
Minimum Sensors to Cover Grid 27.3% | MediumM | Solve→ |
Stable Subarrays With Equal Boundary and Interior Sum 27.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Good Subarrays 27.3% | HardH | Solve→ |
Unique Paths II 25% | MediumM | Solve→ |
Combinations 25% | MediumM | Solve→ |
Minimum Depth of Binary Tree 25% | EasyE | Solve→ |
Clone Graph 25% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array II 25% | HardH | Solve→ |
Department Top Three Salaries 25% | HardH | Solve→ |
Best Time to Buy and Sell Stock IV 25% | HardH | Solve→ |
Ugly Number II 25% | MediumM | Solve→ |
Encode and Decode Strings 25% | MediumM | Solve→ |
Word Pattern 25% | EasyE | Solve→ |
House Robber III 25% | MediumM | Solve→ |
Russian Doll Envelopes 25% | HardH | Solve→ |
Kth Smallest Element in a Sorted Matrix 25% | MediumM | Solve→ |
Continuous Subarray Sum 25% | MediumM | Solve→ |
Minimum Time Difference 25% | MediumM | Solve→ |
Classes With at Least 5 Students 25% | EasyE | Solve→ |
Exchange Seats 25% | MediumM | Solve→ |
Maximum Product of Three Numbers 25% | EasyE | Solve→ |
Min Cost Climbing Stairs 25% | EasyE | Solve→ |
Rectangle Overlap 25% | EasyE | Solve→ |
Shortest Subarray with Sum at Least K 25% | HardH | Solve→ |
Remove All Adjacent Duplicates In String 25% | EasyE | Solve→ |
Longest Happy String 25% | MediumM | Solve→ |
Unique Number of Occurrences 25% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum of Beauty of All Substrings 25% | MediumM | Solve→ |
Count Subarrays With Fixed Bounds 25% | HardH | Solve→ |
Ugly Number 25% | EasyE | Solve→ |
Number of Good Pairs 25% | EasyE | Solve→ |
Jewels and Stones 25% | EasyE | Solve→ |
Interval List Intersections 25% | MediumM | Solve→ |
String Compression II 25% | HardH | Solve→ |
Invalid Tweets 25% | EasyE | Solve→ |
Construct Binary Search Tree from Preorder Traversal 25% | MediumM | Solve→ |
Contains Duplicate III 25% | HardH | Solve→ |
Word Subsets 25% | MediumM | Solve→ |
Maximum Ascending Subarray Sum 25% | EasyE | Solve→ |
House Robber IV 25% | MediumM | Solve→ |
Maximum Unique Subarray Sum After Deletion 25% | EasyE | Solve→ |
Summary Ranges 25% | EasyE | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 25% | MediumM | Solve→ |
New 21 Game 25% | MediumM | Solve→ |
24 Game 25% | HardH | Solve→ |
Maximum OR 25% | MediumM | Solve→ |
Consecutive Numbers Sum 25% | HardH | Solve→ |
Minimum Number of Steps to Make Two Strings Anagram 25% | MediumM | Solve→ |
Count and Say 22.5% | MediumM | Solve→ |
Pascal's Triangle II 22.5% | EasyE | Solve→ |
Sum Root to Leaf Numbers 22.5% | MediumM | Solve→ |
Factorial Trailing Zeroes 22.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Complete Tree Nodes 22.5% | MediumM | Solve→ |
Rectangle Area 22.5% | MediumM | Solve→ |
Number of Digit One 22.5% | HardH | Solve→ |
Alien Dictionary 22.5% | HardH | Solve→ |
Find the Celebrity 22.5% | MediumM | Solve→ |
Nim Game 22.5% | EasyE | Solve→ |
Binary Tree Vertical Order Traversal 22.5% | MediumM | Solve→ |
Power of Three 22.5% | EasyE | Solve→ |
Intersection of Two Arrays II 22.5% | EasyE | Solve→ |
Design Hit Counter 22.5% | MediumM | Solve→ |
Sum of Two Integers 22.5% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 22.5% | MediumM | Solve→ |
Evaluate Division 22.5% | MediumM | Solve→ |
Trapping Rain Water II 22.5% | HardH | Solve→ |
Longest Palindrome 22.5% | EasyE | Solve→ |
Delete Node in a BST 22.5% | MediumM | Solve→ |
Next Greater Element III 22.5% | MediumM | Solve→ |
Design In-Memory File System 22.5% | HardH | Solve→ |
Robot Return to Origin 22.5% | EasyE | Solve→ |
Top K Frequent Words 22.5% | MediumM | Solve→ |
Delete and Earn 22.5% | MediumM | Solve→ |
Open the Lock 22.5% | MediumM | Solve→ |
Snakes and Ladders 22.5% | MediumM | Solve→ |
Maximum Sum Circular Subarray 22.5% | MediumM | Solve→ |
Maximum Width Ramp 22.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Tree Cameras 22.5% | HardH | Solve→ |
Critical Connections in a Network 22.5% | HardH | Solve→ |
Remove All Adjacent Duplicates in String II 22.5% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 22.5% | MediumM | Solve→ |
Search Suggestions System 22.5% | MediumM | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 22.5% | MediumM | Solve→ |
Richest Customer Wealth 22.5% | EasyE | Solve→ |
Find the Winner of the Circular Game 22.5% | MediumM | Solve→ |
Partition Array Into Two Arrays to Minimize Sum Difference 22.5% | HardH | Solve→ |
Delete the Middle Node of a Linked List 22.5% | MediumM | Solve→ |
Longest Nice Subarray 22.5% | MediumM | Solve→ |
Game Play Analysis I 22.5% | EasyE | Solve→ |
Immediate Food Delivery II 22.5% | MediumM | Solve→ |
Product Price at a Given Date 22.5% | MediumM | Solve→ |
Different Ways to Add Parentheses 22.5% | MediumM | Solve→ |
K-th Smallest in Lexicographical Order 22.5% | HardH | Solve→ |
Separate Black and White Balls 22.5% | MediumM | Solve→ |
Permutation Sequence 22.5% | HardH | Solve→ |
User Activity for the Past 30 Days I 22.5% | EasyE | Solve→ |
Guess Number Higher or Lower 22.5% | EasyE | Solve→ |
Shortest Distance from All Buildings 22.5% | HardH | Solve→ |
Meeting Rooms III 22.5% | HardH | Solve→ |
Maximum Gap 22.5% | MediumM | Solve→ |
Grid Game 22.5% | MediumM | Solve→ |
Sum of Left Leaves 22.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Serialize and Deserialize BST 22.5% | MediumM | Solve→ |
Find Winner on a Tic Tac Toe Game 22.5% | EasyE | Solve→ |
Count Negative Numbers in a Sorted Matrix 22.5% | EasyE | Solve→ |
Subarray Product Less Than K 22.5% | MediumM | Solve→ |
Single-Threaded CPU 22.5% | MediumM | Solve→ |
Reverse Bits 22.5% | EasyE | Solve→ |
Valid Triangle Number 22.5% | MediumM | Solve→ |
Minimum Number of Increments on Subarrays to Form a Target Array 22.5% | HardH | Solve→ |
Base 7 22.5% | EasyE | Solve→ |
Customer Placing the Largest Number of Orders 22.5% | EasyE | Solve→ |
Perfect Number 22.5% | EasyE | Solve→ |
Shifting Letters 22.5% | MediumM | Solve→ |
Convert Integer to the Sum of Two No-Zero Integers 22.5% | EasyE | Solve→ |
Vowel Spellchecker 22.5% | MediumM | Solve→ |
Minimum Initial Energy to Finish Tasks 22.5% | HardH | Solve→ |
Calculate Money in Leetcode Bank 22.5% | EasyE | Solve→ |
Can Make Arithmetic Progression From Sequence 22.5% | EasyE | Solve→ |
Minimum Pair Removal to Sort Array I 22.5% | EasyE | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum I 22.5% | EasyE | Solve→ |
Unique Binary Search Trees 19.5% | MediumM | Solve→ |
Binary Tree Preorder Traversal 19.5% | EasyE | Solve→ |
Max Points on a Line 19.5% | HardH | Solve→ |
Department Highest Salary 19.5% | MediumM | Solve→ |
Bulb Switcher 19.5% | MediumM | Solve→ |
Design Twitter 19.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Frog Jump 19.5% | HardH | Solve→ |
Island Perimeter 19.5% | EasyE | Solve→ |
Predict the Winner 19.5% | MediumM | Solve→ |
Subtree of Another Tree 19.5% | EasyE | Solve→ |
Shortest Unsorted Continuous Subarray 19.5% | MediumM | Solve→ |
Number of Distinct Islands 19.5% | MediumM | Solve→ |
Partition to K Equal Sum Subsets 19.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 19.5% | MediumM | Solve→ |
Network Delay Time 19.5% | MediumM | Solve→ |
Max Chunks To Make Sorted 19.5% | MediumM | Solve→ |
Search in a Binary Search Tree 19.5% | EasyE | Solve→ |
Keys and Rooms 19.5% | MediumM | Solve→ |
Boats to Save People 19.5% | MediumM | Solve→ |
Maximum Frequency Stack 19.5% | HardH | Solve→ |
Most Stones Removed with Same Row or Column 19.5% | MediumM | Solve→ |
K Closest Points to Origin 19.5% | MediumM | Solve→ |
Height Checker 19.5% | EasyE | Solve→ |
Minimum Knight Moves 19.5% | MediumM | Solve→ |
Parsing A Boolean Expression 19.5% | HardH | Solve→ |
Snapshot Array 19.5% | MediumM | Solve→ |
Minimum Time to Collect All Apples in a Tree 19.5% | MediumM | Solve→ |
Path With Minimum Effort 19.5% | MediumM | Solve→ |
Find the Highest Altitude 19.5% | EasyE | Solve→ |
Sum of Subarray Ranges 19.5% | MediumM | Solve→ |
Rearrange Array Elements by Sign 19.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Double a Number Represented as a Linked List 19.5% | MediumM | Solve→ |
Percentage of Users Attended a Contest 19.5% | EasyE | Solve→ |
Logger Rate Limiter 19.5% | EasyE | Solve→ |
Remove All Occurrences of a Substring 19.5% | MediumM | Solve→ |
Not Boring Movies 19.5% | EasyE | Solve→ |
Construct String With Repeat Limit 19.5% | MediumM | Solve→ |
Split Linked List in Parts 19.5% | MediumM | Solve→ |
Count Days Without Meetings 19.5% | MediumM | Solve→ |
Lexicographical Numbers 19.5% | MediumM | Solve→ |
Redundant Connection 19.5% | MediumM | Solve→ |
Removing Stars From a String 19.5% | MediumM | Solve→ |
Maximum Swap 19.5% | MediumM | Solve→ |
Range Sum Query 2D - Immutable 19.5% | MediumM | Solve→ |
Last Stone Weight 19.5% | EasyE | Solve→ |
Find the Maximum Achievable Number 19.5% | EasyE | Solve→ |
Rotating the Box 19.5% | MediumM | Solve→ |
Maximum Matrix Sum 19.5% | MediumM | Solve→ |
Two Best Non-Overlapping Events 19.5% | MediumM | Solve→ |
Maximum Average Pass Ratio 19.5% | MediumM | Solve→ |
Find a Peak Element II 19.5% | MediumM | Solve→ |
Unique Length-3 Palindromic Subsequences 19.5% | MediumM | Solve→ |
Wiggle Sort II 19.5% | MediumM | Solve→ |
Reverse String II 19.5% | EasyE | Solve→ |
Investments in 2016 19.5% | MediumM | Solve→ |
Remove Invalid Parentheses 19.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Enclaves 19.5% | MediumM | Solve→ |
Find Unique Binary String 19.5% | MediumM | Solve→ |
Longest String Chain 19.5% | MediumM | Solve→ |
Super Pow 19.5% | MediumM | Solve→ |
Fruits Into Baskets II 19.5% | EasyE | Solve→ |
Maximum Candies Allocated to K Children 19.5% | MediumM | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 19.5% | MediumM | Solve→ |
Memoize 19.5% | MediumM | Solve→ |
Sum of All Subset XOR Totals 19.5% | EasyE | Solve→ |
Design a Text Editor 19.5% | HardH | Solve→ |
Maximum Difference Between Even and Odd Frequency I 19.5% | EasyE | Solve→ |
Maximum Difference Between Even and Odd Frequency II 19.5% | HardH | Solve→ |
Number of Recent Calls 19.5% | EasyE | Solve→ |
Maximum Manhattan Distance After K Changes 19.5% | MediumM | Solve→ |
Kth Smallest Product of Two Sorted Arrays 19.5% | HardH | Solve→ |
Rearranging Fruits 19.5% | HardH | Solve→ |
Matrix Diagonal Sum 19.5% | EasyE | Solve→ |
Longest Happy Prefix 19.5% | HardH | Solve→ |
Find the Winner of an Array Game 19.5% | MediumM | Solve→ |
Reordered Power of 2 19.5% | MediumM | Solve→ |
Queries Quality and Percentage 19.5% | EasyE | Solve→ |
K-th Symbol in Grammar 19.5% | MediumM | Solve→ |
Count Elements With Maximum Frequency 19.5% | EasyE | Solve→ |
Find in Mountain Array 19.5% | HardH | Solve→ |
Unique Paths III 19.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Defanging an IP Address 19.5% | EasyE | Solve→ |
How Many Numbers Are Smaller Than the Current Number 19.5% | EasyE | Solve→ |
Sort Integers by The Number of 1 Bits 19.5% | EasyE | Solve→ |
Combination Sum III 19.5% | MediumM | Solve→ |
Beautiful Arrangement 19.5% | MediumM | Solve→ |
Minimum Moves to Make Array Complementary 19.5% | MediumM | Solve→ |
Count Subarrays With Majority Element I 19.5% | MediumM | Solve→ |
Unique Binary Search Trees II 16.1% | MediumM | Solve→ |
Single Number III 16.1% | MediumM | Solve→ |
Minimum Genetic Mutation 16.1% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements II 16.1% | MediumM | Solve→ |
Validate IP Address 16.1% | MediumM | Solve→ |
Find the Closest Palindrome 16.1% | HardH | Solve→ |
Find Duplicate Subtrees 16.1% | MediumM | Solve→ |
Image Smoother 16.1% | EasyE | Solve→ |
Cherry Pickup 16.1% | HardH | Solve→ |
Serialize and Deserialize N-ary Tree 16.1% | HardH | Solve→ |
Swim in Rising Water 16.1% | HardH | Solve→ |
Robot Room Cleaner 16.1% | HardH | Solve→ |
Hand of Straights 16.1% | MediumM | Solve→ |
Shortest Bridge 16.1% | MediumM | Solve→ |
Balance a Binary Search Tree 16.1% | MediumM | Solve→ |
Last Person to Fit in the Bus 16.1% | MediumM | Solve→ |
Number of Closed Islands 16.1% | MediumM | Solve→ |
Convert Binary Number in a Linked List to Integer 16.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Steps to Reduce a Number to Zero 16.1% | EasyE | Solve→ |
Find Kth Bit in Nth Binary String 16.1% | MediumM | Solve→ |
Min Cost to Connect All Points 16.1% | MediumM | Solve→ |
Find Minimum Time to Finish All Jobs 16.1% | HardH | Solve→ |
The Number of the Smallest Unoccupied Chair 16.1% | MediumM | Solve→ |
Find the Minimum and Maximum Number of Nodes Between Critical Points 16.1% | MediumM | Solve→ |
Max Sum of a Pair With Equal Sum of Digits 16.1% | MediumM | Solve→ |
Maximum Subsequence Score 16.1% | MediumM | Solve→ |
Minimize the Maximum Difference of Pairs 16.1% | MediumM | Solve→ |
Super Egg Drop 16.1% | HardH | Solve→ |
Find Right Interval 16.1% | MediumM | Solve→ |
Binary Tree Pruning 16.1% | MediumM | Solve→ |
Keyboard Row 16.1% | EasyE | Solve→ |
Design a Stack With Increment Operation 16.1% | MediumM | Solve→ |
Check If Array Pairs Are Divisible by k 16.1% | MediumM | Solve→ |
Repeated Substring Pattern 16.1% | EasyE | Solve→ |
Defuse the Bomb 16.1% | EasyE | Solve→ |
Shortest Distance After Road Addition Queries I 16.1% | MediumM | Solve→ |
Minimum Time to Visit a Cell In a Grid 16.1% | HardH | Solve→ |
Fix Names in a Table 16.1% | EasyE | Solve→ |
Count Hills and Valleys in an Array 16.1% | EasyE | Solve→ |
Word Pattern II 16.1% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 16.1% | EasyE | Solve→ |
Maximum Sum BST in Binary Tree 16.1% | HardH | Solve→ |
Repeated String Match 16.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Sum of 3 Non-Overlapping Subarrays 16.1% | HardH | Solve→ |
Determine if Two Strings Are Close 16.1% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements 16.1% | MediumM | Solve→ |
Number of Ways to Split Array 16.1% | MediumM | Solve→ |
Special Array I 16.1% | EasyE | Solve→ |
Project Employees I 16.1% | EasyE | Solve→ |
Product of the Last K Numbers 16.1% | MediumM | Solve→ |
Valid Number 16.1% | HardH | Solve→ |
Validate Stack Sequences 16.1% | MediumM | Solve→ |
Number of Sub-arrays With Odd Sum 16.1% | MediumM | Solve→ |
Recover a Tree From Preorder Traversal 16.1% | HardH | Solve→ |
Alternating Groups II 16.1% | MediumM | Solve→ |
Minimum Sideway Jumps 16.1% | MediumM | Solve→ |
Triangle Judgement 16.1% | EasyE | Solve→ |
Maximum Count of Positive Integer and Negative Integer 16.1% | EasyE | Solve→ |
Determine Whether Matrix Can Be Obtained By Rotation 16.1% | EasyE | Solve→ |
Minimum Time to Repair Cars 16.1% | MediumM | Solve→ |
Count the Number of Complete Components 16.1% | MediumM | Solve→ |
Count Square Submatrices with All Ones 16.1% | MediumM | Solve→ |
Count Symmetric Integers 16.1% | EasyE | Solve→ |
Remove Nodes From Linked List 16.1% | MediumM | Solve→ |
Count the Number of Good Subarrays 16.1% | MediumM | Solve→ |
Count Equal and Divisible Pairs in an Array 16.1% | EasyE | Solve→ |
Count Subarrays With Score Less Than K 16.1% | HardH | Solve→ |
Exclusive Time of Functions 16.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Bitwise AND of Numbers Range 16.1% | MediumM | Solve→ |
Build Array from Permutation 16.1% | EasyE | Solve→ |
Largest Odd Number in String 16.1% | EasyE | Solve→ |
Detonate the Maximum Bombs 16.1% | MediumM | Solve→ |
Find the Lexicographically Largest String From the Box I 16.1% | MediumM | Solve→ |
Actors and Directors Who Cooperated At Least Three Times 16.1% | EasyE | Solve→ |
Sorting the Sentence 16.1% | EasyE | Solve→ |
Number of Operations to Make Network Connected 16.1% | MediumM | Solve→ |
Jump Game VI 16.1% | MediumM | Solve→ |
Convert BST to Greater Tree 16.1% | MediumM | Solve→ |
Check Completeness of a Binary Tree 16.1% | MediumM | Solve→ |
Car Pooling 16.1% | MediumM | Solve→ |
Find the Original Typed String II 16.1% | HardH | Solve→ |
Reach a Number 16.1% | MediumM | Solve→ |
Find the Maximum Length of Valid Subsequence II 16.1% | MediumM | Solve→ |
Shortest Distance to a Character 16.1% | EasyE | Solve→ |
Maximum 69 Number 16.1% | EasyE | Solve→ |
Duplicate Zeros 16.1% | EasyE | Solve→ |
Last Substring in Lexicographical Order 16.1% | HardH | Solve→ |
Element Appearing More Than 25% In Sorted Array 16.1% | EasyE | Solve→ |
Alice and Bob Playing Flower Game 16.1% | MediumM | Solve→ |
Flatten a Multilevel Doubly Linked List 16.1% | MediumM | Solve→ |
Movie Rating 16.1% | MediumM | Solve→ |
Super Ugly Number 16.1% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Cooldown 16.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Number With All Set Bits 16.1% | EasyE | Solve→ |
Select Data 16.1% | EasyE | Solve→ |
Set Intersection Size At Least Two 16.1% | HardH | Solve→ |
Web Crawler 16.1% | MediumM | Solve→ |
Greatest Sum Divisible by Three 16.1% | MediumM | Solve→ |
Count Ways To Build Good Strings 16.1% | MediumM | Solve→ |
Minesweeper 16.1% | MediumM | Solve→ |
Maximize Happiness of Selected Children 16.1% | MediumM | Solve→ |
Minimize Maximum of Array 16.1% | MediumM | Solve→ |
Four Divisors 16.1% | MediumM | Solve→ |
Maximum Level Sum of a Binary Tree 16.1% | MediumM | Solve→ |
Find the Largest Area of Square Inside Two Rectangles 16.1% | MediumM | Solve→ |
Build an Array With Stack Operations 16.1% | MediumM | Solve→ |
Construct the Minimum Bitwise Array II 16.1% | MediumM | Solve→ |
Car Fleet II 16.1% | HardH | Solve→ |
Maximum Number of Balloons 16.1% | EasyE | Solve→ |
Minimum Number Game 16.1% | EasyE | Solve→ |
Minimum Cost to Merge Stones 16.1% | HardH | Solve→ |
Self Dividing Numbers 16.1% | EasyE | Solve→ |
Largest Submatrix With Rearrangements 16.1% | MediumM | Solve→ |
Maximum Non Negative Product in a Matrix 16.1% | MediumM | Solve→ |
Valid Phone Numbers 16.1% | EasyE | Solve→ |
Stone Game 16.1% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 12% | MediumM | Solve→ |
Graph Valid Tree 12% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Palindrome Permutation 12% | EasyE | Solve→ |
Minimum Height Trees 12% | MediumM | Solve→ |
Maximum Size Subarray Sum Equals k 12% | MediumM | Solve→ |
Power of Four 12% | EasyE | Solve→ |
Integer Break 12% | MediumM | Solve→ |
Nth Digit 12% | MediumM | Solve→ |
Third Maximum Number 12% | EasyE | Solve→ |
Strong Password Checker 12% | HardH | Solve→ |
Maximum XOR of Two Numbers in an Array 12% | MediumM | Solve→ |
Optimal Account Balancing 12% | HardH | Solve→ |
Find Largest Value in Each Tree Row 12% | MediumM | Solve→ |
Encode and Decode TinyURL 12% | MediumM | Solve→ |
Sum of Square Numbers 12% | MediumM | Solve→ |
Maximum Length of Repeated Subarray 12% | MediumM | Solve→ |
Letter Case Permutation 12% | MediumM | Solve→ |
Most Common Word 12% | EasyE | Solve→ |
Sum of Distances in Tree 12% | HardH | Solve→ |
Reveal Cards In Increasing Order 12% | MediumM | Solve→ |
Tallest Billboard 12% | HardH | Solve→ |
Minimum Domino Rotations For Equal Row 12% | MediumM | Solve→ |
Uncrossed Lines 12% | MediumM | Solve→ |
Design File System 12% | MediumM | Solve→ |
Validate Binary Tree Nodes 12% | MediumM | Solve→ |
Maximum Length of a Concatenated String with Unique Characters 12% | MediumM | Solve→ |
Number of Steps to Reduce a Number in Binary Representation to One 12% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Design Browser History 12% | MediumM | Solve→ |
The kth Factor of n 12% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 12% | MediumM | Solve→ |
Merge In Between Linked Lists 12% | MediumM | Solve→ |
Max Number of K-Sum Pairs 12% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended II 12% | HardH | Solve→ |
Egg Drop With 2 Eggs and N Floors 12% | MediumM | Solve→ |
Time Needed to Buy Tickets 12% | EasyE | Solve→ |
Maximum Twin Sum of a Linked List 12% | MediumM | Solve→ |
Minimum Bit Flips to Convert Number 12% | EasyE | Solve→ |
Root Equals Sum of Children 12% | EasyE | Solve→ |
Equal Row and Column Pairs 12% | MediumM | Solve→ |
Find Words Containing Character 12% | EasyE | Solve→ |
Count the Number of Special Characters II 12% | MediumM | Solve→ |
Find the Minimum Area to Cover All Ones II 12% | HardH | Solve→ |
Type of Triangle 12% | EasyE | Solve→ |
Count the Number of Substrings With Dominant Ones 12% | MediumM | Solve→ |
Shortest Path Visiting All Nodes 12% | HardH | Solve→ |
Lemonade Change 12% | EasyE | Solve→ |
Merge BSTs to Create Single BST 12% | HardH | Solve→ |
Maximum Score From Removing Substrings 12% | MediumM | Solve→ |
Path with Maximum Probability 12% | MediumM | Solve→ |
Spiral Matrix IV 12% | MediumM | Solve→ |
Insert Greatest Common Divisors in Linked List 12% | MediumM | Solve→ |
Valid Mountain Array 12% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Special Array With X Elements Greater Than or Equal X 12% | EasyE | Solve→ |
Count of Matches in Tournament 12% | EasyE | Solve→ |
Find the Length of the Longest Common Prefix 12% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 12% | EasyE | Solve→ |
Rank Transform of an Array 12% | EasyE | Solve→ |
Make Sum Divisible by P 12% | MediumM | Solve→ |
Smallest Missing Non-negative Integer After Operations 12% | MediumM | Solve→ |
Minimum Number of Swaps to Make the String Balanced 12% | MediumM | Solve→ |
Count Number of Maximum Bitwise-OR Subsets 12% | MediumM | Solve→ |
Split a String Into the Max Number of Unique Substrings 12% | MediumM | Solve→ |
Implement Rand10() Using Rand7() 12% | MediumM | Solve→ |
N-ary Tree Level Order Traversal 12% | MediumM | Solve→ |
Remove Sub-Folders from the Filesystem 12% | MediumM | Solve→ |
String Compression III 12% | MediumM | Solve→ |
Find if Array Can Be Sorted 12% | MediumM | Solve→ |
Delete Characters to Make Fancy String 12% | EasyE | Solve→ |
Flip Columns For Maximum Number of Equal Rows 12% | MediumM | Solve→ |
List the Products Ordered in a Period 12% | EasyE | Solve→ |
Move Pieces to Obtain a String 12% | MediumM | Solve→ |
Minimum Penalty for a Shop 12% | MediumM | Solve→ |
Special Array II 12% | MediumM | Solve→ |
Baseball Game 12% | EasyE | Solve→ |
K Inverse Pairs Array 12% | HardH | Solve→ |
Longest Substring Of All Vowels in Order 12% | MediumM | Solve→ |
Circle and Rectangle Overlapping 12% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Vowel Strings in Ranges 12% | MediumM | Solve→ |
Counting Words With a Given Prefix 12% | EasyE | Solve→ |
Construct K Palindrome Strings 12% | MediumM | Solve→ |
Invalid Transactions 12% | MediumM | Solve→ |
Count Non-Decreasing Subarrays After K Operations 12% | HardH | Solve→ |
Minimize XOR 12% | MediumM | Solve→ |
Swap Sex of Employees 12% | EasyE | Solve→ |
Count Servers that Communicate 12% | MediumM | Solve→ |
Maximum Number of Fish in a Grid 12% | MediumM | Solve→ |
Divide Nodes Into the Maximum Number of Groups 12% | HardH | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 12% | EasyE | Solve→ |
Loud and Rich 12% | MediumM | Solve→ |
Construct the Lexicographically Largest Valid Sequence 12% | MediumM | Solve→ |
Length of Longest Fibonacci Subsequence 12% | MediumM | Solve→ |
Maximum Absolute Sum of Any Subarray 12% | MediumM | Solve→ |
Count Total Number of Colored Cells 12% | MediumM | Solve→ |
Closest Prime Numbers in Range 12% | MediumM | Solve→ |
Minimum Cost Walk in Weighted Graph 12% | HardH | Solve→ |
Minimum Operations to Make a Uni-Value Grid 12% | MediumM | Solve→ |
Shortest Path with Alternating Colors 12% | MediumM | Solve→ |
Delete Nodes From Linked List Present in Array 12% | MediumM | Solve→ |
Minimum Operations to Make Array Values Equal to K 12% | EasyE | Solve→ |
Total Cost to Hire K Workers 12% | MediumM | Solve→ |
Minimum Cost For Tickets 12% | MediumM | Solve→ |
Find Numbers with Even Number of Digits 12% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Push Dominoes 12% | MediumM | Solve→ |
Check If a String Contains All Binary Codes of Size K 12% | MediumM | Solve→ |
Solving Questions With Brainpower 12% | MediumM | Solve→ |
Smallest Number in Infinite Set 12% | MediumM | Solve→ |
Finding 3-Digit Even Numbers 12% | EasyE | Solve→ |
Ways to Make a Fair Array 12% | MediumM | Solve→ |
Painting a Grid With Three Different Colors 12% | HardH | Solve→ |
Zero Array Transformation I 12% | MediumM | Solve→ |
Reaching Points 12% | HardH | Solve→ |
Sort Array By Parity II 12% | EasyE | Solve→ |
Zero Array Transformation III 12% | MediumM | Solve→ |
Count Number of Pairs With Absolute Difference K 12% | EasyE | Solve→ |
Longest Palindrome by Concatenating Two Letter Words 12% | MediumM | Solve→ |
Minimum Cost to Move Chips to The Same Position 12% | EasyE | Solve→ |
Number of Ways to Arrive at Destination 12% | MediumM | Solve→ |
Minimum Number of Operations to Make Array Continuous 12% | HardH | Solve→ |
Check if Object Instance of Class 12% | MediumM | Solve→ |
Maximum Frequency After Subarray Operation 12% | MediumM | Solve→ |
Maximum Difference Between Adjacent Elements in a Circular Array 12% | EasyE | Solve→ |
Flip Equivalent Binary Trees 12% | MediumM | Solve→ |
Swapping Nodes in a Linked List 12% | MediumM | Solve→ |
Number of Subsequences That Satisfy the Given Sum Condition 12% | MediumM | Solve→ |
Find the K-th Character in String Game I 12% | EasyE | Solve→ |
Reschedule Meetings for Maximum Free Time II 12% | MediumM | Solve→ |
Count Number of Texts 12% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Maximum Length of Valid Subsequence I 12% | MediumM | Solve→ |
Maximum Erasure Value 12% | MediumM | Solve→ |
Minimum Cost to Make Array Equal 12% | HardH | Solve→ |
The K Weakest Rows in a Matrix 12% | EasyE | Solve→ |
Maximize Subarrays After Removing One Conflicting Pair 12% | HardH | Solve→ |
Guess the Word 12% | HardH | Solve→ |
Smallest Subarrays With Maximum Bitwise OR 12% | MediumM | Solve→ |
Fruits Into Baskets III 12% | MediumM | Solve→ |
Divisor Game 12% | EasyE | Solve→ |
Corporate Flight Bookings 12% | MediumM | Solve→ |
Number of Zero-Filled Subarrays 12% | MediumM | Solve→ |
Number of Increasing Paths in a Grid 12% | HardH | Solve→ |
Reconstruct Itinerary 12% | HardH | Solve→ |
As Far from Land as Possible 12% | MediumM | Solve→ |
Array Partition 12% | EasyE | Solve→ |
Successful Pairs of Spells and Potions 12% | MediumM | Solve→ |
Reverse Only Letters 12% | EasyE | Solve→ |
Fraction to Recurring Decimal 12% | MediumM | Solve→ |
Sort Vowels in a String 12% | MediumM | Solve→ |
Maximum Number of Words You Can Type 12% | EasyE | Solve→ |
Paint House 12% | MediumM | Solve→ |
Check if the Sentence Is Pangram 12% | EasyE | Solve→ |
Get the Maximum Score 12% | HardH | Solve→ |
Find Resultant Array After Removing Anagrams 12% | EasyE | Solve→ |
Maximum Subarray Sum with One Deletion 12% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Palindromes After Operations 12% | MediumM | Solve→ |
Sliding Puzzle 12% | HardH | Solve→ |
Maximum Number of Occurrences of a Substring 12% | MediumM | Solve→ |
The Two Sneaky Numbers of Digitville 12% | EasyE | Solve→ |
Power Grid Maintenance 12% | MediumM | Solve→ |
Count Vowel Substrings of a String 12% | EasyE | Solve→ |
Minimum Increments to Equalize Leaf Paths 12% | MediumM | Solve→ |
Champagne Tower 12% | MediumM | Solve→ |
Smallest Integer Divisible by K 12% | MediumM | Solve→ |
Minimum Operations to Make Array Sum Divisible by K 12% | EasyE | Solve→ |
Count Mentions Per User 12% | MediumM | Solve→ |
Cherry Pickup II 12% | HardH | Solve→ |
Binary Searchable Numbers in an Unsorted Array 12% | MediumM | Solve→ |
Long Pressed Name 12% | EasyE | Solve→ |
Largest Component Size by Common Factor 12% | HardH | Solve→ |
Create Maximum Number 12% | HardH | Solve→ |
My Calendar I 12% | MediumM | Solve→ |
Minimum Difference Between Highest and Lowest of K Scores 12% | EasyE | Solve→ |
Magnetic Force Between Two Balls 12% | MediumM | Solve→ |
Divide an Array Into Subarrays With Minimum Cost I 12% | EasyE | Solve→ |
Trips and Users 12% | HardH | Solve→ |
Transformed Array 12% | EasyE | Solve→ |
Maximum Capacity Within Budget 12% | MediumM | Solve→ |
Binary Watch 12% | EasyE | Solve→ |
Binary Gap 12% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Convert a Number to Hexadecimal 12% | EasyE | Solve→ |
Parallel Courses III 12% | HardH | Solve→ |
Minimum Operations to Equalize Binary String 12% | HardH | Solve→ |
Count Numbers with Unique Digits 12% | MediumM | Solve→ |
Minimum Number of Flips to Make the Binary String Alternating 12% | MediumM | Solve→ |
Construct Product Matrix 12% | MediumM | Solve→ |
Equal Sum Grid Partition I 12% | MediumM | Solve→ |
Maximum Units on a Truck 12% | EasyE | Solve→ |
Substrings of Size Three with Distinct Characters 12% | EasyE | Solve→ |
Maximum Amount of Money Robot Can Earn 12% | MediumM | Solve→ |
Grumpy Bookstore Owner 12% | MediumM | Solve→ |
Minimum Absolute Distance Between Mirror Pairs 12% | MediumM | Solve→ |
Maximum Path Score in a Grid 12% | MediumM | Solve→ |
Get Equal Substrings Within Budget 12% | MediumM | Solve→ |
Rotate Function 12% | MediumM | Solve→ |
Find Greatest Common Divisor of Array 12% | EasyE | Solve→ |
Minimum Cost to Reach Destination in Time 12% | HardH | Solve→ |
Moving Average from Data Stream 12% | EasyE | Solve→ |
Minimum Element After Replacement With Digit Sum 12% | EasyE | Solve→ |
Maximum Product of Subsequences With an Alternating Sum Equal to K 12% | HardH | Solve→ |
Number of ZigZag Arrays I 12% | HardH | Solve→ |
Remove Covered Intervals 12% | MediumM | Solve→ |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 12% | MediumM | Solve→ |
Find the Number of Subsequences With Equal GCD 12% | HardH | Solve→ |
Unique Email Addresses 12% | 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 12% | EasyE | Solve→ |
Smallest Divisible Digit Product I 12% | EasyE | Solve→ |
Smallest Divisible Digit Product II 12% | HardH | Solve→ |
Stone Game II 12% | MediumM | Solve→ |
Longest Substring of One Repeating Character 12% | HardH | Solve→ |
Binary Tree Postorder Traversal 7.3% | EasyE | Solve→ |
Insertion Sort List 7.3% | MediumM | Solve→ |
Flatten Nested List Iterator 7.3% | MediumM | Solve→ |
132 Pattern 7.3% | MediumM | Solve→ |
Reverse Words in a String III 7.3% | EasyE | Solve→ |
Replace Words 7.3% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 7.3% | MediumM | Solve→ |
Domino and Tromino Tiling 7.3% | MediumM | Solve→ |
Custom Sort String 7.3% | MediumM | Solve→ |
Minimum Cost to Hire K Workers 7.3% | HardH | Solve→ |
All Possible Full Binary Trees 7.3% | MediumM | Solve→ |
Sort Array By Parity 7.3% | EasyE | Solve→ |
Minimum Add to Make Parentheses Valid 7.3% | MediumM | Solve→ |
Range Sum of BST 7.3% | EasyE | Solve→ |
Largest Time for Given Digits 7.3% | MediumM | Solve→ |
Distribute Coins in Binary Tree 7.3% | MediumM | Solve→ |
Cousins in Binary Tree 7.3% | EasyE | Solve→ |
Find Common Characters 7.3% | EasyE | Solve→ |
Product Sales Analysis III 7.3% | MediumM | Solve→ |
Longest ZigZag Path in a Binary Tree 7.3% | 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 7.3% | EasyE | Solve→ |
Find Closest Number to Zero 7.3% | EasyE | Solve→ |
The Latest Time to Catch a Bus 7.3% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 7.3% | MediumM | Solve→ |
Frog Jump II 7.3% | MediumM | Solve→ |
Construct the Longest New String 7.3% | MediumM | Solve→ |
Add Two Promises 7.3% | EasyE | Solve→ |
Count Subarrays Where Max Element Appears at Least K Times 7.3% | MediumM | Solve→ |
Find the City With the Smallest Number of Neighbors at a Threshold Distance 7.3% | MediumM | Solve→ |
Harshad Number 7.3% | EasyE | Solve→ |
Spiral Matrix III 7.3% | MediumM | Solve→ |
Magic Squares In Grid 7.3% | MediumM | Solve→ |
Partition Array into Disjoint Intervals 7.3% | MediumM | Solve→ |
Maximum Number of Points with Cost 7.3% | MediumM | Solve→ |
Strange Printer 7.3% | HardH | Solve→ |
Minimum Additions to Make Valid String 7.3% | MediumM | Solve→ |
Shortest Word Distance 7.3% | EasyE | Solve→ |
Minimum Jumps to Reach Home 7.3% | MediumM | Solve→ |
Smallest Good Base 7.3% | HardH | Solve→ |
Divide Players Into Teams of Equal Skill 7.3% | MediumM | Solve→ |
Friends Of Appropriate Ages 7.3% | MediumM | Solve→ |
Find Smallest Letter Greater Than Target 7.3% | EasyE | Solve→ |
Array Prototype Last 7.3% | EasyE | Solve→ |
Kth Largest Sum in a Binary Tree 7.3% | MediumM | Solve→ |
Minimum Total Distance Traveled 7.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Subarray With OR at Least K II 7.3% | MediumM | Solve→ |
Walls and Gates 7.3% | MediumM | Solve→ |
Prime Subtraction Operation 7.3% | MediumM | Solve→ |
Generate Binary Strings Without Adjacent Zeros 7.3% | MediumM | Solve→ |
Find K-th Smallest Pair Distance 7.3% | HardH | Solve→ |
Reformat Department Table 7.3% | EasyE | Solve→ |
Check If a Word Occurs As a Prefix of Any Word in a Sentence 7.3% | EasyE | Solve→ |
Check If N and Its Double Exist 7.3% | EasyE | Solve→ |
Smallest Value of the Rearranged Number 7.3% | MediumM | Solve→ |
Number of Spaces Cleaning Robot Cleaned 7.3% | MediumM | Solve→ |
Find Longest Special Substring That Occurs Thrice I 7.3% | MediumM | Solve→ |
Count Pairs Whose Sum is Less than Target 7.3% | EasyE | Solve→ |
Magical String 7.3% | MediumM | Solve→ |
Count the Number of Incremovable Subarrays I 7.3% | EasyE | Solve→ |
String Matching in an Array 7.3% | EasyE | Solve→ |
Nearest Exit from Entrance in Maze 7.3% | MediumM | Solve→ |
Find the Prefix Common Array of Two Arrays 7.3% | MediumM | Solve→ |
Find Followers Count 7.3% | EasyE | Solve→ |
Restaurant Growth 7.3% | MediumM | Solve→ |
Minimum Number of Operations to Move All Balls to Each Box 7.3% | MediumM | Solve→ |
Delete Operation for Two Strings 7.3% | MediumM | Solve→ |
Check if One String Swap Can Make Strings Equal 7.3% | EasyE | Solve→ |
Coloring A Border 7.3% | MediumM | Solve→ |
Tuple with Same Product 7.3% | MediumM | Solve→ |
Adding Spaces to a String 7.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Detect Capital 7.3% | EasyE | Solve→ |
Maximum Sum With at Most K Elements 7.3% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 7.3% | MediumM | Solve→ |
Minimum Swaps to Group All 1's Together II 7.3% | MediumM | Solve→ |
Gray Code 7.3% | MediumM | Solve→ |
Longest Mountain in Array 7.3% | MediumM | Solve→ |
Minimum Index of a Valid Split 7.3% | MediumM | Solve→ |
Average of Levels in Binary Tree 7.3% | EasyE | Solve→ |
Maximum Value of an Ordered Triplet II 7.3% | MediumM | Solve→ |
Count Salary Categories 7.3% | MediumM | Solve→ |
Minimum Number of Operations to Make Elements in Array Distinct 7.3% | EasyE | Solve→ |
Minimum Cuts to Divide a Circle 7.3% | EasyE | Solve→ |
Rabbits in Forest 7.3% | MediumM | Solve→ |
Minimized Maximum of Products Distributed to Any Store 7.3% | MediumM | Solve→ |
Count the Number of Ideal Arrays 7.3% | HardH | Solve→ |
Count of Interesting Subarrays 7.3% | MediumM | Solve→ |
Smallest Palindromic Rearrangement I 7.3% | MediumM | Solve→ |
Merge Two Binary Trees 7.3% | EasyE | Solve→ |
Count Subarrays of Length Three With a Condition 7.3% | EasyE | Solve→ |
Continuous Subarrays 7.3% | MediumM | Solve→ |
Number of Segments in a String 7.3% | EasyE | Solve→ |
Path with Maximum Gold 7.3% | MediumM | Solve→ |
Lexicographically Minimum String After Removing Stars 7.3% | MediumM | Solve→ |
Walking Robot Simulation 7.3% | MediumM | Solve→ |
Transform Array to All Equal Elements 7.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Divide Array Into Arrays With Max Difference 7.3% | MediumM | Solve→ |
Maximum Number of Words Found in Sentences 7.3% | EasyE | Solve→ |
Sum of k-Mirror Numbers 7.3% | HardH | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 7.3% | HardH | Solve→ |
Find the Original Typed String I 7.3% | EasyE | Solve→ |
Minimum Limit of Balls in a Bag 7.3% | MediumM | Solve→ |
Minimum Suffix Flips 7.3% | MediumM | Solve→ |
Minimum Difference in Sums After Removal of Elements 7.3% | HardH | Solve→ |
Delete Duplicate Folders in System 7.3% | HardH | Solve→ |
Minimum Score After Removals on a Tree 7.3% | HardH | Solve→ |
Find The Original Array of Prefix Xor 7.3% | MediumM | Solve→ |
Merge Two 2D Arrays by Summing Values 7.3% | EasyE | Solve→ |
Longest Subarray With Maximum Bitwise AND 7.3% | MediumM | Solve→ |
Maximize Greatness of an Array 7.3% | MediumM | Solve→ |
Maximum Fruits Harvested After at Most K Steps 7.3% | HardH | Solve→ |
Cat and Mouse 7.3% | HardH | Solve→ |
Reducing Dishes 7.3% | HardH | Solve→ |
Find the Distance Value Between Two Arrays 7.3% | EasyE | Solve→ |
Design Snake Game 7.3% | MediumM | Solve→ |
Minimum Swaps to Make Strings Equal 7.3% | MediumM | Solve→ |
Length of Longest V-Shaped Diagonal Segment 7.3% | HardH | Solve→ |
Count Number of Bad Pairs 7.3% | MediumM | Solve→ |
Minimum Substring Partition of Equal Character Frequency 7.3% | MediumM | Solve→ |
Twisted Mirror Path Count 7.3% | MediumM | Solve→ |
Degree of an Array 7.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Array Reduce Transformation 7.3% | EasyE | Solve→ |
Minimize Malware Spread 7.3% | HardH | Solve→ |
Word Frequency 7.3% | MediumM | Solve→ |
Rearrange Words in a Sentence 7.3% | MediumM | Solve→ |
Number of People Aware of a Secret 7.3% | MediumM | Solve→ |
Kill Process 7.3% | MediumM | Solve→ |
Design a Food Rating System 7.3% | MediumM | Solve→ |
Design Task Manager 7.3% | MediumM | Solve→ |
Design Spreadsheet 7.3% | MediumM | Solve→ |
Implement Router 7.3% | MediumM | Solve→ |
Reverse Prefix of Word 7.3% | EasyE | Solve→ |
Count Special Quadruplets 7.3% | EasyE | Solve→ |
Put Marbles in Bags 7.3% | HardH | Solve→ |
Robot Bounded In Circle 7.3% | MediumM | Solve→ |
Remove Boxes 7.3% | HardH | Solve→ |
Convert 1D Array Into 2D Array 7.3% | EasyE | Solve→ |
Minimum Score Triangulation of Polygon 7.3% | MediumM | Solve→ |
Find Triangular Sum of an Array 7.3% | MediumM | Solve→ |
Tree Diameter 7.3% | MediumM | Solve→ |
Minimum Number of Changes to Make Binary String Beautiful 7.3% | MediumM | Solve→ |
Find the Minimum Amount of Time to Brew Potions 7.3% | MediumM | Solve→ |
Count Number of Ways to Place Houses 7.3% | MediumM | Solve→ |
Broken Calculator 7.3% | MediumM | Solve→ |
Adjacent Increasing Subarrays Detection I 7.3% | EasyE | Solve→ |
Find the Minimum Area to Cover All Ones I 7.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Unreachable Pairs of Nodes in an Undirected Graph 7.3% | MediumM | Solve→ |
The Dining Philosophers 7.3% | MediumM | Solve→ |
Count Collisions of Monkeys on a Polygon 7.3% | MediumM | Solve→ |
Subdomain Visit Count 7.3% | MediumM | Solve→ |
Check If Digits Are Equal in String After Operations I 7.3% | EasyE | Solve→ |
Seat Reservation Manager 7.3% | MediumM | Solve→ |
Next Greater Numerically Balanced Number 7.3% | MediumM | Solve→ |
Mirror Reflection 7.3% | MediumM | Solve→ |
Longest Ideal Subsequence 7.3% | MediumM | Solve→ |
Minimum Sum of Mountain Triplets I 7.3% | EasyE | Solve→ |
Make Array Elements Equal to Zero 7.3% | EasyE | Solve→ |
Count Unguarded Cells in the Grid 7.3% | MediumM | Solve→ |
Find X-Sum of All K-Long Subarrays I 7.3% | EasyE | Solve→ |
Sort Matrix by Diagonals 7.3% | MediumM | Solve→ |
Sort Even and Odd Indices Independently 7.3% | EasyE | Solve→ |
Find Duplicate File in System 7.3% | MediumM | Solve→ |
Numbers At Most N Given Digit Set 7.3% | HardH | Solve→ |
Best Meeting Point 7.3% | HardH | Solve→ |
Letter Tile Possibilities 7.3% | MediumM | Solve→ |
To Lower Case 7.3% | EasyE | Solve→ |
Paths in Matrix Whose Sum Is Divisible by K 7.3% | HardH | Solve→ |
Maximum Number of K-Divisible Components 7.3% | HardH | Solve→ |
Delete Leaves With a Given Value 7.3% | MediumM | Solve→ |
Palindrome Pairs 7.3% | HardH | Solve→ |
Count Partitions with Even Sum Difference 7.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count of Substrings Containing Every Vowel and K Consonants II 7.3% | MediumM | Solve→ |
Decrypt String from Alphabet to Integer Mapping 7.3% | EasyE | Solve→ |
Count Partitions With Max-Min Difference at Most K 7.3% | MediumM | Solve→ |
Binary Prefix Divisible By 5 7.3% | EasyE | Solve→ |
Check If It Is a Good Array 7.3% | HardH | Solve→ |
Number of Smooth Descent Periods of a Stock 7.3% | MediumM | Solve→ |
Number of Ways to Divide a Long Corridor 7.3% | HardH | Solve→ |
Design Bounded Blocking Queue 7.3% | MediumM | Solve→ |
Best Time to Buy and Sell Stock using Strategy 7.3% | MediumM | Solve→ |
Final Value of Variable After Performing Operations 7.3% | EasyE | Solve→ |
GCD of Odd and Even Sums 7.3% | EasyE | Solve→ |
Count the Number of Inversions 7.3% | HardH | Solve→ |
Number of Ways to Paint N × 3 Grid 7.3% | HardH | Solve→ |
Number of Employees Who Met the Target 7.3% | EasyE | Solve→ |
Minimum Time Visiting All Points 7.3% | EasyE | Solve→ |
Find Minimum Diameter After Merging Two Trees 7.3% | HardH | Solve→ |
Count Residue Prefixes 7.3% | EasyE | Solve→ |
Construct the Minimum Bitwise Array I 7.3% | EasyE | Solve→ |
Binary Tree Level Order Traversal II 7.3% | MediumM | Solve→ |
Calculator with Method Chaining 7.3% | EasyE | Solve→ |
Find Beautiful Indices in the Given Array I 7.3% | MediumM | Solve→ |
Minimum Pair Removal to Sort Array II 7.3% | HardH | Solve→ |
Rotated Digits 7.3% | MediumM | Solve→ |
Count Routes to Climb a Rectangular Grid 7.3% | HardH | Solve→ |
Largest Substring Between Two Equal Characters 7.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Taps to Open to Water a Garden 7.3% | HardH | Solve→ |
Minimum Cost Path with Edge Reversals 7.3% | MediumM | Solve→ |
Row With Maximum Ones 7.3% | EasyE | Solve→ |
The Maze 7.3% | MediumM | Solve→ |
Employee Free Time 7.3% | HardH | Solve→ |
Minimum Score of a Path Between Two Cities 7.3% | MediumM | Solve→ |
Trionic Array II 7.3% | HardH | Solve→ |
Function Composition 7.3% | EasyE | Solve→ |
Replace Non-Coprime Numbers in Array 7.3% | HardH | Solve→ |
Maximum Length Substring With Two Occurrences 7.3% | EasyE | Solve→ |
Tweet Counts Per Frequency 7.3% | MediumM | Solve→ |
Valid Boomerang 7.3% | EasyE | Solve→ |
Goat Latin 7.3% | EasyE | Solve→ |
Distance to a Cycle in Undirected Graph 7.3% | HardH | Solve→ |
Longest Balanced Substring II 7.3% | MediumM | Solve→ |
Minimize Maximum Component Cost 7.3% | MediumM | Solve→ |
Binary Number with Alternating Bits 7.3% | EasyE | Solve→ |
First Unique Number 7.3% | MediumM | Solve→ |
N-th Tribonacci Number 7.3% | EasyE | Solve→ |
Couples Holding Hands 7.3% | HardH | Solve→ |
Strong Password Checker II 7.3% | EasyE | Solve→ |
Longest Absolute File Path 7.3% | MediumM | Solve→ |
Minimum Array Sum 7.3% | MediumM | Solve→ |
Minimum Area Rectangle 7.3% | MediumM | Solve→ |
Maximum Total Damage With Spell Casting 7.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Harmonious Subsequence 7.3% | EasyE | Solve→ |
Minimum Changes To Make Alternating Binary String 7.3% | EasyE | Solve→ |
Flipping an Image 7.3% | EasyE | Solve→ |
Fizz Buzz Multithreaded 7.3% | MediumM | Solve→ |
Minimum Cost to Convert String II 7.3% | HardH | Solve→ |
Cache With Time Limit 7.3% | MediumM | Solve→ |
Largest Number At Least Twice of Others 7.3% | EasyE | Solve→ |
Maximize Spanning Tree Stability with Upgrades 7.3% | HardH | Solve→ |
Maximum Students Taking Exam 7.3% | HardH | Solve→ |
Find the Longest Equal Subarray 7.3% | MediumM | Solve→ |
Longest Substring with At Most Two Distinct Characters 7.3% | MediumM | Solve→ |
Maximum Good People Based on Statements 7.3% | HardH | Solve→ |
Matrix Similarity After Cyclic Shifts 7.3% | EasyE | Solve→ |
Equal Sum Grid Partition II 7.3% | HardH | Solve→ |
Construct Quad Tree 7.3% | MediumM | Solve→ |
Check if Strings Can be Made Equal With Operations I 7.3% | EasyE | Solve→ |
Check if Strings Can be Made Equal With Operations II 7.3% | MediumM | Solve→ |
Lexicographically Smallest Generated String 7.3% | HardH | Solve→ |
Robot Collisions 7.3% | HardH | Solve→ |
Maximum Walls Destroyed by Robots 7.3% | HardH | Solve→ |
Print Binary Tree 7.3% | MediumM | Solve→ |
Most Frequent Subtree Sum 7.3% | MediumM | Solve→ |
Maximum Nesting Depth of Two Valid Parentheses Strings 7.3% | MediumM | Solve→ |
Find the Difference of Two Arrays 7.3% | EasyE | Solve→ |
Minimum Distance to Type a Word Using Two Fingers 7.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Distance to Target String in a Circular Array 7.3% | EasyE | Solve→ |
Minimum Distance Between Three Equal Elements II 7.3% | MediumM | Solve→ |
Find Words That Can Be Formed by Characters 7.3% | EasyE | Solve→ |
Maximum Distance Between a Pair of Values 7.3% | MediumM | Solve→ |
Sum of Distances 7.3% | MediumM | Solve→ |
Reorder Data in Log Files 7.3% | MediumM | Solve→ |
Detect Cycles in 2D Grid 7.3% | MediumM | Solve→ |
Separate the Digits in an Array 7.3% | EasyE | Solve→ |
Check if Array is Good 7.3% | EasyE | Solve→ |
Display the First Three Rows 7.3% | EasyE | Solve→ |
Number of Matching Subsequences 7.3% | MediumM | Solve→ |
Longest Cycle in a Graph 7.3% | HardH | Solve→ |
4Sum II 7.3% | MediumM | Solve→ |
Combination Sum IV 7.3% | MediumM | Solve→ |
Decompress Run-Length Encoded List 7.3% | EasyE | Solve→ |
Block Placement Queries 7.3% | HardH | Solve→ |
Maximum Number of Items From Sale I 7.3% | MediumM | Solve→ |
Total Waviness of Numbers in Range II 7.3% | HardH | Solve→ |
Minimum Cost Homecoming of a Robot in a Grid 7.3% | MediumM | Solve→ |
Find Building Where Alice and Bob Can Meet 7.3% | HardH | Solve→ |
Maximum Total Subarray Value II 7.3% | HardH | Solve→ |
Range Frequency Queries 7.3% | MediumM | Solve→ |
Second Largest Digit in a String 7.3% | EasyE | Solve→ |
Process String with Special Operations I 7.3% | MediumM | Solve→ |
Restore Finishing Order 7.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Escape a Large Maze 7.3% | HardH | Solve→ |
Sort the People 7.3% | EasyE | Solve→ |
Elimination Game 7.3% | MediumM | Solve→ |
Maximum Building Height 7.3% | HardH | Solve→ |
Verify Preorder Sequence in Binary Search Tree 7.3% | MediumM | Solve→ |
Maximum Ice Cream Bars 7.3% | MediumM | Solve→ |
Max Chunks To Make Sorted II 7.3% | HardH | Solve→ |
Binary Tree Paths 7.3% | EasyE | Solve→ |
Count Subarrays With Majority Element II 7.3% | HardH | Solve→ |
Debounce 7.3% | MediumM | Solve→ |
Find the Maximum Number of Elements in Subset 7.3% | MediumM | Solve→ |
Maximum Element After Decreasing and Rearranging 7.3% | MediumM | Solve→ |
Number of Strings That Appear as Substrings in Word 7.3% | EasyE | Solve→ |
Jump Game IV 7.3% | HardH | Solve→ |
Sum Multiples 7.3% | EasyE | Solve→ |
Employees Whose Manager Left the Company 7.3% | EasyE | Solve→ |
Find the Safest Path in a Grid 7.3% | MediumM | Solve→ |
Minimum Insertion Steps to Make a String Palindrome 7.3% | HardH | Solve→ |
Vowels of All Substrings 7.3% | MediumM | Solve→ |
Valid Subarrays With Matching Sum Digits I 7.3% | MediumM | Solve→ |
Sleep 7.3% | EasyE | Solve→ |
Longest Even Odd Subarray With Threshold 7.3% | EasyE | Solve→ |
Find the Count of Numbers Which Are Not Special 7.3% | MediumM | Solve→ |
Number of Atoms 7.3% | HardH | Solve→ |
Checking Existence of Edge Length Limited Paths 7.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Path Existence Queries in a Graph I 7.3% | MediumM | Solve→ |
Fill Missing Data 7.3% | EasyE | Solve→ |
Maximum Difference Between Increasing Elements 7.3% | EasyE | Solve→ |
Longest Turbulent Subarray 7.3% | MediumM | Solve→ |
Count Paths That Can Form a Palindrome in a Tree 7.3% | HardH | Solve→ |
Get Watched Videos by Your Friends 7.3% | MediumM | Solve→ |
Minimum Falling Path Sum II 7.3% | HardH | Solve→ |
Arithmetic Slices II - Subsequence 7.3% | HardH | Solve→ |
Fair Candy Swap 7.3% | EasyE | Solve→ |
Apply Operations to an Array 7.3% | EasyE | Solve→ |
Find the Distinct Difference Array 7.3% | EasyE | Solve→ |
Group the People Given the Group Size They Belong To 7.3% | MediumM | Solve→ |
Brightest Position on Street 7.3% | MediumM | Solve→ |
Maximize Active Section with Trade I 7.3% | MediumM | Solve→ |
Number of Unique XOR Triplets I 7.3% | MediumM | Solve→ |
Smallest Subsequence of Distinct Characters 7.3% | MediumM | Solve→ |
Process String with Special Operations II 7.3% | HardH | Solve→ |
Make The String Great 7.3% | EasyE | Solve→ |
Biggest Single Number 7.3% | EasyE | Solve→ |
Maximum Value of an Ordered Triplet I 7.3% | EasyE | Solve→ |
Shifting Letters II 7.3% | MediumM | Solve→ |
Maximum Number of Coins You Can Get 7.3% | MediumM | Solve→ |
Non-decreasing Subsequences 7.3% | MediumM | Solve→ |
Destroying Asteroids 7.3% | MediumM | Solve→ |
Find All Possible Stable Binary Arrays I 7.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Operations to Make the Array Increasing 7.3% | EasyE | Solve→ |
Sum of GCD of Formed Pairs 7.3% | MediumM | Solve→ |
Maximum Tastiness of Candy Basket 7.3% | MediumM | Solve→ |
Longest Word in Dictionary 7.3% | MediumM | Solve→ |
Best Team With No Conflicts 7.3% | MediumM | Solve→ |
Can I Win 7.3% | MediumM | Solve→ |
Find the K-Sum of an Array 7.3% | HardH | Solve→ |
Course Schedule III 7.3% | HardH | Solve→ |
Mice and Cheese 7.3% | 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 Microsoft?
Our current Microsoft practice dataset contains 1384 tagged coding problems, including Two Sum, Add Two Numbers, Longest Palindromic Substring. The difficulty breakdown is 393 Easy, 757 Medium, and 234 Hard problems.
How should I prepare for a Microsoft coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Microsoft interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Microsoft coding interviews?
Based on our data, Microsoft interviews include 393 Easy (28%), 757 Medium (55%), and 234 Hard (17%) problems.
Ready to ace your Microsoft interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required