Solve island connectivity and string multiplication
Company: Meta
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
##### Question
Given N distinct islands (e.g., a, b, c…) and a list of existing undirected paths between them, compute the minimum number of additional paths required so that all islands become connected. LeetCode 43. Multiply Strings – Given two non-negative integers represented as strings, return their product as a string. (Clarify whether the carry can exceed 10.)
https://leetcode.com/problems/multiply-strings/description/
Quick Answer: This question evaluates graph connectivity reasoning (computing minimum edges to unify components) and string-based big-integer arithmetic (multiplying numbers represented as strings), testing competency in graph theory, component analysis, and numeric string manipulation.