Propagate Task Filtering Through Ancestors

Read the full interview experience this question came from →

Quick Overview

Design hierarchical task filtering so a directly removed ancestor also removes every descendant, even when records arrive out of order. The solution uses indexed memoized traversal, proves propagation through arbitrary depth, and covers stable output, linear complexity, missing parents, cycles, and regression tests.

Propagate Task Filtering Through Ancestors

Company: Rippling

Role: Software Engineer

Category: Software Engineering Fundamentals

Difficulty: hard

Interview Round: Technical Screen

Overview: Design hierarchical task filtering so a directly removed ancestor also removes every descendant, even when records arrive out of order. The solution uses indexed memoized traversal, proves propagation through arbitrary depth, and covers stable output, linear complexity, missing parents, cycles, and regression tests.

Read the full Rippling Software Engineer interview experience this question came from

Rippling logo
Rippling
Aug 17, 2026
hardSoftware EngineerTechnical ScreenSoftware Engineering Fundamentals
35
0
Loading...