Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2901. Longest Unequal Adjacent Groups Subsequence II
Find the longest increasing subsequence of indices such that each adjacent pair of selected words has the same length, Hamming distance 1, and comes from different groups, and return the corresponding words. In other words, it's a longest subsequence problem with local adjacency constraints (same-length, Hamming distance 1, unequal groups) between consecutive elements.
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.