feat: add LeetCode problem 92 - #1585
Open
darshan0548 wants to merge 1 commit into
Open
Conversation
Add iterative solution for Reverse Linked List II
darshan0548
requested review from
Panquesito7,
alexpantyukhin and
tjgurwara99
as code owners
August 25, 2026 05:43
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Adds an iterative C solution for LeetCode #92 "Reverse Linked List II" —
reverses the sublist of a singly linked list between positions
leftandright(1-indexed), using a dummy node and the standard prev/currpointer-reversal technique.
Description of Change
Iterative reversal of a sublist (positions left to right) in a singly
linked list, using a dummy node to simplify the edge case where left == 1.
References
N/A
Checklist
Notes: Iterative solution, O(n) time, O(1) space.