Back to Companies

IBM Interview Questions (170)

Practice real interview problems from IBM

All170 Easy52 Medium102 Hard16

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	4. Median of Two Sorted Arrays	Solution	Solve	Hard	Accenture+46	Array Binary Search+1
	23. Merge k Sorted Lists	Solution	Solve	Hard	Accenture+52	Divide and Conquer Heap (Priority Queue)+2
	32. Longest Valid Parentheses	Solution	Solve	Hard	Accenture+27	Dynamic Programming Stack+1
	42. Trapping Rain Water	Solution	Solve	Hard	Accenture+77	Array Dynamic Programming+3
	51. N-Queens	Solution	Solve	Hard	Adobe+15	Array Backtracking
	76. Minimum Window Substring	Solution	Solve	Hard	Adobe+33	Hash Table Sliding Window+1
	135. Candy	Solution	Solve	Hard	Accenture+23	Array Greedy
	239. Sliding Window Maximum	Solution	Solve	Hard	Adobe+47	Array Heap (Priority Queue)+3
	1163. Last Substring in Lexicographical Order	Solution	Solve	Hard	Amazon+4	String Two Pointers
	1312. Minimum Insertion Steps to Make a String Palindrome	Solution	Solve	Hard	Accenture+5	Dynamic Programming String
	1526. Minimum Number of Increments on Subarrays to Form a Target Array	Solution	Solve	Hard	Amazon+6	Array Dynamic Programming+3
	2193. Minimum Number of Moves to Make Palindrome	Solution	Solve	Hard	Amazon+4	Binary Indexed Tree Greedy+2
	2921. Maximum Profitable Triplets With Increasing Prices II	Solution	Solve	Hard	IBM	Array Binary Indexed Tree+1
	2972. Count the Number of Incremovable Subarrays II	Solution	Solve	Hard	Apple+2	Array Binary Search+1
	3130. Find All Possible Stable Binary Arrays II	Solution	Solve	Hard	IBM	Dynamic Programming Prefix Sum
	3145. Find Products of Elements of Big Array	Solution	Solve	Hard	IBM	Array Binary Search+1

Median of Two Sorted Arrays

Hard✓ Solution📹 Video

Accenture+46

Array Binary Search Divide and Conquer

Merge k Sorted Lists

Hard✓ Solution📹 Video

Accenture+52

Divide and Conquer Heap (Priority Queue)Linked List+1

Longest Valid Parentheses

Hard✓ Solution

Accenture+27

Dynamic Programming Stack String

Trapping Rain Water

Hard✓ Solution

Accenture+77

Array Dynamic Programming Monotonic Stack+2

N-Queens

Hard✓ Solution

Adobe+15

Array Backtracking

Minimum Window Substring

Hard✓ Solution

Adobe+33

Hash Table Sliding Window String

Candy

Hard✓ Solution

Accenture+23

Sliding Window Maximum

Hard✓ Solution

Adobe+47

Array Heap (Priority Queue)Monotonic Queue+2

Last Substring in Lexicographical Order

Hard📹 Video

Amazon+4

String Two Pointers

Minimum Insertion Steps to Make a String Palindrome

Hard✓ Solution

Accenture+5

Dynamic Programming String

Minimum Number of Increments on Subarrays to Form a Target Array

Hard✓ Solution

Amazon+6

Array Dynamic Programming Greedy+2

Minimum Number of Moves to Make Palindrome

Hard

Amazon+4

Binary Indexed Tree Greedy String+1

Maximum Profitable Triplets With Increasing Prices II

Hard📹 Video

IBM

Array Binary Indexed Tree Segment Tree

Count the Number of Incremovable Subarrays II

Hard

Apple+2

Array Binary Search Two Pointers

Find All Possible Stable Binary Arrays II

Hard✓ Solution

IBM

Dynamic Programming Prefix Sum

Find Products of Elements of Big Array

Hard

IBM

Array Binary Search Bit Manipulation