SourCaPlacement OS

Targeted Campus Assessment Prep

Setting up coding workspace...

Loading problem statement, test cases, and compiler sandbox

SourCaPlacement OS

Targeted Campus Assessment Prep

Loading SourCa...

Synchronizing placement benchmarks & campus recruitment roadmaps

SourCa/ Technical Preparation Platform

Companies Practice Progress College Insights Share Feedback Privacy

SourCa is an independent coding and assessment practice system designed from publicly available interview patterns. Not affiliated with or endorsed by any company.

INDEPENDENT PLATFORM

SourCaPlacement OS

Targeted Campus Assessment Prep

Setting up coding workspace...

Loading problem statement, test cases, and compiler sandbox

Tech Mahindra • Coding AssessmentSet 178/251•

Number of Closed Islandscoding

Next in Set

coding•DSA & Problem Solving•Graphs & Backtracking

Number of Closed Islands

Problem Statement

Given a 2D grid consists of `0`s (land) and `1`s (water). An island is a maximal 4-directionally connected group of `0`s and a closed island is an island totally (all left, top, right, bottom) surrounded by `1`s. Return the number of closed islands. ### Constraints - `1 <= grid.length, grid[0].length <= 100` - `0 <= grid[i][j] <= 1` ### Input Format - Line 1: Two space-separated integers `m` and `n`. - Next `m` lines: `n` space-separated integers (0 or 1). ### Output Format Print the number of closed islands.

Sample Cases

Example 1Sample Case

Input: 5 8 1 1 1 1 1 1 1 1 1 0 0 1 1 0 1 1 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

Output: 2

Example 2Sample Case

Input: 3 3 0 0 0 0 1 0 0 0 0

Output: 0

Example 3Sample Case

Input: 3 3 1 0 1 1 0 1 1 1 1

Output: 0

Constraints

Runtime Limit: 2000 ms per test batch
Memory Limit: 256 MB
Standard I/O stream reading

Official submissions are evaluated against hidden test cases on the server to verify time & memory complexity.

solution.pyUTF-8 • Tab: 4 spaces

Initializing SourCa IDE...

Test Cases:

Ready to Evaluate

Online Judge Sandbox // Sample Verification

Input

5 8 1 1 1 1 1 1 1 1 1 0 0 1 1 0 1 1 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

Expected Output