How should I practice Biggest Connected Component?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Codeium online assessment problems in FastPrep.

Is Biggest Connected Component associated with Codeium?

FastPrep tags this as a Codeium online assessment coding practice problem when the problem catalog has that company and stage context.

Biggest Connected Component

Codeium● HardOA

Learn

Problem statement

Alice has a grid represented as a 2D integer array grid with h rows and w columns.

A cell is considered "filled" if its value is 1, and "empty" if its value is 0. A group of filled cells is connected if you can reach any cell from any other cell by moving horizontally or vertically. The size of a connected group is the number of cells in it.

Alice can perform one operation: choose a row or column and fill all its cells with 1.

Help Alice find the maximum possible size of the largest connected group of filled cells after performing the operation at most once.

Function

getBiggestConnectedComponent(h: int, w: int, grid: int[][]) → int

Examples

Example 1

h = 3w = 5grid = [[1, 0, 1, 0, 0], [0, 1, 0, 0, 0], [1, 0, 1, 0, 0]]return = 9

In this example, Alice should set the 2nd row to all 1s.

This connects all 5 cells in the 2nd row with the four originally filled cells in columns 1 and 3, so the largest connected group has 9 cells.

Constraints

The product of h and w is less than 1,000,000.
Your solution should work in a reasonable amount of time regardless of the contents of the grid. There are test cases checking that on a roughly 999 x 999 grid, your solution finishes in less than 1 second.