IBM Placement Papers 2025

Overview

This page is a working set of IBM placement papers from 2025: from student reports questions, the 2025 online assessment pattern, and step-by-step solutions. Use it to see what IBM actually asked in the latest cycle, how hard the rounds were, and which themes (DSA, system design, aptitude, or role-specific topics) mattered most. Practice the problems below under timed conditions, then cross-check with the interview and preparation guides if you are targeting an upcoming IBM drive.

2025 Updates

The 2025 IBM assessment maintains focus on aptitude, programming fundamentals, and technical concepts with emphasis on cloud computing.

IBM Online Assessment 2025 pattern

Section	Questions	Time	Difficulty	Focus Areas
Aptitude	20-25	40 min	Medium	Quantitative, logical, verbal
Technical	10-15	20 min	Medium	Programming, DBMS, OOPs, Cloud
Coding	1-2	30 min	Medium-Hard	Arrays, strings, basic algorithms

Total: 30-40 questions, 90 minutes
Platform: IBM assessment platform
Languages Allowed: C, C++, Java, Python
Success Rate: ~20-25% cleared assessment and advanced to interviews

IBM Placement Papers 2025 - actual questions & solutions

This section contains practice questions styled on IBM placement papers 2025 (recent-cycle pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.

Question 1: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (Java):

public int climbStairs(int n) {
    if (n <= 2) return n;
    int a = 1, b = 2;
    for (int i = 3; i <= n; i++) {
        int c = a + b; a = b; b = c;
    }
    return b;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 2: longest common prefix

Show solution

Problem Statement: Find the longest common prefix string amongst an array of strings.

Example:

Input: ["flower","flow","flight"]
Output: "fl"

Solution (Java):

public String longestCommonPrefix(String[] strs) {
    if (strs.length == 0) return "";
    String pref = strs[0];
    for (int i = 1; i < strs.length; i++) {
        while (!strs[i].startsWith(pref)) {
            pref = pref.substring(0, pref.length() - 1);
            if (pref.isEmpty()) return "";
        }
    }
    return pref;
}

Time Complexity: O(S)
Space Complexity: O(1)

Question 3: first non-repeating character

Show solution

Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.

Example:

Input: "swiss"
Output: 'w'

Solution (Java):

public char firstUnique(String s) {
    int[] freq = new int[256];
    for (char c : s.toCharArray()) freq[c]++;
    for (char c : s.toCharArray()) if (freq[c] == 1) return c;
    return '_';
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 4: two sum

Show solution

Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1]

Solution (Java):

public int[] twoSum(int[] nums, int target) {
    Map<Integer, Integer> map = new HashMap<>();
    for (int i = 0; i < nums.length; i++) {
        int need = target - nums[i];
        if (map.containsKey(need)) return new int[]{map.get(need), i};
        map.put(nums[i], i);
    }
    return new int[]{};
}

Time Complexity: O(n)
Space Complexity: O(n)

Question 5: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (Java):

public ListNode mergeTwoLists(ListNode a, ListNode b) {
    ListNode dummy = new ListNode(0), cur = dummy;
    while (a != null && b != null) {
        if (a.val <= b.val) { cur.next = a; a = a.next; }
        else { cur.next = b; b = b.next; }
        cur = cur.next;
    }
    cur.next = (a != null) ? a : b;
    return dummy.next;
}

Time Complexity: O(n + m)
Space Complexity: O(1)

Question 6: detect cycle in linked list

Show solution

Problem Statement: Return true if the linked list has a cycle.

Example:

Input: 3→2→0→-4→(back to 2)
Output: true

Solution (Java):

public boolean hasCycle(ListNode head) {
    ListNode slow = head, fast = head;
    while (fast != null && fast.next != null) {
        slow = slow.next;
        fast = fast.next.next;
        if (slow == fast) return true;
    }
    return false;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 7: maximum subarray sum

Show solution

Problem Statement: Find the contiguous subarray with the largest sum.

Example:

Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]
Output: 6  // [4, -1, 2, 1]

Solution (Java):

public int maxSubArray(int[] nums) {
    int best = nums[0], cur = nums[0];
    for (int i = 1; i < nums.length; i++) {
        cur = Math.max(nums[i], cur + nums[i]);
        best = Math.max(best, cur);
    }
    return best;
}

Time Complexity: O(n)
Space Complexity: O(1)

Question 8

Q8: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 9

Q9: Which data structure uses FIFO order?

Solution:

FIFO = First In First Out → Queue. Stack is LIFO.

Answer: Queue

Question 10

Q10: In OOP, hiding internal details and showing only essential features is called?

Solution:

This is the definition of Encapsulation (often paired with abstraction in interviews).

Answer: Encapsulation

Question 11

Q11: Which SQL clause filters grouped rows after GROUP BY?

Solution:

HAVING filters aggregates; WHERE filters rows before grouping.

Answer: HAVING

Key insights from 2025 IBM Online Assessment

1. Aptitude Section is Critical: Must perform well in quantitative, logical, and verbal reasoning
2. Technical MCQs: Strong emphasis on programming fundamentals, DBMS, OOPs, Cloud technologies
3. Coding Section: 1-2 coding problems in 30 minutes requires good problem-solving skills
4. Time Management: 30-40 questions in 90 minutes requires excellent speed
5. Success Rate: Only 20-25% cleared assessment and advanced to interviews
6. Platform: IBM assessment platform
7. Focus Areas: Quantitative aptitude, logical reasoning, programming fundamentals, cloud technologies, AI/ML basics
8. Enhanced Emphasis: Optimal solutions, cloud computing, and AI/ML fundamentals

IBM 2025 interview experiences

Based on recent candidate experiences from 2025 IBM interviews:

2025 Interview Process:

1. Online Assessment (90 minutes): Aptitude (20-25) + Technical (10-15) + Coding (1-2)
2. Technical Interview (45-60 minutes): Programming concepts, DBMS, OOPs, cloud technologies, AI/ML basics, problem-solving
3. HR Interview (30-45 minutes): Behavioral questions, company fit, motivation

2025 Interview Trends:

• Increased emphasis on IBM Cloud and AI/ML technologies
• More focus on optimal solutions and cloud-native development
• Enhanced behavioral questions about innovation and adaptability
• Questions about AI/ML applications and cloud migration

Common 2025 Interview Topics:

• Aptitude: Quantitative reasoning, logical reasoning, verbal ability
• Technical: Programming concepts, DBMS, OOPs, IBM Cloud, Watson, AI/ML basics
• Coding: Arrays, strings, basic algorithms, optimal solutions
• Behavioral: Problem-solving approach, teamwork, motivation, innovation, adaptability

Success Tips:

• Strong aptitude performance is essential - practice quantitative and logical reasoning
• Understand programming fundamentals, DBMS, OOPs, cloud technologies, AI/ML basics
• Practice coding problems - arrays, strings, basic algorithms
• Prepare behavioral examples using STAR format
• Learn IBM Cloud, Watson, and AI/ML technologies

For detailed interview experiences from 2025, visit IBM Interview Experience page.

Preparation tips for IBM 2025 pattern

1. Master Aptitude: Focus on quantitative, logical, and verbal reasoning - practice regularly
2. Technical Fundamentals: Strong understanding of programming, DBMS, OOPs, cloud technologies, AI/ML basics
3. Practice Previous Year Papers: Solve IBM assessment papers from 2020-2025 to understand evolving patterns
4. Time Management: Practice completing 30-40 questions in 90 minutes
5. Coding Practice: Practice arrays, strings, basic algorithms, optimal solutions
6. Technical MCQs: Practice programming concepts, DBMS, OOPs, cloud technologies, AI/ML basics
7. IBM Technologies: Learn IBM Cloud, Watson, enterprise software, AI/ML frameworks
8. Behavioral Preparation: Prepare examples using STAR format - leadership, teamwork, innovation
9. Mock Tests: Take timed practice tests to improve speed and accuracy
10. Cloud Knowledge: Understand cloud computing, IBM Cloud services, cloud-native development
11. AI/ML Basics: Understand AI/ML fundamentals and applications

Comments & Suggestions

Related resources

2024 papers→

Interview experience→

Preparation guide→

IBM hub→

Similar companies

TCS · Microsoft · Accenture · Infosys · Wipro · Cognizant