{"id":18416795,"url":"https://github.com/fynv/norecursion","last_synced_at":"2025-04-13T03:17:36.153Z","repository":{"id":211713465,"uuid":"729797082","full_name":"fynv/NoRecursion","owner":"fynv","description":"Coding practice. Some DFS related questions","archived":false,"fork":false,"pushed_at":"2023-12-11T11:20:45.000Z","size":55,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-13T03:17:33.354Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/fynv.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-12-10T11:47:10.000Z","updated_at":"2023-12-10T11:48:27.000Z","dependencies_parsed_at":"2025-02-16T06:25:20.039Z","dependency_job_id":"7e87318d-cb70-4249-aea3-1dc829f3feeb","html_url":"https://github.com/fynv/NoRecursion","commit_stats":null,"previous_names":["fynv/norecursion"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fynv%2FNoRecursion","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fynv%2FNoRecursion/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fynv%2FNoRecursion/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fynv%2FNoRecursion/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/fynv","download_url":"https://codeload.github.com/fynv/NoRecursion/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248657913,"owners_count":21140846,"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":[],"created_at":"2024-11-06T04:07:20.550Z","updated_at":"2025-04-13T03:17:36.132Z","avatar_url":"https://github.com/fynv.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Coding Practice\n\nThe \"Rabbit Hole (Chapter 2)\" question from Meta Careers:\n\nhttps://www.metacareers.com/profile/coding_puzzles/?puzzle=254501763097320\n\nIt reminded me that there are some DFS based questions that are relatively tricky to code if you want to do them without using recursions.\n\n* dfs.cpp: just depth-first search\n* scc.cpp: compute strongly connected components using Kosaraju's algorithm (2 x dfs) and Tarjan's algorithm.\n* rabit_hole.cpp: a solution of the Rabbit Hole question (SCC + critical-path using topological sorting of DAG).\n\n\n## Rabbit Hole (Charpter 2) \n\nProblem description:\n\n![](screen.gif)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffynv%2Fnorecursion","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffynv%2Fnorecursion","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffynv%2Fnorecursion/lists"}