Company: PhonePe
Difficulty: medium
The Secret Ninja Mission Coding UNSOLVED Problem Statement A ninja from the magical hidden leaf village embarks on a mission to cross the magical forest. Along his journey, there are magical trees with hidden scrolls that mark significant points for completing a secret mission. The ninja starts his journey on day - 0 from a magical tree at position 0 and the time he takes from one tree to another is known. Task You are given the length of the path n, the number of magical trees k, and the number of queries q. Additionally, you are provided with two arrays of size k: trees: Array containing the positions of the magical trees along the path. time: Array containing the number of days taken by the ninja to reach from (i-1)th to (i)th tree only. Your task is to determine the day the ninja reaches any given point along the path. Provide the day number rounded down to the floor in case of a fractional answer. The ninja moves at a constant speed between any two magical trees, but his speed can