← Accolite questions
CodingMedium

Path with Maximum Weight in DAG

Filed under Accolite

Given a directed graph with `n` vertices and `m` edges where each vertex has a lowercase English letter, find the maximum frequency of any character along a valid directed path. If the graph contains…

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 Accolite questions

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