IBM LeetCode Interview Questions
Practice 173 coding problems currently tagged to IBM. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
53 Easy
104 Medium
16 Hard
Top Topics at IBM
Ace your IBM interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
IBM Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Fizz Buzz 100% | EasyE | Solve→ |
Merge Intervals 93.8% | MediumM | Solve→ |
Integer to Roman 91.3% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 87.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 86.5% | EasyE | Solve→ |
Two Sum 85.4% | EasyE | Solve→ |
Roman to Integer 82.9% | EasyE | Solve→ |
Valid Parentheses 81.6% | EasyE | Solve→ |
Count Ways to Group Overlapping Ranges 81.6% | MediumM | Solve→ |
Minimum Operations to Make All Array Elements Equal 80.3% | MediumM | Solve→ |
Rotate Image 78.8% | MediumM | Solve→ |
Minimum Moves to Equal Array Elements 75.5% | MediumM | Solve→ |
Longest Palindromic Substring 71.7% | MediumM | Solve→ |
Subarray Sum Equals K 71.7% | MediumM | Solve→ |
Find Occurrences of an Element in an Array 69.6% | MediumM | Solve→ |
Count Vowel Strings in Ranges 69.6% | MediumM | Solve→ |
Minimum Operations to Make Columns Strictly Increasing 69.6% | EasyE | Solve→ |
Longest Mountain in Array 69.6% | MediumM | Solve→ |
Find The First Player to win K Games in a Row 67.2% | MediumM | Solve→ |
Sort the Students by Their Kth Score 67.2% | MediumM | Solve→ |
Valid Anagram 67.2% | EasyE | Solve→ |
Group Anagrams 64.5% | MediumM | Solve→ |
Maximum Profitable Triplets With Increasing Prices I 64.5% | MediumM | Solve→ |
Maximum Profitable Triplets With Increasing Prices II 64.5% | HardH | Solve→ |
Number of Divisible Triplet Sums 64.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Type of Triangle 64.5% | EasyE | Solve→ |
Minimum Absolute Difference 64.5% | EasyE | Solve→ |
Minimum Levels to Gain More Points 64.5% | MediumM | Solve→ |
Taking Maximum Energy From the Mystic Dungeon 64.5% | MediumM | Solve→ |
Minimum Operations to Make Median of Array Equal to K 64.5% | MediumM | Solve→ |
Find Products of Elements of Big Array 64.5% | HardH | Solve→ |
Activity Participants 64.5% | MediumM | Solve→ |
Average Value of Even Numbers That Are Divisible by Three 64.5% | EasyE | Solve→ |
Find the Array Concatenation Value 64.5% | EasyE | Solve→ |
Minimum Length of String After Operations 64.5% | MediumM | Solve→ |
Reach a Number 64.5% | MediumM | Solve→ |
Palindrome Number 61.4% | EasyE | Solve→ |
Longest Common Prefix 61.4% | EasyE | Solve→ |
Maximum Units on a Truck 61.4% | EasyE | Solve→ |
Lexicographically Smallest String After Substring Operation 61.4% | MediumM | Solve→ |
Maximum Sum of Distinct Subarrays With Length K 61.4% | MediumM | Solve→ |
Minimum Number of Flips to Make the Binary String Alternating 61.4% | MediumM | Solve→ |
Max Consecutive Ones III 61.4% | MediumM | Solve→ |
Number of Operations to Make Network Connected 57.9% | MediumM | Solve→ |
3Sum 57.9% | MediumM | Solve→ |
Find Pivot Index 57.9% | EasyE | Solve→ |
Container With Most Water 57.9% | MediumM | Solve→ |
Water Bottles 57.9% | EasyE | Solve→ |
Letter Combinations of a Phone Number 53.8% | MediumM | Solve→ |
Maximum Subarray 53.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Meeting Rooms II 53.8% | MediumM | Solve→ |
Spiral Matrix 53.8% | MediumM | Solve→ |
Number of Divisible Substrings 53.8% | MediumM | Solve→ |
Minimum String Length After Removing Substrings 53.8% | EasyE | Solve→ |
Report Spam Message 53.8% | MediumM | Solve→ |
Largest Number After Digit Swaps by Parity 53.8% | EasyE | Solve→ |
Minimum Window Substring 53.8% | HardH | Solve→ |
Find the Smallest Divisor Given a Threshold 53.8% | MediumM | Solve→ |
Minimum Number of Increments on Subarrays to Form a Target Array 53.8% | HardH | Solve→ |
Longest Consecutive Sequence 48.8% | MediumM | Solve→ |
LRU Cache 48.8% | MediumM | Solve→ |
String Compression 48.8% | MediumM | Solve→ |
Exclusive Time of Functions 48.8% | MediumM | Solve→ |
Count Binary Substrings 48.8% | EasyE | Solve→ |
Validate Binary Search Tree 48.8% | MediumM | Solve→ |
Climbing Stairs 48.8% | EasyE | Solve→ |
Count Pairs Of Similar Strings 48.8% | EasyE | Solve→ |
Merge Strings Alternately 48.8% | EasyE | Solve→ |
Height Checker 48.8% | EasyE | Solve→ |
Contains Duplicate 48.8% | EasyE | Solve→ |
Move Zeroes 48.8% | EasyE | Solve→ |
Minimum Cost to Connect Sticks 48.8% | MediumM | Solve→ |
Sliding Window Maximum 48.8% | HardH | Solve→ |
Middle of the Linked List 48.8% | EasyE | Solve→ |
Rotting Oranges 48.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Non-overlapping Intervals 48.8% | MediumM | Solve→ |
Valid Palindrome II 48.8% | EasyE | Solve→ |
Maximum Median Sum of Subsequences of Size 3 48.8% | MediumM | Solve→ |
Boats to Save People 48.8% | MediumM | Solve→ |
Longest Valid Parentheses 48.8% | HardH | Solve→ |
Kth Largest Element in an Array 48.8% | MediumM | Solve→ |
Single-Threaded CPU 42.3% | MediumM | Solve→ |
Backspace String Compare 42.3% | EasyE | Solve→ |
Flipping an Image 42.3% | EasyE | Solve→ |
N-Queens 42.3% | HardH | Solve→ |
Minimum Swaps to Group All 1's Together II 42.3% | MediumM | Solve→ |
Find All Possible Stable Binary Arrays II 42.3% | HardH | Solve→ |
Odd String Difference 42.3% | EasyE | Solve→ |
Divide Intervals Into Minimum Number of Groups 42.3% | MediumM | Solve→ |
Missing Number 42.3% | EasyE | Solve→ |
Minimum Time to Type Word Using Special Typewriter 42.3% | EasyE | Solve→ |
Remove All Occurrences of a Substring 42.3% | MediumM | Solve→ |
Make Lexicographically Smallest Array by Swapping Elements 42.3% | MediumM | Solve→ |
Number of Islands 42.3% | MediumM | Solve→ |
Sort Characters By Frequency 42.3% | MediumM | Solve→ |
Reverse Words in a String 42.3% | MediumM | Solve→ |
Online Stock Span 42.3% | MediumM | Solve→ |
Linked List Cycle 42.3% | EasyE | Solve→ |
Jump Game II 42.3% | MediumM | Solve→ |
Maximum Value at a Given Index in a Bounded Array 42.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Next Permutation 42.3% | MediumM | Solve→ |
Asteroid Collision 42.3% | MediumM | Solve→ |
Coin Change 42.3% | MediumM | Solve→ |
Last Stone Weight 42.3% | EasyE | Solve→ |
Optimal Partition of String 42.3% | MediumM | Solve→ |
Minimum Number of Moves to Make Palindrome 42.3% | HardH | Solve→ |
Sum of Absolute Differences in a Sorted Array 42.3% | MediumM | Solve→ |
First Unique Character in a String 42.3% | EasyE | Solve→ |
Add Two Numbers 42.3% | MediumM | Solve→ |
Generate Parentheses 42.3% | MediumM | Solve→ |
Minimum Changes To Make Alternating Binary String 42.3% | EasyE | Solve→ |
Edit Distance 42.3% | MediumM | Solve→ |
Maximum Product Subarray 42.3% | MediumM | Solve→ |
Median of Two Sorted Arrays 33.4% | HardH | Solve→ |
Merge Sorted Array 33.4% | EasyE | Solve→ |
Majority Element 33.4% | EasyE | Solve→ |
Rotate Array 33.4% | MediumM | Solve→ |
Product of Array Except Self 33.4% | MediumM | Solve→ |
Get Equal Substrings Within Budget 33.4% | MediumM | Solve→ |
The Employee That Worked on the Longest Task 33.4% | EasyE | Solve→ |
Count Number of Teams 33.4% | MediumM | Solve→ |
Smallest Missing Non-negative Integer After Operations 33.4% | MediumM | Solve→ |
Subsets 33.4% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 33.4% | MediumM | Solve→ |
Flip String to Monotone Increasing 33.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rearrange Array to Maximize Prefix Score 33.4% | MediumM | Solve→ |
Removing Stars From a String 33.4% | MediumM | Solve→ |
Course Schedule II 33.4% | MediumM | Solve→ |
Reorganize String 33.4% | MediumM | Solve→ |
Check if Array Is Sorted and Rotated 33.4% | EasyE | Solve→ |
Kth Missing Positive Number 33.4% | EasyE | Solve→ |
Reverse Linked List 33.4% | EasyE | Solve→ |
Minimum Value to Get Positive Step by Step Sum 33.4% | EasyE | Solve→ |
Gray Code 33.4% | MediumM | Solve→ |
Plus One 33.4% | EasyE | Solve→ |
Add Binary 33.4% | EasyE | Solve→ |
Candy 33.4% | HardH | Solve→ |
Search in Rotated Sorted Array 33.4% | MediumM | Solve→ |
Intersection of Two Arrays II 33.4% | EasyE | Solve→ |
Word Search 33.4% | MediumM | Solve→ |
Minimum Number of Swaps to Make the String Balanced 33.4% | MediumM | Solve→ |
Last Substring in Lexicographical Order 33.4% | HardH | Solve→ |
Minimum Add to Make Parentheses Valid 33.4% | MediumM | Solve→ |
Search Insert Position 33.4% | EasyE | Solve→ |
Heaters 33.4% | MediumM | Solve→ |
Grumpy Bookstore Owner 33.4% | MediumM | Solve→ |
Alert Using Same Key-Card Three or More Times in a One Hour Period 33.4% | MediumM | Solve→ |
Min Stack 33.4% | MediumM | Solve→ |
Minimum Bit Flips to Convert Number 33.4% | EasyE | Solve→ |
Simplify Path 33.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Substrings With Only 1s 33.4% | MediumM | Solve→ |
Minimize Maximum Pair Sum in Array 33.4% | MediumM | Solve→ |
Find Resultant Array After Removing Anagrams 33.4% | EasyE | Solve→ |
Trapping Rain Water 33.4% | HardH | Solve→ |
Minimum Insertion Steps to Make a String Palindrome 33.4% | HardH | Solve→ |
Minimize XOR 33.4% | MediumM | Solve→ |
Max Consecutive Ones 33.4% | EasyE | Solve→ |
Koko Eating Bananas 33.4% | MediumM | Solve→ |
Find Product Recommendation Pairs 33.4% | MediumM | Solve→ |
Palindromic Substrings 33.4% | MediumM | Solve→ |
Sum of Two Integers 33.4% | MediumM | Solve→ |
Subarrays with K Different Integers 33.4% | HardH | Solve→ |
Meeting Rooms III 33.4% | HardH | Solve→ |
Sort Colors 33.4% | MediumM | Solve→ |
Frequency of the Most Frequent Element 33.4% | MediumM | Solve→ |
Number of 1 Bits 33.4% | EasyE | Solve→ |
Check if a Parentheses String Can Be Valid 33.4% | MediumM | Solve→ |
Valid Mountain Array 33.4% | EasyE | Solve→ |
Arithmetic Slices 33.4% | MediumM | Solve→ |
Length of the Longest Alphabetical Continuous Substring 33.4% | MediumM | Solve→ |
Combinations 33.4% | MediumM | Solve→ |
Swap Sex of Employees 33.4% | EasyE | Solve→ |
Gas Station 33.4% | 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 IBM?
Our current IBM practice dataset contains 173 tagged coding problems, including Fizz Buzz, Merge Intervals, Integer to Roman. The difficulty breakdown is 53 Easy, 104 Medium, and 16 Hard problems.
How should I prepare for a IBM coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. IBM interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of IBM coding interviews?
Based on our data, IBM interviews include 53 Easy (31%), 104 Medium (60%), and 16 Hard (9%) problems.
Ready to ace your IBM interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required