{"id":20604340,"url":"https://github.com/vkazakevich/leetcode","last_synced_at":"2025-03-06T16:48:04.872Z","repository":{"id":180239266,"uuid":"594824849","full_name":"vkazakevich/LeetCode","owner":"vkazakevich","description":"Leetcode solutions in Python 🐍 and TypeScript","archived":false,"fork":false,"pushed_at":"2023-11-23T16:47:32.000Z","size":11,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-17T02:14:57.398Z","etag":null,"topics":["leetcode","leetcode-javascript","leetcode-practice","leetcode-python","leetcode-python-solutions","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":false,"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/vkazakevich.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":"2023-01-29T18:49:26.000Z","updated_at":"2023-11-21T13:27:43.000Z","dependencies_parsed_at":"2024-11-16T09:22:25.223Z","dependency_job_id":"9f0e951f-3084-482a-ae2a-e868278cf299","html_url":"https://github.com/vkazakevich/LeetCode","commit_stats":null,"previous_names":["vkazakevich/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vkazakevich%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vkazakevich%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vkazakevich%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/vkazakevich%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/vkazakevich","download_url":"https://codeload.github.com/vkazakevich/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242250437,"owners_count":20096891,"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","leetcode-javascript","leetcode-practice","leetcode-python","leetcode-python-solutions","leetcode-solutions"],"created_at":"2024-11-16T09:22:16.655Z","updated_at":"2025-03-06T16:48:04.847Z","avatar_url":"https://github.com/vkazakevich.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"![Language](https://img.shields.io/badge/Language-Python3-orange.svg?logo=Python\u0026logoColor=yellow) ![Update](https://img.shields.io/badge/Update-Weekly-green.svg)\n\n# Python solution for LeetCode\n\nThe repository contains the best versions of my solutions to [LeetCode](https://leetcode.com/) problems using Python3 and TypeScript.\n\n## Solutions TypeScript\n\n| # | Title | Solution | Time | Space |\n|---| ----- | -------- | ---- | ----- |\n|1814|[Count Nice Pairs in an Array](https://leetcode.com/problems/contains-duplicate/)|[TypeScript](./Solutions/TypeScript/1814-count-nice-pairs-in-an-array.ts)|O(n)|O(n)|\n|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[TypeScript](./Solutions/TypeScript/2-add-two-numbers.ts)|O(n)|O(n)|\n\n## Solutions Python\n\n| # | Title | Solution | Time | Space |\n|---| ----- | -------- | ---- | ----- |\n|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|[Python](./Solutions/217-contains-duplicate.py)|O(n)|O(n)|\n|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[Python](./Solutions/53-maximum-subarray.py)|O(n)|O(1)|\n|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Python](./Solutions/1-two-sum.py)|O(n^2)|O(1)|\n|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[Python](./Solutions/88-merge-sorted-array.py)|O(n + k)|O(k)|\n|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Python](./Solutions/1480-running-sum-of-1d-array.py)|O(n)|O(1)|","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvkazakevich%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvkazakevich%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvkazakevich%2Fleetcode/lists"}