Problem Statement
Maximum Wedges in Matrix Path Problem Description A matrix `m x n` is given in which a person enters from the top-right corner. The person can make exactly two left turns and must come out from the right side only from the matrix. In this traversal, what is the maximum number of wedges collected by the person?