packageeasy;

importjava.util.HashSet;

importjava.util.Set;

publicclassBullsandCows {

publicStringgetHint(Stringsecret,Stringguess) {

int[]secretCows =newint[10];

int[]guessCows =newint[10];

intbulls =0;

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

if(guess.charAt(i) ==secret.charAt(i))bulls++;

else{

secretCows[Character.getNumericValue(secret.charAt(i))] ++;

guessCows[Character.getNumericValue(guess.charAt(i))] ++;

}

}

intcows =0;

for(inti =0;i <11;i++){

cows +=Math.min(secretCows[i],guessCows[i]);

}

returnbulls +"A" +cows +"B";

}

}

|325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)|[Solution] | O(n)|O(n) | Medium| HashMap

|314|[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)|[Solution](../../blob/master/MEDIUM/src/medium/BinaryTreeVerticalOrderTraversal.java)| O(n)|O(n) | Medium| HashMap, BFS

|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|

|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|