Algorithm · Snowflake · Medium
Requirements Input: a directed acyclic graph represented by vertices and directed edges, with each vertex annotated with a set of allowed letters and a set of disallowed letters. Use the 26 lowercase letters as the letter universe. Output: for each vertex, its resulting set of letters. Given a directed acyclic graph whose vertices each carry an allowed-letter set and a denied-letter set. A vertex's allow and deny information must flow through every descendant reachable from…
Checking your access…