Add matrix traversal and product algorithms

[ravithakur2k]

Added three new Python files implementing algorithms for diagonal matrix traversal, spiral matrix traversal, and product of array except self. These solutions are optimized for time and space complexity and include comments for clarity.

[super30admin]

• Strengths:
  • The student has demonstrated a strong understanding of time and space complexity, providing efficient solutions.
  • The code is well-commented and easy to follow.
  • The student has correctly implemented the logic for all three problems.
• Areas for Improvement:
  • In the findDiagonalOrder solution, the variable c is initialized twice (c = 0 and c = 0), which is redundant. This should be fixed to avoid confusion.
  • The comments could be more detailed in explaining the logic, especially for the spiralOrder solution, where the conditions if (top <= bottom) and if (left <= right) might not be immediately clear to a reader.