Available question text
Given a graph as an adjacency list that represents a single ring, return all the nodes in the order they appear on the ring, starting from any node and going in either direction.
Related questions
Continue with questions that share topics or the same question type.
- Given a "system", build one function, then add another, then adapt and build something else. From a design-build problem, it was actually rather pleasant; the issue is that you spend a lot of time expecting interview questions and get tripped up on solving the "real-world problem" they give you.
Other questions
- Given a list of buses and the stops they take, given a start and end stop, find the minimum number of transfers needed to reach. Return -1 if its not possible.
Other questions
- Given an n x n matrix where each row and each column is sorted in ascending order, return the kth smallest element in the matrix. Walk through both the min-heap approach and the binary-search-on-value approach, compare their time and space complexity, and discuss which one you'd prefer for very large matrices that don't fit in memory.
Other questions
- A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Other questions
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Glassdoor · 1 record
Google
Given a graph as an adjacency list that represents a single ring, return all the nodes in the order they appear on the ring, starting from any node and going in either direction.
Reported Oct 2026 · 1 source report
Software Engineer
Source snapshot: Nov 12, 2026
View source