The interview process assesses candidate proficiency in algorithmic problem-solving and scalable System Design.

Expect LeetCode-style questions covering fundamental algorithms and data structures, including:

• Graph traversal like DFS and BFS
• Array manipulation using Two Pointers
• Recursive problem decomposition (Recursion)

Focus on efficiency and complexity analysis.

Given an $m \times n$ binary matrix representing a map of 'land' ($1$) and 'water' ($0$), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically.