Round 1
Questions: The problem involves determining the maximum number of moves that can be made to remove dominoes while maintaining a minimum order defined by the length of the longest strictly increasing subsequence (LIS) of the remaining dominoes.
Given:
n = 6domino = [1, 4, 4, 2, 5, 3]remove = [2, 1, 4, 0, 5, 3]min_order = 3
The task is to find the maximum number of removals such that the LIS of the remaining dominoes is at least min_order.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.