my code link for problem UNLOCK in STL section https://ide.codingblocks.com/s/123073
In my code i am at a time complexity of O(n)
as p is always less than n,
now the limit of n is 10^5, which should be accepted.
Resolve this asap.
I dont think that time limit should be exceed in this code
what if array is sorted in increasing order and k is 10^5 ?
yup…in that case, this would go to n^2…Now tell me how should i change my approach to solve this one
he following problem canbe easily solved by using hashmap or unordered map. The hint to solve the problem is that the given array will always contain permutation of the first N natural numbers. So we will prepare a map which will contain element as the key and the index at which it is present as the value.
Algorithm
Create the map by filling the number as the key and the index at which it is present as the value
Iterate over the whole array.
For element at a particular index m we will check if it is present at its best spot or not.
The best spot of any number num is the N-num index of the array.
If the number is not present at its best spot then we will swap the number with element present at that spot.
As we have stored the index of every element in the map we can easily retrieve that from the map to get the swap done.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.