GFG | Not a subset sum | Greedy | Java | Hindi

In this video, we understand the intuition behind the classic Greedy problem: Find the smallest positive integer that cannot be represented using the sum of any subset of the array.