Available question text
Find the largest integer that appears in exactly one contiguous subarray (sliding window) of length k in nums — return that integer or -1 if none. Equivalently, count for each value how many k-length subarrays contain it and pick the maximum value with count == 1.
Related questions
Continue with questions that share topics or the same question type.
- Find the Kth Largest Integer in the Array
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Find Kth Largest XOR Coordinate Value
Coding
- Find Largest Value in Each Tree Row
Coding
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 3471. Find the Largest Almost Missing Integer
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source