I usually don't post pre-prints, but I'm excited about our newest paper. "Optimal Lottery Tickets via SubsetSum: Logarithmic Over-Parameterization is Sufficient". Joint work with an incredible group of Wisc students. cc'ing @shashank_r12 @AlliotNagle

🎯 Day 123 #GFG160 — Subset Sum (Space Optimized). Solved: Check if any subset sums to a target.✔ Used 2 rolling DP arrays (prev/curr).✔ Bottom-up + boolean OR logic.✔ O(n×sum) time, O(sum) space. @geeksforgeeks.#GeekStreak2025 #DSA #Python #SubsetSum

🚀 Day 26 of #100DaysOfCode: Solved the problem of counting subsets with sum K! 🎯🔢 Utilized dynamic programming techniques for optimization:.- Recursion: TC: 2^n, SC: N.- Memoization: TC: n * sum, SC: n * sum.💡💪 #DynamicProgramming #SubsetSum #CodingJourney 🌟🔑

CODING CLASS Scheduled On….30th April 2022 @ 01:00 PM – 04:00 PM. #codingclass.#coding.#knapsackTopDown.#SubsetSum.#EqualSum.#UnboundKnapsack.#DronacharyaGroupOfInstitutions.#bestengineeringcollegeindelhincr.#topplacementcollegeindelhincr.#CampusPlacement.#multipleplacement

subsetsum problem, how to ask for the nearest number to a double-number from the read-array

🎯 Day 123 – #gfg160.📍 Subset Sum Problem.💡 Problem:.Given an array arr[] and an integer sum, determine if there's a subset whose elements add up exactly to sum. #SubsetSum #DynamicProgramming #RecursionMemoization #JavaDSA #gfg167 #160DaysOfCode #geekstreak2025

🚀 Day 23 of #100DaysOfCode: Solved the moderate-level Subset Sum Equal To K problem! 🎯🔢 .- Recursion: TC: 2^n, SC: n.- Memoization: TC: n * target, SC: (n * target) + n.- Tabulation: TC: n * target, SC: n * target.#DynamicProgramming #SubsetSum #CodingJourney

SubsetSumに線形時間の乱択アルゴリズムが見つかったみたいな論文が回ってきて、P=NP問題のビッグニュースか！と思ったけどよく読んだら擬似多項式だった.

Day 123/160 @geeksforgeeks .Solved 'Subset Sum Problem' .Used dynamic programming to explore all possible subset combinations — solving the sum puzzle efficiently!.#GfG160 #gfg160 #GFG #geekstreak2025 #geeksforgeeks #DSA #DynamicProgramming #SubsetSum #ProblemSolving #Consistency

Day 124/160 @geeksforgeeks .Solved 'Partition Equal Subset Sum' .Applied DP to determine if an array can be split into two equal-sum subsets — balanced logic, balanced arrays!.#GfG160 #gfg160 #geekstreak2025 #geeksforgeeks #DSA #DynamicProgramming #SubsetSum #ProblemSolving

day 304.subsetsum.#scalerdiscord

Finding the best possible subset combinations of numbers to reach a given sum or closest to it #algorithm #dynamicprogramming #javascript #math #subsetsum

How does this algorthim for finding all subset sums of a certain size work? #dynamicprogramming #subsetsum #python #algorithm

Implementation of subset sum problem is giving wrong answer #datastructures #algorithm #python #subsetsum #subset

Given a list of n integers , find the minimum subset sum greater than X #arrays #algorithm #subsetsum #subset #dynamicprogramming

Day 144- Daily Problem Solving 🔹 #gfg160 Day 144: Subset Sum Problem #CodingChallenge #160DaysOfCode #DynamicProgramming #SubsetSum #Algorithms #geekstreak2024.@geeksforgeeks

🔍 Subset Sum in Java: 3 Approaches!. 1️⃣ Iterative (Bit Manipulation).2️⃣ Recursive Backtracking.3️⃣ Recursion with Memoization.Efficient ways to find subsets with a given sum!.#Java #SubsetSum #Recursion #BitManipulation #Memoization #DSA #Algorithms #Coding

🚀 Day [123] of #gfg160dayschallenge @geeksforgeeks .🏆 Today's Problem: Subset Sum Problem.💡 Key Takeaway: Use Dynamic Programming (DP) to check if a subset exists with the given sum. This problem is a classic 0/1 Knapsack variation. #DSA #DP #SubsetSum #Knapsack

Day 123 ✅ | #gfg160 Challenge @geeksforgeeks.🧩 Solved: Subset Sum Problem.🎯 Objective: Given an array & a target sum, determine if any subset of the array sums to the target. 💡Used Bottom-Up Dynamic Programming. #Python #DP #SubsetSum #100DaysOfCode #GeekStreak2025