Ecosyste.ms: Awesome

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

Awesome Lists | Featured Topics | Projects

https://github.com/childe/leetcode

https://leetcode.com
https://github.com/childe/leetcode

Last synced: about 1 month ago
JSON representation

https://leetcode.com

Awesome Lists containing this project

README

        

| # | Title | Solution |
|---| ----- | -------- |
|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Python](https://github.com/childe/leetcode/blob/master/two-sum/two-sum.py)|
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[Python](https://github.com/childe/leetcode/blob/master/add-two-numbers/add-two-numbers.py)|
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[Python](https://github.com/childe/leetcode/blob/master/longest-substring-without-repeating-characters/longest-substring-without-repeating-characters.py)|
|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Python](https://github.com/childe/leetcode/blob/master/median-of-two-sorted-arrays/solution.py)|
|5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)|[Python](https://github.com/childe/leetcode/tree/master/longest-palindromic-substring)|
|6|[https://leetcode.com/problems/zigzag-conversion/](https://leetcode.com/problems/zigzag-conversion/)|[Python](https://github.com/childe/leetcode/blob/master/zigzag-conversion/solution.py)|
|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|[Python](https://github.com/childe/leetcode/blob/master/reverse-integer/solution.py)|
|8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)|[Python](https://github.com/childe/leetcode/blob/master/string-to-integer-atoi/solution.py)|
|9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)|[Python](https://github.com/childe/leetcode/blob/master/palindrome-number)|
|10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)|[Python](https://github.com/childe/leetcode/blob/master/regular-expression-matching/solution.py)|
|11|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[Python](https://github.com/childe/leetcode/blob/master/container-with-most-water/solution.py)|
|12|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)|[Python](https://github.com/childe/leetcode/blob/master/integer-to-roman/solution.py)|
|13|[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)|[Python](https://github.com/childe/leetcode/blob/master/roman-to-integer/solution.py)|
|14|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)|[Python](https://github.com/childe/leetcode/blob/master/longest-common-prefix/solution.py)|
|15|[3Sum](https://leetcode.com/problems/3sum/)|[Python](https://github.com/childe/leetcode/blob/master/3sum/solution.py)|
|16|[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[Python](https://github.com/childe/leetcode/blob/master/3sum-closest/solution.py)|
|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[Python](https://github.com/childe/leetcode/blob/master/letter-combinations-of-a-phone-number/solution.py)|
|20|[valid-parentheses](https://leetcode.com/problems/valid-parentheses/)|[Python](https://github.com/childe/leetcode/blob/master/valid-parentheses/solution.py)|
|20|[merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists/)|[Python](https://github.com/childe/leetcode/blob/master/merge_two_sorted_lists/Solution.py)|
|22|[generate-parentheses](https://leetcode.com/problems/generate-parentheses/)|[Python](https://github.com/childe/leetcode/blob/master/generate-parentheses/solution.py)|
|23|[merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[Python](https://github.com/childe/leetcode/blob/master/merge-k-sorted-lists/solution.py)|
|23|[swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[Python](https://github.com/childe/leetcode/blob/master/swap_nodes_in_pairs/Solution.py)|
|25|[reverse-nodes-in-k-group](https://leetcode.com/problems/reverse-nodes-in-k-group/)|[Python](https://github.com/childe/leetcode/blob/master/reverse-nodes-in-k-group/solution.py)|
|27|[remove-element](https://leetcode.com/problems/remove-element/)|[Python](https://github.com/childe/leetcode/blob/master/remove-element/solution.py)|
|112|[Path Sum](https://leetcode.com/problems/path-sum/)|[Python](https://github.com/childe/leetcode/blob/master/path-sum/solution.py)|
|153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[Python](https://github.com/childe/leetcode/blob/master/find-minimum-in-rotated-sorted-arrays/solution.py)|
|169|[majority element](https://leetcode.com/problems/majority-element/)|[Python](https://github.com/childe/leetcode/blob/master/majority-element/solution.py)|
|290|[Word Pattern](https://leetcode.com/problems/word-pattern/)|[Python](https://github.com/childe/leetcode/blob/master/word-pattern/solution.py)|
|319|[Bulb Switcher](https://leetcode.com/problems/bulb-switcher/)|[Python](https://github.com/childe/leetcode/blob/master/bulb-switcher/solution.py)|
|330|[patching-array](https://leetcode.com/problems/patching-array/)|[Python](https://github.com/childe/leetcode/blob/master/patching-array/solution.py)|