25/08/25 @LeetCode POTD
I sovled this initially using simple diagonal traversal and reversing alternate sequences. Looked into the optimal solution haha def not easy to come up. Keep in mind r + c is equal to number of diagonal counting from top.
TC-O(n*m)
#DSA #LeetCode
