LeetCode Swap Nodes in Pairs Explained - Java

If the given head contains odd number of nodes, this solution doesn't work

Love the channel, but the explanation is lacking for this one!

could u make another video
couldnt understand the code :(

genius answer and clear explanation, thank you!

The only thing missing in this video is your clap in the intro.

Why is it in Medium? Sounds like Easy to me

It is much better to draw some linkedlist for your explaination, I think that will be perfect. Anyway, thanks for sharing.

Nick it would be better explanation with board

Just wanna ask how do you come up with a temp ListNode method? Did you do some similar questions before? Thank you very much.

why did u did first_node->next=second_node->next

@Nick I really like your videos and I wanted to know have u solved all leetcode problems on Patreon?

You look like Desmond from assassin's creed..xd awesome videos btw

fck these algoexpert adds are so irritating

why he has allocated memory to temp node.

C++ Sol
ListNode* swapPairs(ListNode* head) {
ListNode* temp = new ListNode(0);
temp->next = head;
ListNode* curr = temp;

while(curr->next!= NULL && curr->next->next!= NULL)
{
ListNode* first = curr->next;
ListNode* second = curr->next->next;
first->next = second->next;
curr->next = second;
second->next = first;

curr = curr->next->next;
}


return temp->next;

You are Smart, Nick :):)

There is an easier solution:


ListNode* swapPairs(ListNode* head) {
auto temp = head;
while(temp && temp->next)
{
std::swap(temp->val, temp->next->val);
temp = temp->next->next;
}
return head;
}

You just got yourself a new subscriber.

been searching this solution for Java. thanks! keep this channel running buddy.

Great thinking!! :) I wanna develop my coding skills !! Would b great if I get some help :)