My code is correct Not able to Submit,Getting Linked List Class error int public class LinkedList

#1

Node curr=this.head;
Node evenHead=null;
Node evenTail=null;
Node oddHead=null;
Node oddTail=null;
while(curr!=null) {
if(curr.data %2== 0) {
if(evenHead==null) {
evenHead=evenTail=curr;
}else {
evenTail.next=curr;
evenTail=curr;
}
}

		else {
			if(oddHead==null) {
				oddHead=oddTail=curr;
			}else {
				oddTail.next=curr;
				oddTail=curr;
			}
			
		}
		curr=curr.next;
	}
	
	oddTail.next=evenHead;
	evenTail.next=null;
#2

@karamjitverma89,

We can take two pointers before and after to keep track of the two linked lists as described above. These two pointers could be used two create two separate lists and then these lists could be combined to form the desired reformed list.

Algo :

  1. Take Two Fake_heads to take care of odd and even list.
  2. Put loop on the given LinkedList.
  3. If the node is odd add it to odd fake_ head list.
  4. If the node is Even add it to the even fake_head list.
  5. At the set connect both of the list together and set head to odd list.
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.