How do you implement multiple winning patterns? - You start with a 2D array, then convert the 2D array to 1D array and then a binary array. You can use a binary arrray in this case, because you don't care about the integer in the array, only the winning pattern. Eventually you convert the binary array to an integer, and then compare the integer to the user generated pattern. Thus you get a O(1) time complexity for comparing each user's winning.