HackerRank Interview Prep Kit - Problem 8: Minimum Swaps 2
Hello, my name is Brian Dyck, I am a full-time software engineer and a Computer Science graduate walking through HackerRank problems for new and old programmers alike. My goal is to help programmers build up skills and not just see the solutions to problems, but to learn how to think through the problems. Many new videos to come, so stay tuned!
Problem: Minimum Swaps 2
Description:
You are given an unordered array consisting of consecutive integers
[1, 2, 3, ..., n] without any duplicates. You are allowed to swap any two elements. You need to find the minimum number of swaps required to sort the array in ascending order.
For example, given the array arr = [7, 1, 3, 2, 4, 5, 6] we perform the following steps:
i arr swap (indices)
0 [7, 1, 3, 2, 4, 5, 6] swap (0,3)
1 [2, 1, 3, 7, 4, 5, 6] swap (0,1)
2 [1, 2, 3, 7, 4, 5, 6] swap (3,4)
3 [1, 2, 3, 4, 7, 5, 6] swap (4,5)
4 [1, 2, 3, 4, 5, 7, 6] swap (5,6)
5 [1, 2, 3, 4, 5, 6, 7]
It took 5 swaps to sort the array.
In questa pagina del sito puoi guardare il video online HackerRank Interview Prep Kit - Problem 8: Minimum Swaps 2 della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Brian Dyck 28 ottobre 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 14,604 volte e gli è piaciuto 395 spettatori. Buona visione!
