← BNY Mellon questions
CodingMedium

Task Master

Filed under BNY Mellon

Given a directed graph of tasks and dependencies, find the maximum number of tasks that can be completed by ignoring cycles. This is equivalent to finding the size of the largest Directed Acyclic…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related BNY Mellon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.