The N-Queen problem is a classical artificial intelligence and backtracking problem in which (N) queens are to be placed on an (N \times N) chessboard such that no two queens attack each other. A queen can attack another queen if they are placed in the same row, same column, or along the same diagonal. Although recursive backtracking is the most common approach, the problem can also be solved iteratively without recursion by explicitly managing the backtracking process using arrays and loop control. This approach avoids the overhead of recursive function calls while achieving the same result. The iterative algorithm maintains an array `board`, where `board[row]` stores the column position of the queen in that row. The algorithm begins with the first row and attempts to place a queen in each column. Before placing a queen, it checks whether the chosen position is safe by comparing it with the positions of queens already placed in previous rows. If