Bird\'s Nest Building

Problem Statement

Bird\'s Nest Building You are helping the bird build its nest. You are given an array forest , containing positive integers and zeros, and a non-negative integer bird , representing the bird\'s initial position. Each positive integer within the forest is considered to be a stick, where forest[i] represents the length of the i th stick. Each zero within forest[i] represents that this place is empty. Initially, the bird is located at forest[bird] , which is guaranteed to be zero. The bird builds its nest, following the algorithm: The bird flies to the right until it finds a stick; Input Format An array forest containing positive integers (sticks) and zeros (empty spaces) An integer bird representing the initial position of the bird Constraints 1 ≤ forest.length ≤ 10 5 0 ≤ forest[i] ≤ 10 5 0 ≤ bird forest[bird] = 0 Example Input: forest = [0, 2, 0, 3, 0, 0, 1] bird = 0 Output: [To be determined based on complete problem statement] The bird starts at position 0 and flies right until it fin