Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/henilp105/leetcode-obsidian

This repository holds leetcode solutions in Python3
https://github.com/henilp105/leetcode-obsidian

leetcode leetcode-python leetcode-solutions

Last synced: 3 months ago
JSON representation

This repository holds leetcode solutions in Python3

Awesome Lists containing this project

README 

        
# leetcode Obsidian



## About



This 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:



## List of Problems



| Question number | Name | Solution link |

| --- | --- | --- |

| 1 | [Two Sum](https://leetcode.com/problems/two-sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/1.py) |

| 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) |

| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/5.py) |

| 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) |

| 10 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/10.py) |

| 12 | [Integer to Roman](https://leetcode.com/problems/integer-to-roman/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/12.py) |

| 15 | [3Sum](https://leetcode.com/problems/3sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/15.py) |

| 16 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/16.py) |

| 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) |

| 18 | [4Sum](https://leetcode.com/problems/4sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/18.py) |

| 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) |

| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/22.py) |

| 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) |

| 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) |

| 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) |

| 27 | [Remove Element](https://leetcode.com/problems/remove-element/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/27.py) |

| 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) |

| 29 | [Divide Two Integers](https://leetcode.com/problems/divide-two-integers/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/29.py) |

| 31 | [Next Permutation](https://leetcode.com/problems/next-permutation/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/31.py) |

| 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) |

| 35 | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/35.py) |

| 38 | [Count and Say](https://leetcode.com/problems/count-and-say/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/38.py) |

| 41 | [First Missing Positive](https://leetcode.com/problems/first-missing-positive/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/41.py) |

| 48 | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/48.py) |

| 50 | [Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/50.py) |

| 51 | [N-Queens](https://leetcode.com/problems/n-queens/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/51.py) |

| 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/53.py) |

| 55 | [Jump Game](https://leetcode.com/problems/jump-game/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/55.py) |

| 56 | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/56.py) |

| 59 | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/59.py) |

| 61 | [Rotate List](https://leetcode.com/problems/rotate-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/61.py) |

| 68 | [Text Justification](https://leetcode.com/problems/text-justification/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/68.py) |

| 71 | [Simplify Path](https://leetcode.com/problems/simplify-path/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/71.py) |

| 72 | [Edit Distance](https://leetcode.com/problems/edit-distance/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/72.py) |

| 73 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/73.py) |

| 75 | [Sort Colors](https://leetcode.com/problems/sort-colors/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/75.py) |

| 79 | [Word Search](https://leetcode.com/problems/word-search/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/79.py) |

| 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) |

| 88 | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/88.py) |

| 100 | [Same Tree](https://leetcode.com/problems/same-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/100.py) |

| 101 | [Symmetric Tree](https://leetcode.com/problems/symmetric-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/101.py) |

| 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) |

| 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) |

| 110 | [Balanced Binary Tree](https://leetcode.com/problems/balanced-binary-tree/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/110.py) |

| 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) |

| 112 | [Path Sum](https://leetcode.com/problems/path-sum/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/112.py) |

| 118 | [Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/118.py) |

| 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/141.py) |

| 146 | [LRU Cache](https://leetcode.com/problems/lru-cache/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/146.py) |

| 155 | [Factorial Trailing Zeroes](https://leetcode.com/problems/min-stack/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/155.py) |

| 172 | [Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/172.py) |

| 175 | [Combine Two Tables](https://leetcode.com/problems/combine-two-tables/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/175.py) |

| 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) |

| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/189.py) |

| 198 | [House Robber](https://leetcode.com/problems/house-robber/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/198.py) |

| 200 | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/200.py) |

| 202 | [Happy Number](https://leetcode.com/problems/happy-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/202.py) |

| 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) |

| 204 | [Count Primes](https://leetcode.com/problems/count-primes/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/204.py) |

| 207 | [Course Schedule](https://leetcode.com/problems/course-schedule/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/207.py) |

| 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) |

| 227 | [Basic Calculator II](https://leetcode.com/problems/basic-calculator-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/227.py) |

| 229 | [Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/229.py) |

| 234 | [Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/234.py) |

| 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) |

| 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) |

| 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) |

| 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/278.py) |

| 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) |

| 342 | [Power of Four](https://leetcode.com/problems/power-of-four/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/342.py) |

| 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) |

| 368 | [Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/368.py) |

| 414 | [Third Maximum Number](https://leetcode.com/problems/third-maximum-number/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/414.py) |

| 447 | [Number of Boomerangs](https://leetcode.com/problems/number-of-boomerangs/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/447.py) |

| 461 | [Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/461.py) |

| 520 | [Detect Capital](https://leetcode.com/problems/detect-capital/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/520.py) |

| 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) |

| 584 | [Find Customer Referee](https://leetcode.com/problems/find-customer-referee/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/584.py) |

| 595 | [Big Countries](https://leetcode.com/problems/big-countries/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/595.py) |

| 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/605.py) |

| 630 | [Course Schedule III](https://leetcode.com/problems/course-schedule-iii/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/630.py) |

| 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) |

| 735 | [Asteroid Collision](https://leetcode.com/problems/asteroid-collision/) | [Python3 Solution](https://github.com/henilp105/leetcode-obsidian/blob/main/solutions/735.py) |