Answer Happy

Need code in python
Sudoku is a number-placement puzzle. The objective is to fill a 9 × 9 grid with digits so that each column, each row, and each of the nine 3 x 3 sub-grids that compose the grid contains all of the digits from 1 to 9 This algorithm should check if the given grid of numbers represents a correct solution to Sudoku. Example For the first example below, the output should be true For the other grid, the output should be false : each of the nine 3 × 3 sub-grids should contain all of the digits from 1 to 9 Example 1 132 546 987 4 6 5 87932 1 798213 6 5 4 92 14 35 8 7 6 354768219 687192543 576981432 243 657 198 819324765 Example 2 134256 987 46 85 79 3 2 1 79 28 1 3 6 5 4 923145876 35 7 4 6 8 2 19 6 8 17 9 2 5 4 3 576 981 4 3 2 2 456 3 7 198 819 32 4 7 6 5
● ● [execution time limit] 4 seconds (py) [input] array.array.integer grid A matrix representing 9 × 9 grid already filled with numbers from 1 to 9. [output] boolean true if the given grid represents a correct solution to Sudoku, false otherwise. [Python 2] Syntax Tips #Prints help message to the console # Returns a string def helloWorld (name) : print "This prints to the console when you return "Hello, " + name