{"id":19998012,"url":"https://github.com/raj-roy/leetcode-two-sum","last_synced_at":"2025-10-14T04:25:05.314Z","repository":{"id":261181429,"uuid":"881748342","full_name":"raj-roy/leetcode-two-sum","owner":"raj-roy","description":null,"archived":false,"fork":false,"pushed_at":"2024-11-07T04:44:44.000Z","size":9,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"dev","last_synced_at":"2025-08-05T09:14:02.794Z","etag":null,"topics":["csharp","leetcode","solutions"],"latest_commit_sha":null,"homepage":"","language":"C#","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/raj-roy.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-11-01T06:21:51.000Z","updated_at":"2024-11-05T05:23:34.000Z","dependencies_parsed_at":"2024-11-05T06:23:42.690Z","dependency_job_id":"89a4b9a3-7f2e-47c3-a9bb-e0abdd0b22d3","html_url":"https://github.com/raj-roy/leetcode-two-sum","commit_stats":null,"previous_names":["raj-roy/leetcode-two-sum"],"tags_count":0,"template":false,"template_full_name":"raj-roy/leetcode-template","purl":"pkg:github/raj-roy/leetcode-two-sum","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raj-roy%2Fleetcode-two-sum","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raj-roy%2Fleetcode-two-sum/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raj-roy%2Fleetcode-two-sum/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raj-roy%2Fleetcode-two-sum/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/raj-roy","download_url":"https://codeload.github.com/raj-roy/leetcode-two-sum/tar.gz/refs/heads/dev","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raj-roy%2Fleetcode-two-sum/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279017947,"owners_count":26086213,"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","status":"online","status_checked_at":"2025-10-14T02:00:06.444Z","response_time":60,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["csharp","leetcode","solutions"],"created_at":"2024-11-13T05:06:52.625Z","updated_at":"2025-10-14T04:25:05.299Z","avatar_url":"https://github.com/raj-roy.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Two Sum\n\n## Porblem Statement\nGiven an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.\nYou may assume that each input would have exactly one solution, and you may not use the same element twice.\nYou can return the answer in any order.\n\n## Explanation\n**Example 1:**\n**Input**: nums = [2,7,11,15], target = 9\n**Output**: [0,1]\n**Explanation**: Because nums[0] + nums[1] == 9, we return [0, 1].\n\n**Example 2:**\n**Input**: nums = [3,2,4], target = 6\n**Output**: [1,2]\n\n**Example 3:**\n**Input**: nums = [3,3], target = 6\n**Output**: [0,1]\n \n**Constraints:**\n- 2 \u003c= nums.length \u003c= 104\n- -109 \u003c= nums[i] \u003c= 109\n- -109 \u003c= target \u003c= 109\n- Only one valid answer exists.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraj-roy%2Fleetcode-two-sum","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraj-roy%2Fleetcode-two-sum","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraj-roy%2Fleetcode-two-sum/lists"}