{"id":26537411,"url":"https://github.com/mbeps/two_sums","last_synced_at":"2025-03-21T22:29:58.244Z","repository":{"id":265888425,"uuid":"650615989","full_name":"mbeps/Two_Sums","owner":"mbeps","description":null,"archived":false,"fork":false,"pushed_at":"2023-06-07T12:49:20.000Z","size":0,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-15T07:54:51.055Z","etag":null,"topics":["leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","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/mbeps.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-06-07T12:49:17.000Z","updated_at":"2023-06-07T18:44:19.000Z","dependencies_parsed_at":"2024-12-01T11:40:29.125Z","dependency_job_id":null,"html_url":"https://github.com/mbeps/Two_Sums","commit_stats":null,"previous_names":["mbeps/two_sums"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbeps%2FTwo_Sums","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbeps%2FTwo_Sums/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbeps%2FTwo_Sums/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbeps%2FTwo_Sums/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mbeps","download_url":"https://codeload.github.com/mbeps/Two_Sums/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244879471,"owners_count":20525422,"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":["leetcode-python","leetcode-solutions"],"created_at":"2025-03-21T22:29:57.775Z","updated_at":"2025-03-21T22:29:58.219Z","avatar_url":"https://github.com/mbeps.png","language":"Python","readme":"# **1. Two Sum**\nGiven an array of integers `nums` and an integer `target`, return indices of the two numbers such that they add up to `target`.\n\nYou may assume that each input would have **exactly one solution**, and you may not use the same element twice.\n\nYou can return the answer in any order.\n\n\n**Example 1:**\n\n```\nInput: nums = [2,7,11,15], target = 9\nOutput: [0,1]\nExplanation: Because nums[0] + nums[1] == 9, we return [0, 1].\n```\n\n**Example 2:**\n\n```\nInput: nums = [3,2,4], target = 6\nOutput: [1,2]\n```\n\n**Example 3:**\n\n```\nInput: nums = [3,3], target = 6\nOutput: [0,1]\n```\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.**\n\n**Source:** https://leetcode.com/problems/two-sum/description/","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbeps%2Ftwo_sums","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmbeps%2Ftwo_sums","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbeps%2Ftwo_sums/lists"}