We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8ddad8f commit 25884f1Copy full SHA for 25884f1
1 file changed
src/data/roadmaps/leetcode/content/n-queens@fBtsnKP5n3WBjMycwIfir.md
@@ -5,5 +5,4 @@ Place n queens on an n by n chessboard so that no two queens attack each other,
5
Visit the following resources to learn more:
6
7
- [@article@N-Queens](https://leetcode.com/problems/n-queens/)
8
-- [@video@N-Queens Problem | using Backtracking | Leetcode Hard](https://www.youtube.com/watch?v=BdSJnIdR-4s)
9
- [@video@The N Queens Problem using Backtracking/Recursion](https://www.youtube.com/watch?v=wGbuCyNpxIg)
0 commit comments