Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/likejazz/leetcode
C++, Java, Python, Go, TypeScript, Kotlin Solutions of LeetCode Problems.
https://github.com/likejazz/leetcode
Last synced: 25 days ago
JSON representation
C++, Java, Python, Go, TypeScript, Kotlin Solutions of LeetCode Problems.
- Host: GitHub
- URL: https://github.com/likejazz/leetcode
- Owner: likejazz
- License: bsd-3-clause
- Created: 2019-07-07T04:56:21.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2021-08-16T17:29:07.000Z (over 3 years ago)
- Last Synced: 2024-03-15T05:41:47.681Z (10 months ago)
- Language: Python
- Homepage:
- Size: 762 KB
- Stars: 1
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# LeetCode Solutions
By Sang-Kil Park, The Author of [<파이썬 알고리즘 인터뷰>](http://www.yes24.com/Product/Goods/91084402)
| Title | Solution |
| ----- | -------- |
| 1. Two Sum | [Python](python/1-two-sum.py), [Go](go/1-two-sum.go) |
| 14. Longest Common Prefix | [C++](cpp/14-longest-common-prefix.cpp), [Java](java-kotlin/src/main/java/com/likejazz/leetcode/java/solution14/Solution.java), [Python](python/14-longest-common-prefix.py), [Go](go/14-longest-common-prefix.go) |
| 62. Unique Paths | [Kotlin](java-kotlin/src/main/kotlin/com/likejazz/leetcode/solution62/Solution.kt) |
| 101. Symmetric Tree | [C++](cpp/101-symmetric-tree.cpp), [Python](python/101-symmetric-tree.py) |
| 125. Valid Palindrome | [C](c/125-valid-palindrome.c), [Python](python/125-valid-palindrome.py) |
| 141. Linked List Cycle | [Go](go/141-linked-list-cycle.go) |
| 169. Majority Element | [C++](cpp/169-majority-element.cpp) |
| 234. Palindrome Linked List | [Go](go/234-palindrome-linked-list.go) |
| 200. Number Of Islands | [Python](python/200-number-of-islands.py) |
| 207. Course Schedule | [Python](python/207-course-schedule.py) |
| 310. Minimum Height Trees | [Python](python/310-minimum-height-trees.py) |
| 332. Reconstruct Itinerary | [Python](python/332-reconstruct-itinerary.py) |
| 334. Increasing Triplet Subsequence | [C++](cpp/334-increasing-triplet-subsequence.cpp) |
| 387. First Unique Character in a String | [Go](go/387-first-unique-character-in-a-string.go) |
| 399. Evaluate Division | [Python](python/399-evaluate-division.py) |
| 436. Find Right Interval | [Python](python/436-find-right-interval.py) |
| 482. License Key Formatting | [Java](java-kotlin/src/main/java/com/likejazz/leetcode/java/solution482/Solution.java) |
| 590. N-ary Tree Postorder Traversal | [Python](python/590-n-ary-tree-postorder-traversal.py) |
| 684. Redundant Connection | [Python](python/684-redundant-connection.py) |
| 704. Binary Search | [Python](python/704-binary-search.py), [Kotlin](java-kotlin/src/main/kotlin/com/likejazz/leetcode/solution704/Solution.kt) |
| 792. Number of Matching Subsequences | [Python](python/792-number-of-matching-subsequences.py) |
| 819. Most Common Word | [C++](cpp/819-most-common-word.cpp) |
| 897. Increasing Order Search Tree | [Python](python/897-increasing-order-search-tree.py) |
| 905. Sort Array By Parity | [Go](go/905-sort-array-by-parity.go) |
| 938. Range Sum of BST | [Go](go/938-range-sum-of-bst.go) |
| 994. Rotting Oranges | [C++](cpp/994-rotting-oranges.cpp) |
| 1021. Remove Outermost Parentheses | [Go](go/1021-remove-outermost-parentheses.go) |
| 1128. Number of Equivalent Domino Pairs | [Python](python/1128-number-of-equivalent-domino-pairs.py) |
| 1295. Find Numbers with Even Number of Digits | [TypeScript](typescript/1295-find-numbers-with-even-number-of-digits.ts) |
| 1302. Deepest Leaves Sum | [Kotlin](java-kotlin/src/main/kotlin/com/likejazz/leetcode/solution1302/Solution.kt) |
| 1346. Check If N and Its Double Exist | [TypeScript](typescript/1346-check-if-n-and-its-double-exist.ts) |
| 1431. Kids With the Greatest Number of Candies | [Go](go/1431-kids-with-the-greatest-number-of-candies.go) |
| 1513. Number of Substrings With Only 1s | [Python](python/1513-number-of-substrings-with-only-1s.py), [Go](go/1513-number-of-substrings-with-only-1s.go) |
| 1614. Maximum Nesting Depth of the Parentheses | [Kotlin](java-kotlin/src/main/kotlin/com/likejazz/leetcode/solution1614/Solution.kt) |
| 1716. Calculate Money in Leetcode Bank | [TypeScript](typescript/1716-calculate-money-in-leetcode-bank.ts) |
| 1805. Number of Different Integers in a String | [TypeScript](typescript/1805-number-of-different-integers-in-a-string.ts) |
| 1903. Largest Odd Number in String | [Go](go/1903-largest-odd-number-in-string.go), [Kotlin](java-kotlin/src/main/kotlin/com/likejazz/leetcode/solution1903/Solution.kt) |
## Language Compiler Versions
- C99
- C++17
```
$ mkdir bld
$ cd bld
$ cmake ..
$ make
$ ./testcase
```
- Java SE 11
```
$ gradle test
```
- Python 3.7
```
$ python test_leetcode.py
```
- Go 1.16
```
$ go test
// If you use GoLand, Select a Test kind 'Directory' to run the Test properly.
```
- TypeScript 4.2
```
$ deno run test_leetcode.ts
```
- Kotlin 1.5.20
```
// Using IntelliJ Kotlin Worksheet
$ gradle test
```