Cracking the Coding Interview, 4 Edition - 150 Programming Interview Questions and Solutions

Chapter 20 | Hard
Input: DAMP, LIKE
Output: DAMP -> LAMP -> LIMP -> LIME -> LIKE
________________________________________________________________pg 291
20.11 Imagine you have a square matrix, where each cell is filled with either black or white.
Design an algorithm to find the maximum subsquare such that all four borders are
filled with black pixels.
________________________________________________________________pg 293
20.12 Given an NxN matrix of positive and negative integers, write code to find the submatrix
with the largest possible sum.
________________________________________________________________pg 295
20.13 Given a dictionary of millions of words, give an algorithm to find the largest possible
rectangle of letters such that every row forms a word (reading left to right) and every
column forms a word (reading top to bottom).
________________________________________________________________pg 298
CareerCup.com
9 2