**Question:**\nhttps://leetcode.com/problems/house-robber/ except you need to return indices contributing to the maximum sum and not the maximum sum itself.\n\n**Example 1:**\n```\nInput: [4, 0, 11, 3]\nOutput: [0, 2]\nExplanation: Max sum is 4 + 11 = 15.\n```\n\n**Example 2:**\n```\nInput: [2, 7, 9, 3, 1]\nOutput: [0, 2, 4]\nExplanation: Max sum is 2 + 9 + 1 = 12.\n```\n\nI solved it by using a dictionary and using running sum as the key and contributing indices as values. It did not seem like an efficient approach. I\'m wondering if others have better ideas.\n\nLooking forward to see what others ideas are

Question:\nhttps://leetcode.com/problems/house-robber/ except you need to return indices contributing to the maximum sum and not the maximum sum itself.\n\nExam