Комментарии:
Can’t this be done by AI now?
ОтветитьThis looks very interesting boys got skills - I’ll use him for booking
ОтветитьI'm not a programmer and have NOTHING to do with this space but I find this sooo fascinating.
Can someone explain to me how impressive this is?
There was way to much talking from the interviewer here. I know it is your channel but you should have let the young man solve the problem first. Asking him questions about how would do this or that are clues to the solution. Give him the requirements, let him code it and them ask your questions.
ОтветитьHow did you forget to mention that he's a fucking competitive programmer?
ОтветитьForgive my potential naiveness: i just started out with python but i did a fair bit of matlab coding as a nuclear engineering major. I feel like this process could be solved with a handful of for and if statements. Maybe this was just a way more efficient and higher level way of doing it. And im sure there are people watching this who were able to follow along but since i havent learned these forms of coding yet, it obviously seemed less intuitive from a basic standpoint
ОтветитьVery interesting video! One little bit of feedback: it's not good to drink with your microphone on + having your Facebook notifications on.... Otherwise I enjoyed it a lot!
ОтветитьBro has secured jobs before finishing high school. What a legend
Ответитьартур шарифов
Ответитьwhen the SDE codes in a doc file you know you have to hire them.
ОтветитьBro I'm just completing python basics course tomorrow lmao, y'all speaking alien to me.
ОтветитьBasic puzzle on algoritms, do not see any hard question. This is described in any good book on this topic.
Ответить10 Print "your name"
20 GOTO 10
run
"Yup"
ОтветитьLGA has no outbound flights, so you can not start at LGA. Solved :)
ОтветитьNo clue what i just watched but watched the whole thing
ОтветитьFuck are asians so damn smart for
Ответитьimpressive stuff. reminds me of what i learned about simplifying finite automata. Would not have thought of that probably.
ОтветитьTook 2 days for me to understand the question 😢
Ответитьfix your lower jaw Clem because you have a lisp and your jaw makes you over exaggerate facial expressions to communicate
ОтветитьI don't understand a word of this. :(
ОтветитьWhat the hell is even that?
ОтветитьI don't know English, can you explain this algorithm to me so that I can solve it
Ответить好羨慕你擁有那天才般的腦袋
Ответитьcan clement get that smirk off his face holy moly.........
ОтветитьWilliam is giving emotional damage to Clement
Ответить"Is that part clear?" Not to me but I trust you 👍
ОтветитьI hate tech interviews. They never relate to the work i actually do as a web developer.
ОтветитьHi
ОтветитьNice voice
ОтветитьPlease talk in English
ОтветитьYep
Uhuh
Sure
Right
Yah that's fine
This guy's 1TB homework folder is actually homework.
Ответитьbruddha this is an informatics olympiads gold medalist
ОтветитьAnyone seeing this right now, please answer this. I am a complete beginner rn, so I wanted to ask whether AIs could solve such questions?
ОтветитьWtf he's a high school student ???? That problem could literally be a 3/20 point question in a final exam at my MEng 🙃🙃 The guy has potential....
ОтветитьHow the fuck does a kid fit so much knowledge in in such a short amount of time? Why does he know all of this?
Ответитьwatching this at 2AM is torture to my bean size brain
ОтветитьIm 13 and idk why im watching this
ОтветитьI guess a single DFS could be enough: let's figure out for each node whether it's reachable from some other node or not. First we run DFS from the starting airport (which we consider reachable), then from all the unvisited ones. Now if an airport is not reachable then we're gonna have to add a flight to it. The cycles are an issue though, not sure what exactly to do with them, but we can for example find them with the same DFS and compress into single nodes.
ОтветитьTerrible interviewer. Great interviewee
ОтветитьThe person who represented U.S does actually have made in China tag.
ОтветитьI am new to dsa but isn't this just kind of an implementation of dijkstra's algorithm?
ОтветитьOh shoot is that Andrew tang or am I stupid?
ОтветитьRegarding to this question. Can we simply calculate the indegree of each node and return the number of nodes where the indegree is zero.
ОтветитьBro is interviewing the interviewer 😂
ОтветитьBro I am 100% sure more than 99% of programmers don't know how to solve this.
Ответить