Bloomberg LeetCode Interview Questions
Practice 1223 coding problems currently tagged to Bloomberg. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
399 Easy
650 Medium
174 Hard
Top Topics at Bloomberg
Ace your Bloomberg interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Bloomberg LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Two Sum 100% | EasyE | Solve→ |
Merge Intervals 87.1% | MediumM | Solve→ |
Add Two Numbers 85.2% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 85.1% | MediumM | Solve→ |
Number of Islands 84.7% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 84.7% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 83.9% | EasyE | Solve→ |
Valid Parentheses 83.8% | EasyE | Solve→ |
Trapping Rain Water 80.9% | HardH | Solve→ |
Longest Palindromic Substring 79.6% | MediumM | Solve→ |
3Sum 79.6% | MediumM | Solve→ |
Invalid Transactions 78.7% | MediumM | Solve→ |
Flatten a Multilevel Doubly Linked List 78.5% | MediumM | Solve→ |
Median of Two Sorted Arrays 78.2% | HardH | Solve→ |
Longest Common Prefix 78.2% | EasyE | Solve→ |
Word Search 77.8% | MediumM | Solve→ |
Container With Most Water 76.5% | MediumM | Solve→ |
Decode String 75.9% | MediumM | Solve→ |
Majority Element 75.2% | EasyE | Solve→ |
Valid Anagram 75.2% | EasyE | Solve→ |
Reverse Integer 74.6% | MediumM | Solve→ |
Merge Sorted Array 74.6% | EasyE | Solve→ |
Palindrome Number 73.9% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 73.9% | EasyE | Solve→ |
LRU Cache 72.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Merge Two Sorted Lists 72% | EasyE | Solve→ |
Longest Consecutive Sequence 71.8% | MediumM | Solve→ |
Subarray Sum Equals K 71.8% | MediumM | Solve→ |
Design Underground System 71.8% | MediumM | Solve→ |
Roman to Integer 71.5% | EasyE | Solve→ |
Search in Rotated Sorted Array 70.5% | MediumM | Solve→ |
Group Anagrams 70.2% | MediumM | Solve→ |
Min Stack 69.9% | MediumM | Solve→ |
Subsets 69.6% | MediumM | Solve→ |
Next Permutation 69.4% | MediumM | Solve→ |
Maximum Subarray 69.4% | MediumM | Solve→ |
Climbing Stairs 67.2% | EasyE | Solve→ |
Move Zeroes 67.2% | EasyE | Solve→ |
First Unique Character in a String 66.6% | EasyE | Solve→ |
Meeting Rooms II 66.2% | MediumM | Solve→ |
Generate Parentheses 65.9% | MediumM | Solve→ |
Rotate Image 65.9% | MediumM | Solve→ |
Reverse Linked List 65.2% | EasyE | Solve→ |
Validate Binary Search Tree 64.5% | MediumM | Solve→ |
Valid Palindrome 64.5% | EasyE | Solve→ |
Rotate Array 64.5% | MediumM | Solve→ |
Number of Ships in a Rectangle 64.1% | HardH | Solve→ |
Single Number 63.3% | EasyE | Solve→ |
Word Break II 63.3% | HardH | Solve→ |
Pascal's Triangle 62.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Peak Element 62.9% | MediumM | Solve→ |
Create Hello World Function 62.9% | EasyE | Solve→ |
String to Integer (atoi) 62.5% | MediumM | Solve→ |
Coin Change 62.5% | MediumM | Solve→ |
Find First and Last Position of Element in Sorted Array 62.1% | MediumM | Solve→ |
Longest Repeating Character Replacement 62.1% | MediumM | Solve→ |
Koko Eating Bananas 62.1% | MediumM | Solve→ |
4Sum 61.7% | MediumM | Solve→ |
Jump Game 61.7% | MediumM | Solve→ |
Sqrt(x) 61.7% | EasyE | Solve→ |
Evaluate Division 61.7% | MediumM | Solve→ |
Single Element in a Sorted Array 61.7% | MediumM | Solve→ |
Sort Integers by The Power Value 61.7% | MediumM | Solve→ |
Pow(x, n) 61.2% | MediumM | Solve→ |
Contains Duplicate 61.2% | EasyE | Solve→ |
Sort Colors 60.8% | MediumM | Solve→ |
Remove Element 60.3% | EasyE | Solve→ |
Spiral Matrix 60.3% | MediumM | Solve→ |
House Robber 59.9% | MediumM | Solve→ |
Product of Array Except Self 59.9% | MediumM | Solve→ |
Next Greater Element I 59.9% | EasyE | Solve→ |
Remove All Adjacent Duplicates in String II 59.9% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 59.9% | EasyE | Solve→ |
Plus One 59.4% | EasyE | Solve→ |
All Paths From Source to Target 59.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Search Insert Position 58.4% | EasyE | Solve→ |
Binary Tree Level Order Traversal 58.4% | MediumM | Solve→ |
Palindrome Partitioning 58.4% | MediumM | Solve→ |
Word Break 58.4% | MediumM | Solve→ |
Palindrome Linked List 58.4% | EasyE | Solve→ |
Remove Letter To Equalize Frequency 58.4% | EasyE | Solve→ |
Combine Two Tables 57.9% | EasyE | Solve→ |
Binary Tree Vertical Order Traversal 57.9% | MediumM | Solve→ |
Two City Scheduling 57.9% | MediumM | Solve→ |
Merge k Sorted Lists 57.3% | HardH | Solve→ |
Find the Index of the First Occurrence in a String 57.3% | EasyE | Solve→ |
Set Matrix Zeroes 57.3% | MediumM | Solve→ |
Minimum Remove to Make Valid Parentheses 57.3% | MediumM | Solve→ |
Zigzag Conversion 56.8% | MediumM | Solve→ |
Reorder List 56.8% | MediumM | Solve→ |
Max Consecutive Ones 56.8% | EasyE | Solve→ |
Daily Temperatures 56.8% | MediumM | Solve→ |
3Sum Closest 56.2% | MediumM | Solve→ |
Rotting Oranges 56.2% | MediumM | Solve→ |
Design an Ordered Stream 56.2% | EasyE | Solve→ |
Best Time to Buy and Sell Stock II 55.6% | MediumM | Solve→ |
Gas Station 55.6% | MediumM | Solve→ |
Copy List with Random Pointer 55.6% | MediumM | Solve→ |
Kth Largest Element in an Array 55.6% | MediumM | Solve→ |
Contains Duplicate II 55.6% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Binary Search 55.6% | EasyE | Solve→ |
Largest Rectangle in Histogram 55% | HardH | Solve→ |
Reverse Words in a String 55% | MediumM | Solve→ |
Valid Triangle Number 55% | MediumM | Solve→ |
Combination Sum 54.4% | MediumM | Solve→ |
N-Queens 54.4% | HardH | Solve→ |
Symmetric Tree 54.4% | EasyE | Solve→ |
Candy 54.4% | HardH | Solve→ |
Isomorphic Strings 54.4% | EasyE | Solve→ |
String Compression 54.4% | MediumM | Solve→ |
Number of Provinces 54.4% | MediumM | Solve→ |
Vertical Order Traversal of a Binary Tree 54.4% | HardH | Solve→ |
Merge Strings Alternately 54.4% | EasyE | Solve→ |
Recyclable and Low Fat Products 54.4% | EasyE | Solve→ |
Letter Combinations of a Phone Number 53.8% | MediumM | Solve→ |
Rotate List 53.8% | MediumM | Solve→ |
Unique Paths 53.8% | MediumM | Solve→ |
Linked List Cycle 53.8% | EasyE | Solve→ |
Reverse String 53.8% | EasyE | Solve→ |
Top K Frequent Elements 53.8% | MediumM | Solve→ |
Regular Expression Matching 53.1% | HardH | Solve→ |
Permutations 53.1% | MediumM | Solve→ |
Balanced Binary Tree 53.1% | EasyE | Solve→ |
Maximum Product Subarray 53.1% | MediumM | Solve→ |
Missing Number 53.1% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Swap Nodes in Pairs 52.4% | MediumM | Solve→ |
Add Binary 52.4% | EasyE | Solve→ |
Search a 2D Matrix 52.4% | MediumM | Solve→ |
Word Ladder 52.4% | HardH | Solve→ |
Intersection of Two Arrays 52.4% | EasyE | Solve→ |
Remove Nth Node From End of List 51.7% | MediumM | Solve→ |
Valid Sudoku 51.7% | MediumM | Solve→ |
Length of Last Word 51.7% | EasyE | Solve→ |
Same Tree 51.7% | EasyE | Solve→ |
Construct Binary Tree from Preorder and Inorder Traversal 51.7% | MediumM | Solve→ |
Fibonacci Number 51.7% | EasyE | Solve→ |
Design A Leaderboard 51.7% | MediumM | Solve→ |
Integer to Roman 51% | MediumM | Solve→ |
Jump Game II 51% | MediumM | Solve→ |
Edit Distance 51% | MediumM | Solve→ |
Minimum Size Subarray Sum 51% | MediumM | Solve→ |
Longest Increasing Subsequence 51% | MediumM | Solve→ |
Split Array Largest Sum 51% | HardH | Solve→ |
Count Unhappy Friends 51% | MediumM | Solve→ |
Unique Paths II 50.2% | MediumM | Solve→ |
Subsets II 50.2% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 50.2% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node 50.2% | MediumM | Solve→ |
Happy Number 50.2% | EasyE | Solve→ |
Find the Duplicate Number 50.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Lexicographical Numbers 50.2% | MediumM | Solve→ |
Add Two Numbers II 50.2% | MediumM | Solve→ |
Managers with at Least 5 Direct Reports 50.2% | MediumM | Solve→ |
Number of Recent Calls 50.2% | EasyE | Solve→ |
Frequency of the Most Frequent Element 50.2% | MediumM | Solve→ |
Divide Two Integers 49.4% | MediumM | Solve→ |
Wildcard Matching 49.4% | HardH | Solve→ |
Sliding Window Maximum 49.4% | HardH | Solve→ |
Rotate String 49.4% | EasyE | Solve→ |
Design Browser History 49.4% | MediumM | Solve→ |
Reverse Nodes in k-Group 48.6% | HardH | Solve→ |
Kth Smallest Element in a BST 48.6% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 48.6% | MediumM | Solve→ |
Partition Equal Subset Sum 48.6% | MediumM | Solve→ |
Next Greater Element II 48.6% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 48.6% | MediumM | Solve→ |
Find the Winner of the Circular Game 48.6% | MediumM | Solve→ |
Concatenation of Array 48.6% | EasyE | Solve→ |
Maximum Depth of Binary Tree 47.7% | EasyE | Solve→ |
Populating Next Right Pointers in Each Node II 47.7% | MediumM | Solve→ |
Triangle 47.7% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 47.7% | MediumM | Solve→ |
Diameter of Binary Tree 47.7% | EasyE | Solve→ |
Squares of a Sorted Array 47.7% | EasyE | Solve→ |
Average Time of Process per Machine 47.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Second Highest Salary 47.7% | MediumM | Solve→ |
Sudoku Solver 46.8% | HardH | Solve→ |
Remove Duplicates from Sorted List 46.8% | EasyE | Solve→ |
Rising Temperature 46.8% | EasyE | Solve→ |
H-Index 46.8% | MediumM | Solve→ |
Maximum Average Subarray I 46.8% | EasyE | Solve→ |
Peak Index in a Mountain Array 46.8% | MediumM | Solve→ |
Online Stock Span 46.8% | MediumM | Solve→ |
Evaluate Reverse Polish Notation 45.8% | MediumM | Solve→ |
Implement Trie (Prefix Tree) 45.8% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Search Tree 45.8% | MediumM | Solve→ |
Reverse Vowels of a String 45.8% | EasyE | Solve→ |
Max Consecutive Ones III 45.8% | MediumM | Solve→ |
Minimum Number of Steps to Make Two Strings Anagram 45.8% | MediumM | Solve→ |
Minimum Number of Days to Make m Bouquets 45.8% | MediumM | Solve→ |
Maximum Nesting Depth of the Parentheses 45.8% | EasyE | Solve→ |
Students and Examinations 45.8% | EasyE | Solve→ |
Find Missing and Repeated Values 45.8% | EasyE | Solve→ |
Fruit Into Baskets 45.8% | MediumM | Solve→ |
Search in Rotated Sorted Array II 44.8% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 44.8% | HardH | Solve→ |
Intersection of Two Linked Lists 44.8% | EasyE | Solve→ |
Delete Node in a Linked List 44.8% | MediumM | Solve→ |
Search a 2D Matrix II 44.8% | MediumM | Solve→ |
Odd Even Linked List 44.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Big Countries 44.8% | EasyE | Solve→ |
Implement Magic Dictionary 44.8% | MediumM | Solve→ |
Top K Frequent Words 44.8% | MediumM | Solve→ |
Article Views I 44.8% | EasyE | Solve→ |
Longest Valid Parentheses 43.7% | HardH | Solve→ |
Employees Earning More Than Their Managers 43.7% | EasyE | Solve→ |
Course Schedule 43.7% | MediumM | Solve→ |
Basic Calculator 43.7% | HardH | Solve→ |
Power of Two 43.7% | EasyE | Solve→ |
Implement Queue using Stacks 43.7% | EasyE | Solve→ |
Monthly Transactions I 43.7% | MediumM | Solve→ |
Rearrange Array Elements by Sign 43.7% | MediumM | Solve→ |
First Missing Positive 42.6% | HardH | Solve→ |
Minimum Window Substring 42.6% | HardH | Solve→ |
Sort List 42.6% | MediumM | Solve→ |
Factorial Trailing Zeroes 42.6% | MediumM | Solve→ |
Largest Number 42.6% | MediumM | Solve→ |
Binary Tree Right Side View 42.6% | MediumM | Solve→ |
Count Primes 42.6% | MediumM | Solve→ |
Add Digits 42.6% | EasyE | Solve→ |
Serialize and Deserialize Binary Tree 42.6% | HardH | Solve→ |
Remove K Digits 42.6% | MediumM | Solve→ |
Sort Characters By Frequency 42.6% | MediumM | Solve→ |
Reverse Pairs 42.6% | HardH | Solve→ |
Permutation in String 42.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sort an Array 42.6% | MediumM | Solve→ |
Minimum Absolute Difference 42.6% | EasyE | Solve→ |
Kth Missing Positive Number 42.6% | EasyE | Solve→ |
Find All Anagrams in a String 42.6% | MediumM | Solve→ |
Simplify Path 41.4% | MediumM | Solve→ |
Remove Duplicates from Sorted Array II 41.4% | MediumM | Solve→ |
Maximal Rectangle 41.4% | HardH | Solve→ |
Binary Tree Inorder Traversal 41.4% | EasyE | Solve→ |
Surrounded Regions 41.4% | MediumM | Solve→ |
Remove Linked List Elements 41.4% | EasyE | Solve→ |
Course Schedule II 41.4% | MediumM | Solve→ |
House Robber II 41.4% | MediumM | Solve→ |
Majority Element II 41.4% | MediumM | Solve→ |
Fizz Buzz 41.4% | EasyE | Solve→ |
Arranging Coins 41.4% | EasyE | Solve→ |
Accounts Merge 41.4% | MediumM | Solve→ |
Middle of the Linked List 41.4% | EasyE | Solve→ |
Binary Subarrays With Sum 41.4% | MediumM | Solve→ |
Average Selling Price 41.4% | EasyE | Solve→ |
Linked List Cycle II 40.1% | MediumM | Solve→ |
Find Median from Data Stream 40.1% | HardH | Solve→ |
Next Greater Element III 40.1% | MediumM | Solve→ |
Longest Common Subsequence 40.1% | MediumM | Solve→ |
Sort Array by Increasing Frequency 40.1% | EasyE | Solve→ |
Shortest Palindrome 40.1% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Flatten Binary Tree to Linked List 40.1% | MediumM | Solve→ |
Diagonal Traverse 40.1% | MediumM | Solve→ |
Count and Say 38.7% | MediumM | Solve→ |
Combination Sum II 38.7% | MediumM | Solve→ |
Reverse Linked List II 38.7% | MediumM | Solve→ |
Customers Who Never Order 38.7% | EasyE | Solve→ |
Implement Stack using Queues 38.7% | EasyE | Solve→ |
Design Hit Counter 38.7% | MediumM | Solve→ |
Ransom Note 38.7% | EasyE | Solve→ |
Non-overlapping Intervals 38.7% | MediumM | Solve→ |
Contiguous Array 38.7% | MediumM | Solve→ |
Reverse String II 38.7% | EasyE | Solve→ |
Asteroid Collision 38.7% | MediumM | Solve→ |
Sum of Subarray Minimums 38.7% | MediumM | Solve→ |
Shortest Path in Binary Matrix 38.7% | MediumM | Solve→ |
Add Two Integers 38.7% | EasyE | Solve→ |
Substring with Concatenation of All Words 37.2% | HardH | Solve→ |
Multiply Strings 37.2% | MediumM | Solve→ |
Remove Duplicates from Sorted List II 37.2% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 37.2% | MediumM | Solve→ |
First Bad Version 37.2% | EasyE | Solve→ |
Perfect Squares 37.2% | MediumM | Solve→ |
Increasing Triplet Subsequence 37.2% | MediumM | Solve→ |
Is Subsequence 37.2% | EasyE | Solve→ |
Target Sum 37.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Employee Bonus 37.2% | EasyE | Solve→ |
Kill Process 37.2% | MediumM | Solve→ |
Find Customer Referee 37.2% | EasyE | Solve→ |
Subarray Sums Divisible by K 37.2% | MediumM | Solve→ |
Remove Outermost Parentheses 37.2% | EasyE | Solve→ |
Queries Quality and Percentage 37.2% | EasyE | Solve→ |
Number of Substrings Containing All Three Characters 37.2% | MediumM | Solve→ |
Reordered Power of 2 37.2% | MediumM | Solve→ |
Partition List 35.6% | MediumM | Solve→ |
Path Sum II 35.6% | MediumM | Solve→ |
Consecutive Numbers 35.6% | MediumM | Solve→ |
Basic Calculator II 35.6% | MediumM | Solve→ |
Range Sum Query - Immutable 35.6% | EasyE | Solve→ |
Delete Node in a BST 35.6% | MediumM | Solve→ |
Valid Parenthesis String 35.6% | MediumM | Solve→ |
Lemonade Change 35.6% | EasyE | Solve→ |
Immediate Food Delivery II 35.6% | MediumM | Solve→ |
Unique Number of Occurrences 35.6% | EasyE | Solve→ |
Maximum Profit in Job Scheduling 35.6% | HardH | Solve→ |
Replace Employee ID With The Unique Identifier 35.6% | EasyE | Solve→ |
Running Sum of 1d Array 35.6% | EasyE | Solve→ |
Dot Product of Two Sparse Vectors 35.6% | MediumM | Solve→ |
Count Good Numbers 35.6% | MediumM | Solve→ |
Find if Path Exists in Graph 35.6% | EasyE | Solve→ |
How Many Numbers Are Smaller Than the Current Number 35.6% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Digit One 35.6% | HardH | Solve→ |
Product Price at a Given Date 35.6% | MediumM | Solve→ |
Maximum Swap 35.6% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 35.6% | MediumM | Solve→ |
Permutation Sequence 35.6% | HardH | Solve→ |
Minimum Path Sum 33.8% | MediumM | Solve→ |
Combinations 33.8% | MediumM | Solve→ |
Excel Sheet Column Title 33.8% | EasyE | Solve→ |
Nth Highest Salary 33.8% | MediumM | Solve→ |
Sparse Matrix Multiplication 33.8% | MediumM | Solve→ |
Find the Difference 33.8% | EasyE | Solve→ |
Assign Cookies 33.8% | EasyE | Solve→ |
Continuous Subarray Sum 33.8% | MediumM | Solve→ |
Shortest Path to Get Food 33.8% | MediumM | Solve→ |
Exchange Seats 33.8% | MediumM | Solve→ |
Set Mismatch 33.8% | EasyE | Solve→ |
Trim a Binary Search Tree 33.8% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 33.8% | MediumM | Solve→ |
Find Pivot Index 33.8% | EasyE | Solve→ |
Flood Fill 33.8% | EasyE | Solve→ |
Cousins in Binary Tree 33.8% | EasyE | Solve→ |
Find in Mountain Array 33.8% | HardH | Solve→ |
Even Odd Tree 33.8% | MediumM | Solve→ |
Partition Array Into Two Arrays to Minimize Sum Difference 33.8% | HardH | Solve→ |
Power of Three 33.8% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Permutations II 31.9% | MediumM | Solve→ |
Insert Interval 31.9% | MediumM | Solve→ |
Minimum Depth of Binary Tree 31.9% | EasyE | Solve→ |
Single Number II 31.9% | MediumM | Solve→ |
Repeated DNA Sequences 31.9% | MediumM | Solve→ |
Invert Binary Tree 31.9% | EasyE | Solve→ |
Summary Ranges 31.9% | EasyE | Solve→ |
Different Ways to Add Parentheses 31.9% | MediumM | Solve→ |
Remove Duplicate Letters 31.9% | MediumM | Solve→ |
Sum of Two Integers 31.9% | MediumM | Solve→ |
Task Scheduler 31.9% | MediumM | Solve→ |
Maximum Product of Three Numbers 31.9% | EasyE | Solve→ |
Design Search Autocomplete System 31.9% | HardH | Solve→ |
Palindromic Substrings 31.9% | MediumM | Solve→ |
Maximum Width of Binary Tree 31.9% | MediumM | Solve→ |
Subarray Product Less Than K 31.9% | MediumM | Solve→ |
Find Eventual Safe States 31.9% | MediumM | Solve→ |
Boats to Save People 31.9% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 31.9% | MediumM | Solve→ |
Remove All Adjacent Duplicates In String 31.9% | EasyE | Solve→ |
Shuffle the Array 31.9% | EasyE | Solve→ |
Build Array from Permutation 31.9% | EasyE | Solve→ |
Confirmation Rate 31.9% | MediumM | Solve→ |
Product Sales Analysis III 31.9% | MediumM | Solve→ |
Rank Transform of an Array 31.9% | 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 31.9% | HardH | Solve→ |
Heaters 31.9% | MediumM | Solve→ |
Interleaving String 31.9% | MediumM | Solve→ |
Letter Tile Possibilities 31.9% | MediumM | Solve→ |
Partition Array According to Given Pivot 31.9% | MediumM | Solve→ |
Jewels and Stones 31.9% | EasyE | Solve→ |
Duplicate Emails 31.9% | EasyE | Solve→ |
Text Justification 29.7% | HardH | Solve→ |
Read N Characters Given read4 II - Call Multiple Times 29.7% | HardH | Solve→ |
Ugly Number 29.7% | EasyE | Solve→ |
Palindrome Permutation 29.7% | EasyE | Solve→ |
Count of Smaller Numbers After Self 29.7% | HardH | Solve→ |
Largest Divisible Subset 29.7% | MediumM | Solve→ |
Elimination Game 29.7% | MediumM | Solve→ |
Third Maximum Number 29.7% | EasyE | Solve→ |
Find All Duplicates in an Array 29.7% | MediumM | Solve→ |
Find All Numbers Disappeared in an Array 29.7% | EasyE | Solve→ |
Can Place Flowers 29.7% | EasyE | Solve→ |
Sum of Square Numbers 29.7% | MediumM | Solve→ |
Valid Palindrome II 29.7% | EasyE | Solve→ |
Redundant Connection 29.7% | MediumM | Solve→ |
Max Area of Island 29.7% | MediumM | Solve→ |
Contain Virus 29.7% | HardH | Solve→ |
Reorganize String 29.7% | MediumM | Solve→ |
Cheapest Flights Within K Stops 29.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Complement of Base 10 Integer 29.7% | EasyE | Solve→ |
Path In Zigzag Labelled Binary Tree 29.7% | MediumM | Solve→ |
Last Person to Fit in the Bus 29.7% | MediumM | Solve→ |
Allocate Mailboxes 29.7% | HardH | Solve→ |
Number of Good Pairs 29.7% | EasyE | Solve→ |
Customer Who Visited but Did Not Make Any Transactions 29.7% | EasyE | Solve→ |
Number of Students Unable to Eat Lunch 29.7% | EasyE | Solve→ |
Truncate Sentence 29.7% | EasyE | Solve→ |
Check if the Sentence Is Pangram 29.7% | EasyE | Solve→ |
Maximum Number of Accepted Invitations 29.7% | MediumM | Solve→ |
Check if All the Integers in a Range Are Covered 29.7% | EasyE | Solve→ |
Shortest Distance to Target String in a Circular Array 29.7% | EasyE | Solve→ |
Friend Requests II: Who Has the Most Friends 29.7% | MediumM | Solve→ |
Delete Duplicate Emails 29.7% | EasyE | Solve→ |
Find Numbers with Even Number of Digits 29.7% | EasyE | Solve→ |
Serialize and Deserialize N-ary Tree 29.7% | HardH | Solve→ |
Sum of Beauty of All Substrings 29.7% | MediumM | Solve→ |
Restaurant Growth 29.7% | MediumM | Solve→ |
Rank Scores 29.7% | MediumM | Solve→ |
N-Queens II 27.3% | HardH | Solve→ |
Decode Ways 27.3% | MediumM | Solve→ |
Recover Binary Search Tree 27.3% | MediumM | Solve→ |
Path Sum 27.3% | EasyE | Solve→ |
Best Time to Buy and Sell Stock III 27.3% | HardH | Solve→ |
Word Ladder II 27.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Clone Graph 27.3% | MediumM | Solve→ |
Single Number III 27.3% | MediumM | Solve→ |
Word Pattern 27.3% | EasyE | Solve→ |
Valid Perfect Square 27.3% | EasyE | Solve→ |
132 Pattern 27.3% | MediumM | Solve→ |
Island Perimeter 27.3% | EasyE | Solve→ |
01 Matrix 27.3% | MediumM | Solve→ |
Find K Closest Elements 27.3% | MediumM | Solve→ |
Candy Crush 27.3% | MediumM | Solve→ |
Min Cost Climbing Stairs 27.3% | EasyE | Solve→ |
Transpose Matrix 27.3% | EasyE | Solve→ |
Sort Array By Parity 27.3% | EasyE | Solve→ |
Time Based Key-Value Store 27.3% | MediumM | Solve→ |
Greatest Common Divisor of Strings 27.3% | EasyE | Solve→ |
Kids With the Greatest Number of Candies 27.3% | EasyE | Solve→ |
The Number of Employees Which Report to Each Employee 27.3% | EasyE | Solve→ |
Largest Odd Number in String 27.3% | EasyE | Solve→ |
Counter 27.3% | EasyE | Solve→ |
Remove All Occurrences of a Substring 27.3% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 27.3% | HardH | Solve→ |
Finding 3-Digit Even Numbers 27.3% | EasyE | Solve→ |
Perfect Number 27.3% | EasyE | Solve→ |
Can Make Arithmetic Progression From Sequence 27.3% | EasyE | Solve→ |
Count Binary Substrings 27.3% | EasyE | Solve→ |
Distinct Subsequences 24.6% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sum Root to Leaf Numbers 24.6% | MediumM | Solve→ |
Binary Tree Postorder Traversal 24.6% | EasyE | Solve→ |
Department Top Three Salaries 24.6% | HardH | Solve→ |
Reconstruct Itinerary 24.6% | HardH | Solve→ |
Intersection of Two Arrays II 24.6% | EasyE | Solve→ |
Guess Number Higher or Lower 24.6% | EasyE | Solve→ |
Longest Palindrome 24.6% | EasyE | Solve→ |
Find Largest Value in Each Tree Row 24.6% | MediumM | Solve→ |
Coin Change II 24.6% | MediumM | Solve→ |
Making A Large Island 24.6% | HardH | Solve→ |
Partition Array for Maximum Sum 24.6% | MediumM | Solve→ |
Defanging an IP Address 24.6% | EasyE | Solve→ |
Critical Connections in a Network 24.6% | HardH | Solve→ |
Count Number of Nice Subarrays 24.6% | MediumM | Solve→ |
Find the Smallest Divisor Given a Threshold 24.6% | MediumM | Solve→ |
Check If N and Its Double Exist 24.6% | EasyE | Solve→ |
Number of Subsequences That Satisfy the Given Sum Condition 24.6% | MediumM | Solve→ |
Find a Peak Element II 24.6% | MediumM | Solve→ |
House Robber IV 24.6% | MediumM | Solve→ |
Score of a String 24.6% | EasyE | Solve→ |
Array Prototype Last 24.6% | EasyE | Solve→ |
Game Play Analysis IV 24.6% | MediumM | Solve→ |
Smallest Range Covering Elements from K Lists 24.6% | HardH | Solve→ |
Maximum Width Ramp 24.6% | MediumM | Solve→ |
Minimum Limit of Balls in a Bag 24.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Defuse the Bomb 24.6% | EasyE | Solve→ |
Two Sum IV - Input is a BST 24.6% | EasyE | Solve→ |
Check if All Characters Have Equal Number of Occurrences 24.6% | EasyE | Solve→ |
Best Sightseeing Pair 24.6% | MediumM | Solve→ |
Primary Department for Each Employee 24.6% | EasyE | Solve→ |
Longest Strictly Increasing or Strictly Decreasing Subarray 24.6% | EasyE | Solve→ |
Valid Number 24.6% | HardH | Solve→ |
User Activity for the Past 30 Days I 24.6% | EasyE | Solve→ |
Detect Capital 24.6% | EasyE | Solve→ |
Count Symmetric Integers 24.6% | EasyE | Solve→ |
All Nodes Distance K in Binary Tree 24.6% | MediumM | Solve→ |
Rabbits in Forest 24.6% | MediumM | Solve→ |
Longest Palindromic Subsequence 24.6% | MediumM | Solve→ |
Angle Between Hands of a Clock 24.6% | MediumM | Solve→ |
Kth Smallest Product of Two Sorted Arrays 24.6% | HardH | Solve→ |
Maximum Number of Events That Can Be Attended 24.6% | MediumM | Solve→ |
Valid Word 24.6% | EasyE | Solve→ |
Find Winner on a Tic Tac Toe Game 24.6% | EasyE | Solve→ |
Trips and Users 24.6% | HardH | Solve→ |
Subtree of Another Tree 24.6% | EasyE | Solve→ |
Largest Triangle Area 24.6% | EasyE | Solve→ |
Next Greater Numerically Balanced Number 24.6% | MediumM | Solve→ |
Bus Routes 24.6% | HardH | Solve→ |
Last Stone Weight 24.6% | EasyE | Solve→ |
Baseball Game 24.6% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Longest Increasing Subsequence 24.6% | MediumM | Solve→ |
Sum of Root To Leaf Binary Numbers 24.6% | EasyE | Solve→ |
Furthest Point From Origin 24.6% | EasyE | Solve→ |
Unique Binary Search Trees II 21.4% | MediumM | Solve→ |
Convert Sorted Array to Binary Search Tree 21.4% | EasyE | Solve→ |
Binary Tree Preorder Traversal 21.4% | EasyE | Solve→ |
Max Points on a Line 21.4% | HardH | Solve→ |
Binary Search Tree Iterator 21.4% | MediumM | Solve→ |
Number of 1 Bits 21.4% | EasyE | Solve→ |
Design Add and Search Words Data Structure 21.4% | MediumM | Solve→ |
Count Complete Tree Nodes 21.4% | MediumM | Solve→ |
Ugly Number II 21.4% | MediumM | Solve→ |
Range Sum Query 2D - Mutable 21.4% | MediumM | Solve→ |
Counting Bits 21.4% | EasyE | Solve→ |
Convert a Number to Hexadecimal 21.4% | EasyE | Solve→ |
Minimum Number of Arrows to Burst Balloons 21.4% | MediumM | Solve→ |
Repeated Substring Pattern 21.4% | EasyE | Solve→ |
IPO 21.4% | HardH | Solve→ |
Relative Ranks 21.4% | EasyE | Solve→ |
Minimum Time Difference 21.4% | MediumM | Solve→ |
Array Partition 21.4% | EasyE | Solve→ |
Triangle Judgement 21.4% | EasyE | Solve→ |
Not Boring Movies 21.4% | EasyE | Solve→ |
Network Delay Time 21.4% | MediumM | Solve→ |
Car Fleet 21.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Stone Game 21.4% | MediumM | Solve→ |
Snakes and Ladders 21.4% | MediumM | Solve→ |
Number of Enclaves 21.4% | MediumM | Solve→ |
Reverse Substrings Between Each Pair of Parentheses 21.4% | MediumM | Solve→ |
Count Negative Numbers in a Sorted Matrix 21.4% | EasyE | Solve→ |
Max Number of K-Sum Pairs 21.4% | MediumM | Solve→ |
Find the Highest Altitude 21.4% | EasyE | Solve→ |
Delete the Middle Node of a Linked List 21.4% | MediumM | Solve→ |
Find the Maximum Achievable Number 21.4% | EasyE | Solve→ |
Create a DataFrame from List 21.4% | EasyE | Solve→ |
Find N Unique Integers Sum up to Zero 21.4% | EasyE | Solve→ |
Guess the Word 21.4% | HardH | Solve→ |
Movie Rating 21.4% | MediumM | Solve→ |
Most Stones Removed with Same Row or Column 21.4% | MediumM | Solve→ |
Add to Array-Form of Integer 21.4% | EasyE | Solve→ |
Customers Who Bought All Products 21.4% | MediumM | Solve→ |
Invalid Tweets 21.4% | EasyE | Solve→ |
Find Closest Number to Zero 21.4% | EasyE | Solve→ |
Maximum Points You Can Obtain from Cards 21.4% | MediumM | Solve→ |
Car Pooling 21.4% | MediumM | Solve→ |
Design a Todo List 21.4% | MediumM | Solve→ |
Couples Holding Hands 21.4% | HardH | Solve→ |
Count the Number of Fair Pairs 21.4% | MediumM | Solve→ |
Shortest Subarray to be Removed to Make Array Sorted 21.4% | MediumM | Solve→ |
Expression Add Operators 21.4% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count the Number of Arrays with K Matching Adjacent Elements 21.4% | HardH | Solve→ |
Filter Elements from Array 21.4% | EasyE | Solve→ |
Unique Length-3 Palindromic Subsequences 21.4% | MediumM | Solve→ |
Minimum Cost For Tickets 21.4% | MediumM | Solve→ |
Maximum Score Words Formed by Letters 21.4% | HardH | Solve→ |
Clear Digits 21.4% | EasyE | Solve→ |
Next Greater Node In Linked List 21.4% | MediumM | Solve→ |
Find the Punishment Number of an Integer 21.4% | MediumM | Solve→ |
The k-th Lexicographical String of All Happy Strings of Length n 21.4% | MediumM | Solve→ |
Maximum Number of Vowels in a Substring of Given Length 21.4% | MediumM | Solve→ |
Backspace String Compare 21.4% | EasyE | Solve→ |
Maximum Candies Allocated to K Children 21.4% | MediumM | Solve→ |
Minimum Cost to Move Chips to The Same Position 21.4% | EasyE | Solve→ |
Longest Nice Subarray 21.4% | MediumM | Solve→ |
Minimum Number of Refueling Stops 21.4% | HardH | Solve→ |
Find Root of N-Ary Tree 21.4% | MediumM | Solve→ |
Count the Hidden Sequences 21.4% | MediumM | Solve→ |
Find the K-th Character in String Game I 21.4% | EasyE | Solve→ |
Type of Triangle 21.4% | EasyE | Solve→ |
Find Greatest Common Divisor of Array 21.4% | EasyE | Solve→ |
Zero Array Transformation I 21.4% | MediumM | Solve→ |
Path With Minimum Effort 21.4% | MediumM | Solve→ |
Find All K-Distant Indices in an Array 21.4% | EasyE | Solve→ |
Longest Binary Subsequence Less Than or Equal to K 21.4% | MediumM | Solve→ |
Find Subsequence of Length K With the Largest Sum 21.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
K Closest Points to Origin 21.4% | MediumM | Solve→ |
Investments in 2016 21.4% | MediumM | Solve→ |
Consecutive Characters 21.4% | EasyE | Solve→ |
Maximum XOR of Two Numbers in an Array 21.4% | MediumM | Solve→ |
Bitwise ORs of Subarrays 21.4% | MediumM | Solve→ |
Ways to Express an Integer as Sum of Powers 21.4% | MediumM | Solve→ |
New 21 Game 21.4% | MediumM | Solve→ |
Robot Return to Origin 21.4% | EasyE | Solve→ |
Count Submatrices With All Ones 21.4% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Cooldown 21.4% | MediumM | Solve→ |
Find the Minimum Area to Cover All Ones I 21.4% | MediumM | Solve→ |
Number of People Aware of a Secret 21.4% | MediumM | Solve→ |
Count Elements With Maximum Frequency 21.4% | EasyE | Solve→ |
Minimum Time Visiting All Points 21.4% | EasyE | Solve→ |
Rank Teams by Votes 21.4% | MediumM | Solve→ |
Longest Balanced Subarray I 21.4% | MediumM | Solve→ |
Delete Nodes From Linked List Present in Array 21.4% | MediumM | Solve→ |
Divide an Array Into Subarrays With Minimum Cost I 21.4% | EasyE | Solve→ |
Rotate Function 21.4% | MediumM | Solve→ |
Using a Robot to Print the Lexicographically Smallest String 21.4% | MediumM | Solve→ |
Find the Lexicographically Smallest Valid Sequence 21.4% | MediumM | Solve→ |
Gray Code 17.7% | MediumM | Solve→ |
Pascal's Triangle II 17.7% | EasyE | Solve→ |
Word Search II 17.7% | HardH | Solve→ |
Integer to English Words 17.7% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Range Sum Query 2D - Immutable 17.7% | MediumM | Solve→ |
Burst Balloons 17.7% | HardH | Solve→ |
Integer Break 17.7% | MediumM | Solve→ |
Design Twitter 17.7% | MediumM | Solve→ |
All O`one Data Structure 17.7% | HardH | Solve→ |
Minimum Genetic Mutation 17.7% | MediumM | Solve→ |
Predict the Winner 17.7% | MediumM | Solve→ |
Find Bottom Left Tree Value 17.7% | MediumM | Solve→ |
Brick Wall 17.7% | MediumM | Solve→ |
Sales Person 17.7% | EasyE | Solve→ |
Maximum Length of Repeated Subarray 17.7% | MediumM | Solve→ |
Delete and Earn 17.7% | MediumM | Solve→ |
Find Smallest Letter Greater Than Target 17.7% | EasyE | Solve→ |
Partition Labels 17.7% | MediumM | Solve→ |
Search in a Binary Search Tree 17.7% | EasyE | Solve→ |
Kth Largest Element in a Stream 17.7% | EasyE | Solve→ |
K-th Symbol in Grammar 17.7% | MediumM | Solve→ |
Design Circular Queue 17.7% | MediumM | Solve→ |
Hand of Straights 17.7% | MediumM | Solve→ |
Find the Town Judge 17.7% | EasyE | Solve→ |
Find Common Characters 17.7% | EasyE | Solve→ |
Construct Binary Search Tree from Preorder Traversal 17.7% | MediumM | Solve→ |
Longest String Chain 17.7% | MediumM | Solve→ |
Project Employees I 17.7% | EasyE | Solve→ |
N-th Tribonacci Number 17.7% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Users With Valid E-Mails 17.7% | EasyE | Solve→ |
Minimum Cost to Cut a Stick 17.7% | HardH | Solve→ |
Special Array With X Elements Greater Than or Equal X 17.7% | EasyE | Solve→ |
Richest Customer Wealth 17.7% | EasyE | Solve→ |
Maximum Twin Sum of a Linked List 17.7% | MediumM | Solve→ |
Amount of Time for Binary Tree to Be Infected 17.7% | MediumM | Solve→ |
Left and Right Sum Differences 17.7% | EasyE | Solve→ |
To Be Or Not To Be 17.7% | EasyE | Solve→ |
Return Length of Arguments Passed 17.7% | EasyE | Solve→ |
Employees Whose Manager Left the Company 17.7% | EasyE | Solve→ |
Strange Printer 17.7% | HardH | Solve→ |
Trapping Rain Water II 17.7% | HardH | Solve→ |
Longest Harmonious Subsequence 17.7% | EasyE | Solve→ |
Search Suggestions System 17.7% | MediumM | Solve→ |
Number of Ways to Arrive at Destination 17.7% | MediumM | Solve→ |
Create Maximum Number 17.7% | HardH | Solve→ |
Maximum Product of Two Elements in an Array 17.7% | EasyE | Solve→ |
Minimum Total Distance Traveled 17.7% | HardH | Solve→ |
Combination Sum III 17.7% | MediumM | Solve→ |
DI String Match 17.7% | EasyE | Solve→ |
Reverse Bits 17.7% | EasyE | Solve→ |
Add Strings 17.7% | EasyE | Solve→ |
Open the Lock 17.7% | MediumM | Solve→ |
Excel Sheet Column Number 17.7% | EasyE | Solve→ |
Maximum Subarray Sum With Length Divisible by K 17.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Continuous Subarrays 17.7% | MediumM | Solve→ |
Game of Life 17.7% | MediumM | Solve→ |
Max Chunks To Make Sorted 17.7% | MediumM | Solve→ |
Product Sales Analysis I 17.7% | EasyE | Solve→ |
Random Pick with Weight 17.7% | MediumM | Solve→ |
Minimum Number of Operations to Move All Balls to Each Box 17.7% | MediumM | Solve→ |
String Matching in an Array 17.7% | EasyE | Solve→ |
Restore IP Addresses 17.7% | MediumM | Solve→ |
Remove Zero Sum Consecutive Nodes from Linked List 17.7% | MediumM | Solve→ |
Tuple with Same Product 17.7% | MediumM | Solve→ |
Max Sum of a Pair With Equal Sum of Digits 17.7% | MediumM | Solve→ |
Minimum Height Trees 17.7% | MediumM | Solve→ |
Count Salary Categories 17.7% | MediumM | Solve→ |
Distribute Candies 17.7% | EasyE | Solve→ |
Maximum Absolute Sum of Any Subarray 17.7% | MediumM | Solve→ |
Check if Number is a Sum of Powers of Three 17.7% | MediumM | Solve→ |
Zero Array Transformation II 17.7% | MediumM | Solve→ |
Divide Array Into Equal Pairs 17.7% | EasyE | Solve→ |
Maximum Population Year 17.7% | EasyE | Solve→ |
Check if Grid can be Cut into Sections 17.7% | MediumM | Solve→ |
Maximum Value of an Ordered Triplet II 17.7% | MediumM | Solve→ |
Minimum Number of Operations to Make Elements in Array Distinct 17.7% | EasyE | Solve→ |
Maximum Sum Circular Subarray 17.7% | MediumM | Solve→ |
Count Subarrays Where Max Element Appears at Least K Times 17.7% | MediumM | Solve→ |
Push Dominoes 17.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Domino and Tromino Tiling 17.7% | MediumM | Solve→ |
Zero Array Transformation III 17.7% | MediumM | Solve→ |
Count the Number of Consistent Strings 17.7% | EasyE | Solve→ |
Biggest Single Number 17.7% | EasyE | Solve→ |
Make The String Great 17.7% | EasyE | Solve→ |
Apply Operations to an Array 17.7% | EasyE | Solve→ |
Row With Maximum Ones 17.7% | EasyE | Solve→ |
Maximum Manhattan Distance After K Changes 17.7% | MediumM | Solve→ |
Number of Matching Subsequences 17.7% | MediumM | Solve→ |
Taking Maximum Energy From the Mystic Dungeon 17.7% | MediumM | Solve→ |
Maximum Number of Events That Can Be Attended II 17.7% | HardH | Solve→ |
Binary Tree Cameras 17.7% | HardH | Solve→ |
Find the Maximum Length of Valid Subsequence II 17.7% | MediumM | Solve→ |
Successful Pairs of Spells and Potions 17.7% | MediumM | Solve→ |
Count Hills and Valleys in an Array 17.7% | EasyE | Solve→ |
Smallest Subarrays With Maximum Bitwise OR 17.7% | MediumM | Solve→ |
Largest 3-Same-Digit Number in String 17.7% | EasyE | Solve→ |
Shortest Distance to a Character 17.7% | EasyE | Solve→ |
Power of Four 17.7% | EasyE | Solve→ |
Sum of Mutated Array Closest to Target 17.7% | MediumM | Solve→ |
Number of Operations to Make Network Connected 17.7% | MediumM | Solve→ |
Hamming Distance 17.7% | EasyE | Solve→ |
Minimum Operations to Make the Integer Zero 17.7% | MediumM | Solve→ |
Vowel Spellchecker 17.7% | MediumM | Solve→ |
Design Task Manager 17.7% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Contains Duplicate III 17.7% | HardH | Solve→ |
Binary Watch 17.7% | EasyE | Solve→ |
Find the Minimum Amount of Time to Brew Potions 17.7% | MediumM | Solve→ |
Minimum Operations to Convert All Elements to Zero 17.7% | MediumM | Solve→ |
Ones and Zeroes 17.7% | MediumM | Solve→ |
Count Special Triplets 17.7% | MediumM | Solve→ |
Minimum Score of a Path Between Two Cities 17.7% | MediumM | Solve→ |
Magic Squares In Grid 17.7% | MediumM | Solve→ |
Number of Ways to Paint N × 3 Grid 17.7% | HardH | Solve→ |
Four Divisors 17.7% | MediumM | Solve→ |
Find the Length of the Longest Common Prefix 17.7% | MediumM | Solve→ |
Design Linked List 17.7% | MediumM | Solve→ |
Minimum Pair Removal to Sort Array I 17.7% | EasyE | Solve→ |
K-diff Pairs in an Array 17.7% | MediumM | Solve→ |
Minimum Swaps to Arrange a Binary Grid 17.7% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 17.7% | HardH | Solve→ |
Jump Game VII 17.7% | MediumM | Solve→ |
Total Waviness of Numbers in Range II 17.7% | HardH | Solve→ |
Create Binary Tree From Descriptions 17.7% | MediumM | Solve→ |
Maximum Building Height 17.7% | HardH | Solve→ |
Sequential Digits 17.7% | MediumM | Solve→ |
Smallest Palindromic Rearrangement I 17.7% | MediumM | Solve→ |
Minimum Number of Pushes to Type Word I 17.7% | EasyE | Solve→ |
Stone Game IV 17.7% | HardH | Solve→ |
Unique Binary Search Trees 13.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Construct Binary Tree from Inorder and Postorder Traversal 13.4% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 13.4% | MediumM | Solve→ |
Palindrome Partitioning II 13.4% | HardH | Solve→ |
Binary Tree Paths 13.4% | EasyE | Solve→ |
Range Sum Query - Mutable 13.4% | MediumM | Solve→ |
Kth Smallest Element in a Sorted Matrix 13.4% | MediumM | Solve→ |
Sum of Left Leaves 13.4% | EasyE | Solve→ |
Path Sum III 13.4% | MediumM | Solve→ |
LFU Cache 13.4% | HardH | Solve→ |
2 Keys Keyboard 13.4% | MediumM | Solve→ |
Find Duplicate Subtrees 13.4% | MediumM | Solve→ |
Is Graph Bipartite? 13.4% | MediumM | Solve→ |
Custom Sort String 13.4% | MediumM | Solve→ |
Design HashSet 13.4% | EasyE | Solve→ |
Spiral Matrix III 13.4% | MediumM | Solve→ |
Fair Candy Swap 13.4% | EasyE | Solve→ |
Minimum Falling Path Sum 13.4% | MediumM | Solve→ |
Knight Dialer 13.4% | MediumM | Solve→ |
Reveal Cards In Increasing Order 13.4% | MediumM | Solve→ |
Unique Paths III 13.4% | HardH | Solve→ |
Interval List Intersections 13.4% | MediumM | Solve→ |
Duplicate Zeros 13.4% | EasyE | Solve→ |
Game Play Analysis I 13.4% | EasyE | Solve→ |
Relative Sort Array 13.4% | EasyE | Solve→ |
Balance a Binary Search Tree 13.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Three Consecutive Odds 13.4% | EasyE | Solve→ |
Minimum Deletions to Make String Balanced 13.4% | MediumM | Solve→ |
Percentage of Users Attended a Contest 13.4% | EasyE | Solve→ |
Maximum Score From Removing Substrings 13.4% | MediumM | Solve→ |
Time Needed to Buy Tickets 13.4% | EasyE | Solve→ |
Kth Largest Sum in a Binary Tree 13.4% | MediumM | Solve→ |
Find Common Elements Between Two Arrays 13.4% | EasyE | Solve→ |
Final Value of Variable After Performing Operations 13.4% | EasyE | Solve→ |
Fix Names in a Table 13.4% | EasyE | Solve→ |
Repeated String Match 13.4% | MediumM | Solve→ |
Find K-th Smallest Pair Distance 13.4% | HardH | Solve→ |
Maximal Square 13.4% | MediumM | Solve→ |
Sum of Subarray Ranges 13.4% | MediumM | Solve→ |
Meeting Rooms 13.4% | EasyE | Solve→ |
N-ary Tree Postorder Traversal 13.4% | EasyE | Solve→ |
Find the Power of K-Size Subarrays I 13.4% | MediumM | Solve→ |
Longest Subarray With Maximum Bitwise AND 13.4% | MediumM | Solve→ |
Find the Longest Substring Containing Vowels in Even Counts 13.4% | MediumM | Solve→ |
My Calendar I 13.4% | MediumM | Solve→ |
Make Sum Divisible by P 13.4% | MediumM | Solve→ |
Count Servers that Communicate 13.4% | MediumM | Solve→ |
Find K Pairs with Smallest Sums 13.4% | MediumM | Solve→ |
Longest Happy String 13.4% | MediumM | Solve→ |
Find Kth Bit in Nth Binary String 13.4% | MediumM | Solve→ |
Parsing A Boolean Expression 13.4% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Moving Average from Data Stream 13.4% | EasyE | Solve→ |
Final Prices With a Special Discount in a Shop 13.4% | EasyE | Solve→ |
Minimum Number of Removals to Make Mountain Array 13.4% | HardH | Solve→ |
Minimum Index Sum of Two Lists 13.4% | EasyE | Solve→ |
Count Good Triplets 13.4% | EasyE | Solve→ |
Minimum Array End 13.4% | MediumM | Solve→ |
Find a Safe Walk Through a Grid 13.4% | MediumM | Solve→ |
Degree of an Array 13.4% | EasyE | Solve→ |
Delete Characters to Make Fancy String 13.4% | EasyE | Solve→ |
Nim Game 13.4% | EasyE | Solve→ |
Smallest Even Multiple 13.4% | EasyE | Solve→ |
Count Vowel Substrings of a String 13.4% | EasyE | Solve→ |
Find Score of an Array After Marking All Elements 13.4% | MediumM | Solve→ |
Maximum Average Pass Ratio 13.4% | MediumM | Solve→ |
Make Array Elements Equal to Zero 13.4% | EasyE | Solve→ |
Count Beautiful Splits in an Array 13.4% | MediumM | Solve→ |
Find Center of Star Graph 13.4% | EasyE | Solve→ |
Maximum Sum of 3 Non-Overlapping Subarrays 13.4% | HardH | Solve→ |
Count Prefix and Suffix Pairs I 13.4% | EasyE | Solve→ |
Counting Words With a Given Prefix 13.4% | EasyE | Solve→ |
Swap Sex of Employees 13.4% | EasyE | Solve→ |
Check if a Parentheses String Can Be Valid 13.4% | MediumM | Solve→ |
Find the Prefix Common Array of Two Arrays 13.4% | MediumM | Solve→ |
Merge Two Binary Trees 13.4% | EasyE | Solve→ |
Shortest Path in a Grid with Obstacles Elimination 13.4% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shortest Distance from All Buildings 13.4% | HardH | Solve→ |
Shortest Unsorted Continuous Subarray 13.4% | MediumM | Solve→ |
Find the Number of Distinct Colors Among the Balls 13.4% | MediumM | Solve→ |
Construct Quad Tree 13.4% | MediumM | Solve→ |
Longest Nice Substring 13.4% | EasyE | Solve→ |
Product of the Last K Numbers 13.4% | MediumM | Solve→ |
Recover a Tree From Preorder Traversal 13.4% | HardH | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 13.4% | MediumM | Solve→ |
Length of Longest Fibonacci Subsequence 13.4% | MediumM | Solve→ |
Count Total Number of Colored Cells 13.4% | MediumM | Solve→ |
Closest Prime Numbers in Range 13.4% | MediumM | Solve→ |
Walls and Gates 13.4% | MediumM | Solve→ |
Alternating Groups II 13.4% | MediumM | Solve→ |
Count of Substrings Containing Every Vowel and K Consonants II 13.4% | MediumM | Solve→ |
Pacific Atlantic Water Flow 13.4% | MediumM | Solve→ |
Separate Squares I 13.4% | MediumM | Solve→ |
Lowest Common Ancestor of Deepest Leaves 13.4% | MediumM | Solve→ |
Minimum Operations to Make Array Values Equal to K 13.4% | EasyE | Solve→ |
Count Largest Group 13.4% | EasyE | Solve→ |
Flipping an Image 13.4% | EasyE | Solve→ |
Most Frequent Even Element 13.4% | EasyE | Solve→ |
Remove Methods From Project 13.4% | MediumM | Solve→ |
Find Minimum Time to Reach Last Room I 13.4% | MediumM | Solve→ |
Dungeon Game 13.4% | HardH | Solve→ |
Furthest Building You Can Reach 13.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Painting a Grid With Three Different Colors 13.4% | HardH | Solve→ |
Divisible and Non-divisible Sums Difference 13.4% | EasyE | Solve→ |
Longest Palindrome by Concatenating Two Letter Words 13.4% | MediumM | Solve→ |
Insert into a Binary Search Tree 13.4% | MediumM | Solve→ |
Shortest Subarray with Sum at Least K 13.4% | HardH | Solve→ |
Reverse Prefix of Word 13.4% | EasyE | Solve→ |
Maximum Difference Between Increasing Elements 13.4% | EasyE | Solve→ |
Max Difference You Can Get From Changing an Integer 13.4% | MediumM | Solve→ |
Divide Array Into Arrays With Max Difference 13.4% | MediumM | Solve→ |
Divide a String Into Groups of Size k 13.4% | EasyE | Solve→ |
Minimum Deletions to Make String K-Special 13.4% | MediumM | Solve→ |
Nearest Exit from Entrance in Maze 13.4% | MediumM | Solve→ |
Find the Original Typed String I 13.4% | EasyE | Solve→ |
Height Checker 13.4% | EasyE | Solve→ |
Find the Middle Index in Array 13.4% | EasyE | Solve→ |
Find the K-th Character in String Game II 13.4% | HardH | Solve→ |
Special Array I 13.4% | EasyE | Solve→ |
Find Lucky Integer in an Array 13.4% | EasyE | Solve→ |
Finding Pairs With a Certain Sum 13.4% | MediumM | Solve→ |
Reschedule Meetings for Maximum Free Time II 13.4% | MediumM | Solve→ |
Longest Continuous Increasing Subsequence 13.4% | EasyE | Solve→ |
Calculate Amount Paid in Taxes 13.4% | EasyE | Solve→ |
Maximum Erasure Value 13.4% | MediumM | Solve→ |
Minimum Penalty for a Shop 13.4% | MediumM | Solve→ |
Maximum Unique Subarray Sum After Deletion 13.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Market Analysis I 13.4% | MediumM | Solve→ |
Verifying an Alien Dictionary 13.4% | EasyE | Solve→ |
Fruits Into Baskets III 13.4% | MediumM | Solve→ |
Find the Maximum Number of Fruits Collected 13.4% | HardH | Solve→ |
Range Product Queries of Powers 13.4% | MediumM | Solve→ |
Max Sum of Rectangle No Larger Than K 13.4% | HardH | Solve→ |
Maximum 69 Number 13.4% | EasyE | Solve→ |
24 Game 13.4% | HardH | Solve→ |
Longest Subarray of 1's After Deleting One Element 13.4% | MediumM | Solve→ |
Number of Steps to Reduce a Number to Zero 13.4% | EasyE | Solve→ |
Minimum Operations to Make Array Elements Zero 13.4% | HardH | Solve→ |
Maximum Repeating Substring 13.4% | EasyE | Solve→ |
Reverse Nodes in Even Length Groups 13.4% | MediumM | Solve→ |
Largest Perimeter Triangle 13.4% | EasyE | Solve→ |
Maximum Palindromes After Operations 13.4% | MediumM | Solve→ |
Super Egg Drop 13.4% | HardH | Solve→ |
Maximum Tastiness of Candy Basket 13.4% | MediumM | Solve→ |
Avoid Flood in The City 13.4% | MediumM | Solve→ |
Remove K-Balanced Substrings 13.4% | MediumM | Solve→ |
Find the Distance Value Between Two Arrays 13.4% | EasyE | Solve→ |
Longest Balanced Substring I 13.4% | MediumM | Solve→ |
Simple Bank System 13.4% | MediumM | Solve→ |
Range Sum of BST 13.4% | EasyE | Solve→ |
Maximum Frequency Stack 13.4% | HardH | Solve→ |
Find X-Sum of All K-Long Subarrays I 13.4% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Substring with At Least K Repeating Characters 13.4% | MediumM | Solve→ |
Determine if Two Strings Are Close 13.4% | MediumM | Solve→ |
Number of Distinct Islands 13.4% | MediumM | Solve→ |
The Skyline Problem 13.4% | HardH | Solve→ |
Reshape Data: Melt 13.4% | EasyE | Solve→ |
Map of Highest Peak 13.4% | MediumM | Solve→ |
Soup Servings 13.4% | MediumM | Solve→ |
Combination Sum IV 13.4% | MediumM | Solve→ |
Maximum Matrix Sum 13.4% | MediumM | Solve→ |
Online Election 13.4% | MediumM | Solve→ |
Wiggle Sort II 13.4% | MediumM | Solve→ |
Maximum Product of Splitted Binary Tree 13.4% | MediumM | Solve→ |
Smallest Subtree with all the Deepest Nodes 13.4% | MediumM | Solve→ |
Long Pressed Name 13.4% | EasyE | Solve→ |
Maximum Square Area by Removing Fences From a Field 13.4% | MediumM | Solve→ |
Find Missing Elements 13.4% | EasyE | Solve→ |
Find the Largest Area of Square Inside Two Rectangles 13.4% | MediumM | Solve→ |
N-Repeated Element in Size 2N Array 13.4% | EasyE | Solve→ |
Take K of Each Character From Left and Right 13.4% | MediumM | Solve→ |
Exclusive Time of Functions 13.4% | MediumM | Solve→ |
Subtract the Product and Sum of Digits of an Integer 13.4% | EasyE | Solve→ |
House Robber III 13.4% | MediumM | Solve→ |
Find Words That Can Be Formed by Characters 13.4% | EasyE | Solve→ |
Longest Balanced Substring II 13.4% | MediumM | Solve→ |
Champagne Tower 13.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Special Binary String 13.4% | HardH | Solve→ |
Concatenation of Consecutive Binary Numbers 13.4% | MediumM | Solve→ |
Binary Tree Level Order Traversal II 13.4% | MediumM | Solve→ |
Largest Submatrix With Rearrangements 13.4% | MediumM | Solve→ |
Alien Dictionary 13.4% | HardH | Solve→ |
Maximum Amount of Money Robot Can Earn 13.4% | MediumM | Solve→ |
Closest Equal Element Queries 13.4% | MediumM | Solve→ |
Mirror Distance of an Integer 13.4% | EasyE | Solve→ |
Beautiful Array 13.4% | MediumM | Solve→ |
Two Furthest Houses With Different Colors 13.4% | EasyE | Solve→ |
Words Within Two Edits of Dictionary 13.4% | MediumM | Solve→ |
Frog Jump 13.4% | HardH | Solve→ |
Minimum Operations to Reduce an Integer to 0 13.4% | MediumM | Solve→ |
Guess Number Higher or Lower II 13.4% | MediumM | Solve→ |
Valid Mountain Array 13.4% | EasyE | Solve→ |
Total Cost to Hire K Workers 13.4% | MediumM | Solve→ |
Nth Digit 13.4% | MediumM | Solve→ |
Minimum Cost of Buying Candies With Discount 13.4% | EasyE | Solve→ |
Bulls and Cows 13.4% | MediumM | Solve→ |
Earliest Finish Time for Land and Water Rides I 13.4% | EasyE | Solve→ |
Get Equal Substrings Within Budget 13.4% | MediumM | Solve→ |
Number of Ways to Assign Edge Weights II 13.4% | HardH | Solve→ |
Process String with Special Operations I 13.4% | MediumM | Solve→ |
Number of ZigZag Arrays II 13.4% | HardH | Solve→ |
Find the Maximum Number of Elements in Subset 13.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Paths with Max Score 13.4% | HardH | Solve→ |
Remove Covered Intervals 13.4% | MediumM | Solve→ |
Path Existence Queries in a Graph I 13.4% | MediumM | Solve→ |
Find the Number of Subsequences With Equal GCD 13.4% | HardH | Solve→ |
Smallest Subsequence of Distinct Characters 13.4% | MediumM | Solve→ |
Shift 2D Grid 13.4% | EasyE | Solve→ |
Maximum Product of Two Digits 13.4% | EasyE | Solve→ |
Smallest Divisible Digit Product I 13.4% | EasyE | Solve→ |
Smallest Missing Integer Greater Than Sequential Prefix Sum 13.4% | EasyE | Solve→ |
Maximum Length Substring With Two Occurrences 13.4% | EasyE | Solve→ |
Spiral Matrix II 8.2% | MediumM | Solve→ |
Maximum Gap 8.2% | MediumM | Solve→ |
Bulb Switcher 8.2% | MediumM | Solve→ |
Find Right Interval 8.2% | MediumM | Solve→ |
Find Mode in Binary Search Tree 8.2% | EasyE | Solve→ |
Out of Boundary Paths 8.2% | MediumM | Solve→ |
Score of Parentheses 8.2% | MediumM | Solve→ |
Distribute Coins in Binary Tree 8.2% | MediumM | Solve→ |
Longest Arithmetic Subsequence 8.2% | MediumM | Solve→ |
Flower Planting With No Adjacent 8.2% | MediumM | Solve→ |
Longest Duplicate Substring 8.2% | HardH | Solve→ |
Minimum Falling Path Sum II 8.2% | HardH | Solve→ |
Stone Game II 8.2% | MediumM | Solve→ |
Find Resultant Array After Removing Anagrams 8.2% | EasyE | Solve→ |
Group the People Given the Group Size They Belong To 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Water Bottles 8.2% | EasyE | Solve→ |
Patients With a Condition 8.2% | EasyE | Solve→ |
Minimum Time to Make Rope Colorful 8.2% | MediumM | Solve→ |
Sum of All Subset XOR Totals 8.2% | EasyE | Solve→ |
Minimum Number of Operations to Make Array Continuous 8.2% | HardH | Solve→ |
Count Numbers with Unique Digits 8.2% | MediumM | Solve→ |
Most Frequent Subtree Sum 8.2% | MediumM | Solve→ |
Create Target Array in the Given Order 8.2% | EasyE | Solve→ |
Maximum Total Damage With Spell Casting 8.2% | MediumM | Solve→ |
Range Sum of Sorted Subarray Sums 8.2% | MediumM | Solve→ |
Split Linked List in Parts 8.2% | MediumM | Solve→ |
Minimized Maximum of Products Distributed to Any Store 8.2% | MediumM | Solve→ |
Final Array State After K Multiplication Operations I 8.2% | EasyE | Solve→ |
Sum of Digits of String After Convert 8.2% | EasyE | Solve→ |
Linked List in Binary Tree 8.2% | MediumM | Solve→ |
Minimum Bit Flips to Convert Number 8.2% | EasyE | Solve→ |
Sentence Similarity III 8.2% | MediumM | Solve→ |
The Number of the Smallest Unoccupied Chair 8.2% | MediumM | Solve→ |
Divide Intervals Into Minimum Number of Groups 8.2% | MediumM | Solve→ |
Sort By 8.2% | EasyE | Solve→ |
Find Minimum Operations to Make All Elements Divisible by Three 8.2% | EasyE | Solve→ |
Minimum Number of Changes to Make Binary String Beautiful 8.2% | MediumM | Solve→ |
Maximum XOR for Each Query 8.2% | MediumM | Solve→ |
Maximum Sum BST in Binary Tree 8.2% | HardH | Solve→ |
Flip Columns For Maximum Number of Equal Rows 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Special Array II 8.2% | MediumM | Solve→ |
Number of Visible People in a Queue 8.2% | HardH | Solve→ |
Check if Array is Good 8.2% | EasyE | Solve→ |
Number of Ways to Split Array 8.2% | MediumM | Solve→ |
Word Subsets 8.2% | MediumM | Solve→ |
Construct K Palindrome Strings 8.2% | MediumM | Solve→ |
Maximum Distance in Arrays 8.2% | MediumM | Solve→ |
Grid Game 8.2% | MediumM | Solve→ |
Paint House IV 8.2% | MediumM | Solve→ |
Largest Local Values in a Matrix 8.2% | EasyE | Solve→ |
Convert Binary Number in a Linked List to Integer 8.2% | EasyE | Solve→ |
Shortest Path in a Hidden Grid 8.2% | MediumM | Solve→ |
Sort the People 8.2% | EasyE | Solve→ |
Count Pairs Whose Sum is Less than Target 8.2% | EasyE | Solve→ |
Find Unique Binary String 8.2% | MediumM | Solve→ |
Reach a Number 8.2% | MediumM | Solve→ |
Decrypt String from Alphabet to Integer Mapping 8.2% | EasyE | Solve→ |
Maximum Subsequence Score 8.2% | MediumM | Solve→ |
Beautiful Arrangement II 8.2% | MediumM | Solve→ |
Last Stone Weight II 8.2% | MediumM | Solve→ |
Find the Minimum and Maximum Number of Nodes Between Critical Points 8.2% | MediumM | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 8.2% | MediumM | Solve→ |
Find All Possible Recipes from Given Supplies 8.2% | MediumM | Solve→ |
Maximum Units on a Truck 8.2% | EasyE | Solve→ |
Shifting Letters 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Sales Analysis III 8.2% | EasyE | Solve→ |
Grumpy Bookstore Owner 8.2% | MediumM | Solve→ |
Largest Number At Least Twice of Others 8.2% | EasyE | Solve→ |
Solving Questions With Brainpower 8.2% | MediumM | Solve→ |
Count Good Triplets in an Array 8.2% | HardH | Solve→ |
Count Equal and Divisible Pairs in an Array 8.2% | EasyE | Solve→ |
Adding Spaces to a String 8.2% | MediumM | Solve→ |
Equal Row and Column Pairs 8.2% | MediumM | Solve→ |
Count of Interesting Subarrays 8.2% | MediumM | Solve→ |
Minimum Number Game 8.2% | EasyE | Solve→ |
Remove Digit From Number to Maximize Result 8.2% | EasyE | Solve→ |
Merge Two 2D Arrays by Summing Values 8.2% | EasyE | Solve→ |
Move Pieces to Obtain a String 8.2% | MediumM | Solve→ |
Number of Equivalent Domino Pairs 8.2% | EasyE | Solve→ |
Maximum Number of Tasks You Can Assign 8.2% | HardH | Solve→ |
Find Maximum Number of Non Intersecting Substrings 8.2% | MediumM | Solve→ |
Maximum Sum of Edge Values in a Graph 8.2% | HardH | Solve→ |
Minimum Moves to Clean the Classroom 8.2% | MediumM | Solve→ |
Clumsy Factorial 8.2% | MediumM | Solve→ |
Maximum Candies You Can Get from Boxes 8.2% | HardH | Solve→ |
Find the Lexicographically Largest String From the Box I 8.2% | MediumM | Solve→ |
Number of Sub-arrays With Odd Sum 8.2% | MediumM | Solve→ |
Minimum Operations to Make the Array Alternating 8.2% | MediumM | Solve→ |
Lexicographically Minimum String After Removing Stars 8.2% | MediumM | Solve→ |
Maximum Difference Between Even and Odd Frequency II 8.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Difference Between Adjacent Elements in a Circular Array 8.2% | EasyE | Solve→ |
Find Closest Node to Given Two Nodes 8.2% | MediumM | Solve→ |
Generate Tag for Video Caption 8.2% | EasyE | Solve→ |
Longest Happy Prefix 8.2% | HardH | Solve→ |
Sum of k-Mirror Numbers 8.2% | HardH | Solve→ |
Insert Greatest Common Divisors in Linked List 8.2% | MediumM | Solve→ |
Scramble String 8.2% | HardH | Solve→ |
Largest Number After Digit Swaps by Parity 8.2% | EasyE | Solve→ |
Find the Original Typed String II 8.2% | HardH | Solve→ |
Find Followers Count 8.2% | EasyE | Solve→ |
Student Attendance Record I 8.2% | EasyE | Solve→ |
Reschedule Meetings for Maximum Free Time I 8.2% | MediumM | Solve→ |
Partition Array Into Three Parts With Equal Sum 8.2% | EasyE | Solve→ |
Calculator with Method Chaining 8.2% | EasyE | Solve→ |
The Earliest and Latest Rounds Where Players Compete 8.2% | HardH | Solve→ |
Orderly Queue 8.2% | HardH | Solve→ |
Minimum Difference in Sums After Removal of Elements 8.2% | HardH | Solve→ |
Memoize 8.2% | MediumM | Solve→ |
Check if Two Chessboard Squares Have the Same Color 8.2% | EasyE | Solve→ |
Add Two Promises 8.2% | EasyE | Solve→ |
Maximize Subarrays After Removing One Conflicting Pair 8.2% | HardH | Solve→ |
Count Number of Maximum Bitwise-OR Subsets 8.2% | MediumM | Solve→ |
Minimum Cuts to Divide a Circle 8.2% | EasyE | Solve→ |
Sum of Unique Elements 8.2% | EasyE | Solve→ |
Smallest String With Swaps 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rearranging Fruits 8.2% | HardH | Solve→ |
Broken Calculator 8.2% | MediumM | Solve→ |
The Number of Beautiful Subsets 8.2% | MediumM | Solve→ |
Difference Between Element Sum and Digit Sum of an Array 8.2% | EasyE | Solve→ |
The Maze 8.2% | MediumM | Solve→ |
Number of Distinct Substrings in a String 8.2% | MediumM | Solve→ |
Pass the Pillow 8.2% | EasyE | Solve→ |
Minimum Interval to Include Each Query 8.2% | HardH | Solve→ |
Bitwise AND of Numbers Range 8.2% | MediumM | Solve→ |
Sort Items by Groups Respecting Dependencies 8.2% | HardH | Solve→ |
Letter Case Permutation 8.2% | MediumM | Solve→ |
Alice and Bob Playing Flower Game 8.2% | MediumM | Solve→ |
Generate Binary Strings Without Adjacent Zeros 8.2% | MediumM | Solve→ |
Find Closest Person 8.2% | EasyE | Solve→ |
Choose K Elements With Maximum Sum 8.2% | MediumM | Solve→ |
A Number After a Double Reversal 8.2% | EasyE | Solve→ |
Minimum Number of People to Teach 8.2% | MediumM | Solve→ |
Beautiful Arrangement 8.2% | MediumM | Solve→ |
Maximum Number of Points From Grid Queries 8.2% | HardH | Solve→ |
Find the Winning Player in Coin Game 8.2% | EasyE | Solve→ |
Lexicographically Smallest Equivalent String 8.2% | MediumM | Solve→ |
Find Subarrays With Equal Sum 8.2% | EasyE | Solve→ |
Fraction to Recurring Decimal 8.2% | MediumM | Solve→ |
Minimum Common Value 8.2% | EasyE | Solve→ |
Make Two Arrays Equal by Reversing Subarrays 8.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Number of Bad Pairs 8.2% | MediumM | Solve→ |
Dota2 Senate 8.2% | MediumM | Solve→ |
Adjacent Increasing Subarrays Detection I 8.2% | EasyE | Solve→ |
Maximum Number of Distinct Elements After Operations 8.2% | MediumM | Solve→ |
K Radius Subarray Averages 8.2% | MediumM | Solve→ |
Robot Bounded In Circle 8.2% | MediumM | Solve→ |
Minimum Moves to Reach Target in Grid 8.2% | HardH | Solve→ |
Largest Positive Integer That Exists With Its Negative 8.2% | EasyE | Solve→ |
Generate Fibonacci Sequence 8.2% | EasyE | Solve→ |
Find X-Sum of All K-Long Subarrays II 8.2% | HardH | Solve→ |
Number of Ways to Form a Target String Given a Dictionary 8.2% | HardH | Solve→ |
Minimum One Bit Operations to Make Integers Zero 8.2% | HardH | Solve→ |
Tiling a Rectangle with the Fewest Squares 8.2% | HardH | Solve→ |
Design Tic-Tac-Toe 8.2% | MediumM | Solve→ |
Delete Duplicate Folders in System 8.2% | HardH | Solve→ |
Max Chunks To Make Sorted II 8.2% | HardH | Solve→ |
Count the Number of Substrings With Dominant Ones 8.2% | MediumM | Solve→ |
Check If All 1's Are at Least Length K Places Away 8.2% | EasyE | Solve→ |
1-bit and 2-bit Characters 8.2% | EasyE | Solve→ |
Add One Row to Tree 8.2% | MediumM | Solve→ |
Keep Multiplying Found Values by Two 8.2% | EasyE | Solve→ |
Decoded String at Index 8.2% | MediumM | Solve→ |
Find Beautiful Indices in the Given Array I 8.2% | MediumM | Solve→ |
Smallest Integer Divisible by K 8.2% | MediumM | Solve→ |
Maximum Running Time of N Computers 8.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Employee Free Time 8.2% | HardH | Solve→ |
Count Partitions with Even Sum Difference 8.2% | EasyE | Solve→ |
Closest Binary Search Tree Value 8.2% | EasyE | Solve→ |
Tree Node 8.2% | MediumM | Solve→ |
Student Attendance Record II 8.2% | HardH | Solve→ |
Cinema Seat Allocation 8.2% | MediumM | Solve→ |
Put Marbles in Bags 8.2% | HardH | Solve→ |
Count Number of Trapezoids I 8.2% | MediumM | Solve→ |
Count Mentions Per User 8.2% | MediumM | Solve→ |
Number of Ways to Divide a Long Corridor 8.2% | HardH | Solve→ |
Design Spreadsheet 8.2% | MediumM | Solve→ |
Maximum Frequency of an Element After Performing Operations II 8.2% | HardH | Solve→ |
Count Square Sum Triples 8.2% | EasyE | Solve→ |
Minimum Moves to Balance Circular Array 8.2% | MediumM | Solve→ |
Delete Columns to Make Sorted II 8.2% | MediumM | Solve→ |
Check if All A's Appears Before All B's 8.2% | EasyE | Solve→ |
Circular Array Loop 8.2% | MediumM | Solve→ |
Number of Good Paths 8.2% | HardH | Solve→ |
Apple Redistribution into Boxes 8.2% | EasyE | Solve→ |
Analyze Subscription Conversion 8.2% | MediumM | Solve→ |
Meeting Rooms III 8.2% | HardH | Solve→ |
Find Minimum Cost to Remove Array Elements 8.2% | MediumM | Solve→ |
Mini Parser 8.2% | MediumM | Solve→ |
Numbers With Same Consecutive Differences 8.2% | MediumM | Solve→ |
Max Dot Product of Two Subsequences 8.2% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Arithmetic Slices II - Subsequence 8.2% | HardH | Solve→ |
Total Hamming Distance 8.2% | MediumM | Solve→ |
Number of Perfect Pairs 8.2% | MediumM | Solve→ |
Construct the Minimum Bitwise Array I 8.2% | EasyE | Solve→ |
Root Equals Sum of Children 8.2% | EasyE | Solve→ |
Minimum Cost Path with Edge Reversals 8.2% | MediumM | Solve→ |
Minimize String Length 8.2% | EasyE | Solve→ |
Rectangle Area 8.2% | MediumM | Solve→ |
Maximum Difference Between Node and Ancestor 8.2% | MediumM | Solve→ |
Find And Replace in String 8.2% | MediumM | Solve→ |
Binary Gap 8.2% | EasyE | Solve→ |
Trionic Array II 8.2% | HardH | Solve→ |
GCD of Odd and Even Sums 8.2% | EasyE | Solve→ |
Self Crossing 8.2% | HardH | Solve→ |
Replace Non-Coprime Numbers in Array 8.2% | HardH | Solve→ |
Linked List Components 8.2% | MediumM | Solve→ |
The Dining Philosophers 8.2% | MediumM | Solve→ |
Sort Array By Parity II 8.2% | EasyE | Solve→ |
Max Consecutive Ones II 8.2% | MediumM | Solve→ |
Partition to K Equal Sum Subsets 8.2% | MediumM | Solve→ |
Construct the Lexicographically Largest Valid Sequence 8.2% | MediumM | Solve→ |
Tenth Line 8.2% | EasyE | Solve→ |
Remove Invalid Parentheses 8.2% | HardH | Solve→ |
Select Data 8.2% | EasyE | Solve→ |
Check Digitorial Permutation 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Changes To Make Alternating Binary String 8.2% | EasyE | Solve→ |
Swap Adjacent in LR String 8.2% | MediumM | Solve→ |
Find the Number of Ways to Place People I 8.2% | MediumM | Solve→ |
The K Weakest Rows in a Matrix 8.2% | EasyE | Solve→ |
Fancy Sequence 8.2% | HardH | Solve→ |
Maximum Frequency of an Element After Performing Operations I 8.2% | MediumM | Solve→ |
Maximum Frequency After Subarray Operation 8.2% | MediumM | Solve→ |
Daily Leads and Partners 8.2% | EasyE | Solve→ |
Construct Product Matrix 8.2% | MediumM | Solve→ |
Equal Sum Grid Partition I 8.2% | MediumM | Solve→ |
Count Unguarded Cells in the Grid 8.2% | MediumM | Solve→ |
Human Traffic of Stadium 8.2% | HardH | Solve→ |
Maximal Score After Applying K Operations 8.2% | MediumM | Solve→ |
Find the Largest Almost Missing Integer 8.2% | EasyE | Solve→ |
Smallest Number in Infinite Set 8.2% | MediumM | Solve→ |
Merge In Between Linked Lists 8.2% | MediumM | Solve→ |
Shortest Common Supersequence 8.2% | HardH | Solve→ |
Minimum Distance to the Target Element 8.2% | EasyE | Solve→ |
Classes With at Least 5 Students 8.2% | EasyE | Solve→ |
Maximize the Distance Between Points on a Square 8.2% | HardH | Solve→ |
Insertion Sort List 8.2% | MediumM | Solve→ |
Greatest Sum Divisible by Three 8.2% | MediumM | Solve→ |
Substrings of Size Three with Distinct Characters 8.2% | EasyE | Solve→ |
Jump Game IX 8.2% | MediumM | Solve→ |
Minimize Hamming Distance After Swap Operations 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Build an Array With Stack Operations 8.2% | MediumM | Solve→ |
Swapping Nodes in a Linked List 8.2% | MediumM | Solve→ |
Design Snake Game 8.2% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements 8.2% | MediumM | Solve→ |
Design Bounded Blocking Queue 8.2% | MediumM | Solve→ |
Three Divisors 8.2% | EasyE | Solve→ |
Flatten Nested List Iterator 8.2% | MediumM | Solve→ |
Number of Boomerangs 8.2% | MediumM | Solve→ |
Check If Array Pairs Are Divisible by k 8.2% | MediumM | Solve→ |
Number of Unique Subjects Taught by Each Teacher 8.2% | EasyE | Solve→ |
Range Addition II 8.2% | EasyE | Solve→ |
Minimum Number of Coins to be Added 8.2% | MediumM | Solve→ |
Minimum Jumps to Reach Home 8.2% | MediumM | Solve→ |
Reverse Words in a String III 8.2% | EasyE | Solve→ |
Weighted Word Mapping 8.2% | EasyE | Solve→ |
Stock Price Fluctuation 8.2% | MediumM | Solve→ |
Maximum Ice Cream Bars 8.2% | MediumM | Solve→ |
Maximum Number of Balloons 8.2% | EasyE | Solve→ |
Minimum Swaps To Make Sequences Increasing 8.2% | HardH | Solve→ |
Number of ZigZag Arrays I 8.2% | HardH | Solve→ |
Count the Number of Inversions 8.2% | HardH | Solve→ |
Word Frequency 8.2% | MediumM | Solve→ |
Employee Importance 8.2% | MediumM | Solve→ |
Count Square Submatrices with All Ones 8.2% | MediumM | Solve→ |
Transpose File 8.2% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Count Subarrays With Majority Element I 8.2% | MediumM | Solve→ |
Maximum Score of a Good Subarray 8.2% | HardH | Solve→ |
Find the Sequence of Strings Appeared on the Screen 8.2% | MediumM | Solve→ |
Number of Strings That Appear as Substrings in Word 8.2% | EasyE | Solve→ |
Naming a Company 8.2% | HardH | Solve→ |
Maximum Element After Decreasing and Rearranging 8.2% | MediumM | Solve→ |
Base 7 8.2% | EasyE | Solve→ |
Count Ways To Build Good Strings 8.2% | MediumM | Solve→ |
Find the Safest Path in a Grid 8.2% | MediumM | Solve→ |
Shortest Impossible Sequence of Rolls 8.2% | HardH | Solve→ |
Minimum Number of Pushes to Type Word II 8.2% | MediumM | Solve→ |
Network Recovery Pathways 8.2% | HardH | Solve→ |
Most Popular Video Creator 8.2% | MediumM | Solve→ |
Unique 3-Digit Even Numbers 8.2% | EasyE | Solve→ |
Concatenate Non-Zero Digits and Multiply by Sum II 8.2% | MediumM | Solve→ |
Path Existence Queries in a Graph II 8.2% | HardH | Solve→ |
Kth Ancestor of a Tree Node 8.2% | HardH | Solve→ |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold 8.2% | MediumM | Solve→ |
Sorted GCD Pair Queries 8.2% | HardH | Solve→ |
The Two Sneaky Numbers of Digitville 8.2% | EasyE | Solve→ |
Sum of Distances in Tree 8.2% | HardH | Solve→ |
Maximum Binary Tree 8.2% | MediumM | Solve→ |
Maximize Active Section with Trade I 8.2% | MediumM | Solve→ |
Maximize Active Section with Trade II 8.2% | HardH | Solve→ |
Leaf-Similar Trees 8.2% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Unique XOR Triplets II 8.2% | MediumM | Solve→ |
Minimum Operations to Make All Array Elements Equal 8.2% | MediumM | Solve→ |
Swim in Rising Water 8.2% | HardH | Solve→ |
Strong Password Checker 8.2% | HardH | Solve→ |
Rearrange Spaces Between Words 8.2% | EasyE | Solve→ |
Maximum Number of Integers to Choose From a Range I 8.2% | MediumM | Solve→ |
K Inverse Pairs Array 8.2% | HardH | Solve→ |
Stone Game III 8.2% | HardH | Solve→ |
Maximize the Minimum Powered City 8.2% | HardH | Solve→ |
Shortest Bridge 8.2% | MediumM | Solve→ |
Minimum Difference Between Highest and Lowest of K Scores 8.2% | EasyE | Solve→ |
Kth Smallest Number in Multiplication Table 8.2% | HardH | Solve→ |
Maximize Distance to Closest Person 8.2% | MediumM | Solve→ |
Find the Difference of Two Arrays 8.2% | EasyE | Solve→ |
Sum of GCD of Formed Pairs 8.2% | MediumM | Solve→ |
Optimal Account Balancing 8.2% | HardH | Solve→ |
Actors and Directors Who Cooperated At Least Three Times 8.2% | EasyE | Solve→ |
Detect Squares 8.2% | MediumM | Solve→ |
Maximum Matching of Players With Trainers 8.2% | MediumM | Solve→ |
Length of Longest Subarray With at Most K Frequency 8.2% | MediumM | Solve→ |
Jump Game VI 8.2% | MediumM | Solve→ |
Longest Substring of One Repeating Character 8.2% | HardH | Solve→ |
Longest Subsequence With Non-Zero Bitwise XOR 8.2% | 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 Bloomberg?
Our current Bloomberg practice dataset contains 1223 tagged coding problems, including Two Sum, Merge Intervals, Add Two Numbers. The difficulty breakdown is 399 Easy, 650 Medium, and 174 Hard problems.
How should I prepare for a Bloomberg coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Bloomberg interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Bloomberg coding interviews?
Based on our data, Bloomberg interviews include 399 Easy (33%), 650 Medium (53%), and 174 Hard (14%) problems.
Ready to ace your Bloomberg interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required