write a program to solve N-queens problem using non recursive way in C ++

This allocates the array for us dynamically, at run-time. After this we can use the array q just as if it had been declared normally" and it has n elements denoted q[0] through q[n-1]. When we no longer need the memory that was allocated to the array, we write delete I I q For this problem, you pass the required length for the array q to your function, which then allocates q dynamically (using "new") and uses it to hold the solutions for the given size. Each time the function exits, you must deallocate q by calling delete [ ]