{"id":18851473,"url":"https://github.com/heartsker/leetcode","last_synced_at":"2026-02-03T21:30:15.696Z","repository":{"id":39669436,"uuid":"507100287","full_name":"heartsker/leetcode","owner":"heartsker","description":null,"archived":false,"fork":false,"pushed_at":"2024-08-31T20:58:53.000Z","size":27,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-30T16:52:50.701Z","etag":null,"topics":["algorithms","hard","leetcode","leetcode-solutions","leetcode-swift","solutions"],"latest_commit_sha":null,"homepage":"","language":"Swift","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/heartsker.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-06-24T17:57:58.000Z","updated_at":"2024-08-31T20:58:57.000Z","dependencies_parsed_at":"2024-11-08T03:39:34.375Z","dependency_job_id":"f9cababa-d9c3-41f3-a979-d47566a46da9","html_url":"https://github.com/heartsker/leetcode","commit_stats":null,"previous_names":["heartsker/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heartsker%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heartsker%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heartsker%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/heartsker%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/heartsker","download_url":"https://codeload.github.com/heartsker/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239788306,"owners_count":19697174,"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":["algorithms","hard","leetcode","leetcode-solutions","leetcode-swift","solutions"],"created_at":"2024-11-08T03:34:52.868Z","updated_at":"2026-02-03T21:30:15.651Z","avatar_url":"https://github.com/heartsker.png","language":"Swift","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCodeSolutions-Hard\n\nLeetCode is a very popular resourse to upgrade your skill in solving algorithmic problems\n\nAnd the most interesting ones are the hardest ones\n\nYou can find these problems [here](https://leetcode.com/problemset/algorithms/?difficulty=HARD\u0026page=1)\n\n---\n\nIn this repo you can find my solutions for LeetCode Problems\n\nFor your convenience, here is a table of contents:\n\n- [4. Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0004_Median_of_Two_Sorted_Arrays.swift)\n\n- [10. Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0010_Regular_Expression_Matching.swift)\n\n- [23. Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0023_Merge_k_Sorted_Lists.swift)\n\n- [25. Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/25_Reverse_Nodes_in_k-Group.swift)\n    \n- [30. Substring with Concatenation of All Words](https://leetcode.com/problems/substring-with-concatenation-of-all-words/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/0030_Substring_with_Concatenation_of_All_Words.swift)\n\n- [1526. Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)\n    - [Solution](https://github.com/heartsker/LeetCodeSolutions-Hard/blob/main/1526_Minimum_Number_of_Increments_on_Subarrays_to_Form_a_Target_Array)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fheartsker%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fheartsker%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fheartsker%2Fleetcode/lists"}