{"id":23272379,"url":"https://github.com/letsdeepchat/hrecurs---hello-recursion","last_synced_at":"2026-01-19T05:33:21.108Z","repository":{"id":153852849,"uuid":"441931561","full_name":"letsdeepchat/HRECURS---Hello-Recursion","owner":"letsdeepchat","description":null,"archived":false,"fork":false,"pushed_at":"2021-12-26T16:11:25.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-04-06T09:52:54.130Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":null,"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/letsdeepchat.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":"2021-12-26T16:09:04.000Z","updated_at":"2021-12-26T16:11:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"91dfcaac-6a5b-4e7b-b562-a8ca64a86012","html_url":"https://github.com/letsdeepchat/HRECURS---Hello-Recursion","commit_stats":null,"previous_names":["letsdeepchat/hrecurs---hello-recursion"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/letsdeepchat/HRECURS---Hello-Recursion","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FHRECURS---Hello-Recursion","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FHRECURS---Hello-Recursion/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FHRECURS---Hello-Recursion/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FHRECURS---Hello-Recursion/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/letsdeepchat","download_url":"https://codeload.github.com/letsdeepchat/HRECURS---Hello-Recursion/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/letsdeepchat%2FHRECURS---Hello-Recursion/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28561858,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-19T03:31:16.861Z","status":"ssl_error","status_checked_at":"2026-01-19T03:31:15.069Z","response_time":67,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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-12-19T19:15:14.218Z","updated_at":"2026-01-19T05:33:21.094Z","avatar_url":"https://github.com/letsdeepchat.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# HRECURS---Hello-Recursion\n\nHRECURS - Hello Recursion\nYou will be given an array of N integers. Write a recursive function to calculate its summation.\n\n####Input\n\nInput starts with an integer T (T ≤ 100), the number of test cases.\n\nEach of the next T lines will start with an integer N (1 \u003c= N \u003c= 100), number of integers followed by N space separated. Each of these N integers will be between -1000 and 1000 (inclusive).\n\n####Output For each test case, output one line in the format “Case x: a” (quotes for clarity), where x is the case number and a is the summation of the integers.\n\nSample Input\n\nInput:\n\n2\n\n5 10 5 -2 3 0\n\n3 100 -10 34\n\nSample Output\n\nOutput:\n\nCase 1: 16\n\nCase 2: 124\n\nExplanation\nYou just have to get the sum, which is an easy in task iteratively. Try it recursively.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsdeepchat%2Fhrecurs---hello-recursion","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fletsdeepchat%2Fhrecurs---hello-recursion","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fletsdeepchat%2Fhrecurs---hello-recursion/lists"}