Find all valid ways of putting N queens on an N*N chessboard so that no two queens can attack each other (two queens can attack each other if they are on the same row/colomn or same diagonal line). FInd the time and space complexity

Using Java you can use your own way of how to print the solution