Search
⌘K
Get Premium
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).
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid December, 2025
Meta
Senior
Late October, 2025
Meta
Mid-level
Early October, 2025
Meta
Mid-level
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.