IBM interview experience Real time questions & tips from candidates to crack your interview
Software Engineer Intern
IBM
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I missed most of the good companies in the first phase of the placement season because of the placement policy of the college. I find my way out, you will definitely get it. Hard work, Perseverance is your weapon. Believe in god and have patience, you will get through it.
Application story
300+ students applied from the campus, and almost all eligible students from each branch are allowed.
Why selected/rejected for the role?
Coding helps me all the time. My resume has passed the screening round(make it ATS-friendly). I got rejected by many companies, but it helps me improve and work on my weakness. Be honest, and confident, you will definitely get it.
Preparation
Duration: 3 months
Topics: Data Structures, Algorithms, DBMS, OS, OOPS
Tip 1 : Don't run behind the number of questions on Leetcode, practice good quality questions. Follow Striver DSA Sheet, it is a pot of gold.
Tip 2 : Make a Project on your own from scratch, or you get it from GitHub and you should know each detail in depth. Don't jump over blockchain or crypto projects without knowing in depth about them. Interviewers are always smarter than you.
Application process
Where: Campus
Eligibility: 7.5+ CGPA
Tip 1 : Keep it simple, mention your achievements (in my case coding achievements), and hackathons(my team got selected in the top 10 of the competition).
Tip 2 : Mention each detail in bold about your project (tech stack, efficiency %, features, use cases).
Interview rounds
01
Round
Easy
Telephonic
Duration60 minutes
Interview date23 Dec 2022
Coding problem2
1. Merge K Sorted Arrays
Moderate
15m average time
85% success
0/80
Asked in companies
You have been given ‘K’ different arrays/lists, which are sorted individually (in ascending order). You need to merge all the given arrays/list such that the output array/list should be sorted in ascending order.
2. Frog Jump
Easy
30m average time
60% success
0/40
Asked in companies
There is a frog on the '1st' step of an 'N' stairs long staircase. The frog wants to reach the 'Nth' stair. 'HEIGHT[i]' is the height of the '(i+1)th' stair.If Frog jumps from 'ith' to 'jth' stair, the energy lost in the jump is given by absolute value of ( HEIGHT[i-1] - HEIGHT[j-1] ). If the Frog is on 'ith' staircase, he can jump either to '(i+1)th' stair or to '(i+2)th' stair. Your task is to find the minimum total energy used by the frog to reach from '1st' stair to 'Nth' stair.
For Example
If the given ‘HEIGHT’ array is [10,20,30,10], the answer 20 as the frog can jump from 1st stair to 2nd stair (|20-10| = 10 energy lost) and then a jump from 2nd stair to last stair (|10-20| = 10 energy lost). So, the total energy lost is 20.
02
Round
Medium
Video Call
Duration30 minutes
Interview date28 Dec 2022
Coding problem1
Hiring Manager Round
1. Technical Questions
Project Discussion.
Resume Discussion.
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
System Engineer
3 rounds | 12 problems
Interviewed by IBM
Rejected
2230 views
0 comments
0 upvotes
SDE - Intern
4 rounds | 8 problems
Interviewed by IBM
Selected 1803 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 3 problems
Interviewed by IBM
Selected 1788 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by IBM
Rejected
886 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer Intern
4 rounds | 4 problems
Interviewed by Microsoft
Selected 1378 views
0 comments
0 upvotes