{"id":19011521,"url":"https://github.com/codeabinash/leetcode-solutions","last_synced_at":"2025-04-22T23:26:54.597Z","repository":{"id":53569787,"uuid":"521361432","full_name":"codeAbinash/leetcode-solutions","owner":"codeAbinash","description":"Solutions of leetcode problems","archived":false,"fork":false,"pushed_at":"2024-11-19T10:11:44.000Z","size":646,"stargazers_count":13,"open_issues_count":0,"forks_count":4,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-04-17T16:03:12.716Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://leetcode-solutions-delta.vercel.app","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/codeAbinash.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":"2022-08-04T17:42:37.000Z","updated_at":"2025-01-01T08:25:51.000Z","dependencies_parsed_at":"2023-10-16T10:54:52.690Z","dependency_job_id":"1bdf2e90-93a7-406f-88d7-b2c5f33fd7ae","html_url":"https://github.com/codeAbinash/leetcode-solutions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeAbinash%2Fleetcode-solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeAbinash%2Fleetcode-solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeAbinash%2Fleetcode-solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeAbinash%2Fleetcode-solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codeAbinash","download_url":"https://codeload.github.com/codeAbinash/leetcode-solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":250339311,"owners_count":21414337,"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-08T19:14:41.852Z","updated_at":"2025-04-22T23:26:54.577Z","avatar_url":"https://github.com/codeAbinash.png","language":"C++","readme":"# Leetcode Solutions\n\n[Live Website](https://codeabinash.github.io/leetcode-solutions-web/)\n\n\u003ca href=\"https://codeabinash.github.io/leetcode-solutions-web/\" target=\"_blank\"\u003e\n\u003cp align=\"center\" width=\"100%\"\u003e\n    \u003cimg width=\"100%\" src=\"https://codeabinash.github.io/leetcode-solutions-web/images/banner-md.jpg\"\u003e\n\u003c/p\u003e\n\u003c/a\u003e\n\n## Installation\n\nFork this repo then do following things\n\n```bash\n$ git clone \"https://github.com/YOUR_USER_NAME/leetcode-solutions.git\"\n$ cd \"leetcode-solutions\"\n$ cd \"files/problems\"\n```\n\nInside the problems directory make your language directory (e.g. `c`, `py`, `cpp`) then create a file and paste your code, make sure your solution name match our [Code of Contribution](#code-contribution)\n\n# Code Contribution\n\n- Use meaningful variables name, because we don't know whats x and y you are using.\n- Leave a comment if you think your code `could be` hard to understand.\n- Your code must have Runtime and Space complexity.\n- Leave your social in the solution, it will help people connect with other people\n\nExample of valid solution naming:\n\n```\n1. two-sum.py\n2. move-zeros.py\n3. search-in-sorted-array.py\n4. two-sum-II.py\n```\n\nExample of valid function with valid naming:\n\n```python\nFILE: two-sum.py\n\n@USER_NAME\nTime: O(n)\nSpace: O(n); where n is the number elements present in the array\n\ndef two_sum(numArr, target):\n    seen = {}\n    for idx, val in enumerate(numArr): # loop with index, value\n        compliment = target - val\n        if compliment in seen:\n            return [seen[compliment], idx] \n        seen[val] = idx\n\n    return [-1, -1]\n\n```\n\n---\n\n\u003e ## Be a contributor\n\u003e\n\u003e Even if you have edited this README.md file or have just added one line of code, you are a contributor and you have helped the community, leave your name inside the [contributors.md](contributors.md) with your socials.\n\nHappy Coding!\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeabinash%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodeabinash%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeabinash%2Fleetcode-solutions/lists"}