go-daily-coding-problem

KO | EN

gitlite — search

#typescript #ai-agents #ai #dsh-plugin #deepseek-harness #open-source #cli #claude-code #codex #developer-tools #react #windows

go-daily-coding-problem

★ 4 Open GitHub ↗

Solutions for Daily Coding Problem, written in Go

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Go Daily Coding Problem

[![Action Status](https://github.com/TipsyPixie/go-daily-coding-problem/workflows/Go%20Test/badge.svg)](https://github.com/TipsyPixie/go-daily-coding-problem/actions)
[![Go Report Card](https://goreportcard.com/badge/github.com/TipsyPixie/go-daily-coding-problem)](https://goreportcard.com/report/github.com/TipsyPixie/go-daily-coding-problem)
[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)

Solutions for [Daily Coding Problem](https://www.dailycodingproblem.com/ "Daily Coding Problem"), written in Go

## Requirements

- Go >= 1.17

## Getting Started

Run `make test` to test the solutions.

```bash
make test # test all
```

## Problems

| Number            | Difficulty | Asked By    | Title                                                        |
|-------------------|------------|-------------|--------------------------------------------------------------|
| [#1](problem001)  | EASY       | Google      | Finding 2 numbers that adds up to k                          |
| [#2](problem002)  | HARD       | Uber        | Array multiplication                                         |
| [#3](problem003)  | MEDIUM     | Google      | Tree serialization                                           |
| [#4](problem004)  | HARD       | Stripe      | Finding lowest positive number                               |
| [#5](problem005)  | MEDIUM     | Jane Street | Lisp pair operations                                         |
| [#6](problem006)  | HARD       | Google      | XOR linked list                                              |
| [#7](problem007)  | MEDIUM     | Facebook    | Message encoding                                             |
| [#8](problem008)  | EASY       | Google      | Counting unival tree                                         |
| [#9](problem009)  | HARD       | Airbnb      | Finding the largest sum of non-adjacent numbers              |
| [#10](problem010) | MEDIUM     | Apple       | Job scheduler                                                |
| [#11](problem011) | MEDIUM     | Twitter     | Text autocompletion                                          |
| [#12](problem012) | HARD       | Amazon      | Climbing stairs                                              |
| [#13](problem013) | HARD       | Amazon      |                                                              |
| [#14](problem014) | MEDIUM     | Google      |                                                              |
| [#15](problem015) | MEDIUM     | Facebook    |                                                              |
| [#16](problem016) | EASY       | Twitter     |                                                              |
| [#17](problem017) | HARD       | Google      |                                                              |
| [#18](problem018) | HARD       | Google      |                                                              |
| [#19](problem019) | MEDIUM     | Facebook    |                                                              |
| [#20](problem020) | EASY       | Google      |                                                              |
| [#21](problem021) | EASY       | Snapchat    |                                                              |
| [#22](problem022) | MEDIUM     | Microsoft   |                                                              |
| [#23](problem023) | EASY       | Google      |                                                              |
| [#24](problem024) | MEDIUM     | Google      |                                                              |
| [#25](problem025) | HARD       | Facebook    |                                                              |
| [#26](problem026) | MEDIUM     | Google      |                                                              |
| [#27](problem027) | EASY       | Facebook    |                                                              |
| [#28](problem028) | MEDIUM     | Palantir    |                                                              |
| [#29](problem029) | EASY       | Amazon      |                                                              |
| [#30](problem030) | MEDIUM     | Facebook    |                                                              |
| [#31](problem031) | EASY       | Google      |                                                              |
| [#32](problem032) | HARD       | Jane Street |                                                              |
| [#33](problem033) | EASY       | Microsoft   |                                                              |
| [#34](problem034) | MEDIUM     | Quora       |                                                              |
| [#35](problem035) | HARD       | Google      | Segregating R, G, and Bs in linear time                      |
| [#36](problem036) | MEDIUM     | Dropbox     | Finding the second largest node in BST                       |
| [#37](problem037) | EASY       | Google      | Generating the power set of a set                            |
| [#38](problem038) | HARD       | Microsoft   | Arranging N queens without threatening one another           |
| [#39](problem039) | MEDIUM     | Dropbox     | Conway's Game of Life                                        |
| [#40](problem040) | HARD       | Google      | Finding the non-duplicated number                            |
| [#41](problem041) | MEDIUM     | Facebook    | Finding full itinerary from a list of flights                |
| [#42](problem042) | HARD       | Google      | Finding a subset of S that adds up to k                      |
| [#43](problem043) | EASY       | Amazon      | Implementing Stack                                           |
| [#44](problem044) | MEDIUM     | Google      | Counting inversions in a list of numbers                     |
| [#45](problem045) | EASY       | Two Sigma   | Writing rand function                                        |
| [#46](problem046) | HARD       | Amazon      | Finding the longest palindromic substring                    |
| [#47](problem047) | EASY       | Facebook    | Calculating maximum profit with chronological stock prices   |
| [#48](problem048) | MEDIUM     | Google      | Building a tree with given pre-order and in-order traversals |
| [#49](problem049) | MEDIUM     | Amazon      | Finding the maximum sum of contiguous subarray               |
| [#50](problem050) | EASY       | Microsoft   | Arithmetic binary tree                                       |
| [#51](problem051) | MEDIUM     | Facebook    | Card shuffle                                                 |
| [#52](problem052) | HARD       | Google      | LRU cache                                                    |
| [#53](problem053) | MEDIUM     | Apple       | Implementing a queue with 2 stacks                           |
| [#54](problem054) | HARD       | Dropbox     | Implementing a Sudoku solver                                 |
| [#55](problem055) | EASY       | Microsoft   | URL shortener                                                |
| [#56](problem056) | MEDIUM     | Google      | Map coloring                                                 |
| [#57](problem057) | MEDIUM     | Amazon      | Splitting string into lines of limited length                |
| [#58](problem058) | MEDIUM     | Amazon      | Search in rotated sorted array                               |
| [#59](problem059) | HARD       | Google      | Low bandwidth file synchronization                           |
| [#60](problem060) | MEDIUM     | Facebook    | Partitioning set by subtotals                                |
| [#61](problem061) | MEDIUM     | Google      | Faster pow operation                                         |
| [#62](problem062) | MEDIUM     | Facebook    | Couting methods to move down                                 |
| [#63](problem063) | EASY       | Microsoft   | Finding word left-to-right or up-to-down                     |
| [#64](problem064) | HARD       | Google      | Knight's tour on Chessboard                                  |
| [#65](problem065) | EASY       | Amazon      | Clockwise matrix traverse                                    |
| [#66](problem066) | MEDIUM     | Square      | Fair coin toss with a biased coin                            |
| [#67](problem067) | HARD       | Google      | LFU cache                                                    |

go-daily-coding-problem

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README