Linked List Group Reverse solved in JS | GfG | POTD | Streak 278 | Thu 04 Sep 2025

You are given the head of a Singly linked list. You have to reverse every k node in the linked list and return the head of the modified list.
Note: If the number of nodes is not a multiple of k then the left-out nodes at the end, should be considered as a group and must be reversed.

Expected Complexities
Time Complexity: O(n)
Auxiliary Space: O(1)

#coding #GeeksforGeeks #ProblemOfTheDay #JavaScript

---
introduction:
name: "Jagadeesh Kumar S"
contact: "+91 73972 85837 | jagadeesh_2k17@proton.me"
description: "A problem-solving enthusiast passionate about coding challenges."

technical_achievements:
- "Solved 100+ daily coding challenges on GeeksforGeeks"
- "Ranked in the top 130 on SRM Institute of Science and Technology's GeeksforGeeks leaderboard"
- "Maintained a 100+ day streak for Problem of the Day"

github:
contributions: "Solutions available at https://github.com/JKS-sys/Solution-To-Problem-Of-The-Day-at-geeksforgeeks.org"
---

Видео Linked List Group Reverse solved in JS | GfG | POTD | Streak 278 | Thu 04 Sep 2025 канала NewsCraft Studio