IBM interview experience Real time questions & tips from candidates to crack your interview

Software Developer

IBM
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Dynamic Programming, Graphs, Greedy Algorithms, Data Structures, OOPs
Tip
Tip

Tip 1 : Practice atleast 250 Coding questions, and clear with OS, Networking and Database concepts
Tip 2 : Do atleast 2 Good projects
Tip 3 : Go through company specific questions before appearing to that company.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Have atleast 2 Good projects on resume
Tip 2 : Do not put false information and don not put any information you are not sure.

Interview rounds

01
Round
Medium
Face to Face
Duration50 minutes
Interview date31 Aug 2022
Coding problem2

There are 2 coding questions. Easy to moderate level.

1. Sort An Array of 0s, 1s and 2s

Easy
10m average time
90% success
0/40
Asked in companies
IBMSamsungDirecti

You have been given an array/list 'arr' consisting of 'n' elements.


Each element in the array is either 0, 1 or 2.


Sort this array/list in increasing order.


Do not make a new array/list. Make changes in the given array/list.


Example :
Input: 'arr' = [2, 2, 2, 2, 0, 0, 1, 0]

Output: Final 'arr' = [0, 0, 0, 1, 2, 2, 2, 2]

Explanation: The array is sorted in increasing order.
Problem approach

step1 : I simply sorted the array. It was not good enough
step2 : Interviewer asked to not use sort function.
Step 3: Then I gave a solution of remembering the 0s, 1s, 2s count and then wrote 0s, 1s then 2s with the counts each number has.

Try solving now

2. Rod cutting problem

Moderate
40m average time
75% success
0/80
Asked in companies
Goldman SachsSamsungRazorpay

Given a rod of length ‘N’ units. The rod can be cut into different sizes and each size has a cost associated with it. Determine the maximum cost obtained by cutting the rod and selling its pieces.

Note:
1. The sizes will range from 1 to ‘N’ and will be integers.

2. The sum of the pieces cut should be equal to ‘N’.

3. Consider 1-based indexing.
Problem approach

Step 1 : I first applied recursion techniques. It was not good enough
Step 2 : Interviewer asked me to optimise the solution
Step 3 : Then I gave recursion + memoization technique and interviewer was satisfied.

Try solving now
02
Round
Easy
HR Round
Duration20 minutes
Interview date31 Aug 2021
Coding problem1

It is actually a managerial + HR round.
Interviewer asked about myself, then jumped into my projects.
I explained my projects well.
Asked some questions on OS concepts.

1. Basic HR Questions

1. Introduction

2. Your strengths and weakness

3. Where do you see yourself after 5 years?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
Software Developer
3 rounds | 5 problems
Interviewed by IBM
3497 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 5 problems
Interviewed by IBM
2497 views
1 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by IBM
886 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by IBM
2661 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
4029 views
1 comments
0 upvotes
company logo
Software Developer
6 rounds | 12 problems
Interviewed by SAP Labs
2912 views
0 comments
0 upvotes
company logo
Software Developer
3 rounds | 3 problems
Interviewed by Amazon
1271 views
0 comments
0 upvotes