{"id":25519787,"url":"https://github.com/swiftyfinch/leetcode","last_synced_at":"2025-07-01T09:07:49.020Z","repository":{"id":104103860,"uuid":"314646519","full_name":"swiftyfinch/Leetcode","owner":"swiftyfinch","description":"🎓 Top 100 Interview Questions (10/100 Solved) ✅","archived":false,"fork":false,"pushed_at":"2020-11-30T16:21:19.000Z","size":31,"stargazers_count":4,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-21T00:08:12.848Z","etag":null,"topics":["algorithm-problem","algorithms","leetcode","leetcode-solutions","leetcode-swift"],"latest_commit_sha":null,"homepage":"https://leetcode.com/problemset/top-interview-questions/","language":"Swift","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/swiftyfinch.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}},"created_at":"2020-11-20T19:09:21.000Z","updated_at":"2023-11-28T00:17:03.000Z","dependencies_parsed_at":"2023-09-21T15:31:45.684Z","dependency_job_id":null,"html_url":"https://github.com/swiftyfinch/Leetcode","commit_stats":{"total_commits":15,"total_committers":2,"mean_commits":7.5,"dds":0.2666666666666667,"last_synced_commit":"65f905f6c7fe55dfd5959ff3c002f91fd5586d18"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/swiftyfinch/Leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/swiftyfinch%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/swiftyfinch%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/swiftyfinch%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/swiftyfinch%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/swiftyfinch","download_url":"https://codeload.github.com/swiftyfinch/Leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/swiftyfinch%2FLeetcode/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":262933317,"owners_count":23386784,"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":["algorithm-problem","algorithms","leetcode","leetcode-solutions","leetcode-swift"],"created_at":"2025-02-19T17:33:44.147Z","updated_at":"2025-07-01T09:07:48.992Z","avatar_url":"https://github.com/swiftyfinch.png","language":"Swift","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\n\n### 📖 [Top 100 Interview Questions](https://leetcode.com/problemset/top-interview-questions/) (10/100 Solved) ✅\n\n1. [Two Sum](\u003cTop 100 Interview Questions/Two Sum\u003e) (Easy)\n2. [Add Two Numbers](\u003cTop 100 Interview Questions/Add Two Numbers\u003e) (Medium)\n3. [Longest Substring Without Repeating Characters](\u003cTop 100 Interview Questions/Longest Substring Without Repeating Characters\u003e) (Medium)\n4. [Median of Two Sorted Arrays](\u003cTop 100 Interview Questions/Median of Two Sorted Arrays\u003e) (Hard)\n5. [Longest Palindromic Substring](\u003cTop 100 Interview Questions/Longest Palindromic Substring\u003e) (Medium)\n6. [Reverse Integer](\u003cTop 100 Interview Questions/Reverse Integer\u003e) (Easy)\n7. [String to Integer (atoi)](\u003cTop 100 Interview Questions/String to Integer (atoi)\u003e) (Medium)\n8. [Regular Expression Matching](\u003cTop 100 Interview Questions/Regular Expression Matching\u003e) (Hard)\n9. [Container With Most Water](\u003cTop 100 Interview Questions/Container With Most Water\u003e) (Medium)\n10. [Roman to Integer](\u003cTop 100 Interview Questions/Roman to Integer\u003e) (Easy)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fswiftyfinch%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fswiftyfinch%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fswiftyfinch%2Fleetcode/lists"}