Rearrange Array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space #InterviewBit Code C++

Показать описание

Rearrange a given array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space.

Example:

Input : [1, 0]
Return : [0, 1]
Let's say N = size of the array. Then, the following holds true :

All elements in the array are in the range [0, N-1]
N * N does not overflow for a signed integer

Code with Alisha

Рекомендации по теме

Комментарии

Awesome explanation! I have started solving InterviewBit problems, hopefully u have ciovered them all <3

siddharthb

for the people why she is taking n as parameter of dividing or taking modulo because as the question suggested the element is less than n so the number should be in between .might clear

piyushsrivastava

plz continue creating such great sols..thanks

niranjanaware

Thanks for explanation...Thanks my dear sister.

venkatanagaprathapyelugula

I'm searching a good video for array explanation and I really find good content. Thank you so much for sharing this. 😀

AmanRaj-uxcw

Great explanation! Immediately subscribed :)

anshikaaa

Hey Alisha Great Explanation but have one doubt that its like we have to mug up this approach so if i try to solve this after 1 week i definitely forget it so how to remember these type of questions?

neerajgarg

can you give me explanation on this= sum(arr, n-1)+arr[n-1], what exactly going on here

SachinNagareiGTB

Thanks Alisha....what an easy gave me learning without wasting much time

dspeaks

Muskuraiye ...you have a new subscriber 😁

asad_mirza

new approach .... SC O(1)... TC O(n) ....

void arrange(long long arr[], int n) {

for(int i=0;i<n;i++)
{
if(arr[i]<0)
{
continue;
}

int ind=i;
int temp=arr[i];
int j;
while(arr[ind]>=0)
{
j=arr[ind];
int val=arr[j];
if(val<0)
{
break;
}

arr[ind]=val-1e6;

ind=j;
}

arr[ind]=temp-1e6;

}

for(int i=0;i<n;i++)
{
arr[i]=arr[i]+1e6;
}

return ;
}

billgatesbisht

Best explanation ever, thanks, please keep making such awesome videos! learning a lot

HarendraKumar-yrgt

What is the intuition behind this approach.

avishjain

clean and clear explanation thanks for good content..

harshitsharma

Useful video...explanation is understandable

reshmah

i thought why there's need to put modulo n in arr[arr[i]]%n *n since all the numbers in arr are less than n
but
now i realized as we multiply no's are changing at arr[i] so we have to first modulo n then just do multiply with n

rohankumarshah

How to get logic these type of question 😢

learncreative

thanks and keep making the such awesome videos.

rahultomar

Should have focused on the mathematical intuition

suyashpurwar

Why should we take %n before multiplying with n?

lakshmipriya

Rearrange Array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space #InterviewBit Code C++

Rearrange Array so that Arr[i] becomes Arr[Arr[i]] with O(1) extra space #InterviewBit Code C++

Rearrange an array such that ‘arr j ’ becomes ‘i’ if ‘arr i ’ is ‘j’

Rearrange an array so that arr[i] becomes arr[arr[i]] with space complexity O(1)

Rearrange an array such that arr[i] = i |Data Structures Algorithms | GeeksforGeeks,LeetCode | 001

REARRANGE AN ARRAY SUCH THAT ARR[i] = i

Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space GFG

Rearrange an array such that arr[i] = i

Rearrange array alternately

Rearrange array so that arr[i] becomes arr[arr[i]] | Arrays | Hindi

Array : Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space

#Array-Question_no_7#Program to Rearrange an array such that arr[i]=i. #Python #Efficient_Program

Reverse an Array | Rearrange an array such that ‘arr[j]’ becomes ‘i’ if ‘arr[i]’ is ‘j

Rearranging positive and negative values in an array | GeeksforGeeks

Rearrange Array Elements by Sign | 2 Varieties of same Problem

Rearrange Array Alternately in O(1) space complexity and O(N) Time Complexity Geeksforgeeks Solution

Segregate positive and negative numbers in Array

Largest number formed from an array

Java Program #17 - Sort an Array of Integers in ascending order

Sort colors | Leetcode #75

largest number | largest number leetcode | leetcode 179 | arrays sort java 8 2 liner

Stop using [arr.length - 1]!

Array - 52: Segregate Odd & Even Numbers in given Array

LeetCode: Merge Sorted Array in C++, using: sort(), arr:begin(). arr::.end(), array vectors as param

Maximize Sum Of Arr[i]*i Of An Array | Module Searching And Sorting | In English | Java | Video_9