Leetcode 1570. Dot Product of Two Sparse Vectors

Given two large, mostly-zero vectors provided in sparse form, compute their dot product efficiently by summing products only for matching non-zero indices; the challenge is to avoid O(n) work over all elements by using index-aware traversal (e.g., hash map or two-pointer on sorted index lists).