Loading Company...
This is a verified interview question from Dream-11-sde. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Minimum Value of p" covers key patterns like Graphs.
"You are given an undirected and connected graph with n nodes. Intially you are at node 1, and need to travel to node n. There are power boosters at k nodes, and every time you arrive at a power booster node, your power is set to p, which allows you to walk cross p edges. What is the minimum value of p such that you can reach node n from node 1?"
Join thousands of developers practicing for Dream-11-sde.