KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#developer-tools #typescript #claude-code #codex #dsh #dsh-plugin #ai-agent #ai-agents #deepseek-harness #agent-skills #macos #cli

LeetCode-Kotlin

★ 122 Open GitHub ↗

🖋Solutions of LeetCode with Kotlin

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# LeetCode
**Total problems: 109, easy: 32, medium: 65, hard: 12**
| # | Title | Solution | Difficulty |
| ------ | ------ | ------ | ------ |
| 1 | [two-sum](https://leetcode.com/problems/two-sum/description/) | [Kotlin](./easy/1.two-sum.kt) | Easy |
| 2 | [add-two-numbers](https://leetcode.com/problems/add-two-numbers/description/) | [Kotlin](./easy/2.add-two-numbers.kt) | Easy |
| 3 | [longest-substring-without-repeating-characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/) | [Kotlin](./medium/3.longest-substring-without-repeating-characters.kt) | Medium |
| 5 | [longest-palindromic-substring](https://leetcode.com/problems/longest-palindromic-substring/description/) | [Kotlin](./medium/5.longest-palindromic-substring.kt) | Medium |
| 6 | [zig-zag-conversion](https://leetcode.com/problems/zig-zag-conversion/description/) | [Kotlin](./medium/6.zig-zag-conversion.kt) | Medium |
| 7 | [reverse-integer](https://leetcode.com/problems/reverse-integer/description/) | [Kotlin](./easy/7.reverse-integer.kt) | Easy |
| 8 | [string-to-integer-atoi](https://leetcode.com/problems/string-to-integer-atoi/description/) | [Kotlin](./medium/8.string-to-integer-atoi.kt) | Medium |
| 9 | [palindrome-number](https://leetcode.com/problems/palindrome-number/description/) | [Kotlin](./easy/9.palindrome-number.kt) | Easy |
| 10 | [regular-expression-matching](https://leetcode.com/problems/regular-expression-matching/description/) | [Kotlin](./hard/10.regular-expression-matching.kt) | Hard |
| 11 | [container-with-most-water](https://leetcode.com/problems/container-with-most-water/description/) | [Kotlin](./medium/11.container-with-most-water.kt) | Medium |
| 12 | [integer-to-roman](https://leetcode.com/problems/integer-to-roman/description/) | [Kotlin](./medium/12.integer-to-roman.kt) | Medium |
| 13 | [roman-to-integer](https://leetcode.com/problems/roman-to-integer/description/) | [Kotlin](./easy/13.roman-to-integer.kt) | Easy |
| 14 | [longest-common-prefix](https://leetcode.com/problems/longest-common-prefix/description/) | [Kotlin](./easy/14.longest-common-prefix.kt) | Easy |
| 15 | [3-sum](https://leetcode.com/problems/3-sum/description/) | [Kotlin](./medium/15.3-sum.kt) | Medium |
| 16 | [3-sum-closest](https://leetcode.com/problems/3-sum-closest/description/) | [Kotlin](./medium/16.3-sum-closest.kt) | Medium |
| 17 | [letter-combinations-of-a-phone-number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/) | [Kotlin](./medium/17.letter-combinations-of-a-phone-number.kt) | Medium |
| 18 | [4-sum](https://leetcode.com/problems/4-sum/description/) | [Kotlin](./medium/18.4-sum.kt) | Medium |
| 19 | [remove-nth-node-from-end-of-list](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/) | [Kotlin](./medium/19.remove-nth-node-from-end-of-list.kt) | Medium |
| 20 | [valid-parentheses](https://leetcode.com/problems/valid-parentheses/description/) | [Kotlin](./easy/20.valid-parentheses.kt) | Easy |
| 21 | [merge-two-sorted-lists](https://leetcode.com/problems/merge-two-sorted-lists/description/) | [Kotlin](./easy/21.merge-two-sorted-lists.kt) | Easy |
| 22 | [generate-parentheses](https://leetcode.com/problems/generate-parentheses/description/) | [Kotlin](./medium/22.generate-parentheses.kt) | Medium |
| 23 | [merge-k-sorted-lists](https://leetcode.com/problems/merge-k-sorted-lists/description/) | [Kotlin](./hard/23.merge-k-sorted-lists.kt) | Hard |
| 24 | [swap-nodes-in-pairs](https://leetcode.com/problems/swap-nodes-in-pairs/description/) | [Kotlin](./medium/24.swap-nodes-in-pairs.kt) | Medium |
| 25 | [reverse-nodes-in-k-group](https://leetcode.com/problems/reverse-nodes-in-k-group/description/) | [Kotlin](./hard/25.reverse-nodes-in-k-group.kt) | Hard |
| 26 | [remove-duplicates-from-sorted-array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) | [Kotlin](./easy/26.remove-duplicates-from-sorted-array.kt) | Easy |
| 27 | [remove-element](https://leetcode.com/problems/remove-element/description/) | [Kotlin](./easy/27.remove-element.kt) | Easy |
| 28 | [implement-str-str](https://leetcode.com/problems/implement-str-str/description/) | [Kotlin](./easy/28.implement-str-str.kt) | Easy |
| 29 | [divide-two-integers](https://leetcode.com/problems/divide-two-integers/description/) | [Kotlin](./medium/29.divide-two-integers.kt) | Medium |
| 31 | [next-permutation](https://leetcode.com/problems/next-permutation/description/) | [Kotlin](./medium/31.next-permutation.kt) | Medium |
| 32 | [longest-valid-parentheses](https://leetcode.com/problems/longest-valid-parentheses/description/) | [Kotlin](./hard/32.longest-valid-parentheses.kt) | Hard |
| 33 | [search-in-rotated-sorted-array.](https://leetcode.com/problems/search-in-rotated-sorted-array./description/) | [C++](./medium/33.search-in-rotated-sorted-array..cpp) | Medium |
| 34 | [find-first-and-last-position-of-element-in-sorted-array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/description/) | [Kotlin](./medium/34.find-first-and-last-position-of-element-in-sorted-array.kt) | Medium |
| 38 | [count-and-say](https://leetcode.com/problems/count-and-say/description/) | [Kotlin](./easy/38.count-and-say.kt) | Easy |
| 44 | [wildcard-matching](https://leetcode.com/problems/wildcard-matching/description/) | [Kotlin](./hard/44.wildcard-matching.kt) | Hard |
| 50 | [pow-x-n](https://leetcode.com/problems/pow-x-n/description/) | [Kotlin](./medium/50.pow-x-n.kt) | Medium |
| 53 | [maximum-subarray](https://leetcode.com/problems/maximum-subarray/description/) | [Kotlin](./easy/53.maximum-subarray.kt) | Easy |
| 55 | [jump-game](https://leetcode.com/problems/jump-game/description/) | [Kotlin](./medium/55.jump-game.kt) | Medium |
| 60 | [permutation-sequence](https://leetcode.com/problems/permutation-sequence/description/) | [Kotlin](./medium/60.permutation-sequence.kt) | Medium |
| 62 | [unique-paths](https://leetcode.com/problems/unique-paths/description/) | [Kotlin](./medium/62.unique-paths.kt) | Medium |
| 63 | [unique-paths-ii](https://leetcode.com/problems/unique-paths-ii/description/) | [Kotlin](./medium/63.unique-paths-ii.kt) | Medium |
| 64 | [minimum-path-sum](https://leetcode.com/problems/minimum-path-sum/description/) | [Kotlin](./medium/64.minimum-path-sum.kt) | Medium |
| 67 | [add-binary](https://leetcode.com/problems/add-binary/description/) | [Kotlin](./easy/67.add-binary.kt) | Easy |
| 69 | [sqrt-x](https://leetcode.com/problems/sqrt-x/description/) | [Kotlin](./easy/69.sqrt-x.kt) | Easy |
| 70 | [climbing-stairs](https://leetcode.com/problems/climbing-stairs/description/) | [Kotlin](./easy/70.climbing-stairs.kt) | Easy |
| 72 | [edit-distance](https://leetcode.com/problems/edit-distance/description/) | [Kotlin](./hard/72.edit-distance.kt) | Hard |
| 85 | [maximal-rectangle](https://leetcode.com/problems/maximal-rectangle/description/) | [Kotlin](./hard/85.maximal-rectangle.kt) | Hard |
| 91 | [decode-ways](https://leetcode.com/problems/decode-ways/description/) | [Kotlin](./medium/91.decode-ways.kt) | Medium |
| 94 | [binary-tree-inorder-traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/description/) | [Kotlin](./medium/94.binary-tree-inorder-traversal.kt) | Medium |
| 95 | [unique-binary-search-trees-ii](https://leetcode.com/problems/unique-binary-search-trees-ii/description/) | [Kotlin](./medium/95.unique-binary-search-trees-ii.kt) | Medium |
| 96 | [unique-binary-search-trees](https://leetcode.com/problems/unique-binary-search-trees/description/) | [Kotlin](./medium/96.unique-binary-search-trees.kt) | Medium |
| 98 | [validate-binary-search-tree](https://leetcode.com/problems/validate-binary-search-tree/description/) | [Kotlin](./medium/98.validate-binary-search-tree.kt) | Medium |
| 104 | [maximum-depth-of-binary-tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) | [Kotlin](./easy/104.maximum-depth-of-binary-tree.kt) | Easy |
| 112 | [path-sum](https://leetcode.com/problems/path-sum/description/) | [Kotlin](./easy/112.path-sum.kt) | Easy |
| 114 | [flatten-binary-tree-to-linked-list](https://leetcode.com/problems/flatten-binary-tree-to-linked-list/description/) | [Kotlin](./medium/114.flatten-binary-tree-to-linked-list.kt) | Medium |
| 120 | [triangle](https://leetcode.com/problems/triangle/description/) | [Kotlin](./medium/120.triangle.kt) | Medium |
| 127 | [word-ladder](https://leetcode.com/problems/word-ladder/description/) | [Kotlin](./medium/127.word-ladder.kt) | Medium |
| 134 | [gas-station](https://leetcode.com/problems/gas-station/description/) | [Kotlin](./medium/134.gas-station.kt) | Medium |
| 139 | [word-break](https://leetcode.com/problems/word-break/description/) | [Kotlin](./medium/139.word-break.kt) | Medium |
| 140 | [word-break-ii](https://leetcode.com/problems/word-break-ii/description/) | [Kotlin](./hard/140.word-break-ii.kt) | Hard |
| 162 | [find-peak-element](https://leetcode.com/problems/find-peak-element/description/) | [Kotlin](./medium/162.find-peak-element.kt) | Medium |
| 169 | [majority-element](https://leetcode.com/problems/majority-element/description/) | [Kotlin](./easy/169.majority-element.kt) | Easy |
| 198 | [house-robber](https://leetcode.com/problems/house-robber/description/) | [Kotlin](./easy/198.house-robber.kt) | Easy |
| 204 | [count-primes](https://leetcode.com/problems/count-primes/description/) | [Kotlin](./easy/204.count-primes.kt) | Easy |
| 207 | [course-schedule](https://leetcode.com/problems/course-schedule/description/) | [Kotlin](./medium/207.course-schedule.kt) | Medium |
| 210 | [course-schedule-ii](https://leetcode.com/problems/course-schedule-ii/description/) | [Kotlin](./medium/210.course-schedule-ii.kt) | Medium |
| 213 | [house-robber-ii](https://leetcode.com/problems/house-robber-ii/description/) | [Kotlin](./medium/213.house-robber-ii.kt) | Medium |
| 264 | [ugly-number-ii](https://leetcode.com/problems/ugly-number-ii/description/) | [Kotlin](./medium/264.ugly-number-ii.kt) | Medium |
| 268 | [missing-number](https://leetcode.com/problems/missing-number/description/) | [Kotlin](./easy/268.missing-number.kt) | Easy |
| 279 | [perfect-squares](https://leetcode.com/problems/perfect-squares/description/) | [Kotlin](./medium/279.perfect-squares.kt) | Medium |
| 300 | [longest-increasing-subsequence](https://leetcode.com/problems/longest-increasing-subsequence/description/) | [Kotlin](./medium/300.longest-increasing-subsequence.kt) | Medium |
| 303 | [range-sum-query-immutable](https://leetcode.com/problems/range-sum-query-immutable/description/) | [Kotlin](./easy/303.range-sum-query-immutable.kt) | Easy |
| 304 | [range-sum-query-2-d-immutable](https://leetcode.com/problems/range-sum-query-2-d-immutable/description/) | [Kotlin](./medium/304.range-sum-query-2-d-immutable.kt) | Medium |
| 310 | [minimum-height-trees](https://leetcode.com/problems/minimum-height-trees/description/) | [Kotlin](./medium/310.minimum-height-trees.kt) | Medium |
| 322 | [coin-change](https://leetcode.com/problems/coin-change/description/) | [Kotlin](./medium/322.coin-change.kt) | Medium |
| 329 | [longest-increasing-path-in-a-matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/description/) | [Kotlin](./hard/329.longest-increasing-path-in-a-matrix.kt) | Hard |
| 372 | [super-pow](https://leetcode.com/problems/super-pow/description/) | [Kotlin](./medium/372.super-pow.kt) | Medium |
| 402 | [remove-k-digits](https://leetcode.com/problems/remove-k-digits/description/) | [Kotlin](./medium/402.remove-k-digits.kt) | Medium |
| 515 | [find-largest-value-in-each-tree-row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/description/) | [Kotlin](./medium/515.find-largest-value-in-each-tree-row.kt) | Medium |
| 621 | [task-scheduler](https://leetcode.com/problems/task-scheduler/description/) | [Kotlin](./medium/621.task-scheduler.kt) | Medium |
| 859 | [buddy-strings](https://leetcode.com/problems/buddy-strings/description/) | [Kotlin](./easy/859.buddy-strings.kt) | Easy |
| 869 | [reordered-power-of-2](https://leetcode.com/problems/reordered-power-of-2/description/) | [Kotlin](./medium/869.reordered-power-of-2.kt) | Medium |
| 872 | [leaf-similar-trees](https://leetcode.com/problems/leaf-similar-trees/description/) | [Kotlin](./easy/872.leaf-similar-trees.kt) | Easy |
| 999 | [available-captures-for-rook](https://leetcode.com/problems/available-captures-for-rook/description/) | [Kotlin](./easy/999.available-captures-for-rook.kt) | Easy |
| 1038 | [binary-search-tree-to-greater-sum-tree](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree/description/) | [Kotlin](./medium/1038.binary-search-tree-to-greater-sum-tree.kt) | Medium |
| 1305 | [all-elements-in-two-binary-search-trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/description/) | [Kotlin](./medium/1305.all-elements-in-two-binary-search-trees.kt) | Medium |
| 1306 | [jump-game-iii](https://leetcode.com/problems/jump-game-iii/description/) | [Kotlin](./medium/1306.jump-game-iii.kt) | Medium |
| 1309 | [decrypt-string-from-alphabet-to-integer-mapping](https://leetcode.com/problems/decrypt-string-from-alphabet-to-integer-mapping/description/) | [Kotlin](./easy/1309.decrypt-string-from-alphabet-to-integer-mapping.kt) | Easy |
| 1362 | [closest-divisors](https://leetcode.com/problems/closest-divisors/description/) | [Kotlin](./medium/1362.closest-divisors.kt) | Medium |
| 1370 | [increasing-decreasing-string](https://leetcode.com/problems/increasing-decreasing-string/description/) | [Kotlin](./easy/1370.increasing-decreasing-string.kt) | Easy |
| 1374 | [generate-a-string-with-characters-that-have-odd-counts](https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts/description/) | [Kotlin](./easy/1374.generate-a-string-with-characters-that-have-odd-counts.kt) | Easy |
| 1375 | [bulb-switcher-iii](https://leetcode.com/problems/bulb-switcher-iii/description/) | [Kotlin](./medium/1375.bulb-switcher-iii.kt) | Medium |
| 1376 | [time-needed-to-inform-all-employees](https://leetcode.com/problems/time-needed-to-inform-all-employees/description/) | [Kotlin](./medium/1376.time-needed-to-inform-all-employees.kt) | Medium |
| 1377 | [frog-position-after-t-seconds](https://leetcode.com/problems/frog-position-after-t-seconds/description/) | [Kotlin](./hard/1377.frog-position-after-t-seconds.kt) | Hard |
| 1380 | [lucky-numbers-in-a-matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/description/) | [Kotlin](./easy/1380.lucky-numbers-in-a-matrix.kt) | Easy |
| 1381 | [design-a-stack-with-increment-operation](https://leetcode.com/problems/design-a-stack-with-increment-operation/description/) | [Kotlin](./medium/1381.design-a-stack-with-increment-operation.kt) | Medium |
| 1382 | [balance-a-binary-search-tree](https://leetcode.com/problems/balance-a-binary-search-tree/description/) | [Kotlin](./medium/1382.balance-a-binary-search-tree.kt) | Medium |
| 1404 | [number-of-steps-to-reduce-a-number-in-binary-representation-to-one](https://leetcode.com/problems/number-of-steps-to-reduce-a-number-in-binary-representation-to-one/description/) | [Kotlin](./medium/1404.number-of-steps-to-reduce-a-number-in-binary-representation-to-one.kt) | Medium |
| 1405 | [longest-happy-string](https://leetcode.com/problems/longest-happy-string/description/) | [Kotlin](./medium/1405.longest-happy-string.kt) | Medium |
| 1472 | [design-browser-history](https://leetcode.com/problems/design-browser-history/description/) | [Kotlin](./medium/1472.design-browser-history.kt) | Medium |
| 1473 | [paint-house-iii](https://leetcode.com/problems/paint-house-iii/description/) | [Kotlin](./hard/1473.paint-house-iii.kt) | Hard |
| 1487 | [making-file-names-unique](https://leetcode.com/problems/making-file-names-unique/description/) | [Kotlin](./medium/1487.making-file-names-unique.kt) | Medium |
| 1550 | [three-consecutive-odds](https://leetcode.com/problems/three-consecutive-odds/description/) | [Kotlin](./easy/1550.three-consecutive-odds.kt) | Easy |
| 1551 | [minimum-operations-to-make-array-equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/description/) | [Kotlin](./medium/1551.minimum-operations-to-make-array-equal.kt) | Medium |
| 1552 | [magnetic-force-between-two-balls](https://leetcode.com/problems/magnetic-force-between-two-balls/description/) | [Kotlin](./medium/1552.magnetic-force-between-two-balls.kt) | Medium |
| 1582 | [special-positions-in-a-binary-matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/description/) | [Kotlin](./easy/1582.special-positions-in-a-binary-matrix.kt) | Easy |
| 1583 | [count-unhappy-friends](https://leetcode.com/problems/count-unhappy-friends/description/) | [Kotlin](./medium/1583.count-unhappy-friends.kt) | Medium |
| 1584 | [min-cost-to-connect-all-points](https://leetcode.com/problems/min-cost-to-connect-all-points/description/) | [Kotlin](./medium/1584.min-cost-to-connect-all-points.kt) | Medium |
| 1585 | [check-if-string-is-transformable-with-substring-sort-operations](https://leetcode.com/problems/check-if-string-is-transformable-with-substring-sort-operations/description/) | [Kotlin](./hard/1585.check-if-string-is-transformable-with-substring-sort-operations.kt) | Hard |
| 1589 | [maximum-sum-obtained-of-any-permutation](https://leetcode.com/problems/maximum-sum-obtained-of-any-permutation/description/) | [Kotlin](./medium/1589.maximum-sum-obtained-of-any-permutation.kt) | Medium |

LeetCode-Kotlin

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README