Challenging Google's Top Feeder College Students? Ft. UC Berkeley!
Vložit
- čas přidán 1. 06. 2024
- Aryender & I challenged UC Berkeley students with Google's most asked Leetcode question : Flood Fill. Find out how many students can do!
👨🎓Checkout Our Live App Dev Course: singhinusa.com
📲 Get premium wireless for as low as $15 a month with my partner at www.mintmobile.com/singh
📈 Get 2 FREE Stocks in US (valued up to $1400): a.webull.com/i/SinghinUSA
I use WeBull for stock trading which are legal.
My Gear:-
📕 Favorite Book for Software Engineers: geni.us/GT9jvz
💻 My Gear Page: singhinusa.com/my-tech/
📱iPhone: geni.us/J9c6GoY
📸Sony Camera: geni.us/zShMGT4
⿍ Tripod: geni.us/iVsd
🎙Vlogging & Podcast Mic geni.us/v915Z9H
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Follow me on -
Instagram - / iharnoor
Facebook - / singhinusa
Twitter - / iharnoorsingh
E-mail for BUSINESS INQUIRY & HELP- hello@singhinusa.com
MUSIC CREDITS:
Music From (Free Trial): www.epidemicsound.com/referra...
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
@@kiisifelix2769 is ai gonna swap developer
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.
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
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
czcams.com/video/gBmx3RmThDE/video.html
@@liquidityforyouhindi he q
@@liquidityforyouhindi 1uuu8uuuuu
czcams.com/video/o-yJLABxoZo/video.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.
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?😊
Harnoor's editing skills are getting much better... keep it up mate❤🙌
that's cause he hired an editor. lol.
czcams.com/video/o-yJLABxoZo/video.html
czcams.com/video/o-yJLABxoZo/video.html
This is very good work . In which we can compare ourselves with foreign students.
Do this challenge in stanford also bro. it's so interesting and motivating to see this kind of enthusiasm.❤️
czcams.com/video/o-yJLABxoZo/video.html
czcams.com/video/o-yJLABxoZo/video.html
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.
Really enjoyed watching this kinda videos!!
What a amazing content... i will recommend this channel to everyone who is interested in tech 😍😍
i very enjoyed this video... just seeing them solving the problem also gave me excitement, thrills, and joyness of solving it 😁
We are getting motivated by your videos , really
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.
Loved it. We need more vids like this.
We want more videos like this!!
That philosophy student is everything you want.. perfect.
animated Box With CSS
czcams.com/video/gBmx3RmThDE/video.html
You are doing really good job Bro 👍
Getting lot of knowledge from your vlog's
czcams.com/video/o-yJLABxoZo/video.html
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.
Sir
I am like breaking my head here
Kindly bring more such videos
Good work
Keep it up
The piece of motivation at the end was the best part♥️
Singh is putting himself in the elite club of some of the best youtubers worldwide .
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)
That Philosophy student was spot on. 🔥
animated Box With CSS
czcams.com/video/gBmx3RmThDE/video.html
can i talke with you
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
czcams.com/video/o-yJLABxoZo/video.html
czcams.com/video/o-yJLABxoZo/video.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
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 .
More of this please!!
you're doing really a great job... loved it... heart wants more😁 ..❤️
The lines in the end 100% true 💯🙌🏻🙌🏻🙌🏻
It is More than just cramming an answer
czcams.com/video/o-yJLABxoZo/video.html
When you see even at UC Berkeley mostly indian students are confident enough to take up challenge and solve it
Im a 3rd year and I remember practically nothing from my algorithms course, these kids crushed me
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
For bfs approach we genrally use queue so that we can store the 1s in the same order while we are traversing
czcams.com/video/o-yJLABxoZo/video.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!
I’m interested in learning more do you have some resources?
@@mr.forever677 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.
@@traviss7740 what free resources would you recommend? I'm very interested in it.
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 CZcams videos or what online course you took to begin with? Thanks
i dont even understand the question to behind with
Such a wholesome video ❤️❤️❤️
thank you for sharing this!
The question is based on flood fill algo which can be solved using bfs or DFS algo👍
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.
Awesome, kids. I can't wait until I provide tutorials on CZcams for questions similar to these and the philosophy of code and mathematics.
The Philosophy Guy stole the show.
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
6:41 harnoor bhaiya It can be solved by using queue too .
You can do it with a queue as well. BFS and DFS both work
7:15 creating new matrix is better because we should avoid altering the input
Love your vlogs
Inspiring us to work hard towards our goals
This guy inspires you to work hard??? Seriously???
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.
czcams.com/video/o-yJLABxoZo/video.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
confidence is so good, leave about problem solving very good
It's funny that i watched the whole video without even understanding what everyone was scribbling! 😅
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
czcams.com/video/o-yJLABxoZo/video.html
They try to get in but we kick em out
Its really fun, I am Liam from the coding round. 6:03, thanks for making this video. hence I found this video, awesome!!!
If you could come to India and test the brilliant students here.... Waiting for it !!!
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
Iterative bfs with queue works too idk why I would forcibly use a stack.
Inspired.. 1.trying to find answer. 2. Asking help/hint
I have just completed the flood fill question 😂😂😂
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
Loved it man
Bro do some more videos like this ❤
We need one more video like this
It's to much better than bsc students in usa
So even I wanna to share my experience 🔥
New fun that's was absolutely amazing
love it, thanks for video
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
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?
Do more of these kind of videos
Awesome really love your videos encourages me to study more
Big love from Nagaland 🇮🇳 INDIA
The students are sooo talented and interactive...
Dude would probably go bankrupt if he did this at an above average university in India lmao
Even being a philosophy student 🤣🤣
you said in your video that we can't use queue for this question but we can use queue and implement using bfs algorithm
I am in india watching you with my adrak tea in evening.waooooo it’s nice!
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
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
me, who didn't understood the que... 🥲
And grammar...
Queue!
Me too😢
Me too
the editing is jokes xD good work mate
I wish smn did such challenge videos for physics too
"It's not about cramming leetcode questions". -All Indians bhaiyas and didis left the chat.
🤣🤣🤣🤣🤣
whats a didi
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
czcams.com/video/gBmx3RmThDE/video.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 🤣
I really love this video to be honest
Love from india bro. These kind of videos are much needed. Its entertainment.
Take this problem to some randomass uni in India and you'll get so many solutions 😭
Your editing skills have been upgraded, great work!
Arey scammer jee bas karo!
Well the first question is a variation of rotten oranges question on leetcode 😁🙂 , can also be done by recursion .
thus video made me feel so much better, i thought im pathetic and behind at cs but nope im the same pace as berkeley kids
One of the best schools for computer science
czcams.com/video/o-yJLABxoZo/video.html
based on the video absolutely not
What a video man🔥
Nice video Harnoor bhaiya... 👍🏻
super tensed with matrix in high-school... knowing that it'll carry on in cse makes me tense even more
czcams.com/video/o-yJLABxoZo/video.html
matrix carry on is most maths related fields
Indian-American professors and PHD students & Top Industry company HR's from both nations should be collabed to form a Commitee and create academia subjects and update them every year.
Only then Students will progress Faster and learn whats needed and avoid whats not needed, If not all are becoming graduates and still trying to do courses to get jobs in both nations.
We want challenges for Indian students too.... Come here for it!!!
czcams.com/video/o-yJLABxoZo/video.html
6:40 you can use a queue. BFS uses a queue
That crowd is so good 🎉
Hi! Harnoor,
Can you please give a tour and review of Arizona State University, I am in grade 12th and planning to apply for fall 2023.
it will be really nice of you if you do so,
Thank you
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
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
Omg !! I've nt skipped this 😄
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.