Reverse Nodes in k-Group | EP 11

Lecture Notes: leadcoding.in/...
Watch the complete Linked List Series • Linked List Series
Relevel test relvl.co/yvy5
Business Development:
• upGrad:- relvl.co/0dx
• Urban Company:- relvl.co/lw8
• Vedantu:- relvl.co/ocn
• Curefit:- relvl.co/gg3
Frontend Development:
• Cred:- relvl.co/cls
• Digit:- relvl.co/op9
Backend Development:
• Cred:- relvl.co/omq
• 1mg:- relvl.co/g9a
• Digit:- relvl.co/5vn
• Razorpay:- relvl.co/mdc
• Yellow Messenger:-relvl.co/2ic
Question (codestudio) bit.ly/3u2fYgH
Question (leetcode) leetcode.com/p...
Placement Preparation Roadmap • Roadmaps for Placement
Hi, I am Fraz.
I am Software Engineer working at Curefit and I love teaching.
This is my Channel where I upload content related to Interviews and my personal experiences.
My contact details
Instagram :- / frazmohammad
Connect with me on LinkedIn :- / mohammad-f-bb4886157
Telegram Group t.me/LeadCoding

[@KhushwantSinghZzzz]

Time complexity: 0(n) -- we are iterating each node twice. Space complexity: O(n/k) -- memory used in recursion stack. Completed season 1. Like the way of explaining the problem and make questions easy to solve. Looking forward for season 2.

[@mohammadfraz]

Thanks , more will come soon

[@aryansiroyajain8503]

Season 1 completed....waiting for next......i m really happy i found ur channel😁

[@nehathakur40]

Videos are really informative the best part is that beginners can also watch these the way of explanation is literally the best!Good job👏👏

[@rajkrishna8294]

If possible sir, please try to upload sorting on Linked List :) 1) Merge Sort 2) Insertion Sort 3) Quick Sort

[@eleveneleven4195]

One of the best series on LinkedList ❤

[@deepakdass4710]

Completed all the videos and coded all the problems by myself and I am sure everything was easy to understand. Thanks for this help

[@KUNALPATIL-bw9qi]

I completed this season. all doubt regarding the linked list is now clear time complexity is 0(n) space complexity is 0(n/k) thanks so much waiting for the next topic.....

[@mohammadfraz]

Nice work! next season is also up

[@sahilkhan_cs50]

I am having doubt in the space complexity.The space complexity is O(n/k) if you include the stack involved in recursion.But in websites like gfg ,they dont consider this extra space and say that the space complexity for the algorithm is O(1) as no extra space is taken.So what should the space complexity be?Should I include the recursion stack or not?

[@dp-ev5me]

too good to stop binging at season 1 end. very nice. Thank you Also, take recursion next, moving to dp without recursion will not be as helpful

[@mohammadfraz]

That's the plan! Recursion is must. Please share krna

[@sauravkumarsonu5539]

Like the very first season of series, bhaiya aap real guru ho, bahut kuchh sikhta hu aapse, waiting for more... ❤️. 🔥🔥🔥

[@mohammadfraz]

Will upload soon

[@avinaba_mazumdar]

TC: O(n) ASC: O(n) Completed Season 1... eagerly waiting for Season 2... Thanks Bhaiyya

[@mohammadfraz]

Soon bro The space is O(n/k)

[@shivarajput9719]

sir mene aapko kafi baar KZbin pr dekha but aaj pehli baar aapki coding wali koi video dekhi, Bhutt ache se smjhaya aapne, 2 din se ye question ni ho rha tha but aapki video dekhne k baad I was like "Bss itna easy tha ye" Nyc Explanation sir ❤️❤️

[@vaidanshkukreja8970]

Please bring the next series on STACKS & QUEUES or STL and thanks for the knowledge i finished the whole series and many concepts are cleared now THANKS A LOT!!!

[@mohammadfraz]

Abhi to more seasons will be coming on linked list

[@pankajsharma1397]

Finished the series. Waiting for next season brother!❤

[@mohammadfraz]

will come soon

[@ankit-ry3cz]

Time complexity= O(N) Space complexity= O(N/k) Completed this lecture..

[@mohammadfraz]

Amazing , now more will come

[@namanbhatia9872]

bhaiya trees aur graph ki bhi series leh aaye

[@mohammadfraz]

In future plan karte Hain

[@namanbhatia9872]

@@mohammadfraz okay bhaiya

[@akashbabutammali4478]

Very good Explanation Brother, I have seen many videos to understand this problem, but most of them didnt explained in easiest way as you.

[@Curlygirl02112]

your explanation is soo good i got the concepts clearly.

[@SurajKumar-ml2vb]

Bhaiya your explanation is exceptional 🔥...... I watched and implemented till now....please launch other episodes bof this series 🙏

[@mohammadfraz]

Soon , just keep spreading

[@mgdesire9255]

season 1 complete can't wait for season 2 .... Bhaiya the way are you teaching is really amazing ,you explain every single step very smoothly..... this serise gonna be mahh all time fav... TC: O(N) SC:O(N/K)

[@mohammadfraz]

Thanks Noob ❤️❤️

[@aryan_01793]

Time complexity:- O(n) Space complexity:- O(n/k) The space complexity n/k, because we are creatint a new node, (number of nodes/ size of the group) number of times. Is my conclusion on Space Complexity right? @Lead Coding by FRAZ

[@maitry6074]

Lots of love and respect;

[@beinghappy9223]

Thanks for the awesome explanation

[@amit9790singh]

I am comming from striver Sir video. I was not satisfy with their explaination. That's why I come here. The way you explain I am able to understand easily. How can do approach.

[@BTECE_manichandT]

tq for such clean explanation

[@rupampakhira8132]

Thank You So Much Bhaiya❤ Completed this lecture😊

[@mohammadfraz]

Great Rupam, keep sharing bro.

[@095udaykiran6]

great explaination

[@atozgyaaan8162]

finished this season bhaiya . waiting for season 02 and thanks for the awesome content .

[@mohammadfraz]

You're welcome ❤️❤️

[@abhayrai1724]

Best explaination specially in the end Of code ...❤️🎉🎉

[@NirmalSilwal]

time complexity - O(n) // for all nodes in the linked list space complexity - O(n-k) ~ O(n) // for recursive stack memory correct me if i am wrong 🙈

[@RishavRaj-kn8nm]

Bhaiya Very Well Explained!!!

[@mohammadfraz]

Thank you ☺️

[@pawanlok1776]

thank you for making this video ..

[@ratnasanjay]

Thankyou bhaiya for this video

[@shoryashokanda8973]

Thankyou fo rthis series

[@desihiphop4998]

bhaiya time complexity O(n) kyuki har node pe jaare ek ek krke aur space complexity O(n/k) kyuki k ke groups mein stack mein space lega isliye k pe depend krega !!!! great season bhaiya !!!! maja aagya !!!!!

[@hameedmulani21]

Well explained! 👨‍💻🏅

[@raghvendrakhatri5848]

Lect - 12 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills. Thankyou bhaiya ♥️

[@jatinmaheriya2343]

Great explanation ! Thank you for such quality content😇

[@suryaprakash1890]

Thank for the great series bhayya completed season 1

[@avirana2212]

Thanks🙌🙌

[@arisahmed1105]

Bhai op series concept dimaag m Beth gye ik dum please DYNAMIC PROGRAMMING PR SERIES LAOO

[@mohammadfraz]

yes bro, Laenge future me

[@simranarora2817]

Great explanation

[@utkarshsingh5390]

Completed season 1: completed all the questions simuntaneously

[@aditiranjan303]

Very nice explanation...pls make series for other topics too...

[@shyamaharihar2425]

Amazing approach thanks :)

[@atulyakharotia311]

17:49 ham agr starting mn next ko NULL se initialize karaden or fir loop ke andr sabse pehle next ko p->next de den to kya wo null pointer walli statement ko skip nahi kar sakte ?

[@35_pandey_shubham89]

sir does returning a head gives the whole linkedlist?if no why do we always return only head while solving the problem not the whole linked nodes?

[@shishirkj]

how do we know that recursion will give 4(90) as head and not as 5(85) because in reverse a linked list it gave the adress of last node

[@nancyshah5272]

sir why do we do the work of reversing the first k group...why dont we hand over that too to the function itself??

[@codingwithanonymous890]

Sir ek question tha like dyanmic programming mein memoozation se ho jaata hain but usko bottom up mein bahut confusion hota hain..so i just prefer memorization in coding rounds is there any chance of stack overflow

[@mohammadfraz]

Yes sometime because of recursion we might exceed time and memory. So bottom up is better

[@amandixit8342]

ha bhaiya proper aise mast si recorded recursion ki series laaye

[@mohammadfraz]

🔥🔥

[@shraddhagulati3081]

Bhaiya, I feel we can do it in one function. Check this I have done in javaScript function reverseKGroup(head, k) { if (head == null) return head; var current = head; var next = null; var prev = null; var count = 0; while (count < k && current != null) { next = current.next; current.next = prev; prev = current; current = next; count++; } if (next != null) { head.next = reverseKGroup(next, k); } if (count != k) { return reverseKGroup(prev, count); } return prev; }

[@thenewway416]

Nice 👍

[@alwaystrue5778]

Bhaiya please tell how to prepare for aptitude

[@mohammadfraz]

There is a playlist on my channel for interview preparation. I have explained in detail about it

[@NirmalSilwal]

thanks for the part1, enjoyed learning 💪

[@aryanrastogi1335]

Java Solution: class Solution { public ListNode reverseKGroup(ListNode head, int k) { if(size(head)

[@ishaankesari3723]

Why linkedlist is better to use here then a array?

[@rupampakhira8132]

Finished the series😌

[@SunnyGupta00]

Reach++🔥

[@girikgarg8]

Done!

[@shyaamaltripathi5373]

Completed

[@reetikgandate606]

🔥🔥🔥

[@fardeenshaikh6434]

bahut takleef hoti hai jab aap yogya ho aur log aapki yogyata na pehchane bhaiya bhut accha samjaya hai

[@edwardkenway6822]

Trees , Graph , Stack , queue Or Recursion pe series chaiye it's very IMP

[@mdnadeem6343]

op series bhaiya 🔥🔥🔥🔥

[@mohammadfraz]

Shukriya

[@kkumar07]

in last video why did u called recursion first and now ur calling next? after our work?

[@divyansh1391]

han bhaiya bilkul recursion ata hai but confidence nhi hai...so plz next series on recursion

[@mdnadeem6343]

O(N) time complexity and space complexity is O(N/K) and season-01 is complete

[@mohammadfraz]

Awesome Nadeem ❤️❤️

[@krishnapalsingh3164]

naming is the most difficult thing - by fraz bhaiya 🙂🙂

[@gopalsakhwala7986]

recursion series pls

[@aparnasah3677]

completed season 1 in a day...except design of hashmap and hashset....are they also imp..means are these two qus asked in interviews..🙂🤧 thank u sir for the amazing content and crystal clear explanation..✨😊

[@prateekshrivastava2802]

No

[@mohdfarhanahmed9416]

Faraz Bhai->Abse aage ke videos mai Java code b provide kariye na kaisa b. Time-O(n) Space-O(n/k) basically proportional to list length, is it correct?

[@mohammadfraz]

Farhan , zada difference nahi hai , aap dekho C++ and java ka syntax almost same sa hi hai. Video bahot bada ban jaega agar sea kiya to aapka answer sahi hai

[@bhavyagupta1389]

Waiting for next season

[@mohammadfraz]

Already hai uploaded

[@madamanchiashokchowdary9790]

nice

[@mandeepdangi1030]

Bhai recursion par video bnado please with question

[@mohammadfraz]

In future pakka

[@mayankshahabadee8331]

Done all videos bhaiya. Please Upload Season 2. Love your content bhaiya.

[@mayankshahabadee8331]

O(n),O(n/k)

[@mohammadfraz]

aaega Jaldi hi

[@scoobyman49]

Finished series

[@mohammadfraz]

Wait for the next season ❤️. Did you like it?

[@scoobyman49]

@@mohammadfraz Yes . It's excellent.. I am 2+ years experienced candidate in product based company and love these kind of content which gives you broader perspective while solving engineering problems. [We can give better review comments to other developers as they tend to ignore complexity Analysis]

[@kkumar07]

if linklist size ==2 then e->next == null so it returns same link list?

[@akshyagarg2398]

finished. when will be next season releasing

[@mohammadfraz]

Kafi jaldi aaega , please share karna series ko

[@GauravKumarSingh-xd4dc]

season 1 completed🙂

[@sageoustheory1957]

got it after second time

[@user-bv6il2nk4t]

please create comprehensive series request like pepcoding , notes if python same question get desxcription , it will good , like vedio deka , we go description and see sem code python for same question code , comapre kar skte say tmre i need move data science . devops and web dev bnae bad me

[@gengar_13]

Bhaiya, dsa sheet k question ka solution with explaination lao plz

[@priyanshuranjan103]

Recursion wala smjh ni aya sir

[@mohammadfraz]

Watch again bro , aajaega

[@ritikgupta1133]

exact time complexity will be k*O(n)

[@vikeshdas3909]

SIR BRING SOME MORE HARD QUESTION

[@koraksengupta3554]

Simpler approach was possible

[@Sonu-tg6tg]

Please make videos using JAVA

[@mohammadfraz]

ok