Question d'entrevue chez WD: How would you represent a sparse matrix using minimum space complexity such that all elements can be accessed through their row and column indices?

WD

How would you represent a sparse matrix using minimum space complexity such that all elements can be accessed through their row and column indices?