Company: Walmart_12march
Difficulty: medium
Collect Magical Flowers Problem Description You are given a square grid of size N x N that represents a magical garden. Each cell in the grid contains a unique number of magical flowers. Your journey starts at the top-left corner of the grid (position (0,0)) and your destination is the bottom-right corner (position (N-1, N-1)). At each step, you can move only to the right or downward, following the paths laid out in the garden. Your task is to collect exactly K magical flowers during your journey. This means that when you add up the numbers of magical flowers from the cells you pass through, the total must equal exactly K. For each path you find that meets this requirement, you should output the message: Path found: followed by the sequence of cell values that make up the path you took. If there is no possible path from the start to the destination that results in a total of exactly K magical flowers, then you should output: No path found! Your challenge is to explore all possible path