Leetcode 2453. Destroy Sequential Targets
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.