gitmyhub

go-interview

Go ★ 4.7k updated 3y ago

Collection of Technical Interview Questions solved with Go

A collection of common software engineering interview problems, numbers, strings, trees, data structures, algorithms, each solved with tested Go code and organized into folders by category.

Gosetup: easycomplexity 1/5

This repository is a collection of common technical interview problems, each one solved and tested in the Go programming language. It is aimed at people who are preparing for software engineering interviews and want to see working solutions alongside the code, rather than just pseudocode or explanations.

The problems are organized into categories. Number problems cover things like checking whether a number is prime, computing Fibonacci sequences, detecting palindromes, and converting between number bases. String problems include reversing words in a sentence, grouping anagrams, and checking for palindromes. Data structure sections show implementations of linked lists, stacks, queues, trees, sets, and priority queues from scratch. There are also problems about trees specifically, such as inverting a binary tree, finding its height, and printing nodes level by level.

Beyond the classic categories, the repo includes stream problems like computing a running average or median as new values arrive, and algorithm problems like A-star pathfinding. There is also a section on evaluations, covering things like solving postfix math expressions and handling repeating fractions.

Each problem lives in its own subfolder with Go source files and tests. The README is essentially a structured table of contents with links to each subfolder, so you can jump directly to the problem you want to study.

The license is MIT, meaning you can use or adapt the code freely. This is a study and reference resource, not a library meant to be imported into other projects.

Where it fits