Reverse a LL - DSA Practice

1/*
2Definition of singly linked list:
3struct ListNode
4{
5    int val;
6    ListNode *next;
7    ListNode()
8    {
9        val = 0;
10        next = NULL;
11    }
12    ListNode(int data1)
13    {
14        val = data1;
15        next = NULL;
16    }
17    ListNode(int data1, ListNode *next1)
18    {
19        val = data1;
20        next = next1;
21    }
22};
23*/
24 
25class Solution {
26public:
27    ListNode* reverseList(ListNode* head) {
28        
29    }
30};

Input:

Nums

Explore the solution