← Questions
Count simple paths whose labels match a prefix
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Every node of a graph carries a label. Count the simple paths (paths that never repeat a node) whose sequence of labels matches a given prefix string. Explain how you prune the search and what the worst case costs.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding