solves word pattern

Author: anishLearnsToCode

README.md

@@ -88,7 +88,7 @@
 | 276 | [Paint Fence](https://leetcode.com/problems/paint-fence) | Easy | |
 | 278 | [First Bad Version](https://leetcode.com/problems/first-bad-version) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]([![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]) |
 | 283 | [Move Zeroes](https://leetcode.com/problems/move-zeroes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](https://github.com/anishLearnsToCode/leetcode-algorithms/blob/master/src/MoveZeros.java) |
-| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | Easy | |
+| 290 | [Word Pattern](https://leetcode.com/problems/word-pattern) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)]() |
 | 292 | [Nim Game](https://leetcode.com/problems/nim-game) | Easy | |
 | 293 | [Flip Game](https://leetcode.com/problems/flip-game) | Easy | |
 | 299 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | Easy | |

src/WordPattern.java

@@ -0,0 +1,30 @@
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
+
+public class WordPattern {
+    public static boolean wordPattern(String pattern, String string) {
+        Map<Character, String> bijection = new HashMap<>();
+        Set<String> wordsMappedTo = new HashSet<>();
+        String[] words = string.split(" ");
+        if (words.length != pattern.length()) {
+            return false;
+        }
+
+        for (int index = 0 ; index < pattern.length() ; index++) {
+            char letter = pattern.charAt(index);
+            String word = words[index];
+
+            if (!bijection.getOrDefault(letter, word).equals(word) ||
+                    (!bijection.containsKey(letter) && wordsMappedTo.contains(word))) {
+                return false;
+            }
+
+            bijection.put(letter, word);
+            wordsMappedTo.add(word);
+        }
+
+        return true;
+    }
+}