Available question text
Find the residue class modulo space that contains the most elements of nums (since seeding with nums[i] destroys all numbers congruent to nums[i] mod space), and return the smallest nums[i] in that class; tie-breaks by minimal seed.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2453. Destroy Sequential Targets
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source