Summary
I had two coding rounds for the SDE 2 role at Yugabyte and unfortunately received a rejection after the second round.
Full Experience
I had an initial call with the recruiter, which was followed by two coding rounds. Each round was scheduled for an hour, providing approximately 50-55 minutes for coding. Despite completing both rounds, I received a rejection notification after the second round.
Interview Questions (2)
You are given an undirected graph with n nodes, a list of edges, and an integer maxMoves. Each edge edges[i] = [ui, vi, cnti] indicates there is an undirected edge between ui and vi with cnti new nodes inserted on that edge.
Specifically, if an edge between ui and vi has cnti new nodes, it means it's replaced by cnti + 1 new edges and cnti new nodes. The original edge (ui, vi) is effectively replaced by a path of length cnti + 1.
The task is to return the number of nodes that are reachable from node 0 within maxMoves moves. A move consists of traversing one edge (whether original or subdivided).
You are given n, the number of nodes in a directed graph where nodes are labeled from 0 to n - 1. You are also given two arrays, redEdges and blueEdges. redEdges[i] = [ai, bi] denotes a directed red edge from node ai to node bi, and blueEdges[j] = [uj, vj] denotes a directed blue edge from node uj to node vj.
Return an array answer of length n, where answer[X] is the length of the shortest path from node 0 to node X such that the edges in the path alternate in color. If such a path does not exist for a node X, set answer[X] to -1.