Uncomment Trie solution

Author: marttp

kotlin/Tries/DesignATrie.kt

@@ -1,11 +1,8 @@
-/*
-    Definition of a TrieNode:
-    
-    data class TrieNode(
-        var isWord: Boolean = false,
-        val children: HashMap<Char, TrieNode> = hashMapOf()
-    )
-*/
+data class TrieNode(
+    var isWord: Boolean = false,
+    val children: HashMap<Char, TrieNode> = hashMapOf()
+)
+
 class Trie {
     val root = TrieNode()
 

kotlin/Tries/FindAllWordsOnABoard.kt

@@ -1,11 +1,7 @@
-/*
-    Definition of a TrieNode:
-
-    data class TrieNode(
-        var isWord: Boolean = false,
-        var word: String? = null
-    )
-*/
+data class TrieNode(
+    var word: String? = null,
+    val children: HashMap<Char, TrieNode> = hashMapOf()
+)
 
 fun findAllWordsOnABoard(board: Array<CharArray>, words: List<String>): List<String> {
     val root = TrieNode()

kotlin/Tries/InsertAndSearchWordsWithWildcards.kt

@@ -1,11 +1,7 @@
-/*
-    Definition of a TrieNode:
-
-    data class TrieNode(
-        var isWord: Boolean = false,
-        val children: HashMap<Char, TrieNode> = hashMapOf()
-    )
-*/
+data class TrieNode(
+    var isWord: Boolean = false,
+    val children: HashMap<Char, TrieNode> = hashMapOf()
+)
 
 class InsertAndSearchWordsWithWildcards {
     private val root = TrieNode()