Analysis updated 2026-07-03
Study and run Go solutions to common interview problems covering arrays, trees, graphs, and dynamic programming.
Review the thought-process notes and complexity analysis for each solution to understand why one approach is better than another.
Run the test files directly with 'go test' to verify solutions pass before an interview.
Use the problem set as a structured study guide drawing from LeetCode, Interview Cake, and Cracking the Coding Interview.
| hoanhan101/algo | go-jet/jet | microcosm-cc/bluemonday | |
|---|---|---|---|
| Stars | 3,669 | 3,669 | 3,669 |
| Language | Go | Go | Go |
| Setup difficulty | easy | moderate | easy |
| Complexity | 1/5 | 3/5 | 2/5 |
| Audience | developer | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Requires Go installed, run any solution with 'go test ./...' from the repo root, no external dependencies needed.
This repository is a collection of over 116 coding interview problems, all implemented in Go, with detailed solutions and explanations. The author assembled it as a personal study resource while preparing for software engineering interviews, with the goal of covering the problems that appear most often and are most worth practicing. Each problem comes with a working solution written as a Go test file, so you can run the code directly to verify that it passes. The author also includes notes on the thought process behind each solution, along with time and space complexity analysis, which describes how the solution performs as the input grows larger. This makes the collection useful not just for getting to a working answer, but for understanding why a particular approach is efficient or not. The problems are organized by source. The collection draws from well-known interview preparation books and websites, including Interview Cake, LeetCode, Cracking the Coding Interview, Grokking the Coding Interview, and Elements of Programming Interviews. Within each source, problems are grouped by topic: arrays, linked lists, trees, graphs, dynamic programming, bit manipulation, sorting, and others. Because the solutions are written in Go and structured as test files, you need Go installed to run them. There is a continuous integration badge indicating the tests are automatically checked on each update. The repository does not include interactive exercises or a web interface, it is a code-first reference you read and run locally. The README also links to a paid ebook called the Ultimate Go Study Guide, which the author sells separately. The ebook is optional and not required to use any of the code in this repository.
A collection of 116+ coding interview problems solved in Go as runnable test files, each with a detailed explanation and time and space complexity analysis.
Mainly Go. The stack also includes Go.
Setup difficulty is rated easy, with roughly 5min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.