LeetCode Entry

1267. Count Servers that Communicate

08.11.2026 medium 2026 kotlin rust

cells connected by row or column

1267. Count Servers that Communicate medium substack youtube

https://dmitrysamoylenko.com/leetcode/

08.11.2026.webp

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1536

Problem TLDR

1-cells connected by row or column

Intuition

Brute-force

Approach

  • column sum + row sum > 2

Complexity

  • Time complexity: \(O(n^3)\)

  • Space complexity: \(O(1)\)

Code

    fun countServers(g: Array<IntArray>)=
    g.sumOf{r->r.indices.count{x->r[x]*(r.sum()+g.sumOf{it[x]})>2}}
    pub fn count_servers(g: Vec<Vec<i32>>) -> i32 {
        g.iter().fold(0,|s,r|(0..).zip(r).fold(s,|s,(x,v)|
            s+v*(g.iter().fold(2,|a,c|a-c[x])<r.iter().sum())as i32))
    }

Comments