Closed
Description
Is there an existing issue for this?
- I have searched the existing issues
Issue Description
Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list.
The first node is considered odd, and the second node is even, and so on.
Note that the relative order inside both the even and odd groups should remain as it was in the input.
You must solve the problem in O(1) extra space complexity and O(n) time complexity.
Suggested Change
adding a solution to leetcode question number 328.
Rationale
No response
Urgency
High
Acknowledgements
- I have read the Contributing Guidelines
- I'm a GSSOC'24 contributor
- I have starred the repository
- I have read and followed the Contribution Guidelines
- I have followed the code style guidelines of this project
- I have checked for any existing open issues that my pull request may address
- I have ensured that my changes do not break any existing functionality
- Each contributor is allowed to create a maximum of 4 issues per day. This helps us manage and address issues efficiently
- I have read the resources for guidance listed below
- I have not used AI-generated content (e.g., ChatGPT, other AI tools)
- I have not used content from existing sites (e.g., text, images)
- I have followed all security rules and only shared trusted resources
Metadata
Metadata
Assignees
Labels
Type
Projects
Status
Done