Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2564. Substring XOR Queries
Given a binary string s and many queries [first, second], for each query find the shortest substring whose integer value val satisfies val ^ first == second (returning its [left,right] or [-1,-1]). Key insight: since values ≤ 1e9, relevant substring lengths are bounded (≈30), so you can preprocess integer values of short substrings and answer queries by looking up target = first ^ second.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.