In this video, we solve Leetcode 3446: Sort Matrix by Diagonals step by step. 🚀
We are given a square matrix and we need to sort all diagonals:
For diagonals starting from the first column (top half) → sort in ascending order.
For diagonals starting from the first row (bottom half, including [0][0]) → sort in descending order.
🔹 Key Concepts Covered:
How to traverse diagonals in a matrix.
Extract → sort → put back method.
Difference in sorting order depending on diagonal position.
Full Python solution explained line by line.
This is an excellent problem for practicing matrix traversal patterns, sorting, and diagonal manipulation.
📌 Hashtags
#Leetcode3446 #MatrixProblems #Sorting #Python #DSA #StatlearnTech #CodingInterview #LeetcodeDaily
