HackerRank

HackerRank

HackerRank is a technology hiring platform that helps over 1,000 companies hire skilled developers and innovate faster. Our mission is to match every developer to the right job.

We also have an active developer community (5 million and counting) where folks around the world can practice coding, prepare for interviews, and get hired.

This channel houses content for developers, hiring managers, and technical recruiters. Explore our videos and playlists to learn more. Subscribe to stay up-to-date on the latest videos.

HackerRank AI Trailer

HackerRank AI Trailer

HackerRank 2021 Rewind!

HackerRank 2021 Rewind!

Пікірлер

  • @AmitSingh-vl9vw
    @AmitSingh-vl9vw3 күн бұрын

    >=

  • @pradhyumansolanki6509
    @pradhyumansolanki65095 күн бұрын

    just realised the semi colon

  • @pranavkuchimanchi3192
    @pranavkuchimanchi31927 күн бұрын

    Hahaa loop terminates before it starts

  • @japhletphilip141
    @japhletphilip1417 күн бұрын

    Semicolon

  • @user-rz3yk2fh2c
    @user-rz3yk2fh2c7 күн бұрын

    No it should be while i <= 5. Since we start at 0, and then loop while i is >= 5 but 0 is never greater than or equal to 5. But it is less than

  • @gabrielazevedo9212
    @gabrielazevedo921211 күн бұрын

    Just beautiful!

  • @abhishekdewan7943
    @abhishekdewan794312 күн бұрын

    Mentor 😂😅

  • @devinebug
    @devinebug13 күн бұрын

    What is the time and space complexity ? And what are the effective use cases for min/max heap?

  • @raghulkrish3715
    @raghulkrish371520 күн бұрын

    Good❤

  • @Kaktifiti
    @Kaktifiti24 күн бұрын

    „Using Facebook not instagram” is like saying crack is better that crocodil

  • @johanmilterjakobsen1627
    @johanmilterjakobsen162725 күн бұрын

    C, C++: A Python, PHP, JS: Z HTML: not on chart

  • @pedkfuri
    @pedkfuri25 күн бұрын

    not funny, keep trying

  • @smartparts
    @smartpartsАй бұрын

    bogger

  • @vamsikrishna2798
    @vamsikrishna2798Ай бұрын

    5.

  • @mikhailsidorov8689
    @mikhailsidorov8689Ай бұрын

    Thank you for such a good, short, and comprehensive explanation of the big-O notation. It was really helpful. I just wanted to clarify my understanding: according to rule 3 (different inputs => different variables), in the rule 4 explanation, there should be O(a + a*b) => O(a*b) instead of O(n + n^2) => O(n^2), shouldn't it?

  • @sollork8135
    @sollork813516 күн бұрын

    Because it is same array it has same inputs so o(n*2)

  • @buchnejf
    @buchnejfАй бұрын

    I appreciate the opportunity to try and make a joke, but this isn't often true and paints senior devs in a bad light of not caring. I've observed a strong feeling for many developers of being too optimistic about wanting to wrap up portions of a project that could use improvements before handing it off to the next person. We want the code that we leave behind to speak well of our ability.

  • @prince184u
    @prince184uАй бұрын

    Bro's IQ --239 i meant +239

  • @djxdynamolitegameingmonste3622
    @djxdynamolitegameingmonste3622Ай бұрын

    He is the smartest person in this world

  • @ivoryas1696
    @ivoryas1696Ай бұрын

    This is _indeed_ a person who thinks nothing but thoughts moment, unfortunately. 😞

  • @jiayouchinese
    @jiayouchineseАй бұрын

    Wasn't Big O an anime about a big robot?

  • @ninadkale5772
    @ninadkale5772Ай бұрын

    bad explanation

  • @ScottMeesey
    @ScottMeeseyАй бұрын

    It's nice to see that terminology like "boo-boo-boo-boo-boop" has survived the test of time. No shade, I think I've used it in my career at some point.

  • @developerweb3158
    @developerweb3158Ай бұрын

    Not so good information about de advantages of use an linkedList, improve that, thanks for the video, for me was not a good video now that i am not more a beginner

  • @vterrans
    @vterransАй бұрын

    How did printing pairs became O of N2?

  • @onionsandwich
    @onionsandwichАй бұрын

    Masterclass !

  • @NoahM21
    @NoahM21Ай бұрын

    I use VIM by the way❤

  • @litheha_prog
    @litheha_progАй бұрын

    i love your content!❤

  • @xXmayank.kumarXx
    @xXmayank.kumarXxАй бұрын

    Heaps can be thought of as a binary tree. Peek takes O(1) while other operations take O(log n). For min heap: 1) Insert new node at last, then heapify (ie swap with parent until parent > child) 2) Delete the root node, replace last element at root then heapify (ie swap down)

  • @music-on7507
    @music-on7507Ай бұрын

    It is updated on the online website or just a new application

  • @ijustsawthat
    @ijustsawthatАй бұрын

    2:46 Candidate: these algorithms can be very complicated, so we are not going into details here. Interviewer: Understandable, have a good day.

  • @ijustsawthat
    @ijustsawthatАй бұрын

    Do you know why Interviewers love questions about Trees, Graphs and Heaps ? Because to answer those, you have to write so much boilerplate, your interview time is gone. See how much she had to past in this just to start writing the actual solution.

  • @professorfontanez
    @professorfontanez2 ай бұрын

    LOL.... so funny!!!

  • @MoAdel92
    @MoAdel922 ай бұрын

    spoiler alert you can use this video to under stand one-week-preparation-kit-no-prefix-set in hacker rank

  • @Miss_YouTube_01
    @Miss_YouTube_012 ай бұрын

    No php developer was harm during this

  • @puppy_fizz
    @puppy_fizz2 ай бұрын

    Song name: vivaldi winter drill #2

  • @quirkyquester
    @quirkyquester2 ай бұрын

    quick sort seems like a scam now lol

  • @bunaul
    @bunaul2 ай бұрын

    21:45

  • @ManoranjanSahoo-fu2fc
    @ManoranjanSahoo-fu2fc2 ай бұрын

    🙂

  • @rahulnegi3539
    @rahulnegi35392 ай бұрын

    What happened??

  • @redheadedmoos1204
    @redheadedmoos12042 ай бұрын

    The demo was fake. Apparently, the code that Devin wrote took 6 hours after manual interventions by the engineers (i.e help) but a normal software engineer created the same code within 30 mins

  • @rahulnegi3539
    @rahulnegi35392 ай бұрын

    @@redheadedmoos1204 🙂🙂

  • @cinemaahall
    @cinemaahall2 ай бұрын

    Devin lost the job 😅😅

  • @yuvrajsau
    @yuvrajsau2 ай бұрын

    Really khama kha tention mein daal Diya sabko

  • @aayushx1610
    @aayushx16102 ай бұрын

    Thanks for clearing ​@@redheadedmoos1204

  • @lac2275
    @lac22752 ай бұрын

    Fantastic condensed, down to the point explanation. Anybody with some CS background can easily fill in the holes of any left out details.

  • @ladro_magro5737
    @ladro_magro57372 ай бұрын

    I am just not a big fan of this blonde. She is super weird.

  • @cripz4203
    @cripz42032 ай бұрын

    Nice idea. I can see myself in him in 5 years

  • @aruntej6858
    @aruntej68582 ай бұрын

    😮

  • @prasad3643
    @prasad36432 ай бұрын

    You have watched all the videos Dont scroll😅

  • @gauravchauhan3832
    @gauravchauhan38322 ай бұрын

    Windows Defender

  • @varunthapliyal8960
    @varunthapliyal89602 ай бұрын

    Nice one 😂😂

  • @andreroodt4647
    @andreroodt46472 ай бұрын

    Wow, some insane comments. I like this implementation, although the upfront explanation was challenging to follow. Before someone comments that she has copied and pasted the solution, no kidding, since the original solution was invented by Tony Hoare in 1959, I couldn't find his KZread channel, unfortunately.

  • @satyamsingh4653
    @satyamsingh46532 ай бұрын

    in clearing the bit, the invert bits are wrong at the 3& 4th place?

  • @AngeloRing-nr4ft
    @AngeloRing-nr4ft2 ай бұрын

    Great overview! I like the handwriting though

  • @edsonxrego2
    @edsonxrego22 ай бұрын

    Thank you!

  • @user-ng7iz2ir8z
    @user-ng7iz2ir8z2 ай бұрын

    if ai learns how to use ai💀

  • @chowaramsonwani2771
    @chowaramsonwani27712 ай бұрын

    Some day that person will also be replaced and you will end up intoxicated due to pressure and in debt due to paying for useless..... The final third thing is worse than the above two