1389 Create Target Array in the Given Order | Zero to FAANG Kunal | Assignment Solution | Leetcode

[@spencer9752]

Nice solution bro , everyone is using arraylist/vector which makes the zero logic but you explained the best approach without using extra space ❤️

[@ProgrammersZone]

Thanks and welcome :)

[@RaymaxOfficial]

Bro All i can say is that you are doing AWESOME JOB. TRULY CAN'T FIND A TUTORIAL OTHER THEN YOU A WHERE I AM LEARNING MULTIPLE APPROACHES TO SOLVE THE PARTICULAR QUESTION. FROM NON OPTIMIZED WAY TO OPTIMIZED WAY.

[@RaymaxOfficial]

KEEP UPLOADING !! SO IN NEED.

[@ProgrammersZone]

@@RaymaxOfficial thanks a lot I'll :)

[@sainayan]

Not a good solution but a unique one.

[@arabindrajak4951]

Thankyou brother samagh aa gya achi tarah se🥰

[@ProgrammersZone]

Welcome buddy

[@RaymaxOfficial]

I want to add this approach also, In This approach it uses ArrayList, to built the target array. ArrayList add function has an built in code where there it shifts the elements when you try to insert another element. public int[] createTargetArray(int[] nums, int[] index) { // 1. create the arraylist ArrayList a = new ArrayList(); // 2. Add elements in arraylst using add function for (int i = 0; i < nums.length ; i++) { a.add(index[i], nums[i]); } // 3. Because ArrayList has an built in function of shifting elements, that is why all we need to do is just copy the elements to our output array, because we need to return the ArrayList. int output[] = new int[nums.length]; for (int i = 0; i < nums.length ; i++) { output[i] = a.get(i); } return output; } ------------------------------------------------------------------------------------------- One question i have what is the time and space complexity here ?

[@ProgrammersZone]

Time Complexity : O(n) Space Complexity : O(n)

[@RaymaxOfficial]

@@ProgrammersZone Sir, Should we also consider the internal for loop arraylist is using for shifting elements or not ? if so then the time complexity will be different?

[@ProgrammersZone]

We'll have to consider so after considering that time complexity becomes O(n^2)

[@RaymaxOfficial]

@@ProgrammersZone Thankyou so much sir for clarifying!!

[@AdityaSharma-fd9px]

@@ProgrammersZone sir i have a question why can't we simply return the a arraylist why are we making another arraylist and adding the same element in it

[@shashanksharma7747]

Good Solution too many approach keep uploading the videos

[@ProgrammersZone]

For sure :)

[@anshumanbehera3706]

thanks bro its help me a lot

[@laugh_till_u_pee968]

keep uploading.

[@ProgrammersZone]

Thanks a lot Keep Supporting :)

[@abhinavkumar2085]

Good

[@ProgrammersZone]

Thank you

[@hailex2045]

Bro he gave the solution almost a year ago by his logic which is only faster than 44% of the population whereas you can only apply Arraylist which is the simplest solution & as of now is faster than 77% of population...

[@ProgrammersZone]

Buddy don't focus on leetcode's analysis instead just focus on time and space complexity it will make far more sense :)

[@hailex2045]

@@ProgrammersZone sure, I am planning soon to watch Kunal's video on Time Complexity but how come leetcode's analysis be wrong as it just compares your code's time complexity with others code's one.

[@ayushacharya4778]

is this the best solution?? time complexity kam nahi hosakta ??

[@sukiratsingh985]

Ho sakti hai bhai nlogn mai kiya hai kisi ne uska thoda complex tha

[@evelynsummer4020]

Can you explain in English please i don't understand

[@anikethpaul3657]

bhai ek solution dunga...agar channel grow karna hain toh thoda kam minutes ka vid banao

[@ProgrammersZone]

Bhai jisko jaisa padhna hai wo waisa dekh le according to time stamps, agar 10 min ka video banana hai to itna time question samjhane me lag jaata hai Hope you understand :)

[@abhishekkr8077]

@@ProgrammersZone you are best bro