Home/Questions/Go

Go Interview Questions 2026

Published July 22, 2026 · Updated July 22, 2026

4 Go interview questions from Amazon, Google, Uber. All difficulty levels, all roles. Upvoted by engineers who were asked them.

4 questions
Companies: Amazon, Google, Uber
178 upvotes

Go Questions by Company

Amazon (1)

Amazon Hard Technical round System DesignMicroservicesJava

Given a directed graph representing service dependencies, detect all strongly connected components and explain how this maps to identifying circular dependencies in a microservices architecture.

↑ 39 upvotes · 33 engineers asked this · Staff

Google (2)

Google Hard Technical round JavaPythonGo

Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.

↑ 61 upvotes · 38 engineers asked this · SDE2
Google Hard Technical round 6-10 yearsSystem DesignGo

Given a large dependency graph of build targets, design an algorithm to compute the minimal set of targets that need to be rebuilt after a file changes, and explain how you would parallelize the rebuild across workers respecting dependency order.

↑ 29 upvotes · 11 engineers asked this · Staff Engineer

Uber (1)

Uber Hard Technical round JavaPythonGo

Given a city map as a weighted graph, find the shortest travel time from a driver's current location to all potential passenger pickup points simultaneously. How does Dijkstra's multi-source variant solve this?

↑ 49 upvotes · 30 engineers asked this · SDE1

Practice these questions with AI feedback

Get instant grading on your answers, identify your weak areas, and generate a personalised 14-day study plan — all free.

Build my study plan →

Frequently asked questions

Given a directed graph representing service dependencies, detect all strongly connected components and explain how this maps to identifying circular dependencies in a microservices architecture.
Given a directed graph representing service dependencies, detect all strongly connected components and explain how this maps to identifying circular dependencies in a microservices architecture.
Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.
Implement a topological sort for a directed acyclic graph. Then extend it to detect cycles and explain how this maps to dependency resolution in build systems like Bazel.
Given a city map as a weighted graph, find the shortest travel time from a driver's current location to all potential passenger pickup points simultaneously. How does Dijkstra's multi-source variant solve this?
Given a city map as a weighted graph, find the shortest travel time from a driver's current location to all potential passenger pickup points simultaneously. How does Dijkstra's multi-source variant solve this?
Given a large dependency graph of build targets, design an algorithm to compute the minimal set of targets that need to be rebuilt after a file changes, and explain how you would parallelize the rebuild across workers respecting dependency order.
Given a large dependency graph of build targets, design an algorithm to compute the minimal set of targets that need to be rebuilt after a file changes, and explain how you would parallelize the rebuild across workers respecting dependency order.