https://www.educative.io/courses/grokking-coding-interview-in-javascript/solution-the-k-weakest-rows-in-a-matrix
Learn to identify the k weakest rows in a binary matrix using binary search and a max-heap to optimize time and space complexity.
binary matrixusing searchfindkrows
https://www.educative.io/courses/grokking-coding-interview-in-go/01-matrix
Learn to solve the matrix distance problem by finding the shortest path to zeros with dynamic programming techniques and adjacency rules.
binary matrixfinddistancenearestzero
https://deepai.org/publication/approximation-schemes-for-low-rank-binary-matrix-approximation-problems
07/18/18 - We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to addit...
binary matrixapproximationschemeslowrank
https://dev.to/pahujanayan/day-41-shortest-path-in-a-binary-matrix-1lcd
Hey everyone! Welcome back to another day of problem-solving. It's day 41, and I'm still going strong... Tagged with coding, leetcode, cpp, tutorial.
shortest pathbinary matrixdev communityday