Maximum money|Coding Problem
Given a street of N houses (a row of houses), each house having K amount of money kept inside; now there is a thief who is going to steal this money but he has a constraint/rule that he cannot steal/rob two adjacent houses. Find the maximum money he can rob.
N = 5 , K = 10
The Robber can rob from the first, third
and fifth houses which will result in 30.
N = 2 , K = 12
The Robber can only rob from the first
or second which will result in 12.
You don’t need to read input or print anything. Your task is to complete the function maximizeMoney() which takes 2 Integers N and K as input and returns the answer.
Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)
1 <= N,K <= 103
Code & Algorithm
/* author : @akash */#include<bits/stdc++.h>
using namespace std;#define ll long long int
#define pb push_back
#define mod 1000000007
#define ld long doubleclass Solution
}// time complexity : T(n)=O(1)
// space compexity : S(n)=O(1)