IBM India Software Developer campus loops emphasize easy coding screens, fundamentals technicals, and puzzle-aware managerial rounds. This page synthesizes 2024-2025 campus and pooled patterns into round tables, outcome notes, and prep traps.
Round-wise process at a glance
Round
Typical format
What clears you
Online Assessment
HackerRank, often 2 coding (easy–moderate); some drives add offline coding+SQL+pattern
Correct solutions with clean logic
Technical interview
~30–45 min - OOP, DSA, SQL, projects, puzzles
Clear fundamentals + honest projects
Managerial / HR
Puzzles, URL shortener-style design, projects, role expectations
Design: shorten a long URL for a customer (expected: hash table mapping)
Favourite subject → if DBMS: Neo4j vs MySQL when to use each
Favourite project; what job do you expect at IBM?
Final result: Offer (per that GFG write-up)
Tip: Managerial still tests structured problem-solving - treat puzzles as scored
Key takeaways: IBM campus technicals reward textbook clarity. Puzzles are not optional warm-ups.
Takeaways
What decided it: Easy OA clears, textbook OOP/C++ clarity (v-table, SOLID), House Robber coding, then scored managerial puzzles and URL-shortener design
Common fail: Listing RAG/AI without follow-up readiness, or dismissing rope/cake/coin puzzles
How to practise: Shallow vs deep copy + virtual; classic puzzles; hash-map URL shortener sketch
When separate HR exists: family, academics, joining timelines
Final result: Offer after managerial in many 2025 reports
Key takeaways: Even without a labelled HR round, expect behavioural and location questions inside managerial.
Sample answers for high-frequency questions
Use these as frames, not scripts - interviewers probe follow-ups.
Technical
Q. Shallow copy vs deep copy? A. Shallow copy duplicates the object but shares references to nested objects - mutating a nested field affects both. Deep copy recursively duplicates nested state so the two graphs are independent. In C++, default copy is member-wise; manage pointers carefully or use clone helpers.
Q. What is a v-table? A. For classes with virtual functions, the compiler builds a virtual table of function pointers; each object carries a vptr to the table for its dynamic type. Virtual dispatch looks up the function at runtime - the mechanism behind runtime polymorphism.
Q. Compress abbcddeee → ab2cd2e3? A. Single pass: count runs of identical adjacent characters; emit the character and the count only when count > 1 (per problem statement variant). Time O(n), space O(n) for the output string.
Q. URL shortener at fresher depth? A. Map short code → long URL in a hash table (and reverse map if needed). Generate codes via base62 of an auto-increment id or a hash with collision handling. Mention uniqueness and redirect lookup - enough for IBM managerial.
HR
Q. Why IBM? A. Tie enterprise technology breadth, India delivery centres, and one skill (backend, data, cloud). Reference something concrete from the PPT or careers page.
Q. Favourite project? A. Problem → your module → tech choice → hardest bug → outcome. Keep it under three minutes with room for follow-ups.
Common questions checklist
Online assessment
Anagrams, heaps, greedy, patterns, SQL joins
Technical
OOP / virtual / SOLID; string + easy DP coding
SQL/DBMS; puzzles; projects
Managerial
Coin weighing; URL shortener; Neo4j vs MySQL; role fit
Tips from successful candidates
Assessment tips
Easy problems still need clean I/O and edge cases
Revise SQL joins and pattern printing for pooled drives
These links are research inputs used to map IBM campus and pooled coding gates - not copied page mirrors. We reorganized them into process tables, outcome notes, and prep takeaways.
Confirm eligibility and women-only/pool rules against the notification.
