My solutions to LeetCode problems in Kotlin.
| # | Title | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 5 | Longest Palindromic Substring | Medium |
| 8 | String to Integer (atoi) | Medium |
| 20 | Valid Parentheses | Easy |
| 27 | Remove Element | Easy |
[42](https://leetcode.com/problems/trapping-rain-water/) | [Trapping Rain Water](src/main/kotlin/com/schmoczer/leetcode/_0042/TrappingRainWater.kt) | Hard |
| 48 | Rotate Image | Medium | | 49 | Group Anagrams | Medium | | 54 | Spiral Matrix | Medium | | 73 | Set Matrix Zeroes | Medium | | 88 | Merge Sorted Array | Easy | | 125 | Valid Palindrome | Easy | | 141 | Linked List Cycle | Easy | | 151 | Reverse Words in a String | Medium | | 186 | Reverse Words in a String II | Medium | | 206 | Reverse Linked List | Easy | | 344 | Reverse String | Easy | | 383 | Ransom Note | Easy | | 412 | Fizz Buzz | Easy | | 485 | Max Consecutive Ones | Easy | | 773 | Sliding Puzzle | Hard | | 796 | Rotate String | Easy | | 876 | Middle of the Linked List | Easy | | 977 | Squares of a Sorted Array | Easy | | 1089 | Duplicate Zeros | Easy | | 1295 | Find Numbers with Even Number of Digits | Easy | | 1342 | Number of Steps to Reduce a Number to Zero | Easy | | 1480 | Running Sum of 1d Array | Easy | | 1574 | Shortest Subarray to be Removed to Make Array Sorted | Medium | | 1672 | Richest Customer Wealth | Easy | | 1829 | Maximum XOR for Each Query | Medium | | 1861 | Rotating the Box | Medium | | 1957 | Delete Characters to Make Fancy String | Easy | | 1975 | Maximum Matrix Sum | Medium | | 2064 | Minimized Maximum of Products Distributed to Any Store | Medium | | 2070 | Most Beautiful Item for Each Query | Medium | | 2257 | Count Unguarded Cells in the Grid | Medium | | 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | | 2490 | Circular Sentence | Easy | | 2516 | Take K of Each Character From Left and Right | Medium | | 2577 | Minimum Time to Visit a Cell In a Grid | Hard | | 2914 | Minimum Number of Changes to Make Binary String Beautiful | Medium | | 2924 | Find Champion II | Medium | | 3011 | Find if Array Can Be Sorted | Medium | | 3133 | Minimum Array End | Medium | | 3163 | String Compression III | Medium | | 3254 | Find the Power of K-Size Subarrays I | Medium |