0 day streak

Arcesium coding interview questions

FintechEnterprise SaaS India Machine coding / LLD

Ranked by how often candidates report them. Each opens in the editor with hidden tests, an animated walkthrough and solutions in four languages; a question you solve once counts for every company that asks it.

0%ready
ProgressTitleDifficultyTopicHow often hereAlso asked atNext step
Partition Array Into Two Arrays to Minimize Sum DifferenceMeet in the Middle Hard Recursion & Backtracking Samsung, Swiggy Solve
Russian Doll Envelopes1D DP Hard Dynamic Programming Atlassian, Zomato, Media.net Solve
Median of Two Sorted ArraysBinary Search on Partition Hard Binary Search Google, Amazon, Microsoft +17 Solve
Count Collisions on a RoadStack Basics Medium Stack Meesho Solve
Find Median from Data StreamAdvanced Hard Heaps Google, Amazon, Apple +14 Solve
Longest Consecutive SequenceHash Set Lookup Medium Arrays & Hashing Google, Bloomberg, Spotify +17 Solve
Sudoku Solver2D Matrix Backtracking Hard Recursion & Backtracking Microsoft, DoorDash, VMware by Broadcom +2 Solve
Maximal RectangleMonotonic Stack Hard Monotonic Stack Google, VMware by Broadcom Solve
Word LadderBFS for shortest path Hard Graphs Google, Amazon, Microsoft +13 Solve
Longest Substring Without Repeating CharactersSliding Window · Variable Medium Arrays & Hashing Google, Amazon, Microsoft +50 Solve
Koko Eating BananasBinary Search on Answer Space Medium Binary Search Amazon, Netflix, DoorDash +12 Solve
Reverse Linked ListFront Middle Back Pointer Easy Linked List Microsoft, Apple, Bloomberg +17 Solve
Decode Ways1D DP Medium Dynamic Programming Google, Meta, Goldman Sachs +3 Solve
Smallest Range Covering Elements from K ListsMerge K Sorted Hard Heaps PhonePe Solve
Populating Next Right Pointers in Each NodeTraversals Medium Trees & BST Microsoft Solve
Minimum Changes To Make Alternating Binary StringString Basics Easy Arrays & Hashing Tesla Solve
Also reported, being added to AlgoRung (9)

Beautiful Towers II · Maximum Length of Subarray With Positive Product · Cycle Length Queries in a Tree · Maximize the Confusion of an Exam · Number of People Aware of a Secret · House Robber IV · Minimum Swaps to Group All 1's Together II · Find the Count of Monotonic Pairs I · Maximum Sum Increasing Subsequence

Questions people ask

What coding questions does Arcesium ask most?

Partition Array Into Two Arrays to Minimize Sum Difference, Russian Doll Envelopes, Median of Two Sorted Arrays, Count Collisions on a Road, Find Median from Data Stream, Longest Consecutive Sequence, Sudoku Solver, Maximal Rectangle.

Which topics come up in Arcesium coding rounds?

dynamic programming, binary search, trees, graphs, heaps, sliding window.

How hard are Arcesium coding questions?

Of the reported questions, 2 are easy, 6 medium and 8 hard. A 45 to 60 minute live interview where you solve one or two data-structures-and-algorithms problems while explaining your thinking. Interviewers score problem solving, code quality, testing and communication.