Available question text
Given an array words and a parallel binary array groups, find a longest subsequence (preserving original order) of words such that the corresponding group bits strictly alternate (no two consecutive bits are equal); return any valid longest subsequence.
Related questions
Continue with questions that share topics or the same question type.
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 2900. Longest Unequal Adjacent Groups Subsequence I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source