@@ -21,6 +21,7 @@ My solutions to LeetCode problems in Kotlin.
 | [186](https://leetcode.com/problems/reverse-words-in-a-string-ii/) | [Reverse Words in a String II](src/main/kotlin/com/schmoczer/leetcode/_0186/ReverseWordsInStringInPlace.kt) | Medium |
 | [206](https://leetcode.com/problems/reverse-linked-list/) | [Reverse Linked List](src/main/kotlin/com/schmoczer/leetcode/_0206/ReverseLinkedList.kt) | Easy |
 | [344](https://leetcode.com/problems/reverse-string/) | [Reverse String](src/main/kotlin/com/schmoczer/leetcode/_0344/ReverseString.kt) | Easy |
+| [383](https://leetcode.com/problems/ransom-note/) | [Ransom Note](src/main/kotlin/com/schmoczer/leetcode/_0383/RansomNote.kt) | Easy |
 | [412](https://leetcode.com/problems/fizz-buzz/) | [Fizz Buzz](src/main/kotlin/com/schmoczer/leetcode/_0412/FizzBuzz.kt) | Easy |
 | [773](https://leetcode.com/problems/sliding-puzzle/) | [Sliding Puzzle](src/main/kotlin/com/schmoczer/leetcode/_0773/SlidingPuzzle.kt) | Hard |
 | [796](https://leetcode.com/problems/rotate-string/) | [Rotate String](src/main/kotlin/com/schmoczer/leetcode/_0796/RotateString.kt) | Easy |

@@ -0,0 +1,29 @@
+# Ransom Note
+
+Given two strings `ransomNote` and `magazine`, return `true` if `ransomNote` can be constructed by using the letters
+from `magazine` and `false` otherwise.
+
+Each letter in `magazine` can only be used once in `ransomNote`.
+
+Example 1:
+
+> Input: ransomNote = "a", magazine = "b"
+>
+> Output: false
+
+Example 2:
+
+> Input: ransomNote = "aa", magazine = "ab"
+>
+> Output: false
+
+Example 3:
+
+> Input: ransomNote = "aa", magazine = "aab"
+>
+> Output: true
+
+Constraints:
+
+- `1 <= ransomNote.length, magazine.length <= 10^5`
+- `ransomNote` and `magazine` consist of lowercase English letters.

@@ -0,0 +1,32 @@
+package com.schmoczer.leetcode._0383
+
+class RansomNote {
+// Approach 1: remove letters from magazine, simple & intuitive
+fun canConstruct1(ransomNote: String, magazine: String): Boolean {
+val magazine = magazine.toMutableList()
+for (letter in ransomNote) {
+if (!magazine.remove(letter)) {
+return false
+}
+}
+return true
+}
+
+// Approach 2: map occurrences of a letter into a IntArray
+// Runtime 3ms Beats 98.51%
+fun canConstruct(ransomNote: String, magazine: String): Boolean {
+val alphabet = IntArray(123)
+for (letter in magazine) {
+alphabet[letter.code]++
+}
+
+for (letter in ransomNote) {
+if (alphabet[letter.code] == 0) {
+return false
+}
+alphabet[letter.code]--
+}
+
+return true
+}
+}

@@ -0,0 +1,39 @@
+package com.schmoczer.leetcode._0383
+
+import org.junit.jupiter.api.Assertions.assertFalse
+import org.junit.jupiter.api.Assertions.assertTrue
+import org.junit.jupiter.api.BeforeEach
+import kotlin.test.Test
+
+class RansomNoteTest {
+private lateinit var sut: RansomNote
+
+@BeforeEach
+fun setUp() {
+sut = RansomNote()
+}
+
+@Test
+fun `a can not be constructed from b`() {
+val note = "a"
+val magazine = "b"
+
+assertFalse(sut.canConstruct(note, magazine))
+}
+
+@Test
+fun `aa can not be constructed from ab`() {
+val note = "aa"
+val magazine = "ab"
+
+assertFalse(sut.canConstruct(note, magazine))
+}
+
+@Test
+fun `aa can be constructed from aab`() {
+val note = "aa"
+val magazine = "aab"
+
+assertTrue(sut.canConstruct(note, magazine))
+}
+}