InterviewBit Problems   Queen Attack : Solved

About the Queen Attack : Solved category (1)
O(mn) solution with dp (1)
Simple JAVA dfs (1)
Shortest solution using dfs on all 8 directions for every queen (3)
C++ code for given solution approach (1)
Simple but long python solution (1)
Simple Solution for Queen Attack (using 8 direction Approach) (2)
Solution with O(N) additional memory. (Since my vector<vector<vector<int>>> dp with M*N*8 failed with MLE :/) (2)
A simpler approach using simple implementation (1)
A much simpler approach in C++ [Non DP] (1)
Queen Attack BitMasking (1)
Can be solved without using DP in an iterative way (3)
Use of bits to save space : O(m*n) (1)
Iterative solution with O(n+m) space complexity (1)
Non-DP solution (1)
The most intuitive way is to rotate the board (1)