Arcesium Interview Questions — 20 DSA Problems

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

Most frequently asked Arcesium LeetCode questions for software engineering interviews.

• Maximum Length of Subarray With Positive Product (MEDIUM) — Array, Dynamic Programming, Greedy
• Cycle Length Queries in a Tree (HARD) — Array, Tree, Binary Tree
• Count Collisions on a Road (MEDIUM) — String, Stack, Simulation
• Maximize the Confusion of an Exam (MEDIUM) — String, Binary Search, Sliding Window, Prefix Sum
• Number of People Aware of a Secret (MEDIUM) — Dynamic Programming, Queue, Simulation
• Partition Array Into Two Arrays to Minimize Sum Difference (HARD) — Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Ordered Set, Bitmask
• House Robber (MEDIUM) — Array, Dynamic Programming
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Possible Bipartition (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Stone Game VI (MEDIUM) — Array, Math, Greedy, Sorting, Heap (Priority Queue), Game Theory
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Find the Count of Monotonic Pairs I (HARD) — Array, Math, Dynamic Programming, Combinatorics, Prefix Sum
• Next Permutation (MEDIUM) — Array, Two Pointers
• Best Time to Buy and Sell Stock IV (HARD) — Array, Dynamic Programming
• Minimum Insertion Steps to Make a String Palindrome (HARD) — String, Dynamic Programming
• Edit Distance (MEDIUM) — String, Dynamic Programming
• Maximum Product Subarray (MEDIUM) — Array, Dynamic Programming
• Surrounded Regions (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Pow(x, n) (MEDIUM) — Math, Recursion