gfg-potd
gfg-potd copied to clipboard
Update README.md
Another approach for the ones who are facing difficulty in understanding recursion. It simply uses nested for loops to solve the problem in O(n^3) time complexity and O(1) space complexity.