2023.11.12 - Cassidoo's Interview Question of the Week

2023.11.12-cassidoo.ts

// Given a list of tasks, where each task has a duration, and a limited amount of available time to work,
// write a function to return the tasks that can be completed within the given time, without re-ordering
// the original list of tasks.

type Task = { name: string; duration: number };
const tasks = [
  { name: "Task 1", duration: 4 },
  { name: "Task 2", duration: 2 },
  { name: "Task 3", duration: 7 },
  { name: "Task 4", duration: 5 },
  { name: "Task 5", duration: 1 },
  { name: "Task 6", duration: 3 },
];

const timeToWork = 6;
console.log(doTasks(tasks, timeToWork));
// > ['Task 2', 'Task 5', 'Task 6']

function doTasks(tasks: Task[], timeToWork: number) : string[] {
  const competitors: { duration: number; tasks: Task[] }[] = [];
  for (const task of tasks) {
    for (const competitor of competitors) {
      const newDuration = competitor.duration + task.duration;
      if (newDuration <= timeToWork) {
        competitor.tasks.push(task);
        competitor.duration = newDuration;
      }
    }

    if (task.duration <= timeToWork) {
      const competitor = { duration: task.duration, tasks: [task] };
      competitors.push(competitor);
    }
  }

  let highScore = 0;
  let winner: Task[] = [];
  for (const competitor of competitors) {
    if (competitor.tasks.length > highScore) {
      highScore = competitor.tasks.length;
      winner = competitor.tasks;
    }
  }
  return winner.map((task) => task.name);
}