[Java] Leetcode 343. Integer Break [DP Integer Partition #1]

[@priyAGUPTA-kr7wb]

amazing explanation

[@nitinsaxena1857]

Liked the explanation and mention of both approaches. Thanks

[@degea9]

For the second solution. Space complexity O(n) but I think Time Complexity will be O(n2) because for each number you need an additional loop from 1 to that number

[@vasanthanv6143]

Nice explanation , thanks

[@EricProgramming]

You are welcome

[@keerthivasan138]

@@EricProgramming Sir Is There Any other important pattern of dp for coding interviews

[@keerthivasan138]

@@EricProgramming Sir pls Can you make video on greedy type questions

[@priyAGUPTA-kr7wb]

why we have taken private method plz explain ?

[@light-water]

Why is this exactly what I’m doing, and my name is also Eric. Uncanny