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 996fd78 commit 457c31bCopy full SHA for 457c31b
dsa-solutions/lc-solutions/3000-3099/3001-Minimum moves to capture queen.md renamed to dsa-solutions/lc-solutions/3000-3099/minimum-moves-to-capture-the-queen.md
@@ -1,5 +1,5 @@
1
---
2
-id: Minimum-Moves-to-Capture-The-Queen
+id: minimum-moves-to-capture-the-queen
3
title: Minimum Moves to Capture The Queen
4
sidebar_label: 3001 - Minimum Moves to Capture The Queen
5
tags:
@@ -243,7 +243,3 @@ public:
243
### Conclusion
244
245
THis code efficectively calculates the minimum number of moves using constant space and constant time
246
-
247
-- **LeetCode Problem**: [Minimum Moves to Capture The Queen](https://leetcode.com/problems/minimum-moves-to-capture-the-queen/description/)
248
249
-- **Solution Link**: [LeetCode Solution](https://leetcode.com/problems/minimum-moves-to-capture-the-queen/solutions/4577719/beats-100-time-complexity-o-1)
0 commit comments