{"id":16104856,"url":"https://github.com/dbc2201/towerofhanoi","last_synced_at":"2025-06-19T22:38:36.600Z","repository":{"id":133012052,"uuid":"510139604","full_name":"dbc2201/TowerOfHanoi","owner":"dbc2201","description":null,"archived":false,"fork":false,"pushed_at":"2022-07-08T21:57:02.000Z","size":10,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-06T02:32:29.433Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","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/dbc2201.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":"2022-07-03T21:31:01.000Z","updated_at":"2024-02-02T14:35:45.000Z","dependencies_parsed_at":null,"dependency_job_id":"af15ca8a-8491-4f1c-8a83-50a64ecee6cc","html_url":"https://github.com/dbc2201/TowerOfHanoi","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dbc2201/TowerOfHanoi","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbc2201%2FTowerOfHanoi","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbc2201%2FTowerOfHanoi/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbc2201%2FTowerOfHanoi/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbc2201%2FTowerOfHanoi/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dbc2201","download_url":"https://codeload.github.com/dbc2201/TowerOfHanoi/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dbc2201%2FTowerOfHanoi/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260844859,"owners_count":23071653,"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-10-09T19:06:43.219Z","updated_at":"2025-06-19T22:38:31.587Z","avatar_url":"https://github.com/dbc2201.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Tower of Hanoi\n\n## Java Programming Course\n\n---\n\n**Course 1**: Problem-Solving and Computational Thinking using Java\n\n**Sprint 7**: Implementing Recursion\n\n---\n\nProblem Statement\n---\n\nWrite a program in Java to calculate the minimum number of steps required to solve the Tower of Hanoi problem for `n`\ndisks.\n\n---\n\nTask\n---\n\n1. Open the [source code file](src/main/java/io/github/dbc/TowerOfHanoiSolver.java) and complete the code.\n2. Open the [test case file](src/test/java/io/github/dbc/TowerOfHanoiSolverTest.java) and run the test cases to\n   check your code.\n\n---\n\nFun Resource\n---\n\n1. [Tower of Hanoi Animation by Y. Daniel Liang](https://yongdanielliang.github.io/animation/web/TowerOfHanoi.html)\n2. [Tower of Hanoi - Math is Fun](https://www.mathsisfun.com/games/towerofhanoi.html)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbc2201%2Ftowerofhanoi","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdbc2201%2Ftowerofhanoi","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdbc2201%2Ftowerofhanoi/lists"}