Practice Battleships in a Board
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
Given an m x n matrix board where each cell is a battleship 'X' or empty '.', return the number of the battleships on board. Battleships can only be placed horizontally or vertically on board. In other words, they can only be made of the shape 1 x k (1 row, k columns) or k x 1 (k rows, 1 column), where k can be of any size. At least one horizontal or vertical cell separates between two battleships (i.e., there are no adjacent battleships). Example 1: Example 2: Constraints: Follow up: Could you do it in one-pass, using only O(1) extra memory and without modifying the values board?
Source: Battleships in a Board on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
board = [["X",".",".","X"],[".",".",".","X"],[".",".",".","X"]]
2
# Example 2
board = [["."]]
0
Constraints
Related LeetCode Problems
Practice more problems similar to Battleships in a Board.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.