Skip to content
DeepForgeby svx
All problems
MediumNLPnlp-226

Plan Validity

Problem

Check a plan given as [step_id, [dependencies]] pairs. The plan is valid when every dependency refers to an earlier step id.

Return True or False, and treat an empty plan as valid.

Hint

Collect executed step ids as you scan forward and check each dependency against them.

Test cases

case 1
in: [[["a",[]],["b",["a"]]]]
expected: true
case 2
in: [[["a",["b"]],["b",[]]]]
expected: false
case 3
in: [[["a",["a"]]]]
expected: false
case 4
in: [[]]
expected: true
Starter codePython
def plan_validity(steps):
    # Your code here
    pass

4 test cases · run your code against them in the editor