Clément Mihailescu yes he seem super nervous if that’s what you want to know.

How good would he be white boarding in C++ though I wonder? Nice interview Clem!!!

Hi @Clément Mihailescu, do another interview with me, I am totally self taught engineer (only high school graduate) and I was recently interviewed by Amazon and Google.

Next Interview : Gennady Korotkevich

Can we become like him if we buy algo expert?

I started coding websites in PHP at age 14 for my Counter-Strike team, but I did not even know what a linked list was until age 19-20. Also, my code and website looked like crap. It was 2004 though, for my defence most websites looked like crap.

Zuckerbook also shaves his eyebrows, so I guess the joke is on this Google Prodigy.

but he is competitive programmer, in competitive programming this is one of the easiest graph algorithms.

i cant even programme a basic result of an area of a square :((

@@klicer3068 would you like a job at Google?

@shrowdy ydworhs Well, I guess you will receive full points without doing anything...

@@LiudongZuo XD

Just half ass it.

Okay I am done

Just hack his computer to one up him

C for competitive programming D for dijkstra E for education F for flow charts G for graphs H for heaps I for iterative deepiening dfs J for jump point search K for kadane L for logorithmic time M for min max N for null O for big O P for prime Q for quick sort R for recursion S for sets T for trees U for unordered map V for vectors W for width X for xavier Y for f(x) Z for complex numbers

G for greedy search H for Heurisitic search I for insertion sort J for Johnson's algorithm K for Kruskal's algorithm L for linked list M for minimax algorithm N for N-queens problem O for Optimization problem P for Pigeonhole sort Q for Quicksort R for Recursion S for Shortest path T for Tree traversal U for Undirected graph V for Venn diagram W for Weighted graph X for Xenomorph algorithm Y for Yak algorithm Z for Zucchini algorithm

@@awekeningbro1207 0 for false 1 for true 3 for 11....

@@nischayrawat682 2 = 10

No, B is for Binary Tree Reversing

Bro, you just killed me😂😂😂😅😄😄😃

😂😂😂😂

😂😂😂😂😂😂💀💀💀💀💀💀💀💀

1 minute after hearing it? 1 minute into him saying the problem, I was like what the hell?

exactly

There are asians, and there are Asians

this is technically impossible, as it implies the need for an Asian better than the best of Asians, but I don't care

It's True.

maybe a belarusian in case of Competitive

You mean there's a Russian ?

Probably some kids in foreign countries like this now. Maybe South Korea or Japan.

I'm a kid who learned to program before I could read/speak English (this means almost no documentation and no stack overflow).

You mean kids since forever: "I learned everything else before learning another language"? Language doesn't measure your intellect and it doesn't required you to learn English first before you can master other stuff.

@@donaldazevedo5554 Bro people in Japan don't even have a computer in their house

@@phunweng962 Coding culture in india is on Boom right now.Iam a college student in india and literally everyone here only talks about competetive coding

If you are trying to understand the theory of the program, you can look up graph theory and more specifically directed graphs. There are tons of books that explain it from a programmer's point of view, though I highly recommend reading a more mathematical source if you can understand the mathematical language. Good luck on your coding journey!

This is more of a data structures and algorithms problem than a programming problem. Learning to code is just simply being able to use the tools to fix a job. This is more theory of how to structure code in a way that can fix the problem. In this scenario, he is using a direction graph to represent the relationship between each airport. The graph shows the edges of each node, and he then simplifies the graph to exclude useless information (nodes that are strongly interconnected can be summed to 1 node). From here, a breadth first searching alg can be used to find where the solution should be. This is all theory The actual coding may only take like 10 minutes to implement Search up data structures and algorithms on UKposts, some really good videos that help break it down in a less maths heavy way. Maybe try get your head around time complexity as well Keep it up buddy 👍

Hey what programming languages did u learn and what are u learning now?

@@-nocturn3268 are you by any chance a swe? Can I reach out?

​@@enyplayz1514 Late response, and not directed to me. But i started learning python for my self due to it's less incline learning curve. The syntax is easy to follow and the thought process between different things within OOP is easier to learn. Secondly i learnt Java, which is similar but still different, now im learning c++ on my own. Another "programming language" that is very useful in todays society is SQL due to databases widespread use in almost any modern business. I'm currently 1.5 years (+0.3 self learnt) into my programming journey. I'd probably say start with python if you want to learn coding easily and also learn a language that is going to be used very widely in the future. It's strong, simple and very modern. There's alot of good free online courses, even here on youtube. good luck

😂😂😂

😂

😂😂😂😂

I cannot deny that

Fr

Lmaoooo

@sun If u don't get the joke, ur probably under the age of 10

@@The2AmInventor Literally no one cares

@@icyweiner2182 Literally nobody asked

@@The2AmInventor Quiet child

Why this has no likes?

JAJAJAJJAs same

Bro 🤣🤣🤣😂

I feel you man

@The tech q actually, depends on the language hes working with.

😂😂😂y'all just killing me

Hilarious 😂😂😂

Second year in college.....still trying......still.....

Don't look at it that way, William doesn't possess anything you do not possess, the difference is in time spent. You can always improve yourself, and you also don't need to do it alone. Good Luck on your studies!

You can code without knowing all of these. They're only important for higher posts. And you can just take some courses, maybe free even, and they're easy to understand.

He would make a great teacher.

I think at this point he already made it

He already made it. He won huge competitions and has a successful youtube channel. He’s a student at MIT rn so he’s set for life

I dont expect less from an asian kid

And then if they don't laugh, just awkwardly stare at them for the remainder of the interview with no other word spoken.

@@azonnoza thanks both of you I’m crying

@@azonnoza hehehehe

@@azonnoza​ why bro, you made my blood pressure rise up.

Always go jfk

Wonder if he had it prepared before. Definitely makes good impression. I think I'll use it myself one day though if used incorrectly and under stress it might sound a bit arrogant

I’m reasonably certain he could of just produced the results in the amount of time he spent explaining what he was going to do.

This problem was easy considering it was supposed to be the hardest

after watching the whole video, yeah this is just easy SCC stuff, an IGM on Codeforces like him is expected to solve it within minutes (or maybe 10 or 20 minutes at most)

Time stamp plz?

Yes yes and yes.

Familiar with the techniques, connect, clearly explain, and cleanly code them is a lot more difficult than it sounds

This was not an 'extremely basic graph theory question'. It was hard!

@@RenatoOliveiraGaming Lmao.. its basic Question. Actually I didn't even understand the Question that was asked but What The Student is explaining is very Basic stuff.. I just passed 3rd semester in university and I had thus subject called Data Structure. Lmao... its all that stuff. It's piece of cake.

@@pets9921 in general a question like this is kind of labelled "basic" only because it's one of the first concepts you'll learn when looking at graph theory, connectedness, and traversing nodes. shortest distance between two nodes is a very common problem in its own, in this scenario just depends on the algorithm you implement which gets more and more complicated. the question will always be in general very simple, just knowing which implementation to use and how it works to replicate it is the main hard part.

Lol

Typical quora question: I'm a zygote that's just been conceived by mommy and daddy. Is it too late to learn how to code?

HT Rajan Cracking up HT. It’s nver too early to start!

@@htrajan No, coding is transferred through genetics and requires at least 5 generations to establish

@@htrajan Aah, reminds me of the days, when instead of code it used to be JEE preparation

So this kid is really smart lol

@@sf43205 dude ... the purpose of a coding interview is to (1) asses the applicants cs knowledge and (2) test problem-solving skills. It's annoying when people trash on coding interviews saying its irrelevant to what they do on the job when that's not the purpose of an algorithm/coding interview.

And when you say most, you’re not lying. 99.99% cannot solve this.

Oh so he smart😳

@@sf43205 Actually you can't solve the problem with a single recursive function, unless you're a terrible programmer who writes monolithic untestable methods that won't scale very well. Understanding the complexity and performance impact is also part of this. He has 2 recursive functions that can be threaded tasks. Whether he did that on purpose or not, I don't know. He also split the sorting of the data structures from the solving and usage of those structures which is good algorithm design (this should have been taught in your school) and actually makes the implementation not very complex and reasonable to debug. The problem is not simply finding a valid route, which could work with one decently concise method, sure. It's about finding the route with the least cost. His solution is great, I worry more that he's writing algorithms that he's memorized and doesn't understand WHY they work. This can be problematic when you need to translate that work to other hardware or even other languages. But he'll learn more about that when he studies.

😂😂😂🔥

As he talks about it I can see the strongly connecting components dancing with the representative nodes.

Hahaha

I thought the same thing 😂

Bro right! Its gonna be 1 minute advertisements here soon.

On mobile press the (i) stop seeing this ad and then cancel and it’ll skip both of the ads

@@James-pf1vg oh my god, thanks dude!

I just pay for UKposts red because I use UKposts for like all of my tv related entertainment

@@brentmadison7605 you must be over 40

Thought it was only me- although I've never heard this term before, yet when he was explaining, i thought to myself "hey, that made sense"

True lol

And you can tell by the look on the interviewers face his ego took a little hit bc he's the interviewer and he's being taught by a kid lol

im pretty sure the interviewer just wants to know how much the kid understands. kinda the point of the interview

LMAOAO THAT S WHAT I WAS THINKING

to be honest his probably much smarter than the interviewer. He probably has an IQ above 130 and struggles to find people with the same intelligence level. My dad was the same way and always called everyone an idiot. I am not even with an average intelligence struggling in life.. D:

crazy isn't it, I think it's because he gives simple and concrete visual examples and relates it back to his reasoning

@@adamma1024 do you believe that leetcode is best for getting well prepared for coding interviews in big tech companies?

@@JL-pg4pj actually yes it shows you are capable of problem solving

Practice practice.......

It's easy when he has the solution while Clement described the problem. He just needs to spend his processing power on explaining it. Imagine how fast he'll be once he learns the mathematical vernacular to express well-known ideas in college.

I felt the same way lol

@@willfelder4808 shit sounds like a bunch of bs lmao

I am dumb I'll be honest after watching this....and I'm asking myself why did I take this course

Welp, I've a got a long way to go....

ya fr i got an interview later and this rly did not help ajshjahsj

you are bad as **** bro, mine understanding stopped at 2:57 :3

Serious. I'm still laughing with this

focus and a lot of practice and tutoring will help you understand problems like these

@@brandijohnson1326 Dude ur right. I focused. Didn't give up. Practiced a lot after watching this video and I still don't understand.

Hilarious 😂😂

That is far more better than misunderstanding the question right?

Yeah, people shouldn't get discouraged these like most technical interview problems are really simple rephrased data structures problems that were made more to tease out how you approach problems rather than testing your ability to memorize content.

This is why I want to learn programing. What an absolutely amazing journey it must be

@@-karter-4556 then have u yet?

@@TheFriendlyInvader Thank you this made me feel a lot better I haven't taken my data structure classes yet still learning microsoft office and barely touching some Java and I had no idea what they were talking about n felt discouraged.

same lmao

No because there always an Asian that’s gonna out do you in that too 🥲

😂😂😂😂

And you'll meet Gordon Ramsay in your interview

It's always gonna be like that brother, no matter what field, not matter what company, not matter how experienced you are, you will always have bad interviews. Sometimes it's your fault, sometimes it's the interviewer's, most the time it's both. All you gotta do is to not underestimate yourself, do everything you can and if you fail tell to yourself that's more experience. Maybe next time you'll be less anxious, maybe you'll be more prepared, maybe you'll present yourself differently, etc... But it can only get better ! :)

Then Gordon Ramsey in the interview: what kind of food is this, you fuukeen donkey?

Ahahahha

Lol I swear 😂🙏

HAHAHAHAH

Ashutosh one burger plz😂

hahahahhahaha

anddd that's why your life sucks

SOMEONE must be the consumer.

😆 🤣 😂

Paul Gomez who said his life sucks in fact I would bet money that you are unhappy and you feel your life sucks and you projecting.

@@diegocruz9080 The comment i was searchig for as soon i read that shit!

I’m with ya

Welcome to the club hello world

Same here

You should get started. It's fun

@@yawarmushtaq6000 how fun it is to be sleepless everyday

I hate that, he should've pressed more for an explanation because the strategy was convulated and confusing.

@@09SmashingPumpkins It's convulated because you don't understand it

@@09SmashingPumpkins It wasn't

The problem here is that, william only has 45 minutes to find, explain and programm a solution.

Clement is owner of Algoexpert - I doubt he had trouble following some abstract concepts.

I think you should edit your comment to say: "It's time to improve ", bro.

Brandon Castillo good advice

Same here lol, regretted clicking this video tbh

its google interview

🤣🤣na bro come on you jus gotta keep grinding

This kid is a coding genius who puts most people working in the field to shame. You're just a random ass college student, relax.

@@conocosz So overly unnecessary man

Bfs ?

@@bahriaproperties1143 after the post order search, I think a breadth first search (bfs) through the newly created list works, Ik for a fact the successive depth first search works tho

@@tens0r884 The guy is a sophomore who doesn't even qualify as a beginner in the field, and has a chip on his shoulder. Then looks down on the kid because he's a high schooler and gives gives him back handed praise. Necessary.

The kid obviously has a high IQ. IQ transcends age.

Damnnn 😭😭😂

Could you explain why? I’m just curious as I don’t know much about this topic. Is it harder because you don’t have specific paths to follow like roads or variable changes due to the environment?

Insanely difficult, but it's also been done to death, so perhaps not so difficult after all. :) Now try on the stable roommate problem for size. I only accept answers in SQL. ;)

dont even get me started. its mainly the cartesian plane plots that are connected and blah blah that co relate to this

@@fortythirty Yes. It is also because of the environment. With a normal Chess or Rubix scenario, you have preinstalled paths. You can't go across the Chess board or turn once to solve these puzzles. With a plane graph, you could use one flight to get around the world, or use 30 different flights to get around the world. It has stumped developers for years!

@ Gaurav G..right? Flip(positive side) is to be inspired.Easy to be de- motivated for sure but cool to see talent + hard wk.

Work hard bro i am sure we will achieve more than the william lin.

@@bigsmoke1179 I don't think so, William is intelligent. Some people are naturally smart. Like Einstein. He was too smart to be in school. Regardless, you should always work hard to achieve your dreams.

@Atharv Khatri hard work only beats talent if you assume that the talented person isn't working hard as well.

@Atharv Khatri Don't joke yourself, evidence as shown some people are naturally smarter than others. Yes hard work can make you good at a subject. But some people no matter how hard they work at a subject will not beat someone who has natural talent in that subject who put in minimal effort.

1. AFAIK Your job is to provide shortest route from START airport (LGA) to any other of the first array. Yet your job is to create new *least* amount of paths from LGA to those Airports that are unreachable from LGA at the moment. 2. HE builds GRAPH. HE compresses it (reduces interlooped nodes to 1 node) with Korasaju algorithm. Then he searches the solution for the shortest route for any given END. The last part is something i can predict, cuz, well, i've doing my stuff listening to the video on background since minute 15 i guess... he reversed links of the graph, so, during the solving END became START and LGA (initial START) became END.

Lol

@@Vasilevus as a student i want to ask you. How you able to solve and make logic of such type of complex problem. Please reply and guide.

@@Vasilevus yea, I still don't understand

Can't give you nothing but one stupid suggestion : practice. I've solved similar task once. I suggest to practice it the tough way - use C with least libs included, no segfaults and memory leaks. Just juice the best out of the problem: crack the algo down and get used to the conception of memory usage and structure composing altogether.

Oh! my my😂🤣🤣🤣

check my comment above. 25 lines of simple code

I tried to make an algorithm that gives me the exact amount of locations and the locations itself that would need to be connected to my new „airport“ in order to reach every place from my new „airport“. My solution before watching the video after the explanations was that if you do a new list that is a copy of the airports list, you can do the following: for x in (copied airport list) for y in (connections) if x == y[0] copied airport list.remove(y[1]) Explanation of the code: Line 1 makes x cycle through the copied airports list, getting the next string after each cycle. Line 2 makes y cycle through the connections, getting the next string list after each cycle. Line 3 compares current x string with the first string from current y (the currently selected airport with the starting destination of the currently selected connection way). Line 4 is finally removing an airport (the final destination of the currently selected connection way) if the if-statement is true. It’s removing from the copied airport list (let’s call it the anchors list). What you’re left with is a list with every location you would need to set a connection (I think, thought about it for 10 min). Edit: By deleting the list while going through it, you won’t end up going through already accessible airports. Wanted to add this because people might think it would result in deleting a whole „loop“ section where each connection goes back to itself original connection. That wouldn’t be the case though. And yes you would need to try-catch it irl because it would give you an error if you try to delete an airport that is already deleted/nonexistent (which is like 2 words spread over 2 lines)

I use 2000 lines. I am more productive than you all

@@birolklp5574 If this passes all tests, it would be a 10-line, O(m) solution to a 50-line, O(nm) problem. Great job!

Literally Me!! hahahahah.

@@otakuu9609 same! lol

I would go for a more general answer and say : GOOGLE

Python exactly! Thank You!

Ty bro

I sometimes believe that kids like him were born to do this, just like any athlete..yes they worked hard but they were destined to become that good.. thats the conclusion i came too,, could be wrong but thats what helps me not comapre myself.

The fact that I didn't practice as much as he did is what hits hard, not just that he's great at what he's doing, because he's more competent as a person

This is what is called a competitive programmer. Probably he is used to compete in sites like codeforces, hacker rank, URI, etc. I used to hang out with folks like him. Learn a lot from them but was quite difficult to keep the same level as their.

bhahahaha, yup, my thought exactly. Uninstalling pycharm right this moment!

Feel that

I think the kid in the video is dragging on for too long. He goes on tangents that don't have a directed end. I wouldn't hire him because he isn't answering the problem layed out before him. Solve the problem first, explain your solution later.

of course you won't if you have that attitude, this problem isn't that hard unless you're a beginner

@@nilen I was wondering if you could help me I'm a student. I'm studying on code academy and I was wondering is there a more effective way to learn code? I'm looking but the internet is a big place. If you could help I would appreciate it thanks!

You tried, respect.

You got a coding interview when you were 16... That in itself is impressive. Hope your success continued in life! (success in just obtaining opportunities... not that you got ur ass handed to you lol)

@@SharmaGoopta123 Thanks man, you too

Atleast you tried

@@cap4081 just like riders said at least ya tried!

🤣🤣

Damn I’m jealous

LOL

😂🤣😂🤣

@@Allie912 He is conducting a mock interview to which he will be given a result. His result was a “strong hire,” as per the interviewer’s feedback. I just pointed out the moment he seemed to have it in the bag. You don’t need to look into it that much.

@@Allie912 You don't need to graduate to get hired. Most people who graduate with a comp-sci are bumbling idiots anyway. Just like any STEM field. Let's not pretend that it actually has worth outside of getting you better chances of a job, if you're already competent enough, then it doesn't matter.

@@nizarch22 "bumbling idiots" 🤣 thats scary cause im planning to study comp sci

@@Allie912 he can be hired right away tf

More likely William will research at MIT or other prestigious college than work in an MNC. Yeah but you are right.

My mind also flipped to Dijkstra's and A* algorithm very quickly, but only because i dove into Networking during my Bachelors degree. Impresive!

Stephan Brandt right, yea I also quickly thought about Ferasiskis algorithm and implementing some form of trachial loop as which might work

yes

Interesting... Graphs are the right answer when looking for an application programming job - but did anyone grok that, at it's heart, it's not even strictly a graph problem? I mean, yes... you should always answer this AS a graph problem. Keep the solution you offer general, extensible, self-documenting and easy to understand. You should spend most of the interview walking them through a fairly bland and unsurprising answer. After all, there's often a follow-up or spec-change... and if you have to rewrite your existing code, it's a major fail. So... stay general, and model the problem statement closely. But then, when the interviewer is finally satisfied that you're just boring enough to play well in a team churning out unsurprising and predictable code... offer them the _"red pill"_ by pointing out that this approach, though fairly standard, is actually horrendously inefficient. Imagine Morpheus saying : _"What if I told you, you're solving the wrong problem... and all this code is mostly an illusion designed to stop humans from realising the truth and freaking out?"_ Drop a closing tease, like _"I'm just thinking, this problem is actually a lot more interesting than it appears... for example, say we ever needed to run this over big data, I reckon we could consolidate hundreds one way destinations per couple of cycles, in-place, to get the same data without ever building the tree. Almost no heap utilisation, leaves the compiler free to use streaming SIMD and bring those ultra-wide registers into play. The cost saving in a server farm would be absolutely staggering. Of course, it's not pretty - there'd be a tradeoff in readability and it's far less general... but still, it's shocking just how well this optimises." Then, just let it hang there in the air... Basically, you just said _"and, if that's not enough - we can use magic!"_ ... expect an arched eyebrow. If they ask you to expand how you'd do that, then you can take them on a REALLY deep dive without compromising your previous 'safe' answer... and, if they say _"no need, we're very happy with what you've supplied"_ you've still shown you may have hidden depths in terms of problem analysis. In the latter case, you can safely assume there's not likely to be much challenge or opportunity for progression. Sometimes, you'll be asked to re-interview for a different role. You see, there's the UI's and the Apps, and Client code... that's all really safe and boring, and it gets a lot of employee churn. Then there's the behind-the-scenes bread-and-butter data crunching work that pays the big bucks and requires more analysis, problem solving and reductionism. You can interview for both, but let them choose what they want to see. Get it right and you'd be surprised how often you can essentially get hired to a role that's not even open, just to stop you walking out the door. Standard library coders are ten a penny these days, but the kinds of folks who can reduce a problem to it's essence and can switch between high level to machine level, well... the universities just aren't churning many of those out. We live in a world where everyone and their grandmother can code, fewer can program _(yes, it's traditionally a different discipline)_ ... and fewer still have a solid appreciation of how to move a problem into the processors domain _(as opposed to wasting resources bringing the processor up to meet the problem in the natural domain)_ But, you MUST provide the safe answer first! And deep-dive only by invitation, right at the end... offer too clever a solution without being explicitly asked, and you're unemployable! - They'll step over you on the way to the next interviewee : )

exactly i thought the same thing.... dijkstra's but the kid is awesome.... 👍🏼