Algorithms Wildcard Pattern Matching (Dynamic Programming) In the Wildcard Pattern Matching problem, we find if a pattern matches a given input string. We will be using a Dynamic Programming approach with the time complexity of O(m * n), here m and n represent length of string and pattern respectively.

Algorithms Finding the number of sub matrices having sum divisible by K This article is about counting the number of sub-matrices such that the sum of the elements is divisible by k and using Dynamic Programming, we solve it in O(N^3)

Algorithms Largest rectangular sub matrix having sum divisible by k This article is about finding the size of the largest area of the rectangular sub-matrix such that the sum of the elements is divisible by k.