<p>On an <strong>8x8</strong> chessboard, there can be multiple Black Queens and one White King.</p>



<p>Given an array of integer coordinates <code>queens</code> that represents the positions of the Black Queens, and a pair of coordinates <code>king</code> that represent the position of the White King, return the coordinates of all the queens (in any order) that can attack the King.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>



<p><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram.jpg" style="width: 321px; height: 321px;" /></p>



<pre>

<strong>Input:</strong> queens = [[0,1],[1,0],[4,0],[0,4],[3,3],[2,4]], king = [0,0]

<strong>Output:</strong> [[0,1],[1,0],[3,3]]

<strong>Explanation:</strong>&nbsp; 

The queen at [0,1] can attack the king cause they&#39;re in the same row. 

The queen at [1,0] can attack the king cause they&#39;re in the same column. 

The queen at [3,3] can attack the king cause they&#39;re in the same diagnal. 

The queen at [0,4] can&#39;t attack the king cause it&#39;s blocked by the queen at [0,1]. 

The queen at [4,0] can&#39;t attack the king cause it&#39;s blocked by the queen at [1,0]. 

The queen at [2,4] can&#39;t attack the king cause it&#39;s not in the same row/column/diagnal as the king.

</pre>



<p><strong>Example 2:</strong></p>



<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-1.jpg" style="width: 321px; height: 321px;" /></strong></p>



<pre>

<strong>Input:</strong> queens = [[0,0],[1,1],[2,2],[3,4],[3,5],[4,4],[4,5]], king = [3,3]

<strong>Output:</strong> [[2,2],[3,4],[4,4]]

</pre>



<p><strong>Example 3:</strong></p>



<p><strong><img alt="" src="https://assets.leetcode.com/uploads/2019/10/01/untitled-diagram-2.jpg" style="width: 321px; height: 321px;" /></strong></p>



<pre>

<strong>Input:</strong> queens = [[5,6],[7,7],[2,1],[0,7],[1,6],[5,1],[3,7],[0,3],[4,0],[1,2],[6,3],[5,0],[0,4],[2,2],[1,1],[6,4],[5,4],[0,0],[2,6],[4,5],[5,2],[1,4],[7,5],[2,3],[0,5],[4,2],[1,0],[2,7],[0,1],[4,6],[6,1],[0,6],[4,3],[1,7]], king = [3,4]

<strong>Output:</strong> [[2,3],[1,4],[1,6],[3,7],[4,3],[5,4],[4,5]]

</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= queens.length&nbsp;&lt;= 63</code></li>
	<li><code>queens[i].length == 2</code></li>
	<li><code>0 &lt;= queens[i][j] &lt;&nbsp;8</code></li>
	<li><code>king.length == 2</code></li>
	<li><code>0 &lt;= king[0], king[1] &lt; 8</code></li>
	<li>At most one piece is allowed in a cell.</li>
</ul>