Arcesium Coding Interview Questions: 16 Tagged Problems
16 coding problems tagged Arcesium — 13 medium · 3 hard — with solutions in 13 languages. Plus a 2-week study plan by topic.
- Problems: 16
- By difficulty: 13 medium · 3 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
16 problems the CodeKairo catalogue tags as commonly asked in Arcesium's coding rounds — 13 medium and 3 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (10), Binary Search (5) and Greedy (5). The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Arcesium, which CodeKairo is not affiliated with.
Arcesium study plan by topic
All 16 problems tagged Arcesium over 2 weeks, about 10 h 5 min of solving, grouped by technique in the order they build on each other — Sliding Window, Binary Search, Stack and Queue and 6 more.
Week 1: Sliding Window, Binary Search, Stack +3
12 problems on Sliding Window, Binary Search, Stack, Queue, Monotonic Stack and Greedy, easiest first within each topic.
- Longest Substring Without Repeating Characters Medium
- Minimum Size Subarray Sum Medium
- Maximize the Confusion of an Exam Medium
- Minimum Swaps to Group All 1's Together II Medium
- Koko Eating Bananas Medium
- Minimize the Maximum Difference of Pairs Medium
- House Robber IV Medium
- Count Collisions on a Road Medium
- Number of People Aware of a Secret Medium
- Maximal Rectangle Hard
- Maximum Length of Subarray With Positive Product Medium
- Broken Calculator Medium
Week 2: Divide and Conquer, Bitmask, Breadth-First Search +1
4 problems on Divide and Conquer, Bitmask, Breadth-First Search and Brainteaser, easiest first within each topic.
All problems tagged Arcesium
Medium (13)
- Broken Calculator Math, Greedy
- Maximum Length of Subarray With Positive Product Array, Dynamic Programming, Greedy
- Number of People Aware of a Secret Queue, Dynamic Programming, Simulation
- Minimum Impossible OR Array, Bit Manipulation, Brainteaser
- Count Collisions on a Road String, Stack, Simulation
- House Robber IV Array, Binary Search, Greedy
- Minimize the Maximum Difference of Pairs Array, Binary Search, Greedy
- Minimum Swaps to Group All 1's Together II Array, Sliding Window
- Maximize the Confusion of an Exam String, Sliding Window, Prefix Sum
- Koko Eating Bananas Array, Binary Search
- Minimum Size Subarray Sum Array, Sliding Window, Prefix Sum
- Longest Substring Without Repeating Characters String, Sliding Window, Hash Table
- Maximum Subarray Array, Dynamic Programming, Divide and Conquer
Hard (3)
- Partition Array Into Two Arrays to Minimize Sum Difference Array, Binary Search, Bit Manipulation
- Maximal Rectangle Array, Matrix, Stack
- Word Ladder Hash Table, String, Breadth-First Search
Topics Arcesium asks most
- Arrays 10 problems
- Binary Search 5 problems
- Greedy 5 problems
- Strings 4 problems
- Sliding Window 4 problems
- Dynamic Programming 4 problems
- Hash Table 2 problems
- Prefix Sum 2 problems
- Stack 2 problems
- Simulation 2 problems
- Bit Manipulation 2 problems
- Math 1 problem