Leetcode 1709. Biggest Window Between Visits

Given a chronological list of location/site visits, compute the largest gap (number of steps or days) between two consecutive visits to the same location and return the maximum such interval across all locations — this is solved by tracking last-seen positions and updating max differences in a single pass.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1709. Biggest Window Between Visits

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact