Merge pull request #5 from Mansi1233/master

Added Problem 64

Author: offamitkumar

README.md

@@ -53,6 +53,22 @@
 #### Click [__*here*__](Solution/Day-045.cpp) for solution.
 #### Click [__*here*__](https://leetcode.com/problems/implement-rand10-using-rand7/) to visit [*LeetCode*](https://leetcode.com/) for this question.
 ---
+## Problem 64
+##### This problem was asked by Google.
+##### A knight's tour is a sequence of moves by a knight on a chessboard such that all squares are visited once.
+##### Given N, write a function to return the number of knight's tours on an N by N chessboard.
+##### My Testcase :
+##### 
+``` 
+      input : 1 , Output : 1
+      input : 2 , Output : 0 
+      input : 3 , Output : 0
+      input : 4 , Output : 0
+      input : 5 , Output : 1728 (it took 23 seconds) 
+```
+
+#### Click [__*here*__](Solution/Day-064.cpp) for solution.
+---
 ## Problem 65
 ##### This problem was asked by Amazon.
 ##### Given a N by M matrix of numbers, print out the matrix in a clockwise spiral.