NOTO Hiring Challenge | Online Assessment Question | Off-Campus (2024)

Number of Rectangles That Can Form the Largest Square Problem Statement You are given a 2D integer array rectangles, where each element rectangles[i] = [length, width] represents the dimensions of a rectangle. A square can be formed inside a rectangle using the smaller of its two dimensions. Your task is to determine: The largest possible square side that can be formed from any rectangle. How many rectangles can form a square with that maximum side length. Return the count of ...