Dynamic Programming21 sections · 916 units
Open in Course

Quiz: LIS Optimization

Knowledge check

Check Your Understanding

The O(n log n) LIS algorithm maintains an array tails. What does tails[i] store?

  1. A.The smallest ending element of all increasing subsequences of length i+1
  2. B.The number of subsequences of length i
  3. C.The index of the i-th LIS element
  4. D.The i-th element of the original array
Start the roadmap to answer the quizzes and solve the challenges