Most IMPORTANT Linked List Questions for Placements | Java Full Course 

Code for removing cycle - public void removeCycle(Node head) { Node hare = head; Node tortoise = head; // Move hare and tortoise until they meet again (where the cycle starts) while (hare != null && hare.next != null) { hare = hare.next.next; tortoise = tortoise.next; // The point where both of them are at the same place (cycle starts) if (hare == tortoise) { // Move turtle to the head tortoise = head; // Move turtle and hare one step at a time until they meet again while (tortoise.next != hare.next) { tortoise = tortoise.next; hare = hare.next; } // Break the cycle by setting the next of the node where they meet to null hare.next = null; break; } }

Difference between old study and modern , pahle coment krne p teacher gussa hote the aur ab khus🤔

Didi best course nd best explanation please complete it♥️🔥.

Fun fact : Mujhe Java nii aati...

Thank you so much for this course please complete it ♥️♥️

Friend first you have to cover all core points of a topic and then implement one by one that's the easy approach for us all For example like constants, variables, identifiers, pointers, structures, functions, Hopefully you will follow this. Thanks for videos

Mam, we are waiting for your new video to learn to cover all the things.

@Apna College I think, we can eliminate 1st condition of (head.next==null) because for length of Linked list = 1, the condition (n==size) will do the the task, isn't it?

Mam pls continue java course 🙏🙏🙏🙏

i never forget the concept ... hare & turtle '😊 THANKYOU SO MUCH DI.

The expression you gave me at the beginning of this vedio is super amazing ---- I Like it ----- simple simple simple simple

Mme apko follow kr rha hu dsa k liyeee or ek path bhi mil rha tha but apka koi new video ni aya linkedlist pr please🙏 keep it up its very helpful for every student that who will learn dsa please🙏please keep it up

I wish I had such type of trainer and platform in my engineering days 20 years back. But nevertheless its never too late to begin something good.

Haa to sahi se pdhao Or ache se kro ise dobara😂 Baki u r the sweetest or acha hi padhati ho❤

For first question If u just want to print then isn't that indextosearch=size-n+1 ?

Thank you for amazing videos can you please cover all java topics with dsa and dynamic programming 🙏

It looks my interview questions need to be revised since the video perfectly covered them.

Thanks dear Aman bhaiya, Your suggestions are ♾️ Valuable🤘🤘🤘

Please make a freelancing series ...how to make gig , how to deal with clients kindly make these videos

1st question lineno. 28 There will not be i

I feel difficulty in built logic in Programming. Java is my first language i want to be good in it...but how?

This helps me a lot ...could you plz upload videos on android as well....actually i am looking for a job in android- java...so some placement videos on android will help me.. Thank you

Amazing guidelines 🤞

12:55 It should be size-n+1 instead of size -n-1

yaar yeh kitni awesome hai

16:47 .. the way did says "logic chahe ham kitna b bda bna le lrkinn space nagi use krenge computer ki"

Heyy! Do update the answer to remove the loop soon. Btw crazy playlist. Loving it so far

You have made DS easy.

Hare and Turtle explanation is the best one.

Please make a vedio on BTech +mba vs BBA+ MBA!!!!🙏🙏🙏

mam what will we write in main function of these codes?? and mam where are you writting these codes because it is not vs code

how to create that singly linked list on Visual Studio code and can anyone suggest me why the same code as in video is not working on my visual studio code.

For linked list palindrome ke lie yeh thik hai solution but this uses space import java.util.*; class Node { int data; Node next; public Node(int data) { this.data = data; } } public class Palindrome_LL { static void create(int n, Node head) { Scanner sc = new Scanner(System.in); Node temp = head; for (int i = 1; i = 0; i--) { arr2[i] = arr1[arr1.length - 1 - i]; } System.out.println(Arrays.toString(arr2)); if(Arrays.equals(arr1, arr2)){ System.out.println("Linked List is palindrome"); } else{ System.out.println("Linked List is not palindrome"); } } public static void main(String... args) { Node head = new Node(1); create(5, head); System.out.print("Linked List: "); print(head); System.out.print(" Array is: "); convertArr(head); } }

please also make tutorials for doubly, circular linkedList

so i did the question of removing the loop. it worked fine but when it removes the loop, it deletes the node connecting to the meeting point.

teaching way is awesome

tell me which code editor do you use please

Plz pura code likh dya krye mera ouput ni ho rha error a rha h

please upload more videos to cover all java, we are waiting please do it...

Please Microsoft ki eligibility and hiring process ke upar ek detailed video banaiye na. Please

maam that friend's talk was very emotional

Finding middle using size takes less time didi. size = 4ms and hare&turtle = 6ms

#Apna College & shradda didi rocks, god bless you & all 👍

Q.2) Check for palindrome. I did it with recursive solution as well. By this way time complexity remains O(n) but space complexity increases bcz of n number of calls in call stack. Here's the code, //Inside LinkedList class put these two methods and a static variable boolean isPalindrome(){ if(head==null || head.next==null){ return true; } checkPalindrome(head); boolean temp=isPalindrome; isPalindrome=true; return temp; } private static boolean isPalindrome=true; private Node checkPalindrome(Node current){ if(current==null){ return head; } Node start= checkPalindrome(current.next); if(current.data!=start.data){ isPalindrome=false; } return start.next; }

great channel for preparation for exams

Great lecture for me... thank you ma'am....

Allah Pak aap ko hamesha Salamat rakhe ameen 👐 ✧༺♥༻✧

Literally made it easy........Hats off to you....

great lecture..THANKYOU ....request you to please continue this amazing series.

mam , we can solve it using collection framework as well to make it more convenient ,, than why from scratch method

33.30 --> Detection of Loop in a LinkedList

Muskil hai leakin na mumkin nhin no PC and laptop but which your videos

can we js reverse the given linked list and then search of the n-1th index in the reverse linked list for q1?

Di how to recover dcim folder in android mi. I deleted all pics and videos in file manager by mistake

Didi ap bahut achcha padhati hai, please python per 4 se 5 hours ka video banayiye .

Why not using collection frameworks?

CDAC video 🔥🔥

won't it be easy to convert LinkedList to string and then check for palindrome?!!!

Pls upload videos regularly. Pls pls I am waiting

Can we use the direct collection framework to solve Linked List or any data structures (other than tree,graphs hashmaps)to solve problems? @Apna College

Didi please make a review video on NIT Jalandhar. 🙏

i got admision in vit,srm and was able to clear sat 40000 rank in UPTU thats how i got my college But suffered from slip disc during jee-mains preparation

Thanku didi for everything

Very Helpful, making things simple to learn by the way of teaching ❣❣

where can i found notes for this lecture

your code is failed on geeksforgeek palindone problem. The program is compiled sucessfully but in testcase the program gives the error... plz check it...

Please make a video on Java android development course

Didi please explain in short to cut the loop.

In Java, we have built-in methods. Why do we need to create a custom linked list with pointers? Am I missing something?

LeetCode ka sahi prayog...

Be humble otherwise you will suffer losses due to lack of humility i had 12 backs but i cleared them its not engineering experience this is error clinged to ones mind

when n==size , head can't be removed and answer is whole list

What abt double linked list and circulr linkedlist

these were definitely not the most important questions of linkedlist, no doubt they are a part of important questions but there are more important questions out there for linkedlist

Code for deleting the cycle is yet not updated.... Kindly update asap.

didi palindromic vala que doubly linkedlist se asan se kar sakte hena

In second question there should be (here!= null not here.next.next!=null)

42:58 /* Solution of Removing cycle... ☝🏼But first, we have to make a cycle...*/ // make cycle void makeCycle(Node head, int pos){ Node temp=head; Node startNode=null; int cnt=1; while(temp.next!=null){ if(cnt==pos){ startNode=temp; } temp=temp.next; cnt++; } temp.next=startNode; } // remove cycle void removeCycle(Node head){ Node turtle=head; Node hare=head; do{ turtle=turtle.next; hare=hare.next.next; }while(hare!=turtle); //Corner case: If cycle starts from head. if(hare==head){ while(turtle.next!=head){ turtle=turtle.next; } turtle.next=null; return; } hare=head; while(hare.next!=turtle.next){ hare=hare.next; turtle=turtle.next; } turtle.next=null; }

what a great playlist thank you shradha didi

Removing Loops in a Linked List. Didi Need video plz

didi regular video upload karo please ....aise video agr upload karoge to bohot din lag jayega

Removing Loops in a Linked List. Didi please solution update kardo

you have not mentioned code for removing a loop in linked list

Mam pls provide answer to removing loop. It is not updated

Anybody having the solution for adding and removing the cycle without much loss of data, please share.

I don't see the cycle detection logic updated in notes here

excellent video i seen ever 🥰

mam please upload the video for Removing the loop in a LinkedList

In Q.2, according to your code, 1 -> 2 -> 1-> 1 is a palindrome, but it is not, please somesone explain me how to fix that error This error is on 32:07

maam just a doubt collection framework se karne se nahi hoga kya?

Didi question ko dekh ke variable kaise ye analysis krna bhi btaya kre apne video me plzzz

How to find the second middle element of the linked list

How to run such programs? I don't understand.

Did anyone get to know how to remove the loop from the linked list? Of third question?

41:41 ma'am should have used | | instead of && 😅

Please update the answer of removing list in notes! 😄

Plz do upload the solution for loop detection and removal

Didi plz video bnayeeee topic beginner lvl k computer user jisko excel bhi nhi ata meri tarah 😅😅😅😅

Change the editor or compiler

Can't thank you all enough....!!!!