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

[@otismilburn9018]

Awesome explanation! Please continue LeetCode Series sir. Cover atleast 600 questions so that we get prepared for Placements! One video daily sir:)

[@HelloWorldbyprince]

mera v yahi thought hai ekdum

[@bhupeshpattanaik7150]

7:25. ...phool paate wala division 😝😂👌 leaning ke saath entertaining hae yeh video 👍

[@theroastingtoaster8542]

Excelent explanation buddy......have been thinking for like 1 day, never thought of this approach, solved it using O(n) extra space. But your explanation is the best. Keep making these types of videos. You just earned a subscriber. Thankyou.

[@HelloWorldbyprince]

Very welcome! Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@AnandSharma-lt8wq]

some key points any no%m = [0 to m-1] min elements are at odd postitions [1,3,,,,] max elements are at even postitions [0,2,,,,] we're basically storing 2 no's with a single no: using basic concept: dividend = divisor * quotient + remainder using modulo in each operation will give us older number(As that number may have modified already) (around 14:00 to 16:00 in video)

[@ankushladani496]

Jalwa Gajab Ka tha sirji....💯💯🙌🙌

[@Knowledgeduniya1432]

Better than others explaination its good but still filling like zajbat badal gye

[@HelloWorldbyprince]

Thanks , Hahahhaah

[@sahilverma3976]

I've watched many videos regarding this problem and this video has the best explanation. You were not rushing to teach the concept and made even the tiniest bit of things clear. Your new subscriber. Keep it up!

[@HelloWorldbyprince]

You're welcome! Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@ahn360]

@@HelloWorldbyprince cost to free but itna awsome concept share karne me jalan to hoti hai na bhaiya 🤪🤪🤪🤪🤪

[@shashanksabharwal8591]

By the end of 2021 you might have around 1 million subs... Bhai please... Sare graph, trees linked list jo bhi sb important questions hote h.. Jitne bhi interview k lie sare questions jo usually puchte h .. Please complete all of these if possible Array , string sab kuch sorting A to Z ... *I recentlt watched a video of your on linked list. And after watching that video i realised that you are the person i am looking for previous 3 months on youtube... Please complete ASAP.. If possible come live and exoplain code .. Please please please try to make as much as videos you can on a single day...

[@HelloWorldbyprince]

Thanks a lot for these wonderful response ❤️ I don't know I reach 1M or not ? But right now subscribers like you are the need of Hello World Thanks a lot I will definitely make videos and each and every topics And I will try ASAP

[@pavankumar-lv4ne]

this guy trying this best to teach the concept. respect

[@HelloWorldbyprince]

Thanks Pavan for support

[@sajalsangal1436]

great I solved that practise question you gave, you explained the formula very well, this is what I wanted great job.

[@HelloWorldbyprince]

Thanks for watching ❤️ Keep sharing with your friends

[@ishitaroy2238]

One of the best problem solving video.... great job bhaiyaa.

[@HelloWorldbyprince]

Keep learning buddy 😊

[@ROHITRAJ-bc7nq]

Bhai tera padhane ka tarika mst h 👍👍👍

[@HelloWorldbyprince]

dil se thanks bhai

[@saurabhvishwakarma2320]

Very helpful video ...I like it 😊

[@insanecode9374]

bhai you are entertaining !!

[@rafiqn2675]

Bayya make 1 videos per day.... please...main thing is to group these videos according to their concepts (playlist)...very help full...

[@HelloWorldbyprince]

I will definitely try to make one vidoe ❤️

[@musafirgauravv]

In simple english --> By adding arr[i] every time, you are making sure that whenever you will take a % with maximum element, you will always get the original array in return, and by multiplying with modulo of alternate maximum and minimum values you are making sure that when you divide it by maximum element you will always get the new alternate array back

[@ayushanand4530]

Beautiful Explanation! bhaiya you give each and every thing with logic and all the Concepts with Reason which is not Present anywhere else. Thanks a Lot bhaiya. Generally I do not Comment but Today I couldn't Refrain myself.

[@HelloWorldbyprince]

So nice of you

[@harsimran.27]

such a good explanation. Thanks bhaiya.👍🏻👍🏻

[@HelloWorldbyprince]

Thanks buddy ❤️

[@nayankhuman1043]

Best Explanation !! Thanks a lot 🙌

[@HelloWorldbyprince]

thanks nayan

[@trigunadityapnd]

I've just started DSA and a friend suggested me this video. Turned out to be really helpful !!!

[@HelloWorldbyprince]

Thanks brother I hope you also spread my channel and someone else also send me message like u 🙂🙂

[@samridhup]

wow loved it, but there was lag in audio... though keep up the good work

[@VivekKumar-ui1ro]

Gajab concept bhaiya..maja aa gaya

[@divy04]

beautifully explained, awesome

[@pranavkochhar9352]

Your explanation is very good!!

[@anotherstranger3968]

Really Great intuition!🙏🙏

[@HelloWorldbyprince]

Thanks a lot buddy

[@vinothkannans1910]

Great explanation 👍. Please explain in English

[@shaiksabiha5796]

Jajakallahu khair bhaya ..

[@mayankgarg4157]

Nice logic sirrr❤❤❤❤❤❤

[@sudhadevi6692]

Thx bhaiya for this ❤ lecture

[@HelloWorldbyprince]

thanks a lot

[@akashkhandelwal-altruistic5363]

Sir, please make a video on how to find time complexity of any algorithm. I'm beginner in ds/algo

[@HelloWorldbyprince]

Yeah sure

[@RakeshKumar-pi8wh]

Buddy, i never commented on anyone's video.. but your explaination,, literally made me do so.. no words to explain.. just wanna say, thanks buddy.. fabulous work🙌🙌

[@HelloWorldbyprince]

Waoo I feel lucky today 😎😎

[@alexmercer5870]

Beautifully explained

[@vikas5840]

finally found the best explanation for this question

[@HelloWorldbyprince]

Glad it helped! Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@JaikishanJaikumar]

Bhaiya u r awesome. No more words for u

[@HelloWorldbyprince]

thanks a lot Jaikishan keep learning buddy and be consistent and share my channel with your college groups that helps me a lot

[@yagizegemen7303]

Thanks sir you made it very easy to understand this concept. Please Continue uploading questions sir. Fortunate to discover this explanation series.

[@HelloWorldbyprince]

Thank you, I will

[@Socrates225]

nicely explained such a complex approach

[@HelloWorldbyprince]

Keep learning and sharing buddy ❤️

[@sidharthreddyarutla7483]

Very good explanation sir

[@HelloWorldbyprince]

Keep watching

[@alphazero0]

Perfect video like karke iss video ke top me push kardo bhailog.

[@HelloWorldbyprince]

keep learning buddy and be consistent and share my channel with your college groups that helps me a lot

[@user93-i2k]

also Bhaiya has mentioned that the array will be sorted, so if you are applying it to unsorted array, sort it first

[@nayasavlog1816]

good explanation

[@pritamsarkar3371]

this is the best youtube channel I found in 2020

[@mohammedayan7157]

ncy explaination!!!!!

[@coderbhai4958]

Thank you 💘

[@HelloWorldbyprince]

Any time!

[@chidambarjoshi3470]

bro, I have participated in hacktoberfest 2020, please can you make a video on that , as to how make quality pull request and win the challenge

[@RiteshYadav-rc1np]

its very simple bro just write or copy paste any good programs and make pull requests try to make 2 or 3 extra and you are done then after around 7 months raom outside with hacktoberfest T shirt

[@InvincibleMan99]

Thanks bro How to deal with, when we have -ve numbers ?

[@sushantpandey2127]

Thank you x 100

[@HelloWorldbyprince]

Welcome x 1000000

[@bhupeshpattanaik7150]

16:53 confusion start 😂 ... Confused between mod and divide , itna part delete kar dete

[@ARSHADKHAN-sy7vb]

yehi toh genuinity h bande ke !!

[@sudhakarkumar3039]

Very Nice

[@HelloWorldbyprince]

Thanks

[@cr7johnChan]

Thanks

[@HelloWorldbyprince]

Keep learning buddy

[@shikhar2k01]

🔥🔥

[@HelloWorldbyprince]

Thanks brother 😊

[@SunnyKumar-ud9gp]

Great explaination

[@dhairyataneja3211]

Amazing!

[@HelloWorldbyprince]

Thank you! Cheers!

[@asthadubey6571]

Sir, please tell me from where do I build this kind of logic during the placement coding interview. It doesn't click directly after seeing the question and we have a time limit to finish the question. How to improve the logic building part??

[@HelloWorldbyprince]

Trust me 😀.... One simple RULE ...only practice .... Don't think like that... Ye questions agar interview me aata to first time me mere se nahi hota ... Think like that ....ki bahut saraa question practice karne ke baad ye logic to generate ho hi jata

[@unnatigupta6647]

sir please tell the solution order will be maintain

[@HelloWorldbyprince]

Matlab ?

[@unnatigupta6647]

@@HelloWorldbyprince in gfg there was a question to rearrange the array where order should be maintained in question 5 in arrangement section of array

[@ProgrammingWithProject]

Bhaut badiya sir

[@HelloWorldbyprince]

Thanks a ton yaar

[@mohammedwaseem8599]

Thank You So Much!.

[@HelloWorldbyprince]

your welcome buddy

[@vishalshukla3299]

Highly conceptual...

[@HelloWorldbyprince]

Thanks buddy

[@Sasta.Engineer]

@@HelloWorldbyprince ghanta mera lele...

[@harshalgarg1149]

Great explanation.

[@HelloWorldbyprince]

keep learning buddy and be consistent and share my channel with your college groups that helps me a lot

[@harshalgarg1149]

@@HelloWorldbyprince Sure. :)

[@paraskumar693]

We can do it in O(N^2) by reversing array starting from ith index to last index

[@succeedwithuttam2271]

arr[k]=(arr[j]%maxx)*maxx+arr[k], sir in statement (arr[j]%maxx) we are getting same arr[j] value, then why is this showing error when i am direct putting arr[j] ?

[@shubhampatel6325]

Nice video sir

[@chandrashekharpatil6332]

class Solution: def rearrangeEvenOdd(self, head): #code here if head==None: return head temp=head x=head y=head.next t=head while temp.next!=None: ptemp=temp temp=temp.next ptemp.next=temp.next while x.next!=None: x=x.next x.next=y return t #reply if it is wrong #like if it is correct

[@kothapalliavinashkumar8699]

if u teach in english itwill be very grateful

[@HelloWorldbyprince]

sure i will try my best

[@division-gaming]

3:17 roasted me so bad i was trying to swap 😂😂

[@HelloWorldbyprince]

It happens 😂😂

[@330_atharvashirgave8]

Explanation was too good but logic samjna ma ek do din laag jayenga😂

[@mohdyasir5421]

👍👍👍❤❤

[@HelloWorldbyprince]

🔥🔥

[@UnKnown-id7ih]

home work is done Sir in O(1) Space complexity but I'm unable to digest this Method.

[@HelloWorldbyprince]

Try

[@mcaddit6802]

Awesome bruh!

[@rabindrakumar949]

How the formulation created.

[@HelloWorldbyprince]

Just by analysing the data

[@engineer966]

bhaiya Phd wale professors aapke saamne paani bharenge ..pura concept smjh aaa jata hai ...thanks bhaiya

[@HelloWorldbyprince]

🤣🤣

[@suryanshbaranwal8702]

what if we have given random values then

[@VaibhavSutar-xm3cn]

2.06 ultimately nahi hua hoga hits hard

[@aryamansingha9984]

I got stuck in this part bhaiya like you are sayin Index (n-1) = 6*7 kaise hua

[@jasmeenkaur6001]

bhaiya agar app blackboard pe smjate too clearly jhda hotii ppt pe nhi ho rhiiiiiiiiii

[@HelloWorldbyprince]

😊

[@yashgoswami9227]

nicely explaination

[@HelloWorldbyprince]

Thanks Yash

[@davidsharma9662]

Bhai jahan khud ko yaad naa aaye wo part cut kar diya karo! bachche darr jaayenge ki kitna tough questiom hai

[@1piecegaming622]

this code is not working for negative integers in array

[@mohdyasir5421]

Gjb sir

[@HelloWorldbyprince]

yeahh thanks bro

[@adityatayal3147]

Thanks bro

[@HelloWorldbyprince]

Welcome

[@nikhilchaurasiya5156]

i don't know how this code work for the same problem but please tell me this #User function Template for python3 class Solution: ##Complete this function #Function to rearrange the array elements alternately. def rearrange(self,arr, n): ##Your code here i=0 j=n-1 temp=[] if n==1: return arr elif n%2!=0: while i

[@suryapratapsinghrathor7042]

There must be some internal Issue, it is not of O(1) Space

[@ahmedanwer1767]

but for negative values it will not work

[@sidharthdhiman4522]

i did not understant why we are doing arr[i]%maxi , why not take only arr[i]

[@HelloWorldbyprince]

bro i guess u must have to do dry of the code

[@gamingcircus2637]

If to understand the logic, i am taking such long, how can i create my own logic?😂 whoever has solved this problem in his first attempt without any hint must be genius.

[@HelloWorldbyprince]

its beginning and you are going good

[@VaibhavSutar-xm3cn]

aisa lag raha he 5th standard me aa gaya

[@jasmeenkaur6001]

baki bhaiya thankuuuuu

[@HelloWorldbyprince]

Thanks a lot jasmeen ❤️

[@anandparashar4589]

bhai apne mai hi krlo video yu daale ho

[@HelloWorldbyprince]

😇

[@kaustubhgaikwad2562]

samaj nahi aya

[@Anuj-vf7bg]

do your revision first then teach no dry run wt was that

[@inspiredomkar1239]

Bhaiya please directly explaination bataya kro , bakiki baate mt bataya kro

[@Lolzzzzz77]

Taaki tm chhap ke count bdha sko

[@DeepanshMaurya-w7i]

ping++

[@technical3199]

Bro dont give wrong content

[@tricksforsolving2804]

[@amanmahajan1666]

great explanation

[@HelloWorldbyprince]

Glad it was helpful!

[@Sonsourav]

nice explanation