Freaks City

Given two integer arrays nums1 and nums2 sorted in non-decraesing order, merge nums2 into nums1 to produce a single sorted array. The array nums1 has length m + n, where the first m elements contain values to be merged and the last n elements are placeholder zeros. nums2 has length n. The modification must occur in-place within nums1. Approach ...

Given an m x n matrix, if an element is zero, set its entire row and column to zero. The challenge is to perform this modification in place without using extra matrix storage. The key idea: use the first row and first column as flag storage to record which rows and columns need zeroing, then apply the changes in a final pass. Algorithm Outline ...