{"id":19078449,"url":"https://github.com/summerhf/leetcode-exercise","last_synced_at":"2026-06-22T13:31:30.038Z","repository":{"id":100144177,"uuid":"194514862","full_name":"SummerHF/LeetCode-Exercise","owner":"SummerHF","description":"Algorithm Exercise Recording","archived":false,"fork":false,"pushed_at":"2019-07-25T12:17:58.000Z","size":261,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-02-22T05:26:59.778Z","etag":null,"topics":["leetcode-questions","leetcode-solutions","leetcode-swift"],"latest_commit_sha":null,"homepage":null,"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/SummerHF.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":"2019-06-30T12:43:48.000Z","updated_at":"2021-10-19T20:21:19.000Z","dependencies_parsed_at":"2023-05-12T13:15:43.353Z","dependency_job_id":null,"html_url":"https://github.com/SummerHF/LeetCode-Exercise","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/SummerHF/LeetCode-Exercise","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SummerHF%2FLeetCode-Exercise","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SummerHF%2FLeetCode-Exercise/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SummerHF%2FLeetCode-Exercise/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SummerHF%2FLeetCode-Exercise/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/SummerHF","download_url":"https://codeload.github.com/SummerHF/LeetCode-Exercise/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/SummerHF%2FLeetCode-Exercise/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34651747,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"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":["leetcode-questions","leetcode-solutions","leetcode-swift"],"created_at":"2024-11-09T02:09:32.018Z","updated_at":"2026-06-22T13:31:30.011Z","avatar_url":"https://github.com/SummerHF.png","language":"Swift","funding_links":[],"categories":[],"sub_categories":[],"readme":"\n\n# LeetCode-Exercise\n\n\u003e Algorithm Exercise Recording\n\n# 1. Array\n\nTitle | Solution | Difficulty | Time | Space | Ideas Of Solving Problem\n---|---|---|---|---|----|\n[1.Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)| [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/SortArrByParity.playground/Contents.swift) | Easy | O(n) | O(1) | \n[2.Max Consecutive Ones](https://leetcode.com/problems/max-consecutive-ones/)| [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/MaxConsecutive.playground/Contents.swift)| Easy| O(n) | O(1) | \n[3.Heaters](https://leetcode.com/problems/heaters/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/Heaters.playground/Contents.swift) |Easy | O(nlogn) | O(1) | [Thinks](http://ww3.sinaimg.cn/large/006tNc79ly1g4knv9japzj30u00y4npd.jpg)\n[4.Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/NumberOfBoomerangs.playground/Contents.swift) | Easy| O(n\u003csup\u003e2\u003c/sup\u003e) | O(n) |\n[5.Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/IslandPerimeter.playground/Contents.swift) | Easy| O(nm) | O(1) | [Thinks](http://ww3.sinaimg.cn/large/006tNc79ly1g4mfucx8s0j306t06cwed.jpg)\n[6.Majority Element](https://leetcode.com/problems/majority-element/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/MajorityElement.playground/Contents.swift) | Easy| O(nm) | O(m) | \n[7.Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/MajorityElementII.playground/Contents.swift) | Easy| O(n) | O(1) | \n[8.First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/FirstMissingPositive.playground/Contents.swift) | Easy| O(n) | O(1) | \n[9.Intersection Of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/IntersectionOfTwoArrays.playground/Contents.swift) | Easy| O(n) | O(n) | \n[10.Intersection Of Two Arrays II](https://leetcode.com/problems/intersection-of-two-arrays-ii/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/IntersectionOfTwoArraysII.playground/Contents.swift) | Easy| O(n) | O(n) | \n[11.Contain Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/ContainDuplicate.playground/Contents.swift) | Easy| O(n) | O(n) | \n[12.Contain Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/ContainDuplicateII.playground/Contents.swift) | Easy| O(n) | O(m) | \n[13.Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/RemoveDuplicatesfromSortedArray.playground/Contents.swift) | Easy| O(n) | O(1) | \n[14.Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/RemoveDuplicatesfromSortedArrayII.playground/Contents.swift) | Easy| O(n) | O(1) | \n[15.Move Zeroes](https://leetcode.com/problems/move-zeroes/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/MoveZeroes.playground/Contents.swift) | Easy| O(n) | O(1) | \n[16.Move Element](https://leetcode.com/problems/remove-element/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/RemoveElement.playground/Contents.swift) | Easy| O(n) | O(1) | \n[17.Two Sum](https://leetcode.com/problems/two-sum/) | [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/Array/TwoSum.playground/Contents.swift) | Easy| O(n) | O(1) | \n\n# 2. String\n\nTitle | Solution | Difficulty | Time | Space | Ideas Of Solving Problem\n---|---|---|---|---|----|\n[1.Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/String/FizzBuzz.playground/Contents.swift) | Easy | O(n) | O(n) | \n\n# 3. List\n\nTitle | Solution | Difficulty | Time | Space | Ideas Of Solving Problem\n---|---|---|---|---|----|\n[1.Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| [Swift](https://github.com/SummerHF/LeetCode-Exercise/blob/master/List/ReverseLinkedList.playground/Contents.swift) | Easy | O(n) | O(1) | \n\n[Exercise](https://github.com/soapyigu/LeetCode-Swift#string)\n[Location](https://github.com/SummerHF/LeetCode-Exercise)\n[gif](https://github.com/azl397985856/leetcode)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsummerhf%2Fleetcode-exercise","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsummerhf%2Fleetcode-exercise","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsummerhf%2Fleetcode-exercise/lists"}