You are given an array of n pairs where pairs[i] = [left_i, right_i] and left_i < right_i. A pair [c, d] can follow a pair [a, b] if and only if b < c. Find the length of the longest chain format that…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.