# Available Captures for Rook Leetcode Solution

Difficulty Level Easy
algorithms Array coding Interview interviewprep LeetCode LeetCodeSolutionsViews 196

## Problem Statement

In this problem, we are given a 2-D matrix that represents a chessboard with a white rook and some other pieces on it. White’s Rook is represented by the character ‘R’. White’s bishops are represented by ‘B’ and black’s pawns are represented as ‘p’. The problem guarantees that there is no other piece other than the above-mentioned. Our goal is to find out the number of possible black pawns that can be captured by the white rook in one move(considering general chess rules).

### Example

```board = [[".",".",".",".",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".","R",".",".",".","p"],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".","p",".",".",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."]]```
`3`
```board = [[".",".",".",".",".",".",".","."],
[".","p","p","p","p","p",".","."],
[".","p","p","B","p","p",".","."],
[".","p","B","R","B","p",".","."],
[".","p","p","B","p","p",".","."],
[".","p","p","p","p","p",".","."],
[".",".",".",".",".",".",".","."],
[".",".",".",".",".",".",".","."]]```
`0`

## Approach

The approach for the problem is to first find the position of the rook in the chessboard 2-D array and then we can iteratively check in the top, left, right and bottom directions to find if we can find a black pawn(‘p’). In case, we reach end or strike a bishop of the same color in any direction, we stop checking in that direction any further.

### Algorithm

1. Traverse the whole matrix to find a character ‘R’ and save its row and column number in r, c respectively.
2. Initialize cnt to store number of pawns that can be captured
3. Check in the top direction, range: i ∈ (0 , r – 1):
• if board[i][c] == ‘p’:
• increment cnt, cnt++
• break
• if board[i][c] == ‘B’:
• break
4. Do the same for left, right, and the bottom directions
5. Return cnt

### Implementation of Available Captures for Rook Leetcode Solution

#### C++ Program

```#include <bits/stdc++.h>

using namespace std;

int numRookCaptures(vector<vector<char>>& board)
{
if(board.empty())
return 0;
int n = board.size() , m = board[0].size() , cnt = 0 , r , c;

for(int i = 0 ; i < n ; i++)
for(int j = 0 ; j < m ; j++)
{
if(board[i][j] == 'R')
{
r = i;
c = j;
break;
}
}

for(int i = r - 1 ; i >= 0 ; i--)
{
if(board[i][c] == 'p')
{
cnt++;
break;
}
if(board[i][c] == 'B')
break;
}
for(int i = r + 1 ; i < n ; i++)
{
if(board[i][c] == 'p')
{
cnt++;
break;
}
if(board[i][c] == 'B')
break;
}

for(int j = c - 1 ; j >= 0 ; j--)
{
if(board[r][j] == 'p')
{
cnt++;
break;
}
if(board[r][j] == 'B')
break;
}

for(int j = c + 1 ; j < m ; j++)
{
if(board[r][j] == 'p')
{
cnt++;
break;
}
if(board[r][j] == 'B')
break;
}
return cnt;
}

int main() {
vector <vector <char> > board = {{'.','.','.','.','.','.','.','.'},
{'.','.','.','p','.','.','.','.'},
{'.','.','.','R','.','.','.','p'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','p','.','.','.','.'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','.','.','.','.','.'}};

cout << numRookCaptures(board) << endl;
return 0;
}```

#### Java Program

```class number_of_rook_captures {

public static void main(String args[]) {
char[][] board = {{'.','.','.','.','.','.','.','.'},
{'.','.','.','p','.','.','.','.'},
{'.','.','.','R','.','.','.','p'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','p','.','.','.','.'},
{'.','.','.','.','.','.','.','.'},
{'.','.','.','.','.','.','.','.'}};

System.out.println(numRookCaptures(board));
}

public static int numRookCaptures(char [][] board) {
if(board.length == 0)
return 0;
int n = board.length , m = board[0].length , cnt = 0 , r = -1 , c = -1;

for(int i = 0 ; i < n ; i++)
for(int j = 0 ; j < m ; j++)
{
if(board[i][j] == 'R')
{
r = i;
c = j;
break;
}
}

for(int i = r - 1 ; i >= 0 ; i--)
{
if(board[i][c] == 'p')
{
cnt++;
break;
}
if(board[i][c] == 'B')
break;
}
for(int i = r + 1 ; i < n ; i++)
{
if(board[i][c] == 'p')
{
cnt++;
break;
}
if(board[i][c] == 'B')
break;
}

for(int j = c - 1 ; j >= 0 ; j--)
{
if(board[r][j] == 'p')
{
cnt++;
break;
}
if(board[r][j] == 'B')
break;
}

for(int j = c + 1 ; j < m ; j++)
{
if(board[r][j] == 'p')
{
cnt++;
break;
}
if(board[r][j] == 'B')
break;
}
return cnt;
}
}```
`3`

### Complexity Analysis of Available Captures for Rook Leetcode Solution

#### Time Complexity

O(1), as we iterate a constant number of times.

#### Space Complexity

O(1), as we use only constant memory space irrespective of the input.

Translate »