Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 334. Increasing Triplet Subsequence | Medium | ||
| 412. Fizz Buzz | Easy | ||
| 1087. Brace Expansion | Medium | ||
| 137. Single Number II | Medium | ||
| 253. Meeting Rooms II | Medium | ||
| 67. Add Binary | Easy | ||
| 3. Longest Substring Without Repeating Characters | Medium | ||
| 1101. The Earliest Moment When Everyone Become Friends | Medium | ||
| 121. Best Time to Buy and Sell Stock | Easy | ||
| 495. Teemo Attacking | Easy | ||
| π | 754. Reach a Number | Binary Search | Medium |
| π | 933. Number of Recent Calls | Basic DSA | Easy |
| π | 20. Valid Parentheses | Basic DSA | Easy |
| π | 692. Top K Frequent Words | Adv. Data StructureBasic DSA | Medium |
| π | 1135. Connecting Cities With Minimum Cost | Adv. Data StructureGraph | Medium |
| π | 9. Palindrome Number | Basic DSA | Easy |
| π | 1296. Divide Array in Sets of K Consecutive Numbers | Misc.Basic DSA | Medium |
| π | 1081. Smallest Subsequence of Distinct Characters | Misc. | Medium |
| π | 1723. Find Minimum Time to Finish All Jobs | Dynamic ProgrammingBacktracking | Hard |
| π | 1012. Numbers With Repeated Digits | Dynamic Programming | Hard |
| π | 636. Exclusive Time of Functions | Basic DSA | Medium |
| π | 2964. Number of Divisible Triplet Sums | Basic DSA | Medium |
| π | 1529. Minimum Suffix Flips | Misc. | Medium |
| π | 1492. The kth Factor of n | Basic DSA | Medium |
| π | 2491. Divide Players Into Teams of Equal Skill | Two PointersBasic DSA | Medium |
| π | 1200. Minimum Absolute Difference | Basic DSA | Easy |
| π | 2904. Shortest and Lexicographically Smallest Beautiful String | Two Pointers | Medium |
| π | 2598. Smallest Missing Non-negative Integer After Operations | Misc. | Medium |
| π | 1. Two Sum | Basic DSA | Easy |
| π | 12. Integer to Roman | Basic DSA | Medium |
| π | 2571. Minimum Operations to Reduce an Integer to 0 | Misc.Dynamic Programming | Medium |
| π | 2432. The Employee That Worked on the Longest Task | Basic DSA | Easy |
| π | 13. Roman to Integer | Basic DSA | Easy |
| π | 1208. Get Equal Substrings Within Budget | Binary SearchTwo Pointers | Medium |
| π | 88. Merge Sorted Array | Two PointersBasic DSA | Easy |
| π | 14. Longest Common Prefix | Adv. Data Structure | Easy |
| π | 2. Add Two Numbers | BacktrackingBasic DSA | Medium |
| π | 2433. Find The Original Array of Prefix Xor | Basic DSA | Medium |
| π | 713. Subarray Product Less Than K | Two Pointers | Medium |
| π | 456. 132 Pattern | Binary SearchAdv. Data StructureMisc. | Medium |
| π | 17. Letter Combinations of a Phone Number | Backtracking | Medium |
| π | 41. First Missing Positive | Basic DSA | Hard |
| π | 135. Candy | Misc. | Hard |
| π | 53. Maximum Subarray | Misc.Dynamic Programming | Medium |
| π | 300. Longest Increasing Subsequence | Binary SearchDynamic Programming | Medium |
| π | 389. Find the Difference | Basic DSA | Easy |
| π | 7. Reverse Integer | Basic DSA | Medium |
| π | 287. Find the Duplicate Number | Two PointersBinary Search | Medium |
| π | 2455. Average Value of Even Numbers That Are Divisible by Three | Basic DSA | Easy |
| π | 2545. Sort the Students by Their Kth Score | Basic DSA | Medium |
| π | 2562. Find the Array Concatenation Value | Two PointersSimulation | Easy |
| π | 2907. Maximum Profitable Triplets With Increasing Prices I | Adv. Data Structure | Medium |
| π | 2921. Maximum Profitable Triplets With Increasing Prices II | Adv. Data Structure | Hard |
| π | 3024. Type of Triangle | Basic DSA | Easy |
| π | 3096. Minimum Levels to Gain More Points | Two Pointers | Medium |
| π | 3147. Taking Maximum Energy From the Mystic Dungeon | Two Pointers | Medium |
| π | 3107. Minimum Operations to Make Median of Array Equal to K | Misc.Basic DSA | Medium |
| π | 3145. Find Products of Elements of Big Array | Binary Search | Hard |
| π | 3159. Find Occurrences of an Element in an Array | Basic DSA | Medium |
Sign up for free to track your progress, then upgrade to Pro for all 59 questions with detailed solutions.
Sign Up FreeIBM's recruitment process begins with an initial resume screening, aimed at evaluating the applicantβs background and technical expertise relevant to the role. Following this, candidates might be required to complete Online Assessments (OAs) focusing on coding and problem-solving skills. These are key hurdles before progressing to further stages.
After successful completion of the OAs, IBM typically conducts one or two phone screens. These interviews are largely technical with some behavioral questions to gauge a candidate's fit within the company culture. The process culminates with onsite interviews, which are more intensive, involving multiple rounds with team members and managers. The difficulty throughout is considered moderate to challenging, depending on the specific position and technical requirements.
At IBM, the initial screening begins with a detailed review of the candidate's resume, focusing on relevant skills and experiences tailored to the position's requirements. Approximately 75% of applications are filtered out at this stage.
Qualified candidates then proceed to online assessments (OAs) which test technical skills and problem-solving abilities. This step is crucial and typically filters down the candidate pool by another 50%.
At IBM, the interview process typically begins with one or two phone screenings. These initial calls are designed to assess the applicant's basic technical skills and compatibility with IBM's corporate culture.
During these phone screens, candidates might be asked to discuss their previous projects, technical experiences, and problem-solving skills. This step is crucial for determining whether the applicant progresses to the more in-depth technical interviews.
During IBM's onsite interviews, candidates typically face three to four rounds, focusing on a mix of behavioral and technical questions. These are structured to assess problem-solving abilities, coding skills, and cultural fit within the IBM ethos.
Each onsite segment usually includes a coding challenge, a system design problem, and a behavioral interview. This structured diversification helps IBM evaluate a candidateβs comprehensive skill set from logical thinking to interpersonal dynamics.
After concluding the interview stages at IBM, candidates may undergo meetings with senior executives, offer negotiations, and discussions for team alignment based on skills and project needs. This finalizes their placement within the company.
Preparing for a software engineering interview at IBM involves a strategic focus on Two Pointers and Basic DSA, and mostly consists of classical and straightfoward problems that require thorough communication during the interview. Candidates should also pay attention to the relatively high occurrence of miscellaneous problems such as Greedy and Stack/Queue problems, but these are usually found in the easy-medium difficulty level. IBM doesn't change their question bank very often and they are more approachable, making IBM interviews slightly easier than those at tech giants like Google or Apple.
Describe a time when you had to learn a new programming language or technology to complete a project.
Tell me about a project where you had to collaborate with multiple teams. How did you ensure its success?
Can you provide an example of a challenging problem you solved in your previous role?
Describe a time when you had to collaborate closely with a team under tight deadlines. What approaches did you use to manage the workload and communicate effectively?
Can you share an experience where you had to work on a project that required innovative thinking within a team setting?
IBM focuses on integrating AI into many of its products. Can you discuss a time when you had to collaborate on a team to integrate new technology into an existing system?
Describe a time when you had to adapt your software design due to changing client requirements. How did you manage the situation and what was the outcome?
Tell me about a project where you implemented a solution that significantly improved business performance. What was your role and the impact of your solution?
IBM is known for innovation and technology leadership. Can you discuss a personal or professional project where you utilized IBM technologies or methodologies? How did it contribute to the project's success?