×
Home Discussions Write at Opengenus IQ
×
  • DSA Cheatsheet
  • HOME
  • Track your progress
  • Deep Learning (FREE)
  • Join our Internship 🎓
  • RANDOM
  • One Liner

Subset Sum problem

A collection of 3 posts

Algorithms

Subset Sum Problem using Dynamic Programming 【O(N*sum) time complexity】

In this article, we will solve this using a dynamic programming approach which will take O(N * sum) time complexity which is significantly faster than the other approaches which take exponential time.

Kyatham Srikanth Kyatham Srikanth
Algorithms

Subset Sum Problem solved using Backtracking approach 【O(2^N) time complexity】

In this article, we will solve Subset Sum problem using a backtracking approach which will take O(2^N) time complexity

OpenGenus Tech Review Team OpenGenus Tech Review Team
Algorithms

Subset sum problem solved using a recursive brute force approach 【O(2^N) time complexity】

In this article, we will solve Subset Sum problem using a recursive approach where the key idea is to generate all subset recursively. It will take O(2^N) time complexity.

OpenGenus Tech Review Team OpenGenus Tech Review Team
OpenGenus IQ © 2025 All rights reserved ™
Contact - Email: team@opengenus.org
Primary Address: JR Shinjuku Miraina Tower, Tokyo, Shinjuku 160-0022, JP
Office #2: Commercial Complex D4, Delhi, Delhi 110017, IN
Top Posts LinkedIn Twitter
Android App
Apply for Internship