HackerRank | Minimum Swaps 2 | Solution Explained (Java + Whiteboard)

Поділитися
Вставка
  • Опубліковано 11 жов 2024

КОМЕНТАРІ • 15

  • @ellepark
    @ellepark 3 роки тому +4

    Thanks for walking through this. Feels like I'm studying with a buddy =)

  • @shipinytb
    @shipinytb Місяць тому

    Awesome solution! Thanks for sharing~ Very curious how did you come up with this solution and why we can get the *minimum* swaps in this way.🤔

  • @actionjake
    @actionjake Рік тому +1

    "Your favorite alpha male brogrammer" hahaha oh my gosh I love this so much 🤣🤣 give us more content bro!!! It's what the nerds need!🤓

  • @GauravSingh-ku5xy
    @GauravSingh-ku5xy 3 роки тому +1

    Such a nice simple solution man.

  • @onurozen1
    @onurozen1 Рік тому

    good solution, thank you

  • @hernanvelazquez1421
    @hernanvelazquez1421 2 роки тому +1

    Hey, works for me to sort the array in ascending order, but what happens when descending order is required? I'm still not able to make it work with this approach, is it possible?

  • @nabilmadih34
    @nabilmadih34 3 роки тому +1

    super simple and neat! thank you!

  • @minimilitia267
    @minimilitia267 2 роки тому +1

    hey do you have solution for minimum shifts of hacker rank?

  • @akhilsinghchauhan7627
    @akhilsinghchauhan7627 2 роки тому +1

    Hey man which whiteboard do you use?

  • @-Corvo_Attano
    @-Corvo_Attano 2 роки тому +1

    No more Videos ?

    • @xavierelon
      @xavierelon  2 роки тому +2

      Trying to find the time. Definitely plan on getting back into it once things slow down.

    • @-Corvo_Attano
      @-Corvo_Attano 2 роки тому +1

      @@xavierelon cool :) Thanks for your reply