Loading Question...

DSA: Smart Shuffle Playlist Mckinsey and Company - IIT Roorkee Online Assessment | Codinzhub

Mode: On-Campus Exam Pattern: 2 coding + 20 MCQ OA Date: 2026-10-27

You are given a playlist containing N songs. Each song is represented by

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

the algorithm uses their earliest unplayed song positions in the original playlist to break ties.

solution.cpp

Loading code editor...

Run code to see test results

00:00 / 69:42

DSA: Smart Shuffle Playlist Mckinsey and Company - IIT Roorkee

MediumMed•127 views•Data Scientist•23 LPA