IBM Interview Questions — 100 DSA Problems

93 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked IBM LeetCode questions for software engineering interviews.

• Exclusive Time of Functions (MEDIUM) — Array, Stack
• Integer to Roman (MEDIUM) — Hash Table, Math, String
• Fizz Buzz (EASY) — Math, String, Simulation
• Roman to Integer (EASY) — Hash Table, Math, String
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Two Sum (EASY) — Array, Hash Table
• Count Ways to Group Overlapping Ranges (MEDIUM) — Array, Sorting
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Rotate Image (MEDIUM) — Array, Math, Matrix
• Number of Divisible Triplet Sums (MEDIUM) — Array, Hash Table
• Minimum Absolute Difference (EASY) — Array, Sorting
• Minimum Operations to Make All Array Elements Equal (MEDIUM) — Array, Binary Search, Sorting, Prefix Sum
• Minimum Operations to Make Median of Array Equal to K (MEDIUM) — Array, Greedy, Sorting
• Maximum Profitable Triplets With Increasing Prices I (MEDIUM) — Array, Binary Indexed Tree, Segment Tree
• Find The First Player to win K Games in a Row (MEDIUM) — Array, Simulation
• Activity Participants (MEDIUM) — Database
• The kth Factor of n (MEDIUM) — Math, Number Theory
• Find Products of Elements of Big Array (HARD) — Array, Binary Search, Bit Manipulation
• Merge Intervals (MEDIUM) — Array, Sorting
• Type of Triangle (EASY) — Array, Math, Sorting
• Taking Maximum Energy From the Mystic Dungeon (MEDIUM) — Array, Prefix Sum
• Find Occurrences of an Element in an Array (MEDIUM) — Array, Hash Table
• Find the Array Concatenation Value (EASY) — Array, Two Pointers, Simulation
• String Compression (MEDIUM) — Two Pointers, String
• Minimum Levels to Gain More Points (MEDIUM) — Array, Prefix Sum
• Sort the Students by Their Kth Score (MEDIUM) — Array, Sorting, Matrix
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Average Value of Even Numbers That Are Divisible by Three (EASY) — Array, Math
• Count the Number of Incremovable Subarrays II (HARD) — Array, Two Pointers, Binary Search
• Minimum Length of String After Operations (MEDIUM) — Hash Table, String, Counting
• Maximum Profitable Triplets With Increasing Prices II (HARD) — Array, Binary Indexed Tree, Segment Tree
• Count Vowel Strings in Ranges (MEDIUM) — Array, String, Prefix Sum
• Maximum Units on a Truck (EASY) — Array, Greedy, Sorting
• Longest Common Prefix (EASY) — String, Trie
• Get Equal Substrings Within Budget (MEDIUM) — String, Binary Search, Sliding Window, Prefix Sum
• Count Binary Substrings (EASY) — Two Pointers, String
• Valid Parentheses (EASY) — String, Stack
• Minimum Suffix Flips (MEDIUM) — String, Greedy
• Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
• Maximum Sum of Distinct Subarrays With Length K (MEDIUM) — Array, Hash Table, Sliding Window
• Numbers With Repeated Digits (HARD) — Math, Dynamic Programming
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Lexicographically Smallest String After Substring Operation (MEDIUM) — String, Greedy
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Count Pairs Of Similar Strings (EASY) — Array, Hash Table, String, Bit Manipulation, Counting
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Shortest and Lexicographically Smallest Beautiful String (MEDIUM) — String, Sliding Window
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Number of Divisible Substrings (MEDIUM) — Hash Table, String, Counting, Prefix Sum