Adds solution for LeetCode Daily Challenge on Day 27 in Java.
This solution uses dynamic programming to count square submatrices of 1s. For each cell in the matrix, if it's 1, we check its top, left, and top-left neighbors to see how big of a square we can form there, then add that to our total count.
📝 Issue Reference:
Fixes issue: #27
🔍 Checklist:
Please ensure the following before submitting your PR:
[x] I have placed my solution in the correct folder (solutions/dayXX/).
[x] My code follows clean coding practices and is efficient.
[x] I have added comments in my code to explain the approach.
[x] I have updated the README.md for the specific day with a brief explanation of my solution.
[x] I have tested the solution on LeetCode and it works correctly.
🚀 What does this PR do?
📝 Issue Reference:
Fixes issue: #27
🔍 Checklist:
Please ensure the following before submitting your PR:
solutions/dayXX/).README.mdfor the specific day with a brief explanation of my solution.🔧 Solution Details:
🌟 Additional Notes (if any):