Set Mismatch: coding question

Available question text

Given an array of length n containing numbers from 1 to n where one value was duplicated and another lost, return [duplicate, missing]. Core challenge: detect the repeated and the absent number in linear time and constant/linear extra space using counting, a hash set, or arithmetic/XOR techniques.

Continue with questions that share topics or the same question type.

Count Triplets with Even XOR Set Bits I
Coding
Count Triplets with Even XOR Set Bits II
Coding
Data Structure with O(1) Set All Operation
Coding
Design and implement an in-memory key-value store that supports set, transactional begin, commit, and abort operations.
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 645. Set Mismatch
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Set Mismatch

Available question text

Related questions

Set Mismatch

Available question text

Related questions