Tamil | Boolean matrix | Brute force to optimal | GFG | Leetcode | competitive programming|interview

Hey all in this tutorial you will learn about Competitive programming in tamil
this video contains Boolean matrix problem
where i have explained three solutions brute force and two optimal solution with time complexity

brute force : 0(3r*c)
optimal 1 : 0(2r*c + r+c) with space 0(r+c)
optimal 2 : 0(2r*c + r+c) with space 0(1)
this problem had been asked in
zoho amazon freshworks and many product based compaines

0:00 intro
0:25 problem statement
1:00 brute force explanation
2:56 optmial soln with extra space
6:08 optimal coding with extra space
7:08 best optmial without space
10:34 best optimal coding
11:57 outro

check my
Android studio tips and tricks playlist :

check the playlist of making covid19 tracker app :

check the playlist of frequently asked MCQ in various MNC companies :

subscribe my channel for more videos :

-----------------------------------------------------------------------------------------------------------------

Tags :
competetive programming tamil,
competetive programming cs in tamil,
merge two sorted array,
merge array problem tamil,
sorting problem,
leetcode problems in java,
zoho interview experiance,
amazon interview experiance,
zoho problems,
zoho coding questions in tamil,
zoho tamil,
gfg programming tamil,
gfg solution tamil,
leetcode solution tamil,
datastructures in tamil,
boolean matrix leetcode,
boolean matrix gfg,
matrix in java tamil,
matrix problems in leetcode gfg,
data structures and algorithm tamil,

hashtags :
#competitiveprogrammingtamil #javasolution #gfg

[TheProblemSolvers]

Bro i don't know which language you are speaking ....but i understood the for the