LinkedIn

Solved Subset Sum Problem with Recursion and Memoization

Day 123 of GFG 160 : Problem Solved: Subset Sum Problem (Medium) Approach-The code uses recursion with memoization(top-down) to determine if there exists a subset of the array whose sum equals the ...
LinkedIn

Solved Subsets II problem with recursion and backtracking

🚀 Day 28 of my DSA Journey 🚀 Today I solved an important recursion + backtracking problem: 🔹 Problem: Subsets II (LeetCode – 90) 🔹 Category: Recursion / Backtracking 📌 Problem Statement: Given an ...
GitHub

Subset Sum : Sum of all Subsets.py

#Problem Statement: Given an array print all the sum of the subset generated from it, in the increasing order. # Time Complexity: 2^n Subsets for every n and doing sum => O(n.2^n) + Sorting ...
GitHub

Subset_Sum_1.cpp

// "Given an array of integers, we need to find the sum of all possible subsets (including the empty subset)." // This is a powerset problem, but instead of printing all subsets, we’re only interested ...