Skip to main content
Back to problems
#2125
Medium Algorithms

Number of laser beams in a bank

Array Math String Matrix
87.0% acceptance
Feb 25, 2026
2229
223
Anti-theft security devices are activated inside a bank. You are given a 0-indexed binary string array bank representing the floor plan of the bank, which is an m x n 2D matrix. bank[i] represents the ith row, consisting of '0's and '1's. '0' means the cell is empty, while'1' means the cell has a security device. There is one laser beam between any two security devices if both conditions are met: The two devices are located on two different rows: r1 and r2, where r1 < r2. For each row i where r1 < i < r2, there are no security devices in the ith row. Laser beams are independent, i.e., one beam does not interfere nor join with another. Return the total number of laser beams in the bank.

Solution

Rust
Time O(n)
Space O(1)
LeetCode
solution.rs
impl Solution {
  pub fn number_of_beams(bank: Vec<String>) -> i32 {
    let mut prev = 0i32;
    let mut total = 0i32;
    for row in &bank {
      let count = row.bytes().filter(|&b| b == b'1').count() as i32;
      if count > 0 {
        total += prev * count;
        prev = count;
      }
    }
    total
  }
}