IBM Software Engineer Interview Questions & Rounds
How the IBM software engineer interview works in India: online coding test, in-person test, technical and PDM rounds, from real candidate experiences.
On this page
How to Crack IBM: The Software Engineer Interview, From Real Experiences
Last updated November 20, 2026 · 26 min read · For interns and new grads (software developer and software engineer roles at IBM's India software labs)
Built by the Codinzhub team. This guide is built from IBM software engineer interview experiences that candidates shared, including posts on Codinzhub. The process changes by year, unit and drive, so treat this as a map, not a promise.
The 30-second version. For IBM's software developer and engineer track in India, most candidates come through a campus drive. It starts with a 1-hour online coding test on HackerRank, usually 2 tasks. In 2026, one of them was sometimes a debugging task on a given codebase. Some drives add a 75-minute in-person test with 3 tasks: pattern printing, a SQL join and an if-else program. Then comes a technical interview of about 30 minutes, mixing a short classic coding problem with OOP, SQL and OS theory. A managerial (PDM) or HR round about your projects, goals and location follows. Results came within a day to a week. The habit that matters most: know every project on your resume well enough to explain its design and your choices.
What this guide is, and what it is not
This guide is built from 15 reports on IBM's software developer and software engineer hiring in India. Eleven are candidate write-ups and 4 are sets of online-assessment questions shared on Codinzhub. They date from 2023 to 2026, though many are undated. Most are campus hiring for interns and new grads at IBM's software labs (ISL and ISDL).
It is:
- A map of the process, stage by stage, as candidates described it
- The question patterns that keep coming back, and the theory questions to expect
- A six-week plan and practice problems matched to those patterns
It is not:
- A list of leaked questions or a promise of what you will be asked
- An official description of IBM's process
- An offer rate. Outcomes in candidate posts are self-reported and are not a statistical sample.
- A guide to the Associate System Engineer route or to experienced hiring, which have different or unreported processes
Important things to know before you start
These facts change how you should prepare for IBM's software developer and engineer track.
The coding tests run on HackerRank, and some drives hold two. Most reports that name a platform for the online test say HackerRank (4 of 7). Three drives then held a second test in person. Two reports put it at 75 minutes, with pattern printing, SQL and if-else tasks. The campus sittings shared on Codinzhub (two dated 2026) paired one DSA (data structures and algorithms) question with a debugging task on a given codebase. One candidate said friends who solved everything were dropped for plagiarism, so write your own code.
Theory is tested alongside code. Across the tests and interviews, SQL came up in 5 of 15 reports, operating systems in 4 and OOP in 4. Linked lists and arrays came up in 6. Coding questions were short classics, and the rest of the round was definitions, queries and your resume. Revise SQL joins, OS basics and OOP with the same care as DSA.
Round-by-round breakdown
Candidates described five stages: application, shortlisting, one or two coding tests, the interviews (a technical round and a managerial, PDM or HR round), and the result.
Stage 1: Application, where candidates applied
Almost all of the data is Indian campus hiring for IBM's software labs. Eight of the nine reports that name a channel came through a campus or college-run drive, and one came through the careers site. Three of the four intern reports describe an internship with a full-time role attached.
| Channel | What candidates said |
|---|---|
| On-campus drive | The most common route: the online test, then interviews on campus or online. Tests shared on Codinzhub came from IIT Roorkee and MNNIT Allahabad (2026), and from NSUT and RNS Institute of Technology (year not shown). |
| Pooled campus drive | One 2025 intern took a proctored online test first. The in-person test and the interview came 4 days later at a host college. |
| Placement-office link | One 2024 candidate registered through a link from the placement officer and got the test link two days later. |
| IBM careers site | One applicant found a Software Developer opening on the careers site. The shortlist email came a few weeks later. |
What helped. Candidates credited a few solid projects on the resume, regular DSA practice and SQL revision.
Stage 2: Shortlisting, how candidates moved forward
For this track, no report describes a recruiter screen, questionnaire or aptitude round before the coding test. The online coding assessment is the first real filter. The steps that do come before it are eligibility and registration.
- Eligibility check (campus drives). One 2025 pooled campus drive was for female candidates only. It was open to B.E. and B.Tech (CSE, IT, ISE, AI and DS, EEE, ECE, EIE), MCA, M.Tech in Data Science and M.E. in Embedded Systems, with 70% in the degree and no standing arrears. No other report gives cut-offs, so check your own drive's notice.
- Profile shortlist (careers site). The one careers-site applicant sent a resume and academic details. A few weeks later, an email from IBM HR said the profile was shortlisted. The coding assessment came next.
The Associate System Engineer route is different. It adds an English test, game-based cognitive tests and a group discussion before the interview. That track is outside this guide.
Stage 3: Online assessment and the in-person coding test
All 8 campus reports that describe the process start with an online coding test. Three reports add a second coding test, taken in person a few days later, before any interview: an ISDL offline drive, a 2025 pooled drive and an intern drive. No report describes a phone screen.
Online coding assessment
How it works. A remote, timed test, on HackerRank in most reports that name a platform (4 of 7). Ten of 13 reports describe 2 tasks: two coding questions in 7, and in three Codinzhub sittings (two dated 2026) one DSA question plus a debugging task on a given codebase. Some tests added multiple-choice questions (MCQs): 25 on CS fundamentals in one ISDL intern test, 15 mostly on OS and Linux in a 2024 test. No report says whether AI tools were allowed.
At a glance
- Length: 1 hour (3 of 3 reports that give a length)
- Questions: 2 tasks in 10 of 13 reports; 3 coding questions in one ISDL drive; 25 MCQs plus 3 DSA problems in one ISDL intern test
- What was asked: easy-to-medium array, string and linked-list problems; greedy, heap and deque questions named by topic only; a bug-fixing task at the Codinzhub sittings
- Most common: a promo-code validation bug-fix task appeared at 2 of the Codinzhub sittings. No problem from the other reports repeats.
Difficulty words ran from "very easy" (2025 campus) to "medium" (intern). One intern reported that failing 1 or 2 test cases still left you in the running. One ISDL candidate warned that friends who solved every question were not shortlisted because of plagiarism.
| Question | What it tests | Level |
|---|---|---|
| Modified stock buy-and-sell profit problem | Array scan for profit | SWE |
| Modified reverse-a-linked-list problem | Pointer manipulation | SWE |
| Convert an IPv4 address to IPv6 format | String parsing and formatting | New grad |
| Length of the last word, with extra spaces and stray characters | String scanning from the end | New grad |
OA questions shared on Codinzhub.
| Question | Drive | Topic |
|---|---|---|
| Return corrected string | IIT Roorkee, 2 November 2026 | Not reported |
| Minimum cost to combine an array | IIT Roorkee, 2 November 2026 | Not reported |
| Show promo code: AI-based bug fixing | IIT Roorkee | Not reported |
| Fix promo-code validation in a ticketing platform repo | MNNIT Allahabad, 23 October 2026; also NSUT | Backend bug fixing |
| Factor sum | MNNIT Allahabad | Not reported |
| Alex's goal | MNNIT Allahabad | Not reported |
| Top K APIs by load | RNS Institute of Technology, 20 September | Not reported |
| Stream of packets to a video player | NSUT | Not reported |
These pages do not state the role, so read them as signals of the recent campus format. See all IBM OA questions in the question bank.
Second coding test, in person
How it works. Shortlisted candidates sat a second test in person, at a test centre or host college (on HackerRank in the ISDL drive). The two intern reports describe the same three tasks: a pattern-printing program, a SQL join and an if-else program. The pooled drive moved candidates who solved at least 2 of 3 to the interview. The other intern found the pattern hard and the timing strict, and did not clear the round.
At a glance
- Length: 75 minutes (2 of 3 reports)
- Questions: 3 (3 of 3 reports)
- What was asked: pattern printing, a SQL join with GROUP BY, an if-else program with type conversion; the earlier ISDL drive had array and subarray problems instead
- Most common: pattern printing, the SQL join and the if-else task (2 reports each)
| Question | What it tests | Level |
|---|---|---|
| Pattern printing (a diamond with a condition in one report) | Nested loops and index arithmetic | Intern |
| SQL query using joins and GROUP BY | Joins and aggregation | Intern |
| If-else logic task with data-type conversion | Conditionals and type conversion | Intern |
| Count subarrays whose sum is exactly K | Prefix sums with a hash map | SWE |
| Sort an array of 0s, 1s and 2s | Three-pointer partitioning | SWE |
Stage 4: The interview loop
The loop is short: a technical interview, then a managerial, PDM (project or people development manager) or HR round. Three reports describe in-person interviews and three describe video interviews; in two of those, candidates coded in an online compiler or shared editor. Three reports mention two interviewers. One careers-site applicant had three virtual rounds (technical, project, behavioral) with two senior developers, then HR.
Technical interview
At a glance
- Length: about 30 minutes (2 of 3 reports that give one); 1 hour 15 minutes in one 2023 intern report
- Questions: 1 to 3 short coding tasks plus CS theory in the detailed reports; no report gives a count
- What was asked: linked lists, OOP and SOLID (five object-oriented design rules), SQL, operating systems and Linux, resume projects, puzzles
- Most common: detecting a cycle in a linked list, explaining OOP concepts and scenario SQL with joins (3 reports each)
Questions followed the resume and stated strengths in 4 of 9 reports; a non-CS candidate got application questions such as what to consider when building a grocery store website. Operating systems questions came up in 4 reports and a puzzle in 3. One panel gave its own test cases for a dry run (trace the code by hand). Another opened by asking for the logic of the candidate's in-person test answer.
| Question | Follow-up | Level |
|---|---|---|
| Detect a cycle in a linked list | Create the linked list node first, in any language | Intern, New grad |
| Explain OOP concepts (inheritance and its types, polymorphism) with examples | Not reported | Intern |
| Write SQL for a given scenario using joins, GROUP BY and aggregates | Not reported | Intern |
| Walk through a resume project: architecture, technologies, scalability, challenges | Not reported | Intern |
| Explain the SOLID principles | Not reported | New grad, Intern |
| Find the second-highest salary in SQL, then optimise it | Optimise the query | SWE |
| Compress a string: 'abbcddeee' becomes 'ab2cd2e3' | Not reported | New grad |
| Implement a stack from scratch, then dry-run the interviewer's test cases | Where stacks are used; how recursion works | Intern |
The bank holds the rest, including House Robber, bit swaps, endianness, IPC (inter-process communication), the C++ v-table (virtual function table) and three puzzles.
Managerial (PDM) and HR round
At a glance
- Length: Not reported
- Questions: Not reported as a count
- Themes: projects, career goals, location, favourite subject, deadlines and teamwork, why IBM; sometimes a puzzle
- Most common: explain your projects (6 of 8 reports)
It came after the technical interview and overlapped with it: one 2025 managerial round mixed a fake-coin puzzle, a URL-shortening question and a database comparison into the project talk. The 2025 pooled drive had no HR round. One candidate passed the technical round and was not selected after the PDM round, with no reason given, so treat it as scored.
Reported questions.
- Explain your projects: the most recent, favourite or most challenging one, then the approach and tech stack
- What are your career goals and future aspirations?
- Location preference and willingness to relocate
- What is your favourite subject, and why? Then which DBMSes you know, then Neo4j vs MySQL and when to use each
- How did you manage deadlines?
- A time you had an issue with a teammate, and how you resolved it
- Learning a new technology in a limited time
- What do you know about IBM, and why IBM ISDL specifically?
- Puzzle: find the lighter fake coin among 12 with the fewest weighings
See all managerial and HR questions in the question bank.
Stage 5: Result and offer
Result. No report describes a hiring committee or team matching for this track. No further step was reported between the last interview and the result. Three reports give the wait: the next day (2025 pooled drive), a few days later as an offer list (2025 campus drive), and one week later (ISDL offline drive). In that ISDL drive, the candidate said very few people were selected. At the pooled drive the whole thing happened in one day: the in-person coding test in the morning and the technical interview in the afternoon.
Placement questions. Two interviewers asked about location preferences before the decision, and one asked which roles the candidate wanted.
Offer. The pooled-drive candidate was selected for an internship plus a full-time role. Compensation, joining dates and team allocation are not reported for this track, so this guide gives no figures.
The Codinzhub Next-Round Playbook
Candidates who moved forward wrote their own code, knew their resume cold, and could explain theory as well as code.
To get past shortlisting
- Read the drive notice for eligibility before you register. One 2025 pooled drive was open only to female candidates, with 70% in the degree and no standing arrears.
To get past the online coding assessment
- Write your own solution. One ISDL candidate saw friends with every question solved dropped for plagiarism.
- Submit partial solutions. One intern reported that failing 1 or 2 test cases still kept candidates in the running.
- At the campus sittings shared on Codinzhub (two dated 2026), candidates met one DSA question and one debugging task on a given codebase. Practise reading a small repo and fixing a validation bug.
To get past the in-person coding test
- Solve 2 of the 3 first. The pooled drive moved candidates with at least 2 solved to the interview.
- Do the if-else and SQL tasks before the pattern. The intern who got stuck on a hard diamond pattern did not clear the round.
- Remember how you solved it. One panel opened the interview by asking for the logic behind the candidate's pattern answer.
To get past the technical interview
- Expect theory between coding questions: OOP and SOLID, SQL, OS and Linux. OS questions came up in 4 reports.
- Be ready to build the data structure from scratch. One interviewer asked for the linked list node before the cycle check, another for a stack.
- Prepare one-line answers for every technology on your resume. A 2025 candidate got "What is RAG?" straight from the resume.
To get past the managerial (PDM) and HR round
- Treat it as scored. One candidate cleared the technical round and was not selected after the PDM round.
- Lead with a project story that covers approach, tech choices and the hardest problem. Project questions came up in 6 of 8 reports.
To get through the result
- Results arrived from the next day to one week after the last round in 3 reports. Location and role questions come up before the decision, so answer them directly.
How the loop differs by level
The shape is much the same for interns and new grads: an online test, sometimes an in-person test, one technical interview, then a managerial or HR round. No report at any level describes a system design round.
| Level | What candidates describe |
|---|---|
| Intern (internship, often with a full-time role) | Based on 4 reports. The online test was 2 coding questions in 1 hour in three of them, and 25 MCQs plus 3 DSA problems (taken twice) in the ISDL one. Two intern drives added the 75-minute in-person test with pattern printing, SQL and an if-else task. The technical round ran from about 30 minutes (2025) to 1 hour 15 minutes (2023), with stack, linked-list, SQL and Java or cloud questions. One intern drive had no HR round. |
| New grad, full time (campus) | Based on 4 reports. The online test had 2 coding questions in each, and one 2024 test added 15 MCQs on OS and Linux. The technical round was in person in 2025 (C++, OOP, SOLID, puzzles, string compression, House Robber) and virtual in 2024 (about 30 minutes on OS, IPC, bits and endianness). A managerial or HR round with projects and situational questions followed. |
| Level not stated | Based on 3 reports. An ISDL drive ran an online test of 3 questions, an offline test of 3 more, a technical round on OS, Linux and SQL, then HR or PDM. A careers-site applicant had a coding test, three virtual rounds with two senior developers, then HR. A full-time software engineer had a technical round (reverse a number, bubble sort, OS, OOP, SQL) and then a managerial round. |
Experienced hiring is not covered: no usable report was found. Associate System Engineer is a separate route with its own tests.
Most-asked topics
Across 15 reports that described a test or a technical round, questions clustered in a few basic topics. SQL and operating systems show up nearly as often as data structures.
| Topic | What it means | Seen in | Reported examples |
|---|---|---|---|
| Linked lists and array basics | Pointer work on lists; scans, counts and sorts on arrays | 6 of 15 reports | Detect a cycle in a linked list; sort an array of 0s, 1s and 2s; count subarrays with sum K |
| SQL queries | Joins, GROUP BY, aggregates and ranking queries | 5 of 15 reports | Second-highest salary, then optimise; SQL with joins and GROUP BY |
| Operating systems and Linux | Processes, threads, IPC, memory, Linux commands, bit-level C questions | 4 of 15 reports | IPC and semaphores; paging vs segmentation; full form of LINUX and basic commands |
| OOP and language theory | OOP pillars, SOLID, C++ object model, Java collections | 4 of 15 reports | Explain the SOLID principles; shallow vs deep copy and the v-table |
| Puzzles | Classic logic puzzles asked aloud | 2 of 15 reports | Rope that burns in 1 hour; 12 coins; fastest 3 horses |
| Short string programs | Parsing and rewriting strings | 2 of 15 reports | IPv4 to IPv6; length of the last word; string compression |
| Pattern printing and if-else programs | Loop and condition programs written exactly to spec | 2 of 15 reports | Diamond star pattern; if-else task with type conversion |
The question patterns that keep coming back
Most IBM questions in the data are textbook problems, some described as "modified" versions. Learn each base problem well enough to adapt it, and expect theory between the coding.
1. Linked lists and array basics
The widest pattern: 6 of 15 reports, across both tests and the technical interview. Pick the technique from what the question asks. Fast and slow pointers find a cycle or a middle. A hash map with a running prefix sum counts "subarrays with sum K". Three pointers sort a fixed set of values. A set or index marking finds duplicates. Cycle detection is the most repeated coding question in the data (3 reports), and one interviewer first asked for the node structure.
Reported examples. Detect a cycle in a linked list; modified reverse-a-linked-list; sort an array of 0s, 1s and 2s; count subarrays whose sum is exactly K; print all duplicates in an array; implement a stack from scratch.
2. SQL queries
SQL appeared in 5 of 15 reports, in the in-person test and as written queries in the interview. If the question needs two tables, start with the join and its key. If it says "per something", use GROUP BY, and filter groups with HAVING, not WHERE. For "Nth highest", use ORDER BY with LIMIT and OFFSET, or a subquery on MAX, and be ready to say which is faster.
Reported examples. SQL query using joins and GROUP BY; scenario SQL with joins, GROUP BY and aggregates; second-highest salary, then optimise it.
3. Operating systems and Linux
Four reports had OS questions. One ISDL candidate said the technical round "mainly concentrated" on OS and Linux basics. Know process vs thread, IPC, semaphores vs mutexes, deadlock, paging vs segmentation, stack vs heap, and basic Linux commands. For the bit tasks, swap two bits by XOR-ing both positions when they differ. Check endianness by reading the first byte of an integer through a char pointer.
Reported examples. IPC, semaphores, process vs thread, interrupts; deadlocks and paging vs segmentation; full form of LINUX and basic commands; swap the MSB and LSB of an integer; detect little- or big-endian.
4. OOP and language theory
Four reports asked OOP or language theory, with SOLID in two. A C++ candidate got copy semantics and the v-table, and another candidate got Java collections and interfaces. Answer with the definition, then a small example from your own code, then the trade-off. For instance, runtime polymorphism needs a virtual function called through a base-class pointer or reference.
Reported examples. Explain OOP concepts with examples; explain the SOLID principles; shallow vs deep copy, the virtual keyword and the v-table.
5. Puzzles
Two reports name 4 puzzles, in technical and managerial rounds. Think out loud and check the edge case before giving a number. For weighing problems, split into thirds. For burning ropes, think about lighting both ends.
Reported examples. Measure 45 minutes with a rope that burns in 1 hour; minimum cuts for 8 equal cake pieces; find the fastest 3 horses; find the lighter fake coin among 12.
6. Short string programs
Two reports had string questions, all about careful parsing. Scan from the end for the last token. Walk two indices over runs of equal characters. For address conversions, split on the separator, then format.
Reported examples. Convert an IPv4 address to IPv6 format; length of the last word, with extra spaces and stray characters; compress 'abbcddeee' to 'ab2cd2e3'.
7. Pattern printing and if-else programs
This pattern belongs to the in-person test. Two intern reports had a pattern program and an if-else program with type conversion, and one panel later asked for the pattern logic. Work out spaces and stars per row on paper first. For if-else tasks, convert the input types before you compare.
Reported examples. Diamond star pattern with a condition; if-else logic task with data-type conversion; explain the logic of your pattern-printing answer.
Preparing for the managerial (PDM) and HR round
This round comes after the technical interview, and most of it is about you and your projects (see Stage 4). It is not just a formality. One candidate cleared the technical round and was not selected after the PDM round.
Build your story bank. Prepare five real stories, each under two minutes, that cover the themes candidates were asked about:
| Theme | Reported prompt (paraphrased) | Follow-up to expect |
|---|---|---|
| Projects | Explain your most recent, favourite or most challenging project | The approach you took; the technologies you used |
| Deadlines | How did you manage deadlines? | How you handled difficult situations |
| Teamwork and conflict | A time you had an issue with a teammate, and how you resolved it | How you work in teams |
| Learning fast | Learning a new technology in a limited time | Whether you are willing to adapt to new technologies |
| Motivation and fit | What do you know about IBM, and why IBM ISDL specifically? | Which roles interest you; your location preference |
Structure each story. Give the situation in one line. Then say what you did, using "I" for your own actions, and the result, with a number if you have one. End with what you would change. Use real experiences only.
Prepare the short answers too. Several prompts are quick checks rather than stories: career goals (4 reports), location preference or relocation (3 reports), and your favourite subject (2 reports). The favourite-subject question can turn technical. One candidate who said DBMS was asked which databases they knew, then when to use Neo4j over MySQL. Pick a subject you can defend in depth. One PDM also asked the difference between AI and generative AI, so have a view on current trends.
A six-week plan
The plan follows the patterns above, most common first, and ends with timed mocks shaped like the real tests. Plan on two focused hours a day.
- Week 1: Linked lists and array basics. Reverse a list, detect a cycle, find duplicates, pair sums, 0-1-2 sorting, subarrays with sum K, and a stack built from scratch. Habit: write every structure (node, stack) yourself, then dry-run it on three inputs including an empty one.
- Week 2: SQL queries. Joins, GROUP BY with HAVING, aggregates, and Nth-highest queries. Habit: write each query twice, two ways, and say which is faster and why.
- Week 3: Operating systems and Linux. Process vs thread, IPC, semaphores and mutexes, deadlock, paging vs segmentation, stack vs heap, basic Linux commands, and the two bit tasks (swap bits, endianness). Habit: answer each topic in two sentences, then add one example.
- Week 4: OOP and language theory. The four pillars, SOLID, and either the C++ object model (copy semantics, virtual functions, v-table) or Java collections and interfaces, whichever is on your resume. Habit: tie every answer to a class from your own project.
- Week 5: Strings, pattern printing, if-else programs and puzzles. String parsing (last word, IPv4 to IPv6, run-length compression), star patterns, type-conversion logic, and the classic puzzles (rope, cake cuts, fake coin, fastest horses). Add one session on fixing a bug in a small unfamiliar repo. Habit: work out the row formula on paper before coding any pattern.
- Week 6: Mocks. Two timed 1-hour HackerRank tests with 2 questions each. One 75-minute test with a pattern, a SQL join and an if-else task. Two 30-minute mock technical interviews that mix one coding task with OS, OOP and SQL theory. Rehearse your project and PDM stories out loud.
Interns should still cover week 3, because the 2023 intern interview included memory and compilation questions.
Only two weeks? Spend 4 days on linked lists and arrays, 2 on SQL, 2 on OS and Linux, 2 on OOP and SOLID, 1 on strings, patterns and puzzles, and 3 on timed tests, a mock interview and your project stories.
Practice problems that match these experiences
These are well-known practice problems that match the patterns above. They are not claims about IBM's question bank unless a row says the problem was asked as-is.
| # | Practice problem | Pattern | Seen in these experiences as |
|---|---|---|---|
| 1 | Linked List Cycle | Fast and slow pointers | Asked in 3 technical interviews (once as "is the list circular?") |
| 2 | Subarray Sum Equals K | Prefix sums with a hash map | Count subarrays with sum exactly K, in-person test |
| 3 | Sort Colors | Three-pointer partitioning | Sort an array of 0s, 1s and 2s, in-person test |
| 4 | Find All Duplicates in an Array | Hashing or index marking | Print all duplicates in an array, ISDL interview |
| 5 | Two Sum - Pair with given Sum | Hashing or two pointers | Asked as-is in one ISDL interview |
| 6 | House Robber | 1D dynamic programming | Asked as-is in one 2025 technical interview |
| 7 | Second Highest Salary | SQL subquery or ordering | Asked as-is in one ISDL interview, then optimised |
| 8 | Combine Two Tables | SQL joins | SQL query with joins and GROUP BY |
| 9 | String Compression | Run-length counting | 'abbcddeee' becomes 'ab2cd2e3', technical interview |
| 10 | How to swap two bits in a given integer? | Bit masks and XOR | Swap the MSB and LSB of an integer, technical interview |
The OOP, puzzle and pattern-printing questions have no verified problem page that matches. Practise those from the question bank and by writing the patterns yourself.
How to handle a question you have never seen
IBM's questions are mostly classics, sometimes "modified" or wrapped in a story (invoice IDs, API loads, video packets). A repeatable method beats memorised code.
- Repeat the problem and one example. In a test, write one small input and its expected output as a comment before coding. In an interview, say it out loud so you and the interviewer agree.
- Say the brute force and its complexity. In the online test, a brute force that passes some test cases still scores; one intern reported that failing 1 or 2 cases did not end their run.
- Name the bottleneck. Repeated lookups suggest a hash map. Repeated range sums suggest prefix sums. Repeatedly picking the largest or smallest item suggests a heap. Two pointers moving in a list suggest a cycle or a middle.
- Say when you are stuck. Saying exactly what you are unsure of keeps a conversational round moving.
- Code in small pieces while talking. On HackerRank, write the helper first, run the sample, then extend. One virtual panel asked the candidate to open any online compiler, so practise writing a full program from an empty file.
- Dry-run one case and fix the wrong line. One interviewer handed over their own test cases to check corner cases, and another asked the candidate to explain earlier test logic. Trace your code on an empty input and a one-element input before you say you are done.
Why candidates were rejected
Rejection evidence is thin. Two reports in the data ended in rejection, and only one names anything close to a reason. Neither had recruiter feedback. Read these as candidate observations, not IBM's criteria.
- Copied code in the online test. One ISDL candidate said friends who solved every online question were not shortlisted because of plagiarism. The candidate's takeaway was that the uniqueness and logic of a solution count for more than the number solved.
- Running out of time in the in-person test. One intern did not clear the 75-minute in-person test. The candidate pointed to a hard pattern question, strict timing and no extra time. Their advice was to finish the questions you know before trying the hard one.
- Not selected after the PDM round, with no reason given. One candidate cleared both coding tests and the OS and SQL technical round, then was not selected after the PDM round. Very few from that drive were picked, and the report gives no reason.
Selected vs. rejected: do this, not that
What repeats across the reports is a short list of habits; the two rejected reports show what skipping some of them cost.
| Do this | Not that | What the reports show |
|---|---|---|
| Write your own code: solve the online test in your own words and structure | Copy a known solution: paste code that matches other submissions | One ISDL candidate said friends who solved every question were dropped for plagiarism. |
| Bank the easy marks: finish the questions you can solve, then attempt the hard one | Sink the clock: spend most of the 75 minutes on one hard pattern | One intern who got stuck on the hard pattern question did not clear the in-person test. The pooled drive moved candidates who solved 2 of 3. |
| Own every resume line: explain architecture, tech choices and challenges for each project | List what you cannot defend: add tools you only touched once | Project questions came up in 6 of 8 managerial and HR reports, and in 3 technical rounds. One 2025 resume item turned into "What is RAG?". |
| Revise SQL and OS basics: joins, GROUP BY, second-highest salary, processes, IPC | Only grind DSA: skip theory because the coding was easy | SQL appeared in 5 of 15 reports and OS in 4. An ISDL candidate advised brushing up OS and Linux. |
| Explain your code: be ready to walk through the logic you wrote earlier | Submit and forget: lose track of how your test answer works | One panel opened by asking for the logic behind the candidate's in-person pattern answer. Another gave test cases to dry-run. |
If you remember only five things
- The process is short. An online coding test, sometimes a second test in person, a technical interview, then a managerial (PDM) or HR round.
- The tests reward finishing. Two tasks in about 1 hour online; 3 tasks in 75 minutes in person, where solving 2 moved candidates on. Partial passes can count, and copied code can sink you.
- The coding is classic. Linked lists, arrays, simple strings, pattern printing and SQL, sometimes in "modified" form.
- Theory sits beside the code. Expect OOP and SOLID, SQL queries, and OS and Linux questions in the technical interview.
- Your resume is the script. Project questions came up in 6 of 8 managerial and HR reports, and resume items became technical questions.
FAQ
Is there always an online assessment?
In the data, yes: all 8 campus reports that describe the process start with one. The one careers-site applicant also started with an online coding test.
Will there be a second coding test?
Sometimes. Three reports describe an in-person test after the online one, 4 days or a couple of days later. Other drives went straight from the online test to interviews.
Do I need dynamic programming?
Learn the basics. It appears once as a named problem (House Robber) and once unnamed. Linked lists, arrays and SQL came up far more often.
Is system design asked?
No report at any level describes a system design round. The closest items were how to shorten a URL in a managerial round and what to consider when building a grocery store website.
How long does it take?
Results came the next day, a few days later, or one week after the last round, in 3 reports. One careers-site applicant waited a few weeks for the shortlist email. No report gives a full end-to-end timeline.
Which language should I use?
No report names a required language. Candidates mentioned C++, Java and Python. Theory questions covered C++ (copy semantics, the v-table) and Java (collections, interfaces), so revise the language you list.
About this guide
The Codinzhub team researched and wrote this guide from 15 IBM software engineer interview reports, dated from 2023 to 2026 where a date was given. They include experiences and online-assessment questions shared on Codinzhub. We kept only what candidates described. The questions are our own short summaries, and the practice links are similar problems unless a row says otherwise. If you interviewed recently, share your experience on Codinzhub and we will update this guide.
Disclaimer. IBM's process changes by unit, drive, year and level. Use this guide to build a foundation, and confirm the current format with your placement office or recruiter.
Search the question bank
The questions from each round above, with practice links for similar problems. Log in to search every question we collected for this role, including questions shared on Codinzhub.
Showing 20 of 97 questions
Return corrected string
A Ibm online assessment question shared on Codinzhub (IIT Roorkee, 2 November 2026).
Minimum cost to combine an array
A Ibm online assessment question shared on Codinzhub (IIT Roorkee, 2 November 2026).
Show promo code: AI-based bug fixing
A Ibm online assessment question shared on Codinzhub (IIT Roorkee).
Fix promo-code validation in a ticketing platform repo
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad, 23 October 2026; also NSUT).
Factor sum
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad).
Alex's goal
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad).
Top K APIs by load
A Ibm online assessment question shared on Codinzhub (RNS Institute of Technology, 20 September).
Stream of packets to a video player
A Ibm online assessment question shared on Codinzhub (NSUT).
11
A Ibm online assessment question shared on Codinzhub (IIT Roorkee OA page titled 'Debug' Not reported Online assessment Not reported 2026 Coding Codinzhub (exact).
12
A Ibm online assessment question shared on Codinzhub (IIT Roorkee OA page Not reported Online assessment Not reported 2026 Coding Codinzhub (exact).
13
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad OA Not reported Online assessment Not reported 2026 Coding Codinzhub (exact).
14
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad OA Not reported Online assessment Not reported 2026 Coding Codinzhub (exact).
15
A Ibm online assessment question shared on Codinzhub (MNNIT Allahabad OA Not reported Online assessment Not reported 2026 Coding Codinzhub (exact).
16
A Ibm online assessment question shared on Codinzhub.
17
A Ibm online assessment question shared on Codinzhub (nitors how often each API is called Not reported Online assessment Not reported Not reported Coding Codinzhub (exact).
18
A Ibm online assessment question shared on Codinzhub (NSUT).
Modified stock buy-and-sell profit problem
Level: SWE.
Modified reverse-a-linked-list problem
Level: SWE.
Convert an IPv4 address to IPv6 format
Level: New grad.
Length of the last word, with extra spaces and stray characters
Level: New grad.
Keep preparing on Codinzhub
- IBM interview questions and experiences — OA questions and interview experiences candidates shared for IBM.
- Browse IBM online assessment questions — filter the Codinzhub question bank by company.
- Amazon Software Engineer interview guide — the Amazon process, rounds and question patterns.
- Google Software Engineer interview guide — the Google process, rounds and question patterns.
- Adobe Software Engineer interview guide — the Adobe process, rounds and question patterns.
- All company interview guides — every guide on the Codinzhub blog.
Keep track of what you’ve learned.