← Back to Directory

Nebius

Mid-sized

Screna has 3 Nebius interview write-ups. The most reported round is the technical phone screen (3).

3 interview notes · updated Jun 2026

Nebius·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed at Nebius for a Software Engineer role and got a string/combinatorics problem that looked deceptively simple but had a neat bitmask trick at its core. The coding round was focused and technical, no fluff.
  • Given a list of lowercase strings, count the number of unordered pairs (i, j) where the combined characters of the two strings can be rearranged into a palindrome.

“My first instinct was brute force: check every pair, count character frequencies, see if at most one char has odd count.”

View Post

Nebius·Software Engineer·Technical Phone Screen

Jun 2026
Coding round at Nebius for a software engineer role. One algorithmic question, sliding window style. Nothing too wild but you need to actually know your two-pointer mechanics cold.
  • Given a string, find the length of the shortest substring that contains every distinct character present in the full string.

“Classic sliding window and I knew it, but I fumbled the initial setup a bit.”

View Post

Nebius·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed at Nebius for a software engineer role, got a matrix-based problem that looked deceptively simple but had a few wrinkles worth thinking through.
  • Given a 2D matrix of daily health-check results for a set of microservices (rows are days, columns are services, each cell is 1 for pass or 0 for fail), find the length of the longest contiguous sequence of days where every single microservice passed.

“My first instinct was to overcomplicate it.”

View Post