packageeasy;

importjava.util.HashMap;

importjava.util.Map;

publicclassWordPattern {

publicbooleanwordPattern(Stringpattern,Stringstr) {

String[]words =str.split(" ");

char[]patterns =pattern.toCharArray();

Map<Character,String>map =newHashMap();

if(patterns.length !=words.length)returnfalse;

for(inti =0;i <patterns.length;i++){

if(map.containsKey(patterns[i])){

if(!map.get(patterns[i]).equals(words[i]))returnfalse;

}else {

if(map.containsValue(words[i]))returnfalse;//this is for this case: "abba", "dog dog dog dog"

map.put(patterns[i],words[i]);

}

}

returntrue;

}

}

|301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)|[Solution]| ? | ? | Hard| BFS

|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)|[Solution](../../blob/master/EASY/src/easy/BullsandCows.java)| O(n)|O(1)| Easy|

|292|[Nim Game](https://leetcode.com/problems/nim-game/)|[Solution](../../blob/master/EASY/src/easy/NimGame.java)| O(1)|O(1)| Easy|

|290|[Word Pattern](https://leetcode.com/problems/word-pattern/)|[Solution](../../blob/master/EASY/src/easy/WordPattern.java)| O(n)|O(n)| Easy|

|289|[Game of Life](https://leetcode.com/problems/game-of-life/)|[Solution](../../blob/master/MEDIUM/src/medium/GameOfLife.java)| O(m*n)|O(m*n), could be optimized to O(1)| Medium|

|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)|[Solution](../../blob/master/EASY/src/easy/MoveZeroes.java)| O(n)|O(1)| Easy|

|280|[Wiggle Sort](https://leetcode.com/problems/wiggle-sort/)|[Solution](../../blob/master/MEDIUM/src/medium/WiggleSort.java)| O(n)|O(1)| Medium|