IBM Software Engineer Onsite Coding Questions
44+ questions from real IBM Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.
What does the IBM Onsite Coding round test?
The IBM onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.
Top Topics in This Round
IBM Software Engineer Onsite Coding Questions
IBM | SWE Intern | Pune | June 2018 [Offer]
At the time of interview: Status: Undergrad year 3, College in Pune, India Work experience: 3 Months of internship experience at a startup Position: IBM Software Development Intern Location: Pune, India Date: June 1, 2018 -...
#56 Merge Intervals
LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at IBM in the last 6 months.
#412 Fizz Buzz
LeetCode #412: Fizz Buzz. Difficulty: Easy. Topics: Math, String, Simulation. Asked at IBM in the last 6 months.
#3 Longest Substring Without Repeating Characters
LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at IBM in the last 6 months.
#560 Subarray Sum Equals K
LeetCode #560: Subarray Sum Equals K. Difficulty: Medium. Topics: Array, Hash Table, Prefix Sum. Asked at IBM in the last 6 months.
#754 Reach a Number
LeetCode #754: Reach a Number. Difficulty: Medium. Topics: Math, Binary Search. Asked at IBM in the last 6 months.
#12 Integer to Roman
LeetCode #12: Integer to Roman. Difficulty: Medium. Topics: Hash Table, Math, String. Asked at IBM in the last 6 months.
#20 Valid Parentheses
LeetCode #20: Valid Parentheses. Difficulty: Easy. Topics: String, Stack. Asked at IBM in the last 6 months.
#1 Two Sum
LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at IBM in the last 6 months.
LeetCode #1526: Minimum Number of Increments on Subarrays to Form a Target Array. Difficulty: Hard. Topics: Array, Dynamic Programming, Stack, Greedy, Monotonic Stack. Asked at IBM in the last 6 months.
LeetCode #1888: Minimum Number of Flips to Make the Binary String Alternating. Difficulty: Medium. Topics: String, Dynamic Programming, Sliding Window. Asked at IBM in the last 6 months.
#76 Minimum Window Substring
LeetCode #76: Minimum Window Substring. Difficulty: Hard. Topics: Hash Table, String, Sliding Window. Asked at IBM in the last 6 months.
LeetCode #3627: Maximum Median Sum of Subsequences of Size 3. Difficulty: Medium. Topics: Array, Math, Greedy, Sorting, Game Theory. Asked at IBM in the last 6 months.
#881 Boats to Save People
LeetCode #881: Boats to Save People. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting. Asked at IBM in the last 6 months.
#121 Best Time to Buy and Sell Stock
LeetCode #121: Best Time to Buy and Sell Stock. Difficulty: Easy. Topics: Array, Dynamic Programming. Asked at IBM in the last 6 months.
#15 3Sum
LeetCode #15: 3Sum. Difficulty: Medium. Topics: Array, Two Pointers, Sorting. Asked at IBM in the last 6 months.
#680 Valid Palindrome II
LeetCode #680: Valid Palindrome II. Difficulty: Easy. Topics: Two Pointers, String, Greedy. Asked at IBM in the last 6 months.
LeetCode #2193: Minimum Number of Moves to Make Palindrome. Difficulty: Hard. Topics: Two Pointers, String, Greedy, Binary Indexed Tree. Asked at IBM in the last 6 months.
LeetCode #1685: Sum of Absolute Differences in a Sorted Array. Difficulty: Medium. Topics: Array, Math, Prefix Sum. Asked at IBM in the last 6 months.
LeetCode #32: Longest Valid Parentheses. Difficulty: Hard. Topics: String, Dynamic Programming, Stack. Asked at IBM in the last 6 months.
See All 44 Questions from This Round
Full question text, answer context, and frequency data for subscribers.
Get Access