Add reverse linked list

Author: Gituser143

Easy/reverse-linked-list.md

@@ -0,0 +1,42 @@
+Code
+====
+
+```go
+/**
+ * Definition for singly-linked list.
+ * type ListNode struct {
+ *     Val int
+ *     Next *ListNode
+ * }
+ */
+
+func reverseList(head *ListNode) *ListNode {
+	curr := head
+	var prev *ListNode = nil
+	var next *ListNode = nil
+
+	for curr != nil {
+		next = curr.Next
+		curr.Next = prev
+		prev = curr
+		curr = next
+	}
+
+	head = prev
+
+	return head
+}
+```
+
+Solution in mind
+================
+
+-	Keep track of 3 pointer, `prev`, `curr` and `next`. With `curr` being initialised to `head` and the others being `nil`.
+
+-	Move through `curr` till we reach the end of linked list.
+
+-	Set `next` as `curr.Next`. Now the current node's pointer can be set to the previous node.
+
+-	After updating the current node's pointer, move `curr` to `next` and `prev` to `curr`.
+
+-	Finally, set the new `head` as `prev`, this will update the head to the new beginning of the list.

README.md

@@ -7,7 +7,7 @@ Link to profile, [bhargavsnv100](https://leetcode.com/bhargavsnv100/)
 
 | [Easy](#easy) | [Medium](#medium) | [Hard](#hard) |
 |---------------|-------------------|---------------|
-| 44            | 69                | 12            |
+| 45            | 70                | 12            |
 
 Problems finished
 =================
@@ -48,6 +48,7 @@ Easy
 -	[remove-duplicates-from-sorted-list.md](Easy/remove-duplicates-from-sorted-list.md)
 -	[remove-element.md](Easy/remove-element.md)
 -	[reverse-integer.md](Easy/reverse-integer.md)
+-	[reverse-linked-list.md](Easy/reverse-linked-list.md)
 -	[roman-to-int.md](Easy/roman-to-int.md)
 -	[squares-of-a-sorted-array.md](Easy/squares-of-a-sorted-array.md)
 -	[symmetric-tree.md](Easy/symmetric-tree.md)