Quick Overview

Choose a maximum-sum subsequence of positive or negative movie ratings while ensuring no two consecutive positions are skipped. At least one movie must remain, original order is preserved, and the solution must scale to one million entries.

Maximize Movie Ratings Without Skipping Two in a Row

Company: Oracle

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: Choose a maximum-sum subsequence of positive or negative movie ratings while ensuring no two consecutive positions are skipped. At least one movie must remain, original order is preserved, and the solution must scale to one million entries.

Loading…