JavaScript is required for SkillAI Hub to work properly. Please enable JavaScript and refresh the page.
Coding Challenge · INTERMEDIATE
Given a linked list, swap every two adjacent nodes and return its head. You must solve the problem without modifying the values in the list's nodes, only nodes themselves may be changed.