{"id":18847687,"url":"https://github.com/henilp105/leetcode-obsidian","last_synced_at":"2026-03-07T22:32:14.185Z","repository":{"id":183180135,"uuid":"669734769","full_name":"henilp105/leetcode-obsidian","owner":"henilp105","description":"This repository holds leetcode solutions in Python3","archived":false,"fork":false,"pushed_at":"2024-06-29T12:58:50.000Z","size":56,"stargazers_count":3,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-12-13T11:44:03.314Z","etag":null,"topics":["leetcode","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","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/henilp105.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,"zenodo":null}},"created_at":"2023-07-23T08:57:31.000Z","updated_at":"2025-06-13T18:35:21.000Z","dependencies_parsed_at":null,"dependency_job_id":"7f11647c-dcea-4731-9e47-2f75ed560436","html_url":"https://github.com/henilp105/leetcode-obsidian","commit_stats":null,"previous_names":["henilp105/leetcode-obsidian"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/henilp105/leetcode-obsidian","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/henilp105%2Fleetcode-obsidian","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/henilp105%2Fleetcode-obsidian/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/henilp105%2Fleetcode-obsidian/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/henilp105%2Fleetcode-obsidian/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/henilp105","download_url":"https://codeload.github.com/henilp105/leetcode-obsidian/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/henilp105%2Fleetcode-obsidian/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30234584,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-07T19:01:10.287Z","status":"ssl_error","status_checked_at":"2026-03-07T18:59:58.103Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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","leetcode-python","leetcode-solutions"],"created_at":"2024-11-08T03:09:13.846Z","updated_at":"2026-03-07T22:32:14.136Z","avatar_url":"https://github.com/henilp105.png","language":"Python","readme":"# leetcode Obsidian\n\n## About\n\nThis repository includes my solutions to Leetcode questions. If you find my solutions hard to comprehend, give yourself a time to solve easier questions or check discussion section to problem on [LeetCode](https://leetcode.com/). Feel free to contact me for improvements :smiley:\n\n## List of Problems\n\n| Question number | Name | Solution link |\n| --- | --- | --- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/1.py) |\n| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/4.py) |\n| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/5.py) |\n| 8 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/8.py) |\n| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/10.py) |\n| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/12.py) |\n| 15 | [3Sum](https://leetcode.com/problems/3sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/15.py) |\n| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/16.py) |\n| 17 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/17.py) |\n| 18 | [4Sum](https://leetcode.com/problems/4sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/18.py) |\n| 19 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/19.py) |\n| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/22.py) |\n| 23 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/23.py) |\n| 24 | [Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/24.py) |\n| 25 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/25.py) |\n| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/27.py) |\n| 28 | [Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/28.py) |\n| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/29.py) |\n| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/31.py) |\n| 33 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/33.py) |\n| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/35.py) |\n| 38 | [Count and Say](https://leetcode.com/problems/count-and-say/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/38.py) |\n| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/41.py) |\n| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/48.py) |\n| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/50.py) |\n| 51 | [N-Queens](https://leetcode.com/problems/n-queens/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/51.py) |\n| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/53.py) |\n| 55 | [Jump Game](https://leetcode.com/problems/jump-game/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/55.py) |\n| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/56.py) |\n| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/59.py) |\n| 61 | [Rotate List](https://leetcode.com/problems/rotate-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/61.py) |\n| 68 | [Text Justification](https://leetcode.com/problems/text-justification/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/68.py) |\n| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/71.py) |\n| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/72.py) |\n| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/73.py) |\n| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/75.py) |\n| 79 | [Word Search](https://leetcode.com/problems/word-search/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/79.py) |\n| 83 | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/83.py) |\n| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/88.py) |\n| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/100.py) |\n| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/101.py) |\n| 104 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/104.py) |\n| 108 | [Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/108.py) |\n| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/110.py) |\n| 111 | [Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/111.py) |\n| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/112.py) |\n| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/118.py) |\n| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/141.py) |\n| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/146.py) |\n| 155 | [Factorial Trailing Zeroes](https://leetcode.com/problems/min-stack/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/155.py) |\n| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/172.py) |\n| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/175.py) |\n| 181 | [Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/181.py) |\n| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/189.py) |\n| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/198.py) |\n| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/200.py) |\n| 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/202.py) |\n| 203 | [Remove Linked List Elements](https://leetcode.com/problems/remove-linked-list-elements/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/203.py) |\n| 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/204.py) |\n| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/207.py) |\n| 209 | [Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/209.py) |\n| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/227.py) |\n| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/229.py) |\n| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/234.py) |\n| 237 | [Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/237.py) |\n| 238 | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/238.py) |\n| 240 | [Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/240.py) |\n| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/278.py) |\n| 287 | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/287.py) |\n| 342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/342.py) |\n| 363 | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/363.py) |\n| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/368.py) |\n| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/414.py) |\n| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/447.py) |\n| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/461.py) |\n| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/520.py) |\n| 551 | [Student Attendance Record I](https://leetcode.com/problems/student-attendance-record-i/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/551.py) |\n| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/584.py) |\n| 595 | [Big Countries](https://leetcode.com/problems/big-countries/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/595.py) |\n| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/605.py) |\n| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/630.py) |\n| 693 | [Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/693.py) |\n| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/735.py) |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhenilp105%2Fleetcode-obsidian","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhenilp105%2Fleetcode-obsidian","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhenilp105%2Fleetcode-obsidian/lists"}