Given two integers N and K, the task is to find a permutation of first 2*N natural numbers such that the following equation is satisfied.
Note: The value of K will always be less than or equal to N.
Input : N = 1, K = 0 Output : 1 2 The result of the above expression will be: |1-2|-|1-2| =0 Input : N = 2, K = 1 Output : 2 1 3 4 The result of the above expression will be: (|2-1|+|3-4|)-(|2-1+3-4|) = 2
Consider the sorted permutation:
1, 2, 3, 4, 5, 6....
The result of the expression will come out to be exactly 0. If we swap any 2 indices 2i-1 and 2i, the result will increase by exactly 2. So we need to make K such swaps.
Below is the implementation of the above approach:
2 1 3 4
Time Complexity: O(N)
Auxiliary Space: O(1)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Find a permutation such that number of indices for which gcd(p[i], i) > 1 is exactly K
- Lexicographically Smallest Permutation of length N such that for exactly K indices, a[i] > a[i] + 1
- Minimum positive integer to divide a number such that the result is an odd
- Given two binary strings perform operation until B > 0 and print the result
- Maximize the division result of Array using given operations
- Minimum number of given operations required to convert a permutation into an identity permutation
- Minimum number of adjacent swaps required to convert a permutation to another permutation by given condition
- Permutation of numbers such that sum of two consecutive numbers is a perfect square
- Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
- Find the permutation of first N natural numbers such that sum of i % Pi is maximum possible
- Count permutations that produce positive result
- Parity of the given mathematical expression using given N numbers
- Permutation of first N positive integers such that prime numbers are at prime indices
- Permutation of first N positive integers such that prime numbers are at prime indices | Set 2
- Find ways to arrange K green balls among N balls such that exactly i moves is needed to collect all K green balls
- Find a number K such that exactly K array elements are greater than or equal to K
- Find permutation of first N natural numbers that satisfies the given condition
- Numbers less than N which are product of exactly two distinct prime numbers
- Find the permutation p from the array q such that q[i] = p[i+1] - p[i]
- Find the numbers from 1 to N that contains exactly k non-zero digits
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.