Add Two Huge Integers

Problem Statement

Add Two Huge Integers Problem Description You're given 2 huge integers represented by linked lists. Each linked list element is a number from 0 to 9999 that represents a number with exactly 4 digits. The represented number might have leading zeros. Your task is to add up these huge integers and return the result in the same format. Singly-linked lists are already defined with this structure: template<typename T> struct ListNode { ListNode(const T &v) : value(v), next(nullptr) {} T value; ListNode *next; }; Examples Example 1: Input: a = [9876, 5432, 1999], b = [1, 8001] Output: [9876, 5434, 0] Explanation: Because 987654321999 + 18001 = 987654340000, we return [9876, 5434, 0]. Example 2: Input: a = [123, 4, 5], b = [100, 100, 100] Output: [223, 104, 105] Explanation: Because 12300040005 + 1000100100 = 22301040105, we return [223, 104, 105]. Constraints `a` is a linked list representing the first number, without its leading zeros. `0 `0 `b` is a linked list representing the se