Given n cities with treasure values T[i] and colors C[i], calculate the maximum profit possible when moving forward and visiting or skipping cities, where rewards depend on whether the current city's…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.