Successfully completed 50 lectures of DSA busted 🔥🔥 50 videos of Quality Content 🔥🙌thank u so much Love bhaiya for this amazing course 🔥Consistency+++ #BelieveInBabbar ❤️ plz make a videos on *"5 Month Internship Strategy Series with DSA busted course"* as resource for 1st/2nd year students , intership ki party dene ka mauka de do 😁👌
A slight mistake in the solution. If you are considering to return the linked list in its original form (i.e. by reverting the reverse operation), you should also reverse it before you return false.
phle me apke sath tha pace me but internship lgne k bad piche hogya hu but koi nhi har nhi manunga abhi yaha tk hu, aur khud se solve horhe he bhaiya questions apke btane se phle it is only because of you.🥰
Love bhaiya one request please attach questions of different difficulty as a home work sheet in the description for every video! So that we don't have to visit 100s of sites. To do that
i am just thankful for this series as it has helped me a lot to think diff. approaches in diff. questions. thanks a lot love bhai. appreciate the quality content.
A question about the code at 18:02 : Line 64 is sending 'temp' to the reverse function at line 45 which is accepting 'head'. So does that mean that the head written there only serve as a template for the reverse function to accept a input of type 'Node* pointer'...? In other words, can we send 'temp' which is a Node* pointer to a function taking in 'head' as input...? Is it still accepting temp only in the input...?
Question me ye vale test case [1,2] ya fir [1,1,2,1] chala do nahi hoga wrong ans ayga sir. or koi bhi 4 length vali list jo palindrome nahi he vo chalake dekho nahi hoga.
step 4 should be before `return false`, not before `return true`. if the list is palindrome then we don't need to change is back to original, but if it's not palindrome then we need to repeat step 2.
bhaiya i am very demotivated because i am watching every lecture and grasping every concept but in the end when i try to do the homework ques i get stuck and sometimes my mind doesn't comprehend anything it just hangs then i have to search for the ans.. i am watching all the lectures again and again but i am unable to solve any unique ques.. pls help!!
bool isPalindrome(Node *head) { //Your code here Node* curr = head; Node* prev = NULL; int num = 0; while(curr!=NULL){ int digit = curr->data; num = num*10 + digit; // forming the original number and storing in num. Node* next = curr->next; curr->next = prev; // reversing the LL. prev = curr; curr = next; } head = prev; int revnum = 0; while(prev!=NULL){ int digit = prev->data; // forming the reverse number. revnum = revnum*10 + digit; prev = prev->next; } if(revnum == num) return true; else return 0; } solved it on my own.... it was pretty easy tbh ;)
