Boolean Matrix | Competitive Programming for Beginners | Hello World by Prince | Placement series
In this video, I am going to discuss or solve Boolean Matrix. I showed step by step process with Theory and code.
Given a boolean matrix of size RxC where each cell contains either 0 or 1, modify it such that if a matrix cell matrix[i][j] is 1 then all the cells in its ith row and jth column will become 1.
Input:
R = 2, C = 2
matrix[][] = {{1, 0},
{0, 0}}
Output:
1 1
1 0
Explanation:
Only cell that has 1 is at (0,0) so all
cells in row 0 are modified to 1 and all
cells in column 0 are modified to 1.
We also Provide courses on Competitive Programming and Data structure and Algorithms. Please see our Full Playlist on our Channel.
----------------------------------------------------------------------------------------
Boolean Matrix: https://practice.geeksforgeeks.org/pr...
Pdf of Boolean Matrix: https://github.com/Prince-1501/Hello_...
Code of Boolean Matrix: https://github.com/Prince-1501/Hello_...
----------------------------------------------------------------------------------------
*Follow me *
LinkedIn► / iamprince
Facebook► / helloworldofficials
Instagram► / helloworldbyprince
Twitter► / prince_king_
----------------------------------------------------------------------------------------
►Our Playlists on:-
►Competitive Programming: • How to start Competitive Programming ...
►C++ Full Course : • L-01 || Introduction and History of C...
►Algorithms: • L-01 || Prefix Sum Array || Algorithms
►Data Structure: • Data Structures with Code Practice | ...
------------------------------------------------------------------------
#matrix #geeksforgeeks #programming
