PracHub
QuestionsLearningGuidesInterview Prep

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.

  • medium
  • Snowflake
  • Coding & Algorithms
  • Software Engineer

Compute effective permissions on DAG and prune tree

Company: Snowflake

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: 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.

Last updated: Jul 9, 2026
Loading…
PracHub

Master your tech interviews with 8,500+ real questions from top companies.

Product

  • Questions
  • Learning Tracks
  • Interview Guides
  • Resources
  • Premium
  • For Universities

Browse

  • By Company
  • By Role
  • By Category
  • Topic Hubs
  • SQL Questions
  • AI Coding Questions
  • Compare Platforms
  • Discord Community

Support

  • support@prachub.com
  • (916) 541-4762

Legal

  • Privacy Policy
  • Terms of Service
  • About Us

© 2026 PracHub. All rights reserved.

Related Coding Questions

  • Find the Nearest Target Character and Support Streaming Updates - Snowflake (medium)
  • Sort an RGB Record Collection In Place - Snowflake (medium)
  • Implement a JSON Parser - Snowflake (hard)
  • Determine Whether an Undirected Graph Is 3-Colorable - Snowflake (medium)
  • Answer Repeated Lookup Queries Efficiently - Snowflake (medium)