solved on 15/10/23

Priyanshu-Ganatra · Priyanshu-Ganatra · commit 6055e68c7b7f · 2023-10-21T22:28:00.000+05:30
diff --git a/LC_55_HouseRobber.cpp b/LC_55_HouseRobber.cpp
@@ -20,6 +20,7 @@ int solve(vector<int> &nums, int n, int idx)
 }
 
 // recursive solution, gives TLE on leetcode. we'll use DP to optimize it in future
+// tc: O(2^n) sc: O(n)
 int rob(vector<int> &nums)
 {
     int n = nums.size();

Original file line number	Diff line number	Diff line change
`@@ -20,6 +20,7 @@ int solve(vector<int> &nums, int n, int idx)`
`20`	`20`	`}`
`21`	`21`
`22`	`22`	`// recursive solution, gives TLE on leetcode. we'll use DP to optimize it in future`
	`23`	`+// tc: O(2^n) sc: O(n)`
`23`	`24`	`int rob(vector<int> &nums)`
`24`	`25`	`{`
`25`	`26`	`int n = nums.size();`