Jira Ticket: LND-145
LeetCode: https://leetcode.com/problems/reverse-linked-list
Pattern: Linkedlist Reversal
Difficulty: Easy
Status: To Do
Priority: Medium
Labels: Easy, Linked_List
Created: 2025-08-21
Last Updated: 2025-08-22
Problem URL: https://leetcode.com/problems/reverse-linked-list Problem Description: Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3: Input: head = [] Output: [] Constraints: The number of nodes in the list is the range [0, 5000]. -5000 <= Node.val <= 5000 Difficulty: Easy Category: Linked List
- What are we asked to find/compute?
- What are the inputs and outputs?
- What are the edge cases?
Time Complexity: O(?)
Space Complexity: O(?)
Algorithm Steps: 1. 2. 3.
Time Complexity: O(?)
Space Complexity: O(?)
Example:
Step 1:
Step 2:
Step 3:
# Your solution here
def solution():
passInput:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
Input:
Expected Output:
Actual Output:
Status: ⏳ Not Tested
- When to use linkedlist reversal:
- When NOT to use this pattern:
- Pattern Guide
- LeetCode Discussion: https://leetcode.com/problems/reverse-linked-list/discuss/
- Problem understood
- Pattern identified
- Brute force solution
- Optimized solution
- All test cases pass
- Complexity analyzed
- Code reviewed
- Learnings documented
- Jira ticket updated
Status: 🔴 Not Started
Last Updated: 2025-08-22