Swap Every Two Nodes in a Linked List | Data Structures & Algorithms

Join Jomaclass for full-length videos like this: joma.tech/dsa

[@mandeepa3262]

I really love your videos. Keep up the good work and you will be adored by everyone.

[@RawPeds]

Thanks for the video: it's a good stimulus to get to solve funny problems.

[@safeeullahsaifuddin1147]

Thanks for the video! Could you make one going over how to find time and space complexity?

[@DarthVader-wm6tf]

Hey joma ... Thanks for your videos .. they're really helpful ... I'm waiting for your improved animated videos ...

[@LawrenceDCodes.]

Very good 👍🏾

[@RawPeds]

Wait. Nodes are never actually swapped. Only the values are!
Baited :D.
By the way, I tried my solution. Here it is.
def solve(a):
if (!a) return null
if (!a.next) return n
after = solve(a.next.next)
b = a.next # just renaming
b.next = a
a.next = after
return b

[@thecscontent5110]

I also do videos about programming!😁

[@mr.mystiks9968]

Not hard at all actually, even if you literally swap the node references.

[@KoreanBoysFishing]

yeye