IXL Interview Questions — 17 DSA Problems

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

Most frequently asked IXL LeetCode questions for software engineering interviews.

• Range Addition II (EASY) — Array, Math
• Fraction Addition and Subtraction (MEDIUM) — Math, String, Simulation
• Palindrome Linked List (EASY) — Linked List, Two Pointers, Stack, Recursion
• Stickers to Spell Word (HARD) — Array, Hash Table, String, Dynamic Programming, Backtracking, Bit Manipulation, Memoization, Bitmask
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Merge Intervals (MEDIUM) — Array, Sorting
• Design Snake Game (MEDIUM) — Array, Hash Table, Design, Queue, Simulation
• Find the Derangement of An Array (MEDIUM) — Math, Dynamic Programming, Combinatorics
• Fraction to Recurring Decimal (MEDIUM) — Hash Table, Math, String
• Find Median from Data Stream (HARD) — Two Pointers, Design, Sorting, Heap (Priority Queue), Data Stream
• Minimum Number of Steps to Make Two Strings Anagram (MEDIUM) — Hash Table, String, Counting
• Find Peak Element (MEDIUM) — Array, Binary Search
• 1-bit and 2-bit Characters (EASY) — Array
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (MEDIUM) — Array, Greedy, Sorting
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort