PhonePe SDE-1 OA 2025 | Maximum Cookie Revenue & Magical Labyrinths

Problem 1 - Maximum Cookie Revenue Problem Statement You are a girl scout trying to maximize your revenue by selling cookies in a neighborhood. There are N houses. Array P denotes the revenue obtainable from each house, where P[i] represents the amount earned from house i. You are also given M friendship relationships between residents. Each friendship acts as a bidirectional road connecting two houses. You may: Start at any house. End at any house. Stop your journey at any ...