Voleon Interview Questions — Page 3

Voleon·Software Engineer·Technical Phone Screen

May 2026

Voleon coding round focused on a single meaty implementation problem around sparse matrices. Not a vibe-check interview at all, pretty much just heads-down engineering the whole time.

Implement a sparse matrix data structure that supports addition and multiplication, using a memory-efficient representation that skips zero entries. Include proper dimension validation and raise meaningful errors when shapes are incompatible.

“I went with a dict-of-dicts internally, rows as outer keys and columns as inner.”

View Post

Voleon·Software Engineer·Technical Phone Screen

May 2026

Voleon threw a chess-themed algorithmic problem at me that started reasonable and then got a lot more interesting once blockers entered the picture. Two-part question, one interview, and I left feeling like I'd only half-solved it.

Given an N×N chessboard with a list of queens and a list of query points, for each point determine how many queens can attack it, where a queen attacks along its row, column, and both diagonals.
Now add 'rocks' to the board that block a queen's line of attack. A rock stops the attack ray at that cell, the rock itself is not attacked, and any point behind the rock on that ray is safe from that queen. How do you handle this efficiently?

“Part one felt manageable.”

View Post

Voleon·Machine Learning Engineer·Technical Phone Screen

May 2026

Voleon MLE interview mixed a research background chat with two coding problems back to back. Pretty standard algo fare but the combination with the research discussion made it feel a bit disjointed, like they weren't sure which direction they wanted to take it.

Given K eggs and N floors, what is the minimum number of moves needed to find the critical floor in the worst case?
Given an integer array, find all unique triplets that sum to zero.

“This one hurt.”

View Post

Voleon·Software Engineer·Technical Phone Screen

May 2026

Voleon software engineer interview with a geometry/grid problem that started simple and got complicated fast. Two parts: first no blockers, then rocks that block queen attacks. Classic escalation structure.

Given a set of queen positions on an unbounded 2D integer grid and a list of query points, for each query point return how many queens can attack it. A queen attacks along all 8 directions (row, column, two diagonals), with no blockers.
Now add rocks to the grid. A queen can only attack a query point if there is no rock strictly between the queen and the point along their shared line. Return the same attack counts with this blocking constraint.

“Part 1 felt manageable.”

View Post

Voleon·Software Engineer·Technical Phone Screen

May 2026

Voleon coding screen focused on a streaming data problem, basically a trade feed processor with volume queries mixed in. Pretty niche problem, felt more like a systems-adjacent coding challenge than a pure algo grind.

Given a stream of trade events, design a system that handles both trade print events and volume-check queries for a specific security. How do you process these efficiently?

“I went straight to a hashmap keyed by security ID and accumulated volume as trade events came in.”

View Post

Voleon·Software Engineer·Onsite - System Design / Architecture

May 2026

Voleon system design round, pretty deep into multi-client trading infrastructure. The question had a lot of moving parts and I felt like I was chasing the problem the whole time rather than leading it.

You have an existing single-client trading system with a market data feed and an order manager that enforces a participation-rate cap. How would you extend it to handle multiple clients simultaneously, where one client's executed order shifts the market state before the next client acts?
How would you design a priority queue for client orders on a per-symbol basis, and what data structure or keying strategy supports swappable prioritization policies like FIFO, tier-weighted, or deadline-aware ordering?
How do you maintain per-client participation-rate caps independently when multiple clients are trading the same symbol, and how do you prevent one client's high volume from eating into another's quota?
Walk through the concurrency model: do client strategies run on shared threads or isolated per-client threads, and how does that interact with the order routing stage?
How would you test the interaction effects between clients deterministically, given that fills and market state changes are time-dependent?

“This is where I fumbled first.”

View Post

Voleon·Data Analyst·Technical Phone Screen

Jun 2026

A technical round at Voleon for a Data Analyst role centered on debugging from logs, which was more involved than I expected for an analyst position.

You are given a codebase and its associated log output. Walk through the logs to identify where execution goes wrong, trace it back to the responsible code, apply a fix, and explain your reasoning including what confirms the fix worked.

“This was more of a structured exercise than a conversational question.”

View Post

Voleon·Data Scientist·Technical Phone Screen

Jun 2026

A technical screen for a Data Scientist role at Voleon Group that was basically one long, dense coding problem covering everything from file I/O to visualization. The kind of question where you think you're done and then realize there are four more sub-parts.

Given a large CSV file (~1.5 GB) with an unknown delimiter and encoding, how would you detect those properties without loading the full file, then load the data in chunks while keeping peak memory under 1 GB?
After loading the data, how would you drop exact duplicate rows and enforce correct column dtypes?
How would you impute missing spend values, and what rule would you use to decide whether to impute or drop rows with missing clicks or signups? Justify the rule.
How would you compute CPC (cost per click) safely, and then winsorize it at the 1st and 99th percentiles within each region?
Produce three specific visualizations: a scatter of spend vs signups with a LOWESS smoothed line and 95% confidence interval, a boxplot of signups by region sorted by median, and a time-series line of daily total signups. Save all three.
Explain your memory and time complexity choices throughout the solution, and describe how you would test this code end-to-end.

“My first instinct was to just try both delimiters and see which parse didn't explode, which is basically what you'd do in practice.”

View Post

Voleon·Software Engineer·Technical Phone Screen

Jun 2026

Voleon gave me a coding problem about simulating a Kac ring, which sounds like a physics toy but turns into a pretty tricky math/CS puzzle once you hit the O(1) constraint on kstep. The question was well-designed and clearly not off-the-shelf leetcode, which I respect even if it wrecked me a little.

Implement a Kac ring simulation with N positions on a circle, where balls move clockwise each step and flip color when leaving a marked position. The class needs a step() method, a kstep(k) method that runs in O(1) time even for k up to 10^18, and a color() method that returns (W - B) / N in O(1).

“The step() part was fine, just bookkeeping.”

View Post

Voleon·Data Scientist·Technical Phone Screen

Jun 2026

Voleon Group data science interview hit me with a single massive regression design question that covered basically every ML concept I've ever studied, all at once. It felt less like an interview and more like a take-home exam someone decided to ask verbally.

Design a full regression pipeline to predict 90-day customer value (CLV_90) at the user level, given spend features across marketing channels, RFM signals, device, region, tenure, and high-cardinality campaign IDs. The target has many zeros and a heavy right tail. Address loss function choice, feature processing, multicollinearity, time-based cross-validation, heteroskedasticity, prediction intervals, interpretability, leakage risks, and the trade-offs between a regularized linear model and a gradient boosting model.

“This question is nine questions stapled together and handed to you like it's one thing.”

View Post