{"id":19016933,"url":"https://github.com/shivam010/daily-coding-problem","last_synced_at":"2025-04-23T02:45:44.979Z","repository":{"id":57558715,"uuid":"293162886","full_name":"Shivam010/daily-coding-problem","owner":"Shivam010","description":"Solving one problem every day. Problem selection is based on the Daily Coding Problem newsletter","archived":false,"fork":false,"pushed_at":"2022-05-25T19:40:44.000Z","size":619,"stargazers_count":18,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-29T21:21:50.018Z","etag":null,"topics":["algorithms","c-plus-plus","coding","coding-interviews","competitive-programming","daily","daily-coding-problem","data-structures","golang","interview","interview-questions","python","tree"],"latest_commit_sha":null,"homepage":"https://www.dailycodingproblem.com/","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Shivam010.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-09-05T22:19:29.000Z","updated_at":"2024-10-30T11:34:37.000Z","dependencies_parsed_at":"2022-09-15T19:00:43.617Z","dependency_job_id":null,"html_url":"https://github.com/Shivam010/daily-coding-problem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shivam010%2Fdaily-coding-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shivam010%2Fdaily-coding-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shivam010%2Fdaily-coding-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Shivam010%2Fdaily-coding-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Shivam010","download_url":"https://codeload.github.com/Shivam010/daily-coding-problem/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":249318971,"owners_count":21250444,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","c-plus-plus","coding","coding-interviews","competitive-programming","daily","daily-coding-problem","data-structures","golang","interview","interview-questions","python","tree"],"created_at":"2024-11-08T19:45:03.572Z","updated_at":"2025-04-17T05:31:51.917Z","avatar_url":"https://github.com/Shivam010.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003c!-- This file is auto generated by Github Actions --\u003e\n\u003c!-- Do not edit this file manually, your changes will be overwritten --\u003e\nDaily Coding Problem\n====================\n[![Script](https://github.com/Shivam010/daily-coding-problem/workflows/Script/badge.svg)](https://github.com/Shivam010/daily-coding-problem/actions?query=workflow%3AScript)\n[![Cron](https://github.com/Shivam010/daily-coding-problem/workflows/Cron/badge.svg)](https://github.com/Shivam010/daily-coding-problem/actions?query=workflow%3ACron)\n[![Greetings](https://github.com/Shivam010/daily-coding-problem/workflows/Greetings/badge.svg)](https://github.com/Shivam010/daily-coding-problem/actions?query=workflow%3AGreetings)\n[![Days](https://img.shields.io/badge/since-85%20days-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n[![Problems Solved](https://img.shields.io/badge/problems-67%20solved-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n[![Problems Missed](https://img.shields.io/badge/problems-21%20missed-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\u003cbr\u003e\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues/new)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n[![Python](https://img.shields.io/badge/solution-Python-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem)\n\n\u003e _People find their paths in the strangest of ways._\n\nOn _`September 03, 2020`_, I found this website [Daily Coding Problem](https://www.dailycodingproblem.com/), where you can subscribe\nto a newsletter and get one problem a day. I like the initiative: Solving one problem every day.\n\nAlso, after college, the daily job cycle began, which led to my breakup with competitive programming. But I wanted to start\nsolving problems again to keep it up, but could never begin.\n\nSo, I decided to subscribe the newsletter and to solve one problem every day. \u003cbr\u003e\nSince then I have solved _**`#67 problems`**_.\nYou can find the problems and solutions in their directories: [here](https://github.com/Shivam010/daily-coding-problem).\n\nSolutions are mainly in _**C++ and Golang**_, and some problems may\nalso have _**Python**_ solution too, depending on what is asked in question.\n\n\u003e _Checkout my blog post on my habit of solving a problem daily [here](https://medium.com/coderbyte/solving-a-problem-every-day-a6de133a9254)_\n\n_Want to join me? or Just need to stay upto date? \u003cbr\u003e\n**Start watching this repository or connect with me.**_\n\n_And if you want to **review my solutions** or want to **add something**, I am open for accepting PRs, code reviews.\n\u003cbr\u003e\nAnything you feel that needs correction._\n\n\n**Next problem:\n\u0026nbsp; `#089`**\n\u003cbr\u003e\n**Missed problems:\n\u0026nbsp; `#068`\n    \u0026nbsp; • \u0026nbsp; `#069`\n    \u0026nbsp; • \u0026nbsp; `#070`\n    \u0026nbsp; • \u0026nbsp; `#071`\n    \u0026nbsp; • \u0026nbsp; `#072`\n    \u0026nbsp; • \u0026nbsp; `#073`\n    \u0026nbsp; • \u0026nbsp; `#074`\n    \u0026nbsp; • \u0026nbsp; `#075`\n    \u0026nbsp; • \u0026nbsp; `#076`\n    \u0026nbsp; • \u0026nbsp; `#077`\n    \u0026nbsp; • \u0026nbsp; `#078`\n    \u0026nbsp; • \u0026nbsp; `#079`\n    \u0026nbsp; • \u0026nbsp; `#080`\n    \u0026nbsp; • \u0026nbsp; `#081`\n    \u0026nbsp; • \u0026nbsp; `#082`\n    \u0026nbsp; • \u0026nbsp; `#083`\n    \u0026nbsp; • \u0026nbsp; `#084`\n    \u0026nbsp; • \u0026nbsp; `#085`\n    \u0026nbsp; • \u0026nbsp; `#086`\n    \u0026nbsp; • \u0026nbsp; `#087`\n    \u0026nbsp; • \u0026nbsp; `#088`**\n\n\n\u003c!-- Do not edit. To add more problems, add them in `./note-worthy` file --\u003e\nSome of the worthy problems I have solved are listed here...\n\nProblem: \u0026nbsp;`#010`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/010/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](001-050/010/go/code.go)\n[![Python](https://img.shields.io/badge/solution-Python-brightgreen?style=plastic)](001-050/010/python/code.py)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: September 12, 2020_\u003cbr\u003e\nThis problem was asked by Apple.\n\nImplement a _**job scheduler**_ which takes in a function f and an integer n, and\ncalls f after n milliseconds.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/010/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](001-050/010/go/code.go)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Python](001-050/010/python/code.py)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#052`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](051-100/052/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](051-100/052/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 24, 2020_\u003cbr\u003e\nThis problem was asked by Google.\n\nImplement an _**LRU (Least Recently Used) caching**_ system. It should be able to be\ninitialized with a cache size `n`, and contain the following methods:\n\n`set(key, value)`: sets key to value. If there are already n items in the cache\nand we are adding a new item, then it should also remove the least recently used\nitem.\n\n`get(key)`: gets the value at key. If no such key exists, return null. Each\noperation should run in `O(1)` time.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](051-100/052/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](051-100/052/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#067`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](051-100/067/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: November 08, 2020_\u003cbr\u003e\nThis problem was asked by Google.\n\nImplement an _**LFU (Least Frequently Used) caching**_ system. It should be able to be\ninitialized with a cache size `n`, and contain the following methods:\n\n`set(key, value)`: sets key to value. If there are already n items in the cache\nand we are adding a new item, then it should also remove the least frequently used\nitem. If there is a tie, then the least recently used key should be removed.\n\n`get(key)`: gets the value at key. If no such key exists, return null. Each\noperation should run in `O(1)` time.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](051-100/067/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#011`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/011/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](001-050/011/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: September 13, 2020_\u003cbr\u003e\nThis problem was asked by Twitter.\n\nImplement an _**autocomplete system**_. That is, given a query string s and a set of\nall possible query strings, return all strings in the set that have s as a\nprefix.\n\nFor example, given the query string `de` and the set of strings `[dog, deer,\ndeal]`, return `[deer, deal]`.\n\nHint: Try preprocessing the dictionary into a more efficient data structure to\nspeed up queries.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/011/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](001-050/011/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#059`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](051-100/059/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 31, 2020_\u003cbr\u003e\nThis problem was asked by Google.\n\nImplement a file syncing algorithm for two computers over a low-bandwidth network. What if we know the files in the two\ncomputers are mostly the same?\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](051-100/059/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#015`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/015/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](001-050/015/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: September 17, 2020_\u003cbr\u003e\nThis problem was asked by Facebook.\n\nGiven a stream of elements too large to store in memory, pick a random element\nfrom the stream with uniform probability.\u003cbr\u003e i.e. _**UniformSelection**_\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/015/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](001-050/015/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#055`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](051-100/055/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](051-100/055/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 27, 2020_\u003cbr\u003e\nThis problem was asked by Microsoft.\n\nImplement a URL shortener with the following methods:\n\n- `shorten(url)`, which shortens the url into a six-character alphanumeric\nstring, such as `zLg6wl`.\n- `restore(short)`, which expands the shortened string into the original url. If\nno such shortened string exists, return null.\n\nHint: What if we enter the same URL twice?\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](051-100/055/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](051-100/055/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#024`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/024/c++/code.cpp)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: September 26, 2020_\u003cbr\u003e\nThis problem was asked by Google.\n\nImplement locking in a binary tree. A binary tree node can be locked or unlocked\nonly if all of its descendants or ancestors are not locked.\n\nDesign a binary tree node class with the following methods:\n\n- `is_locked`, which returns whether the node is locked.\n- `lock`, which attempts to lock the node. If it cannot be locked, then it\nshould return false. Otherwise, it should lock it and return true.\n- `unlock`, which unlocks the node. If it cannot be unlocked, then it should\nreturn false. Otherwise, it should unlock it and return true.\n\nYou may augment the node to add parent pointers or any other property you would\nlike. You may assume the class is used in a single-threaded program, so there is\nno need for actual locks or mutexes. Each method should run in `O(h)`, where `h`\nis the height of the tree.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/024/c++/code.cpp)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#045`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/045/c++/code.cpp)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](001-050/045/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 17, 2020_\u003cbr\u003e\nThis problem was asked by Two Sigma.\n\nUsing a function `rand5()` that returns an integer from `1 to 5 (inclusive)`\nwith uniform probability, implement a function `rand7()` that returns an integer\nfrom `1 to 7 (inclusive)`.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/045/c++/code.cpp)\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](001-050/045/go/code.go)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#022`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/022/c++/code.cpp)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: September 24, 2020_\u003cbr\u003e\nThis problem was asked by Microsoft.\n\nGiven a dictionary of words and a string made up of those words (no spaces),\nreturn the original sentence in a list. If there is more than one possible\nreconstruction, return any of them. If there is no possible reconstruction, then\nreturn null.\n\nFor example, given the set of words `'quick', 'brown', 'the', 'fox'`, and the\nstring `\"thequickbrownfox\"`, you should return `['the', 'quick', 'brown', 'fox']`.\n\nGiven the set of words `'bed', 'bath', 'bedbath', 'and', 'beyond'`, and the string\n`\"bedbathandbeyond\"`, return either `['bed', 'bath', 'and', 'beyond]` or `['bedbath',\n'and', 'beyond']`\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/022/c++/code.cpp)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#039`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![C++](https://img.shields.io/badge/solution-C++-brightgreen?style=plastic)](001-050/039/c++/code.cpp)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 11, 2020_\u003cbr\u003e\nThis problem was asked by Dropbox _(System Design)_.\n\n_**Conway's Game of Life**_ takes place on an infinite two-dimensional board of square\ncells. Each cell is either dead or alive, and at each tick, the following rules\napply:\n\nAny live cell with less than two live neighbours dies.\nAny live cell with two or three live neighbours remains living.\nAny live cell with more than three live neighbours dies.\nAny dead cell with exactly three live neighbours becomes a live cell.\nA cell neighbours another cell if it is horizontally, vertically, or diagonally\nadjacent.\n\nImplement Conway's Game of Life. It should be able to be initialized with a\nstarting list of live cell coordinates and the number of steps it should run\nfor. Once initialized, it should print out the board state at each step. Since\nit's an infinite board, print out only the relevant coordinates, i.e. from the\ntop-leftmost live cell to bottom-rightmost live cell.\n\nYou can represent a live cell with an asterisk `(*)` and a dead cell with a dot\n`(.)`.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [C++](001-050/039/c++/code.cpp)\u003cbr\u003e\n\n\nProblem: \u0026nbsp;`#056`\n------------\n[![Open for Review](https://img.shields.io/badge/open-for%20reviews-brightgreen?style=plastic)](https://github.com/Shivam010/daily-coding-problem/issues)\n[![Golang](https://img.shields.io/badge/solution-Golang-brightgreen?style=plastic)](051-100/056/go/code.go)\n[![MIT License](https://img.shields.io/github/license/Shivam010/daily-coding-problem?style=plastic)](https://github.com/Shivam010/daily-coding-problem/blob/master/LICENSE)\n\n_Date: October 28, 2020_\u003cbr\u003e\nThis problem was asked by Google.\n\nGiven an undirected graph represented as an adjacency matrix and an integer `k`,\nwrite a function to determine whether each vertex in the graph can be colored\nsuch that no two adjacent vertices share the same color using at most k colors.\n\n**Solution(s)**:\u003cbr\u003e\n    \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp;\n    • [Golang](051-100/056/go/code.go)\u003cbr\u003e\n\n\n\n\n[]()\n-----\n\u003cp align=\"center\"\u003e\n    \u003cb\u003e\u003ci\u003e\n\t    People find their paths in the strangest of ways. Let's find our own! \u003cbr\u003e\n\t    Let's connect \u003ca href=\"https://shivam010.in\"\u003ehere\u003c/a\u003e.\n\t\u003c/i\u003e\u003c/b\u003e\n\u003c/p\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshivam010%2Fdaily-coding-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshivam010%2Fdaily-coding-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshivam010%2Fdaily-coding-problem/lists"}