input value of n there will be a n X n chess board and we want to place n queens on that board such that every column and every row of chess board has at least one queen in other words no column should not have no queen for that we think of recursion at first go but this approach can be optimosed with dp code implements visulisation of this conventional problem in data structures