Codeium

Small

Codeium is an AI-powered developer tools company known for its code completion and coding assistant products, later associated with the Windsurf AI code editor. It provides autocomplete, chat, and search features to help software engineers write and understand code more efficiently.

4 interview notes · updated Jul 2026

Codeium·Software Engineer·Technical Phone Screen

Jun 2026

Coding round for a software engineer role at Codeium. One algorithmic problem, graph-based, not the hardest thing in the world but there are enough edge cases to trip you up if you're not careful.

You're given a graph represented as three strings: a list of vertices, a list of edges, and a candidate path. Write a function to determine whether that path is a valid Hamiltonian path. Return 'yes' if it is, or return the first vertex where validation breaks down, either because there's no edge connecting it to the previous vertex, or because it's already been visited.

“The core logic isn't too bad once you break it down.”

View Post

Codeium·Software Engineer·Technical Phone Screen

May 2026

Codeium software engineer interview with a string manipulation coding problem. Pretty straightforward on the surface but the stable sort requirement is where people probably trip up.

Given an array of strings, return the third largest word by length. If two words share the same length, preserve their original order from the input before ranking.

“The basic idea clicks fast: sort by length descending, grab index 2.”

View Post

Codeium·Software Engineer·Technical Phone Screen

May 2026

Codeium software engineer interview with an array/string manipulation problem that looks straightforward until you actually read the tie-breaking rule.

Given an array of strings, return the third largest word by length. If words tie on length, prefer the one that appears later in the array.

“The base problem is fine, sort by length descending and grab index 2.”

View Post

Codeium·Software Engineer·Online Assessment (OA)

May 2026

Got an OA for a Software Engineer role at Codeium. One graph problem, pretty well-defined, but the failure-case output requirement is the part that'll trip you up if you're not careful.

You're given three strings describing an undirected graph: one listing the vertices, one listing the edges, and one proposing a vertex visit order. Determine whether the proposed order is a valid Hamiltonian path. If it is, return 'yes'. If not, return the first vertex in the order where the path breaks down, whether that's because the vertex doesn't exist, was already visited, or there's no edge connecting it to the previous vertex.

“The 'yes' case is straightforward enough.”

View Post