# shomali11/go-interview

**Attribution required: if you use, quote, or summarise this content, you must credit and link back to [awesome-repositories.com](https://awesome-repositories.com/repository/shomali11-go-interview).**

4,691 stars · 482 forks · Go · mit

## Links

- GitHub: https://github.com/shomali11/go-interview
- awesome-repositories: https://awesome-repositories.com/repository/shomali11-go-interview.md

## Topics

`answer` `go` `golang` `interview` `question`

## Description

This project is a Go algorithm implementation library designed for technical interview preparation. It provides a collection of common data structures and algorithmic solutions to help practice for software engineering coding assessments.

The library includes a custom data structure collection featuring linked lists, stacks, queues, trees, and hash maps. It also implements specific algorithmic solutions, such as A* pathfinding for calculating the shortest path between nodes and a real-time stream processor for computing moving averages and running medians from continuous data inputs.

## Tags

### Software Engineering & Architecture

- [Algorithmic Problem Solving](https://awesome-repositories.com/f/software-engineering-architecture/algorithmic-problem-solving.md) — Provides a collection of algorithmic solutions specifically designed for technical interview and coding assessment preparation. ([source](https://cdn.jsdelivr.net/gh/shomali11/go-interview@master/README.md))
- [Linked Data Structures](https://awesome-repositories.com/f/software-engineering-architecture/linked-data-structures.md) — Implements fundamental pointer-based structures like linked lists for efficient data organization.
- [Median Tracking](https://awesome-repositories.com/f/software-engineering-architecture/heaps/median-tracking.md) — Implements a two-heap system to track the running median of a continuous data input.
- [Priority Queues](https://awesome-repositories.com/f/software-engineering-architecture/queue-implementations/priority-queues.md) — Utilizes priority queues to manage and track the lowest-cost nodes during pathfinding.

### Education & Learning Resources

- [Algorithm Implementations](https://awesome-repositories.com/f/education-learning-resources/educational-resources/algorithms-theory-academics/cs-theory-foundations/algorithms/general-collections-and-study/algorithm-implementations.md) — Provides practical code implementations of algorithms and design patterns for computational problems.
- [Technical Interview Preparation](https://awesome-repositories.com/f/education-learning-resources/technical-interview-preparation.md) — Offers a comprehensive set of resources and implementations for preparing for technical coding interviews.
- [Sliding Window Algorithms](https://awesome-repositories.com/f/education-learning-resources/sliding-window-algorithms.md) — Implements sliding window techniques to process contiguous data buffers for real-time metrics.

### Operating Systems & Systems Programming

- [Data Structures](https://awesome-repositories.com/f/operating-systems-systems-programming/data-structures.md) — Implements fundamental memory-based structures including linked lists, stacks, queues, and trees. ([source](https://cdn.jsdelivr.net/gh/shomali11/go-interview@master/README.md))

### Programming Languages & Runtimes

- [Algorithm Libraries](https://awesome-repositories.com/f/programming-languages-runtimes/algorithm-libraries.md) — A comprehensive library of common data structures and algorithms implemented in Go.

### Scientific & Mathematical Computing

- [Data Structure Implementations](https://awesome-repositories.com/f/scientific-mathematical-computing/data-structure-implementations.md) — Provides practical implementations of fundamental structures like linked lists, stacks, and hash maps.
- [Heuristic Graph Search Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/heuristic-graph-search-algorithms.md) — Implements graph traversal algorithms that use heuristic estimates to optimize pathfinding.
- [Shortest Path Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/algorithms/graph-processing/shortest-path-algorithms.md) — Provides algorithms to calculate the most efficient route between nodes in a graph. ([source](https://github.com/shomali11/go-interview/tree/master/algorithms/astar))
- [Pathfinding Algorithms](https://awesome-repositories.com/f/scientific-mathematical-computing/numerical-mathematical-foundations/algorithms-and-complexity/pathfinding-algorithms.md) — Implements graph traversal and pathfinding algorithms to find optimal routes.

### Data & Databases

- [Real-Time Data Processors](https://awesome-repositories.com/f/data-databases/data-processing-pipelines/data-processing/distributed-processing-frameworks/real-time-data-processors.md) — Implements a real-time data processor to ingest and transform streams for continuous analytics.
- [Stream Median Calculators](https://awesome-repositories.com/f/data-databases/data-processing-pipelines/stream-processing-systems/stream-processing/stream-median-calculators.md) — Implements specialized calculators for determining the median of a continuous number stream. ([source](https://cdn.jsdelivr.net/gh/shomali11/go-interview@master/README.md))
- [Stream Analytics](https://awesome-repositories.com/f/data-databases/stream-analytics.md) — Computes real-time moving averages and running medians from continuous data inputs.