Maximal Square and Longest Increasing Subsequence
Company: Salesforce
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Technical Screen
Overview: Implement two independent analyses: the largest all-ones square in a binary matrix and the length of a strictly increasing subsequence. Account for empty inputs, area-versus-side-length semantics, duplicate values, very large sequences, complexity comparisons, reduced auxiliary space, and witness reconstruction.