New update is available. Click here to update.

Solve problems & track your progress

Checkout your overall progress in every topic here

Become

Sensei

in DSA topics

Open the topic and solve more problems associated with it to improve your skills

Check out the skill meter for every topic

See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

Problem

Submissions

Capture the Pawns

Contributed by

srejanbera

Easy

0/40

Avg time to solve 15 mins

Success Rate 75 %

2 upvotes

Problem Statement

Ninja is learning how to play chess. He is still a beginner, so his friend gave him a simple puzzle. The given situation of the chessboard has only one white Rook ‘R’, some white bishops ‘B’ and some black pawns ‘P’. The task is to find the number of pawns that can be captured by the Rook. Can you help Ninja to solve this problem?

You are given a list of 8 strings of size 8 characters each to describe the position of the pieces. Find the number of pawns that can be captured by the Rook

Detailed explanation ( Input/output format, Notes, Constraints, Images )

Input Format:

Each test case contains a list of 8 space-separated strings.

Output Format:

For each test case, print ‘an integer corresponding to the number of pawns that can be captured by the Rook.

Print the output of each test case in a separate line.

Note:

You do not need to print anything. It has already been taken care of. Just implement the given function.

Constraints:

Board[i][j] = {‘R’ , ‘B’, ‘P’, ‘ * ’ }.

Time limit: 1 sec

Sample Input 1:

******** ******** ***R***P ******** ***P****  ******** ***P**** ********

Sample Output 1:

Explanation of sample input 1:

The white rook will attack the pawns at d5 and h6. Hence, the answer is 2.

Sample Input 2:

***P**** ***B**** P**R***P ******** ***P****  ******** ***P**** ********

Sample Output 2:

Auto

Console