Question: Design an algorithm that finds the largest rectangular pattern that appears more than once in a given bitmap. Input: A 2D array M[1..n, 1..n] of
Design an algorithm that finds the largest rectangular pattern that appears more than once in a given bitmap.
Input: A 2D array M[1..n, 1..n] of bits
Output: The area of the repeated pattern
Two copies of the pattern may overlap, but cannot coincide.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
