Rename 0051-n-queens-uzzle.md to 0051-N-queens-Puzzle.md

Author: chahal0

dsa-solutions/lc-solutions/0000-0099/0051-n-queens-uzzle.md renamed to dsa-solutions/lc-solutions/0000-0099/0051-N-queens-Puzzle.md

@@ -299,4 +299,4 @@ var solveNQueens = function(n) {
 - Convert the list of queen positions into the board representation as a list of strings.
 
 ### Conclusion
-The n-queens puzzle, solved using backtracking, ensures no two queens attack each other on an n x n chessboard. Solutions are efficiently implemented in Python, Java, C++, C, and JavaScript.
+The n-queens puzzle, solved using backtracking, ensures no two queens attack each other on an n x n chessboard. Solutions are efficiently implemented in Python, Java, C++, C, and JavaScript.