IBM coding interview questions
Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.
| Progress | Title | Difficulty | Next step |
|---|---|---|---|
| Fizz BuzzSimulation | Easy | Solve | |
| Merge IntervalsBasics | Medium | Solve | |
| Integer to RomanGreedy | Medium | Solve | |
| Longest Substring Without Repeating CharactersSliding Window · Variable | Medium | Solve | |
| Best Time to Buy and Sell StockState Machine DP - Stock Problems | Easy | Solve | |
| Two SumTwo Sum | Easy | Solve | |
| Roman to IntegerRight to Left Traversal | Easy | Solve | |
| Valid ParenthesesStack Basics | Easy | Solve | |
| Longest Palindromic SubstringStrings | Medium | Solve | |
| Subarray Sum Equals KPrefix Sum Strategy | Medium | Solve | |
| Group AnagramsHashing | Medium | Solve | |
| Valid AnagramHashing | Easy | Solve | |
| Rotate ImageIn-place Transformations | Medium | Solve | |
| Maximum Units on a TruckGreedy | Easy | Solve | |
| Palindrome NumberMath / Number Theory | Easy | Solve | |
| Longest Common PrefixString Basics | Easy | Solve | |
| Container With Most WaterTwo Pointer | Medium | Solve | |
| 3SumTwo Sum | Medium | Solve | |
| Find Pivot IndexPrefix Sum Strategy | Easy | Solve | |
| Max Consecutive Ones IIISliding Window · Variable | Medium | Solve | |
| Longest Mountain in ArrayTwo Pointer | Medium | Solve | |
| Kadane's Algorithm - SimpleKadane's Algorithm | Medium | Solve | |
| Meeting Rooms IILine Sweep | Medium | Solve | |
| Exclusive Time of FunctionsStack Basics | Medium | Solve | |
| Minimum Window SubstringSliding Window · Hash Map | Hard | Solve | |
| Longest Consecutive SequenceHash Set Lookup | Medium | Solve | |
| LRU CacheLinked Lists | Medium | Solve | |
| Number of IslandsConnected Components | Medium | Solve | |
| Move ZeroesTwo Pointer | Easy | Solve | |
| Letter Combinations of a Phone NumberChoice per Position | Medium | Solve | |
| Sort ColorsDutch National Flag | Medium | Solve | |
| Reverse Linked ListFront Middle Back Pointer | Easy | Solve | |
| Repeated DNA SequencesSliding Window · Fixed | Medium | Solve | |
| Single Element in a Sorted ArrayUnique 1-D Binary Search | Medium | Solve | |
| House RobberAlternate Selection / Pick / Not pick | Medium | Solve | |
| String CompressionTwo Pointer | Medium | Solve | |
| Coin ChangeKnapsack | Medium | Solve | |
| Linked List CycleSlow Fast Pointers | Easy | Solve | |
| Rotting OrangesMulti source BFS | Medium | Solve | |
| Sliding Window MaximumMonotonic Stack | Hard | Solve |
No questions match these filters.
Also reported, being added to AlgoRung (8)
Count Ways to Group Overlapping Ranges · Find Occurrences of an Element in an Array · Find The First Player to win K Games in a Row · Minimum Operations to Make Median of Array Equal to K · Minimum Moves to Equal Array Elements · Sort the Students by Their Kth Score · Water Bottles · Minimum Number of Flips to Make the Binary String Alternating
Questions people ask
What coding questions does IBM ask most?
Fizz Buzz, Merge Intervals, Integer to Roman, Longest Substring Without Repeating Characters, Best Time to Buy and Sell Stock, Two Sum, Roman to Integer, Valid Parentheses.
Which topics come up in IBM coding rounds?
arrays, strings, hash maps, intervals, linked list, sliding window.
How hard are IBM coding questions?
Of the reported questions, 13 are easy, 25 medium and 2 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.