nebius

Mid-sized

Nebius is a technology company specializing in cloud infrastructure and AI computing services, providing GPU-powered platforms for machine learning and large-scale AI workloads. Formed from the international operations of the former Yandex, it offers full-stack AI cloud solutions to developers and enterprises.

4 interview notes · updated Jul 2026

nebius·Software Engineer·Online Assessment (OA)

Jul 2026

Four coding problems back to back for a Nebius SWE round. Nothing too exotic but the problems had enough edge cases to keep you honest. Felt like a solid algorithmic screen.

You are given daily health-check results for a set of microservices. A day counts as healthy only if every single microservice passed that day. Find the longest streak of consecutive healthy days.
Given a string, find the length of the shortest substring that contains every distinct character present in the full string at least once.
Given a list of product IDs and an integer m, you can delete exactly m individual occurrences. What's the minimum number of distinct product IDs that can remain after all deletions?
Given an array of strings, count how many pairs (i, j) with i < j can have their characters combined and rearranged to form a palindrome.

“Sliding window or just a linear scan works fine here.”

View Post

nebius·Software Engineer·Technical Phone Screen

Jul 2026

Interviewed for a software engineer role at Nebius and got a string/palindrome pairing problem that looked deceptively clean on the surface. The bit manipulation angle was the whole key and I'm not sure I would've landed on it cleanly under pressure.

Given a list of lowercase strings, count the number of unordered pairs (i, j) where i < j such that the combined characters of the two strings can be rearranged into a palindrome.

“The palindrome condition boils down to: at most one character has an odd frequency across both strings combined.”

View Post

nebius·Software Engineer·Technical Phone Screen

May 2026

Interviewed at Nebius for a software engineer role and got a matrix-based coding problem that looked straightforward but had a small gotcha in how you handle the row check. Pretty standard technical phone screen vibe.

You're given a 2D matrix of daily health-check results for a set of microservices, where each cell is 1 (pass) or 0 (fail). Find the length of the longest contiguous sequence of days where every microservice passed.

“My first instinct was to overthink it and reach for some kind of sliding window, but it's really just a linear scan.”

View Post

nebius·Software Engineer·Technical Phone Screen

Apr 2026

Nebius software engineer interview with a sliding window coding problem. Pretty standard algorithmic round, nothing too wild, but the problem had a subtle contraction step that I almost fumbled.

Given a string, find the length of the shortest substring that contains every distinct character present in the string.

“I recognized the sliding window pattern pretty quickly, which helped.”

View Post