Problem Description
Given the position of a Bishop (A, B) on an 8 * 8 chessboard.
Your task is to count the total number of squares that can be visited by the Bishop in one move.
The position of the Bishop is denoted using row and column number of the chessboard.
1 <= A, B <= 8
First argument is an integer A denoting the row number of the bishop.
Second argument is an integer B denoting the column number of the bishop.
Return an integer denoting the total number of squares that can be visited by the Bishop in one move.
Input 1:
A = 4 B = 4
Output 1:
13
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
