In a village, people build houses in the same side of the road. A thief plans to loot the village. He wants maximum amount of money without having any risk of getting caught. By some means, the villagers know that their adjacent house is being looted or not and thus they become alert. So the thief cannot loot contiguous two houses. Given that the thief knows the amount of money stored in each house and the road is straight and there is no turning, which is the most efficient algorithmic strategy to solve this problem?Brute-forceDynamic ProgrammingBacktrackingDivide and Conquer

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police. Example 1:Input: nums = [1,2,3,1]Output: 4Explanation: Rob house 1 (money = 1) and then rob house 3 (money = 3).Total amount you can rob = 1 + 3 = 4.

Fractional knapsack problem is solved most efficiently by which of the following algorithm?Question 4Answera.Backtrackingb.Greedy algorithmc.Dynamic programmingd.Divide and conquer

Divide and Conquer Method vs Dynamic Programming

Which of the following is a Divide and Conquer algorithm?

Which is the most straightforward approach for planning algorithm?