Merge branch 'neetcode-gh:main' into main

Author: tahzeer

README.md

@@ -192,7 +192,7 @@ If you would like to have collaborator permissions on the repo to merge your own
 <sub>[0876 - Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)</sub> | <sub><div align='center'>[✔️](c%2F0876-middle-of-the-linked-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0876-middle-of-the-linked-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0876-middle-of-the-linked-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0876-Middle-Of-The-Linked-List.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0876-middle-of-the-linked-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0876-middle-of-the-linked-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0876-middle-of-the-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0876-middle-of-the-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0876-middle-of-the-linked-list.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0876-middle-of-the-linked-list.ts)</div></sub>
 <sub>[0160 - Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/)</sub> | <sub><div align='center'>[✔️](c%2F0160-intersection-of-two-linked-lists.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0160-intersection-of-two-linked-lists.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0160-intersection-of-two-linked-lists.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0160-intersection-of-two-linked-lists.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0160-intersection-of-two-linked-lists.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0160-intersection-of-two-linked-lists.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0160-intersection-of-two-linked-lists.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0143 - Reorder List](https://leetcode.com/problems/reorder-list/)</sub> | <sub><div align='center'>[✔️](c%2F0143-reorder-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0143-reorder-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0143-reorder-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0143-reorder-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0143-reorder-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0143-reorder-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0143-reorder-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0143-reorder-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](typescript%2F0143-reorder-list.ts)</div></sub>
-<sub>[2130 - Maximum Twin Sum Of A Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2130-maximum-twin-sum-of-a-linked-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2130-maximum-twin-sum-of-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2130-maximum-twin-sum-of-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
+<sub>[2130 - Maximum Twin Sum Of A Linked List](https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](cpp%2F2130-maximum-twin-sum-of-a-linked-list.cpp)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](java%2F2130-maximum-twin-sum-of-a-linked-list.java)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F2130-maximum-twin-sum-of-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F2130-maximum-twin-sum-of-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0019 - Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)</sub> | <sub><div align='center'>[✔️](c%2F0019-remove-nth-node-from-end-of-list.c)</div></sub> | <sub><div align='center'>[✔️](cpp%2F0019-remove-nth-node-from-end-of-list.cpp)</div></sub> | <sub><div align='center'>[✔️](csharp%2F0019-remove-nth-node-from-end-of-list.cs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](go%2F0019-remove-nth-node-from-end-of-list.go)</div></sub> | <sub><div align='center'>[✔️](java%2F0019-remove-nth-node-from-end-of-list.java)</div></sub> | <sub><div align='center'>[✔️](javascript%2F0019-remove-nth-node-from-end-of-list.js)</div></sub> | <sub><div align='center'>[✔️](kotlin%2F0019-remove-nth-node-from-end-of-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F0019-remove-nth-node-from-end-of-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](rust%2F0019-remove-nth-node-from-end-of-list.rs)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](swift%2F0019-remove-nth-node-from-end-of-list.swift)</div></sub> | <sub><div align='center'>[✔️](typescript%2F0019-remove-nth-node-from-end-of-list.ts)</div></sub>
 <sub>[1721 - Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>[✔️](kotlin%2F1721-swapping-nodes-in-a-linked-list.kt)</div></sub> | <sub><div align='center'>[✔️](python%2F1721-swapping-nodes-in-a-linked-list.py)</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>
 <sub>[0460 - LFU Cache](https://leetcode.com/problems/lfu-cache/)</sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub> | <sub><div align='center'>❌</div></sub>

cpp/2130-maximum-twin-sum-of-a-linked-list.cpp

@@ -0,0 +1,49 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     ListNode *next;
+ *     ListNode() : val(0), next(nullptr) {}
+ *     ListNode(int x) : val(x), next(nullptr) {}
+ *     ListNode(int x, ListNode *next) : val(x), next(next) {}
+ * };
+ */
+
+// Time: O(n)
+// Space: O(1)
+class Solution {
+public:
+    int pairSum(ListNode* head) {
+        ListNode *fast = head, *slow = head;
+
+        while(fast && fast->next) {
+            slow = slow->next;
+            fast = fast->next->next;
+        }
+        slow = reverseList(slow);
+        
+        int mx = 0;
+        while(head && slow) {
+            mx = max(mx, head->val + slow->val);
+            head = head->next;
+            slow = slow->next;
+        }
+        
+        return mx;
+    }
+private:
+    ListNode* reverseList(ListNode* head) {
+        ListNode* prev = NULL;
+        ListNode* curr = head;
+        ListNode* NEXT = NULL;
+        
+        while(curr) {
+            NEXT = curr->next;
+            curr->next = prev;
+            prev = curr;
+            curr = NEXT;
+        }
+        
+        return prev;
+    }
+};