This video is full of lessons. As a student, I was exposed to new terms and learned what they mean from searching. And I loved that you guys clarified asking for a hint is totally okay
Loved the format of the video! I've seen countless videos with this concept for med students but watching one with Engineering students feels great cause it inspires me to do better at my job/field as a Data engineer!! Keep these coming thanks.
You don’t have to be a leetcode expert as a student. I didnt look at leetcode until i graduated, now I have a good job. Slow and steady, keep your head up
You need to start looking into building your portfolio and craft. Just taking the required classes isn’t enough. I’ve met plenty of CS majors who never even bother getting an internship during their time as a college student. Big red flag.
6:39 Bro we can use queue as well. Just push the source coordinates and then push its neighbouring coordinates into the queue after taking source out and so on. Time complexity will also be the same. Infact, we can use any from both stack and queue because LIFO and FIFO doesn't matter in this question as we only have to colour the matrix. Space complexity will also be the same in both dfs and bfs because in dfs you are also using recursive stack space
You're absolutely correct, and I lean towards BFS over DFS for this particular problem. I'm a bit surprised the author wasn't aware that BFS performs just as effectively in this context.
Yup, bfs and dfs are usually interchangeable in these interview questions. And since a queue is pretty much just a linked list, the one student that suggested that was also incorrectly marked as wrong. You can get bonus points for mentioning that depending on the structure of the data one may be slightly better than the other for amount of space they take up, but generally big O they are the same. FAANG SWE here btw.
@@ThePeteyGG I don't think so mentioning linked list is a wise decision( although queues can be implemented using linked list )because it's just not intuitive and will just make the code lengthy. By this logic, even array would be correct answer
6:40 The question can be done using a queue as well, if we do BFS. It wasn't the wrong algorithm lmao. Both BFS and DFS have the same time and space complexity.
the issue with recursion is that it takes up a lot of space on the stack a better way to do it is using a queue system that stores all the points that need to be checked, then do what you need with each of those. that way you only have one bit of code trying to run at a time vs waiting for a ton of functions to complete. i've found that you can reach recursion limits very quickly with recursion flood fill
A queue also takes up space, xD. Still O(M*N) space, both for using a stack or a queue. For recursion limit problem, use a custom stack then, since stacks are marginally faster than queues while growing.
This was really good. Do more of these so we can see what success looks like without falsely feeling like we can’t do it either (given we’ve done enough homework).
i'm very glad that i visited youtube app to watch a video while eating my lunch... and found this... it really gave me new insights and somehow it lights up another flame inside me!!! 😀🤯 i am excited now 🤩
Watching this video i can confirm , there is a huge difference in Indian Universities and these ones. Total study system doesn't let people think off the bat. An avg. Student here will never be able to solve these problems.
Motivation at level 100, bro can you plz make a video on how a new learner starts his career as a software developer without having degree to compete with Berkeley or any other elite institutions, by self learning.
bootcamp man, its more intense but it will be enough to start as a junior. Many people i know went this route and most are fullfilled with solved real life problems with tech
When he mentioned using a queue, I think he meant to solve using BFS, which is not a wrong solution. But DFS is indeed more efficient and more intuitive though.
I agree with the guy who said "leetcode is not the best way to learn, but we need jobs". I would hire him, out of respect for his understanding of problem solving.
Philosophy is very logic heavy. Classical logic starts its development with Aristotle. And philosophers like Frege and Boole formalized modern logic, which fundamentally helped to develop computers. A lot of philosophers come from math, comp sci, and physics backgrounds. For example, Descartes developed the Cartesian plane helping mathematicians develop calculus and analytic geometry.
Philosophy is actually quite logical and mathematical, especially at Berkeley. You’re exposed to a lot of symbolic logic. The type of reading you’re given is also quite analytic. It’s not like reading Cather in the rye or something.
Last year this would've sounded like a foreign language to me. Now I think I could come close to getting the same solution as these guys. Finally! Progress!
@Mr. Forever I've just been putting in 2-3 hours a day with either school, youtube, or books from the public library. Also took a Udemy class to learn Swift.
Since you said last year this would’ve sounded like a foreign problem, I’m kind of in the same situation right now so would you mind sharing how you started like what UA-cam videos or what online course you took to begin with? Thanks
the question is so simple. here is my answer below in c but i can also write in c++, java conside matrix name is A and then put a conditon if(A[i][j]==1) // i is for row and j is for column before that we need to put for loop for i and j. { printf("2"); }
The problem was damn easy. I should have taken the challenge. Surprised many didn't mention BFS traversal instead, everyone went for Recursion(DFS). Also none talked about how the mere Brute Force recursion gets automatically optimized due to different coloring without keeping track of a separate visited array. Here is the C++ Implementation: class Solution { public: int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1};
void dfs(int x, int y, vector &v, int c, int color) {
Good video to see students tested on IQ skills and their knowledge, brain storming. Each student came with different thinking skills sets to solve the matrix
I am friends with the guy at 0:00 who said leetcode is a waste of time, and let me just say that this guy is beyond cracked even if it looks like he didn't get the problem fully correct in the video.
@@IStMl You did see that I referred to "some" students in my comment, right? You can criticize the third-year all you want, but you can't expect a student to be knowledgable just because they were accepted to a reputable university. There's a reason the best STEM departments also have the highest dropout rates.
I am weak in maths that's why I took commerce one my friend in California I heard he is lecturer there for the last 28 years he was brilliant school I was just just govt boy. I met him in 2009.nice development .
I've noticed that a lot of people in the IT world don't know how to calculate time complexity. It makes sense as 60% of developers don't actually create algorithms.
To me his answer is not sufficient. Recursion based approach is suboptimal. I've seen more difficult problems in my high school computers club. It's not really about being smart it's more about being exposed and studying these kind of problems. Problem it self is really easy level problem.
# Create a 3x3 matrix with 0s and 1s matrix = [[0, 1, 0], [1, 0, 1], [0, 1, 1]] # Convert all 1s to 2s for i in range(len(matrix)): for j in range(len(matrix[i])): if matrix[i][j] == 1: matrix[i][j] = 2 # Print the modified matrix for row in matrix: print(row) do i understand your question correctly
You solve this by depth first search and recursion. I remember this type of problem was the first one that I had to look up the algorithm in order to solve it.
you can use a queue/bfs too, nothing "wrong" about it, same time and space, matter of preference (I prefer the queue approach because it is easier to understand for me)
as i am very new to coding i hvae learnt python till now in the first problem i will be choosing multilist of pyhton as after i will use nested loops till list elements under which i will be giving if condition where if li[i][j] element is equl to 1 then insert one at its place i think this will work idk about their but according to my mind level i will be using this without using dsa stack or graph
Yeah that's one thing I was wondering about the video. At 6:32 you can clearly see the student saying "wait, so do we just BFS..." and then at 6:39 he mentions a queue (presumably because he was going with the BFS approach), but the video marks him wrong when it's not even wrong, just a non-dfs approach.
4:25 Bro was definitely delusional. Even his approach seemed quite far from the real answer, his communication skills got him in charge of the convo and letting him won.
I know that bro personally and he is actually very smart, so I'm going to defend him and explain why his approach and answer was not too far off haha. He was not too delusional. He said to use list, and in the video it was marked wrong because the correct answer should've been stack, but a stack can literally be implemented using a list anyway (just look at any python leetcode problem that uses stack and you'll see the solutions using a list). As for the O(4^n) time complexity that he said, that is incorrect but it's not delusional; rather, the idea is that each call recursively makes 4 other calls, so for side length O(n), the recursive tree would be O(n) layers deep and therefore O(4^n).
@Singh in USA . I want to do computer science abroad. I don't understand which SAT exam I have to take (confuse between SAT 1, SAT 2). Can you help me?
Philosophy student was amazing.....like so motivating... I am right in middle of practicing some code for interview tomorrow but feeling so down so exploring videos :(
@@minnie-piano3969 yoo , between the time of this comment and now a lot has changed in IT landscape. Everything is looking so cloudy, still waiting for some concrete offer even after nailing interviews 😢
If I had a chance to go back in time I'd do philosophy deg too. Philosophy degree is the best shortcut there is towards developing well rounded thought process that can be applied towards any problem. Physics or math degrees comes pretty close to that too. Everything else is too specialised and develops knowledge without helping much to develop thought process.
Guys after few rejection which should have been a offer letter mail...finally got offer and joined one company... All others in same boat...stay strong guys for me it took almost 70+ days to land a offer..cleared many last rounds but offer was not getting rolled out.
bruh i think it's you who didn't understand liam and were too preoccupied with the 1 solution you memorized off of leetcode that you failed to understand that there are multiple correct approaches
Brother, please tell me what question are you trying to solve, how to solve it, I am not able to understand anything brother, everything is going over my head.
The top 10 Silicon Valley "Feeder" Universities (Adjusted for Undergraduate Enrollment): 1. Carnegie Mellon University 2 Columbia University 3 Stanford University 4 Massachusetts Institute of Technology 5 California Institute of Technology 6 Harvey Mudd College 7 Georgia Institute of Technology 8 University of Southern California 9 Rice University 10 Harvard University
Idk about these guys but recursion , induction , flood fill , a* then backtrace to find a path. I've learnt all since i was on highschool ,and they're basic of computer science 4 sure. Flood fill kinda oldschool but it's efficient in education, we use a* most cuz searching path is faster
The difference is you (and most other Indian students) memorize a list of ways of attacking a certain type of problem while these guys have a lot of time for creative thinking. This is why we are good at non creative laborious work, while they are good at inventing and thinking new stuff.
Students in USA: major is philosophy and cs ( for back-up & job security) Student in india: what is major/ minor ? I'm pure engineering guy😎 Bhai pahle Ghar walo ko 2cr ka package dikhadu ! phir dekhenge major aur minor😂
Add extra layer to matrix of 0 Like 00000 01010 00110 01110 0000 Og matrix was 101 011 111 And check each element if they have 0 on all side keep as one else replace it with 2 and obviously ignore 0
![Lp. Сердце Вселенной #60 РОЖДЕНИЕ ЛОЛОЛОШКИ [Финал] • Майнкрафт](http://i.ytimg.com/vi/YoR0pAV9FVQ/mqdefault.jpg)
I was the dude with the crowd at the end. Thanks so much for the challenge dude, was a lot of fun!
🧢
Can i have your insta id?
Lmao you made your id 2hrs ago and have only 1 comment and you expect us to believe you're the actual guy
Love from India
🧢
This video is full of lessons. As a student, I was exposed to new terms and learned what they mean from searching. And I loved that you guys clarified asking for a hint is totally okay
Loved the format of the video! I've seen countless videos with this concept for med students but watching one with Engineering students feels great cause it inspires me to do better at my job/field as a Data engineer!! Keep these coming thanks.
I would appreciate if we could connect
Am a techie although
@@kiisifelix is ai gonna swap developer
The results were expected from them as they're students of UC Berkeley all Above that thanks to my man Harnoor for making this amazing video
Bhai me India se hu please reply my Comment apka video dekta hu or muje coding me bohat interest hu
animated Box With CSS
ua-cam.com/video/gBmx3RmThDE/v-deo.html
@@liquidityforyouhindi he q
@@liquidityforyouhindi 1uuu8uuuuu
ua-cam.com/video/o-yJLABxoZo/v-deo.html
As a 3rd year computer science student... I must say I'm nothing compared to these students... 😢
You don’t have to be a leetcode expert as a student. I didnt look at leetcode until i graduated, now I have a good job. Slow and steady, keep your head up
Do not compare yourself to anyone. Comparison builds pressure. Just keep working hard
We live in third world lmao 🤣😭
@@sarthakjain1824 you have to compare yourself bro, unless your are comfortable being mediocre
You need to start looking into building your portfolio and craft. Just taking the required classes isn’t enough. I’ve met plenty of CS majors who never even bother getting an internship during their time as a college student. Big red flag.
6:39 Bro we can use queue as well. Just push the source coordinates and then push its neighbouring coordinates into the queue after taking source out and so on. Time complexity will also be the same. Infact, we can use any from both stack and queue because LIFO and FIFO doesn't matter in this question as we only have to colour the matrix. Space complexity will also be the same in both dfs and bfs because in dfs you are also using recursive stack space
You're absolutely correct, and I lean towards BFS over DFS for this particular problem. I'm a bit surprised the author wasn't aware that BFS performs just as effectively in this context.
Yup, bfs and dfs are usually interchangeable in these interview questions. And since a queue is pretty much just a linked list, the one student that suggested that was also incorrectly marked as wrong. You can get bonus points for mentioning that depending on the structure of the data one may be slightly better than the other for amount of space they take up, but generally big O they are the same. FAANG SWE here btw.
@@ThePeteyGG I don't think so mentioning linked list is a wise decision( although queues can be implemented using linked list )because it's just not intuitive and will just make the code lengthy. By this logic, even array would be correct answer
Was looking for this comment
Is it only me who doesn't have any tiny bit knowledge about computer sciences and still here enjoying the vedio to its fullest .
nope im a commerce student and watching this vid with no knowledge about maths XD
I studied design lmao. Why am I here.
When you see even at UC Berkeley mostly indian students are confident enough to take up challenge and solve it
6:40 The question can be done using a queue as well, if we do BFS. It wasn't the wrong algorithm lmao. Both BFS and DFS have the same time and space complexity.
Lol exactly
I was wondering why that was wrong
sahi baat bhai
bfs and dfs have different time complexity.
yup, singh is quite clueless
@@worldnews1545 no
It's both. You have to understand the problem/solutions and have the ability to converse about them. It's not just about confidence and conversation.
the issue with recursion is that it takes up a lot of space on the stack
a better way to do it is using a queue system that stores all the points that need to be checked, then do what you need with each of those. that way you only have one bit of code trying to run at a time vs waiting for a ton of functions to complete.
i've found that you can reach recursion limits very quickly with recursion flood fill
A queue also takes up space, xD. Still O(M*N) space, both for using a stack or a queue. For recursion limit problem, use a custom stack then, since stacks are marginally faster than queues while growing.
This was really good. Do more of these so we can see what success looks like without falsely feeling like we can’t do it either (given we’ve done enough homework).
i'm very glad that i visited youtube app to watch a video while eating my lunch... and found this... it really gave me new insights and somehow it lights up another flame inside me!!! 😀🤯 i am excited now 🤩
Bro what is feeder college
@@sivakumarkaliappan7447 in which the maximum students are picked by silicon valley companies
@@sivakumarkaliappan7447like a target school?😊
That Philosophy student was spot on. 🔥
animated Box With CSS
ua-cam.com/video/gBmx3RmThDE/v-deo.html
can i talke with you
Watching this video i can confirm , there is a huge difference in Indian Universities and these ones. Total study system doesn't let people think off the bat. An avg. Student here will never be able to solve these problems.
Are you taking about india?
@@Banglar_kitchen yeah
Go to any better college in india youll definitely find students able to solve these questions for sure
@@yogendrapawar1738 don't talk like a arrogant idiot. Most of the colleges are out of this.
shashank is an indian bro
So many indian students out there. I wish one day their students would strive similarly to come and study in our country!!
There is no culture here to come
IIT are also degraded
@@SY27196 Yes that's sad but true.
There's no scope for deserving students in india and limited opportunities usa on the other hand has alot to offer
ua-cam.com/video/o-yJLABxoZo/v-deo.html
They try to get in but we kick em out
That philosophy student is everything you want.. perfect.
animated Box With CSS
ua-cam.com/video/gBmx3RmThDE/v-deo.html
Motivation at level 100, bro can you plz make a video on how a new learner starts his career as a software developer without having degree to compete with Berkeley or any other elite institutions, by self learning.
coding bootcamps imo
ua-cam.com/video/o-yJLABxoZo/v-deo.html
ua-cam.com/video/o-yJLABxoZo/v-deo.html
@@themichaeljoel bro
Lets connect please
am an intermediate
I actually find recursion difficult although
Especially BFS and DFS
bootcamp man, its more intense but it will be enough to start as a junior. Many people i know went this route and most are fullfilled with solved real life problems with tech
When he mentioned using a queue, I think he meant to solve using BFS, which is not a wrong solution. But DFS is indeed more efficient and more intuitive though.
ua-cam.com/video/o-yJLABxoZo/v-deo.html
even with BFS tc will be O(N)
@@rajvardhanthakare8648 both are linear graph algorithm by default…I meant that he should not be interrupted by saying using queue is wrong
Time Complexity Would Be More
agreed, BFS/queue approach is not wrong, in fact most interviewers would prefer that solution
I agree with the guy who said "leetcode is not the best way to learn, but we need jobs". I would hire him, out of respect for his understanding of problem solving.
That philosphy + CS guy is rarest of rare combination. Imagine being logical and philosphical at the same time.
Philosophy is very logic heavy. Classical logic starts its development with Aristotle. And philosophers like Frege and Boole formalized modern logic, which fundamentally helped to develop computers. A lot of philosophers come from math, comp sci, and physics backgrounds. For example, Descartes developed the Cartesian plane helping mathematicians develop calculus and analytic geometry.
@@DG-bb4ij Philosophy gets you nowhere, because you cannot prove it.
@@critical_analysis Did you read the names he mentioned?
Philosophy is actually quite logical and mathematical, especially at Berkeley. You’re exposed to a lot of symbolic logic. The type of reading you’re given is also quite analytic. It’s not like reading Cather in the rye or something.
Harnoor's editing skills are getting much better... keep it up mate❤🙌
that's cause he hired an editor. lol.
ua-cam.com/video/o-yJLABxoZo/v-deo.html
ua-cam.com/video/o-yJLABxoZo/v-deo.html
Last year this would've sounded like a foreign language to me. Now I think I could come close to getting the same solution as these guys. Finally! Progress!
@Mr. Forever I've just been putting in 2-3 hours a day with either school, youtube, or books from the public library. Also took a Udemy class to learn Swift.
Since you said last year this would’ve sounded like a foreign problem, I’m kind of in the same situation right now so would you mind sharing how you started like what UA-cam videos or what online course you took to begin with? Thanks
i dont even understand the question to behind with
Im a 3rd year and I remember practically nothing from my algorithms course, these kids crushed me
the question is so simple. here is my answer below in c but i can also write in c++, java
conside matrix name is A and then put a conditon
if(A[i][j]==1) // i is for row and j is for column before that we need to put for loop for i and j.
{
printf("2");
}
dude first its array
then
Lmao
Harnoor bhaiya: You can write pseudocode.
Guy at 6:50 : It's the same , it's Python dude
😂😂😂😂
LMAO
i feel it
java/c++ students crying in a corner
Meanwhile me thinking he said sudoku
@@Aryanthakur-yt9bc 🙂 and me who just know matrices and deteminants
6:41 How queue is wrong?
We can do bfs traversal via queue still and get the ans.
Yes it can be solved using queue
7:15 creating new matrix is better because we should avoid altering the input
Do this challenge in stanford also bro. it's so interesting and motivating to see this kind of enthusiasm.❤️
ua-cam.com/video/o-yJLABxoZo/v-deo.html
ua-cam.com/video/o-yJLABxoZo/v-deo.html
Singh is putting himself in the elite club of some of the best youtubers worldwide .
The problem was damn easy. I should have taken the challenge.
Surprised many didn't mention BFS traversal instead, everyone went for Recursion(DFS). Also none talked about how the mere Brute Force recursion gets automatically optimized due to different coloring without keeping track of a separate visited array.
Here is the C++ Implementation:
class Solution {
public:
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
void dfs(int x, int y, vector &v, int c, int color)
{
v[x][y] = color;
for(int i=0;i=0 && x1=0 && y1
🥳
animated Box With CSS
ua-cam.com/video/gBmx3RmThDE/v-deo.html
Nerd
yes.One guy mentioned about queue which is bfs approach hanoor asked him to code with stack.don't know why
Copy paste 🤣
Its really fun, I am Liam from the coding round. 6:03, thanks for making this video. hence I found this video, awesome!!!
Good video to see students tested on IQ skills and their knowledge, brain storming. Each student came with different thinking skills sets to solve the matrix
I am friends with the guy at 0:00 who said leetcode is a waste of time, and let me just say that this guy is beyond cracked even if it looks like he didn't get the problem fully correct in the video.
Oh and the guy at 5:55, he's crazy smart too
6:41 harnoor bhaiya It can be solved by using queue too .
The Philosophy Guy stole the show.
"It's not about cramming leetcode questions". -All Indians bhaiyas and didis left the chat.
🤣🤣🤣🤣🤣
whats a didi
TBH I was surprised that there were CS students at Berkeley who can't solve this problem. This is like algorithm 101 stuff.
To be fair, some of them were first-semester freshman who haven't had a chance to finish any 101 courses yet.
@@loldoctor fair enough
@@loldoctor and some were struggling 3rd year students
@@IStMl You did see that I referred to "some" students in my comment, right? You can criticize the third-year all you want, but you can't expect a student to be knowledgable just because they were accepted to a reputable university. There's a reason the best STEM departments also have the highest dropout rates.
I am
weak in maths that's why I took commerce one my friend in California I heard he is lecturer there for the last 28 years he was brilliant school I was just just govt boy. I met him in 2009.nice development .
We are getting motivated by your videos , really
For bfs approach we genrally use queue so that we can store the 1s in the same order while we are traversing
ua-cam.com/video/o-yJLABxoZo/v-deo.html
This is very good work . In which we can compare ourselves with foreign students.
Really enjoyed watching this kinda videos!!
I've noticed that a lot of people in the IT world don't know how to calculate time complexity. It makes sense as 60% of developers don't actually create algorithms.
I expected more from them, well I felt more confident after this😏👍
Exactly.. UC berkley really dissapointed our hope
Fr bro
Although I design ux ,but then also I am disappointed
But some of them are still 1st year students and I don't know atleast what is data structures in my first year 😐
bro they are students
Bro they teach the same shit as any other school I also go there first for CS. If you put in the work don’t matter where you go
That red thread on his wrist at 3:35 speaks it all. A true Indian thing.
Sir
I am like breaking my head here
Kindly bring more such videos
Good work
Keep it up
6:40 you can use a queue. BFS uses a queue
That guy at 10:00 is super smart. He figured it out being a Year 1.
To me his answer is not sufficient. Recursion based approach is suboptimal. I've seen more difficult problems in my high school computers club. It's not really about being smart it's more about being exposed and studying these kind of problems. Problem it self is really easy level problem.
bfs/dfs is year 1 level
# Create a 3x3 matrix with 0s and 1s
matrix = [[0, 1, 0],
[1, 0, 1],
[0, 1, 1]]
# Convert all 1s to 2s
for i in range(len(matrix)):
for j in range(len(matrix[i])):
if matrix[i][j] == 1:
matrix[i][j] = 2
# Print the modified matrix
for row in matrix:
print(row)
do i understand your question correctly
You are doing really good job Bro 👍
Getting lot of knowledge from your vlog's
ua-cam.com/video/o-yJLABxoZo/v-deo.html
Loved it. We need more vids like this.
One of the best schools for computer science
ua-cam.com/video/o-yJLABxoZo/v-deo.html
based on the video absolutely not
This is such a standard flood fill problem. How Berkeley EECS students struggle to do this is a bit surprising.
It's funny that i watched the whole video without even understanding what everyone was scribbling! 😅
You solve this by depth first search and recursion. I remember this type of problem was the first one that I had to look up the algorithm in order to solve it.
The lines in the end 100% true 💯🙌🏻🙌🏻🙌🏻
It is More than just cramming an answer
ua-cam.com/video/o-yJLABxoZo/v-deo.html
Awesome, kids. I can't wait until I provide tutorials on UA-cam for questions similar to these and the philosophy of code and mathematics.
The piece of motivation at the end was the best part♥️
We want more videos like this!!
Such an OP edit 9:15 👏👏👏
🤣🤣🤣
scam
i am freshman at iit kharagpur and this problem is taught in our first semester in a course named programming and data structures
Are u in iit second semester now?
Can u send me ur mail or whatsapp.
I need some help regarding computer science.
I am in bs cs.
i very enjoyed this video... just seeing them solving the problem also gave me excitement, thrills, and joyness of solving it 😁
More of this please!!
you're doing really a great job... loved it... heart wants more😁 ..❤️
you said in your video that we can't use queue for this question but we can use queue and implement using bfs algorithm
you can use a queue/bfs too, nothing "wrong" about it, same time and space, matter of preference (I prefer the queue approach because it is easier to understand for me)
use simple recursion to traverse the indexes and every time you find 1 update it with 2
I am studying in 11th STD and i am a cs student when harnoor ask her the q i was like wait wtf is he talking about flood filled flood filled 💀😂
😂
Bro explain me, I'm in 11th too, I didn't even understand the question 😥
super tensed with matrix in high-school... knowing that it'll carry on in cse makes me tense even more
ua-cam.com/video/o-yJLABxoZo/v-deo.html
matrix carry on is most maths related fields
The question is based on flood fill algo which can be solved using bfs or DFS algo👍
when he mentioned queue, he meant BFS. BFS is also a right approach
What a amazing content... i will recommend this channel to everyone who is interested in tech 😍😍
Nice video Harnoor bhaiya... 👍🏻
Your editing skills have been upgraded, great work!
Arey scammer jee bas karo!
as i am very new to coding i hvae learnt python till now in the first problem i will be choosing multilist of pyhton as after
i will use nested loops till list elements under which i will be giving if condition where if li[i][j] element is equl to 1 then insert one at its place i think this will work idk about their but according to my mind level i will be using this
without using dsa stack or graph
Love your vlogs
Inspiring us to work hard towards our goals
This guy inspires you to work hard??? Seriously???
You can solve with queue.. True, in this case for average memory usage you'd choose DFS, but both are correct.
Yeah that's one thing I was wondering about the video. At 6:32 you can clearly see the student saying "wait, so do we just BFS..." and then at 6:39 he mentions a queue (presumably because he was going with the BFS approach), but the video marks him wrong when it's not even wrong, just a non-dfs approach.
4:25 Bro was definitely delusional. Even his approach seemed quite far from the real answer, his communication skills got him in charge of the convo and letting him won.
ua-cam.com/video/o-yJLABxoZo/v-deo.html
may I know in what way was he delusional?
I know that bro personally and he is actually very smart, so I'm going to defend him and explain why his approach and answer was not too far off haha. He was not too delusional. He said to use list, and in the video it was marked wrong because the correct answer should've been stack, but a stack can literally be implemented using a list anyway (just look at any python leetcode problem that uses stack and you'll see the solutions using a list). As for the O(4^n) time complexity that he said, that is incorrect but it's not delusional; rather, the idea is that each call recursively makes 4 other calls, so for side length O(n), the recursive tree would be O(n) layers deep and therefore O(4^n).
confidence is so good, leave about problem solving very good
It's to much better than bsc students in usa
So even I wanna to share my experience 🔥
5:23 When did Nihal Sarin join Berkeley?
@Singh in USA . I want to do computer science abroad. I don't understand which SAT exam I have to take (confuse between SAT 1, SAT 2). Can you help me?
there's only 1 SAT exam
I think this can also be do with sliding window matrix
Philosophy student was amazing.....like so motivating... I am right in middle of practicing some code for interview tomorrow but feeling so down so exploring videos :(
Good luck and keep up the motivation! Hope your interview went well, but regardless keep up the practice :D
@@minnie-piano3969 yoo , between the time of this comment and now a lot has changed in IT landscape.
Everything is looking so cloudy, still waiting for some concrete offer even after nailing interviews 😢
@@shk161 Dang that's rough :(
If I had a chance to go back in time I'd do philosophy deg too. Philosophy degree is the best shortcut there is towards developing well rounded thought process that can be applied towards any problem. Physics or math degrees comes pretty close to that too. Everything else is too specialised and develops knowledge without helping much to develop thought process.
Guys after few rejection which should have been a offer letter mail...finally got offer and joined one company...
All others in same boat...stay strong guys for me it took almost 70+ days to land a offer..cleared many last rounds but offer was not getting rolled out.
as a 3rd year computer science student i am nothing infront of him because i cannot also built a logic in my code
We want challenges for Indian students too.... Come here for it!!!
ua-cam.com/video/o-yJLABxoZo/v-deo.html
my little brother says it's too easy but he's in school :)
bruh i think it's you who didn't understand liam and were too preoccupied with the 1 solution you memorized off of leetcode that you failed to understand that there are multiple correct approaches
◇Can you tell me, which degree is more worth?
1)Information Systems(is)
2)Information Technology & Management (itm)
Not an IEEE member but have a paper published in IEEE in 12th standard! Fun video
Brother, please tell me what question are you trying to solve, how to solve it, I am not able to understand anything brother, everything is going over my head.
Take this problem to some randomass uni in India and you'll get so many solutions 😭
Such a wholesome video ❤️❤️❤️
The top 10 Silicon Valley "Feeder" Universities (Adjusted for Undergraduate Enrollment):
1. Carnegie Mellon University
2 Columbia University
3 Stanford University
4 Massachusetts Institute of Technology
5 California Institute of Technology
6 Harvey Mudd College
7 Georgia Institute of Technology
8 University of Southern California
9 Rice University
10 Harvard University
If you’re gonna adjust it, do it by college. Do CS departments.
0.51sec that girl lit🔥😂 " if it was easy u waren,t giving 100 dollar" 😂
Idk about these guys but recursion , induction , flood fill , a* then backtrace to find a path. I've learnt all since i was on highschool ,and they're basic of computer science 4 sure. Flood fill kinda oldschool but it's efficient in education, we use a* most cuz searching path is faster
The difference is you (and most other Indian students) memorize a list of ways of attacking a certain type of problem while these guys have a lot of time for creative thinking. This is why we are good at non creative laborious work, while they are good at inventing and thinking new stuff.
Students in USA: major is philosophy and cs ( for back-up & job security)
Student in india: what is major/ minor ? I'm pure engineering guy😎
Bhai pahle Ghar walo ko 2cr ka package dikhadu ! phir dekhenge major aur minor😂
I have just completed the flood fill question 😂😂😂
Add extra layer to matrix of 0
Like
00000
01010
00110
01110
0000
Og matrix was
101
011
111
And check each element if they have 0 on all side keep as one else replace it with 2 and obviously ignore 0
Final year computer science here, and I must say these people are light years ahead, I wish I was able to study in a place like this😢😢