Combination Sum III | Leetcode 216 | Backtracking | Array | Medium

Time Complexity: Recursion depth is k and at each level, we have 9 digits to choose from. O(k * 9^k) Space Complexity: Ignoring the result array, we used ArrayList of size k to store intermediate state O(k) Problem link: https://leetcode.com/problems/combination-sum-iii/ Java Code link: https://github.com/niteshnanda02/Leetcode/blob/master/216-combination-sum-iii/216-combination-sum-iii.java 𝗙𝗲𝗲𝗹 𝗳𝗿𝗲𝗲 𝘁𝗼 𝗰𝗼𝗺𝗺𝗲𝗻𝘁 𝗶𝗳 𝘆𝗼𝘂 𝗵𝗮𝘃𝗲 𝗮𝗻𝘆 𝗱𝗼𝘂𝗯𝘁𝘀 𝗮𝗯𝗼𝘂𝘁 𝘁𝗵𝗲 𝗰𝗼𝗱𝗲 𝗼𝗿 𝘁𝗵𝗲 𝗹𝗼𝗴𝗶𝗰!! 🔴Telegram group https://t.me/+ac96uKT3mow5ZWJl 🔴My contact details LinkedIn: https://www.linkedin.com/in/nitesh-nanda-2590a6172/ Twitter: https://twitter.com/Nitesh_Nanda_ Instagram: https://www.instagram.com/nitesh_nanda_/ #Backtracking #Array #Medium #ConsitencyChallenge #DataStructuresAndAlgorithms #Leetcode #NiteshNanda