Compare two linked lists where each node contains a character array.

If each node contains a character array and chunk boundaries do not matter, do not compare nodes one-for-one. Maintain a current node and character offset for each list. Before each comparison, advance through exhausted or empty arrays; if exactly one stream ends, return false. Compare the current characters, fail on a mismatch, then increment both offsets. When both streams end together, return true. This is a streaming algorithm: it neither concatenates nor copies the text, so it handles one list containing ['ab','c'] and another containing ['a','bc']. Ask whether null arrays are legal and normalize them consistently. Each character and node is visited at most once, giving O(L) time for total characters L and O(1) extra space.