Search
⌘K

Leetcode 2173. Longest Winning Streak

Given a chronological sequence of match outcomes (wins/losses/ties), find the maximum-length contiguous interval where wins outweigh losses (net positive score). This requires transforming results into numeric scores and using prefix-sum + monotonic/hash techniques to identify the longest subarray meeting the inequality efficiently for large inputs.


Question Timeline

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

Comments

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