Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
The input to the function/method consists of two arguments - rideDuration, an integer representing the duration of the ride in seconds; songDurations, a list of integers representing the duration of the songs. Output Return a pair of integers representing the IDs of two songs whose combined runtime will finish exactly 30 seconds before the rider reaches their stop. If no such pair is possible, return a pair with <-1, -1>. Constraints O s songDurations[i] < 1001 Osi< number of songs Example Input: rideDuration = 90 %3D songDurations = [1, 10, 25, 35, 60] Output: [2, 3] Explanation: During the ride duration of 90 seconds, the rider listens to the third and fourth songs (2nd and 3rd index, respectively) which end exactly 30 seconds before the bus arrives at their stop. If two songs have the same duration, select the option with the lowest index.

The input to the function/method consists of two arguments - rideDuration, an integer representing the duration of the ride in seconds; songDurations, a list of integers representing the duration of the songs. Output Return a pair of integers representing the IDs of two songs whose combined runtime will finish exactly 30 seconds before the rider reaches their stop. If no such pair is possible, return a pair with <-1, -1>. Constraints O s songDurations[i] < 1001 Osi< number of songs Example Input: rideDuration = 90 %3D songDurations = [1, 10, 25, 35, 60] Output: [2, 3] Explanation: During the ride duration of 90 seconds, the rider listens to the third and fourth songs (2nd and 3rd index, respectively) which end exactly 30 seconds before the bus arrives at their stop. If two songs have the same duration, select the option with the lowest index.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Assumptions

  1. You will pick exactly two songs.
  2. You cannot pick the same song twice.
  3. If you have multiple pairs with the same total time, select the pair with the longest song.
  4. There are at least two songs available 
Write an algorithm to find the IDs of two songs whose combined runtime will finish exactly 30 seconds before the bus arrives, keeping the original order. Input The input to the function/method consists of two arguments - rideDuration, an integer representing the duration of the ride in seconds; songDurations, a list of integers representing the duration of the songs. Output Return a pair of integers representing the IDs of two songs whose combined runtime will finish exactly 30 seconds before the rider reaches their stop. If no such pair is possible, return a pair with <-1, -1>. Constraints 0 < songDurations[i] < 1001 Osi< number of songs Example Input: rideDuration = 90 songDurations = [1, 10, 25, 35, 60] Output: [2, 3] Explanation: During the ride duration of 90 seconds, the rider listens to the third and fourth songs (2nd and 3rd index, respectively) which end exactly 30 seconds before the bus arrives at their stop. If two songs have the same duration, select the option with the lowest index.
Transcribed Image Text:Write an algorithm to find the IDs of two songs whose combined runtime will finish exactly 30 seconds before the bus arrives, keeping the original order. Input The input to the function/method consists of two arguments - rideDuration, an integer representing the duration of the ride in seconds; songDurations, a list of integers representing the duration of the songs. Output Return a pair of integers representing the IDs of two songs whose combined runtime will finish exactly 30 seconds before the rider reaches their stop. If no such pair is possible, return a pair with <-1, -1>. Constraints 0 < songDurations[i] < 1001 Osi< number of songs Example Input: rideDuration = 90 songDurations = [1, 10, 25, 35, 60] Output: [2, 3] Explanation: During the ride duration of 90 seconds, the rider listens to the third and fourth songs (2nd and 3rd index, respectively) which end exactly 30 seconds before the bus arrives at their stop. If two songs have the same duration, select the option with the lowest index.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS