Quick Overview

This set of problems evaluates proficiency in graph and tree algorithms, specifically transitive state propagation and conflict resolution on a DAG (effective allow/deny sets) and subtree deletion and selection under depth constraints in rooted trees.

Compute effective permissions on DAG and prune tree

Company: Snowflake

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Overview: This set of problems evaluates proficiency in graph and tree algorithms, specifically transitive state propagation and conflict resolution on a DAG (effective allow/deny sets) and subtree deletion and selection under depth constraints in rooted trees.

Loading…