IBM interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
IBM
3 rounds | 7 Coding
problems
Rejected
Interview preparation journey
Journey
I started my coding preparation in my first year of college itself first i do not like coding then after some practice it is like a cake walk for me now its very easy .
Application story
This company came to my college for the on-campus internship, and I have applied for this company from there only.
Why selected/rejected for the role?
Tip 1 : Link to your projects.
Tip 2 : Open source contribution.
Tip 3 : Clear Tech-stack.
Tip 4 : Link to your different profiles.
Tip 5 : Don't mess up things by writing things you don't know.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Start with the basics if you have lost touch with competitive coding. Don't directly jump to interview questions.
Tip 2 : Create a timetable and set goals. Keep aside 3-4 hours for studying. Consistency is the key.
Tip 3 : Focus on medium and hard questions. Solving a lot of easy questions doesn't help.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put the wrong things on your resume.
Interview rounds
01
Round
Easy
Video Call
Duration60 minutes
Interview date29 Dec 2022
Coding problem3
1. Colorful Knapsack
Hard
45m average time
0/120
Asked in companies
You are given 'N' stones labeled from 1 to 'N'. The 'i-th' stone has the weight W[i]. There are 'M' colors labeled by integers from 1 to 'M'. The 'i-th' stone has the color C[i] which is an integer between 1 to 'M', both inclusive.
You have been required to fill a Knapsack with these stones. The Knapsack can hold a total weight of 'X'.
You are required to select exactly 'M' stones; one of each color. The sum of the weights of the stones must not exceed 'X'. Since you paid a premium for a Knapsack with capacity 'X', you are required to fill the Knapsack as much as possible.
Write a program to calculate the best way to fill the Knapsack - that is, the unused capacity should be minimized.
Problem approach
You are given 'N' stones labeled from 1 to 'N'. The 'i-th' stone has the weight W[i]. There are 'M' colors labeled by integers from 1 to 'M'. The 'i-th' stone has the color C[i] which is an integer between 1 to 'M', both inclusive.
2. DSA
Tell the difference Between array and linked List.
And according to which conditions Linked List and Array should be used.
Problem approach
Tip 1 : Tell the basic definition of both Data structures
Tip 2 : Read basics of every Data structures carefully and their uses
Tip 3 : Answer the question completely i.e. Tell all the differences Between array and Linked List and describe it deeply.
3. OOPS Question
Tell about Constructors and types of Constructors in C++.
Why Virtual Destructors are possible while virtual Constructors are not Possible?
Problem approach
Tip 1 : Read about Constructor and Destructor topic carefully
Tip 2 : Do read about Copy Constructor.
Tip 3 : Give valid reason that why virtual constructors aren't possible.
02
Round
Easy
Video Call
Duration60 minutes
Interview date29 Dec 2022
Coding problem3
1. OOPS Question
What is Polymorphism?
What is the difference between operator overloading and polymorphism?
How Runtime Polymorphism is Implemented?
What are abstract Classes and virtual functions?
Problem approach
Read about run time polymorphism and compile time polymorphism
2. Puzzle
You have two ropes coated in oil to help them burn. Each rope will take exactly 1 hour to burn all the way through. However, the ropes do not burn at constant rates—there are spots where they burn a little faster and spots where they burn a little slower, but it always takes 1 hour to finish the job.
With a lighter to ignite the ropes, how can you measure exactly 45 minutes?
3. Maximum Frequency Number
Easy
10m average time
90% success
0/40
Asked in companies
Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given input. He needs your help to solve this problem.
If two or more elements contend for the maximum frequency, return the element which occurs in the array first i.e. whose index is lowest.
For example,
For 'arr' = [ 1, 2, 3, 1, 2]. you need to return 1.
Problem approach
Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given input. He needs your help to solve this problem.
If two or more elements contend for the maximum frequency, return the element which occurs in the array first i.e. whose index is lowest.
03
Round
Easy
HR Round
Duration30 minutes
Interview date29 Dec 2022
Coding problem1
1. Basic HR Questions
Tell me about yourself.
Why should I hire you?
What are your strengths and weaknesses?
Why do you want to work at our company?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which traversal uses a queue as its primary data structure?
Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 2 problems
Interviewed by IBM
Selected 
3484 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by IBM
Rejected
1407 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by IBM
Selected 1703 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by IBM
Rejected
565 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 110395 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 54212 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 33222 views
6 comments
0 upvotes