CodeBook
Ctrlk
  • Introduction
  • Array
  • Binary Search
  • Two Pointers
  • BFS
  • DFS
  • Tree
  • String
  • Data Structures
    • 0 Design
    • 1 LinkedList
    • 2 Stack
    • 3 Queue/Deque
    • 4 Heap
    • 5 Interval
    • 6 Matrix
      • Multiply Sparse Matrix
      • Matrix Diagonal Traverse
      • Valid Sudoku
      • Spiral Matrix
    • 7 Iterator
    • 8 Hash
  • Advanced Data Structures
  • Graph
  • Dynamic Programming
  • Common Methods
  • Design/OOD
  • Appendix
Powered by GitBook
On this page
  1. Data Structures

6 Matrix

Multiply Sparse MatrixMatrix Diagonal TraverseValid SudokuSpiral Matrix
PreviousMeeting Room IINextMultiply Sparse Matrix

Last updated 6 years ago