House Robber | LeetCode 198 | DP | O(n²) to O(n) | C++

In this video, I solve LeetCode 198 – House Robber using Dynamic Programming in C++. I first explain the problem, then build the solution step by step: • O(n²) Dynamic Programming approach • Optimized O(n) Dynamic Programming approach ⏱️ Timestamps: 00:00 – Problem Statement 01:55 – Explanation 14:48 – O(n²) Code 20:10 – O(n) Code 🔹 Problem: House Robber 🔹 LeetCode: #198 🔹 Topic: Dynamic Programming 🔹 Language: C++ 🔹 Approaches: O(n²) and O(n)