Skip to contentSkip to footer

Software Developer Iii Interview Questions

Salaries
Interviews

1,279 software developer iii interview questions shared by candidates

For the coding part of the interview, it was a sorting algorithm style problem where there were some unique constraints given on how to sort the objects. It involved a combination of DSA and OOP. For the discussion parts of the interview, it was mostly design and architectural type questions. Event driven architecture, message queues vs. cache, etc.
avatar

Software Engineer III

Interviewed at Vonage

3.7★
Feb 3, 2025

For the coding part of the interview, it was a sorting algorithm style problem where there were some unique constraints given on how to sort the objects. It involved a combination of DSA and OOP. For the discussion parts of the interview, it was mostly design and architectural type questions. Event driven architecture, message queues vs. cache, etc.

You are given an array `board` of length N, describing subsequent positions on a game board from left to right. Every position is either empty (represented by 0 in the array) or contains a single game piece (represented by 1). Each game piece can be moved at most once. A move means going one or more positions to either the left or the right. Pieces cannot capture (occupy another piece's position) or jump over each other. When the game piece is moved by X positions (either left or right), we say it travels distance X. Also, pieces can be moved in any order, but they must be moved only one at a time. What is the maximum possible distance that the game pieces can travel altogether? Examples: [1, 1, 0, 0, 1] = 4; [0, 1] = 1; [0, 0, 0] = 0 N is an integer within [1..40000]. `board` only contains integers within [0..1].
avatar

Software Development Engineer (SDE) III

Interviewed at GM Financial

3.8★
Feb 13, 2025

You are given an array `board` of length N, describing subsequent positions on a game board from left to right. Every position is either empty (represented by 0 in the array) or contains a single game piece (represented by 1). Each game piece can be moved at most once. A move means going one or more positions to either the left or the right. Pieces cannot capture (occupy another piece's position) or jump over each other. When the game piece is moved by X positions (either left or right), we say it travels distance X. Also, pieces can be moved in any order, but they must be moved only one at a time. What is the maximum possible distance that the game pieces can travel altogether? Examples: [1, 1, 0, 0, 1] = 4; [0, 1] = 1; [0, 0, 0] = 0 N is an integer within [1..40000]. `board` only contains integers within [0..1].

Viewing 561 - 570 interview questions

Glassdoor has 1,279 interview questions and reports from Software developer iii interviews. Prepare for your interview. Get hired. Love your job.