Python
Python Basics
- Introduction to Python and Its History
- Python Syntax and Indentation
- Python Variables and Data Types
- Dynamic and Strong Typing
- Comments and Docstrings
- Taking User Input (input())
- Printing Output (print())
- Python Operators (Arithmetic, Logical, Comparison)
- Type Conversion and Casting
- Escape Characters and Raw Strings
Data Structures in Python
- Lists
- Dictionaries
- Dictionary Comprehensions
- Strings and String Manipulation
- Tuples
- Python Sets: Unordered Collections
- List Comprehensions and Generator Expressions
- Set Comprehensions
- String Formatting
- Indexing and Slicing
Control Flow and Loops
- Conditional Statements: if, elif, and else
- Loops and Iteration
- While Loops
- Nested Loops
- Loop Control Statements
- Iterators and Iterables
- List, Dictionary, and Set Iterations
Functions and Scope
- Defining and Calling Functions (`def`)
- Function Arguments (`*args`, `**kwargs`)
- Default Arguments and Keyword Arguments
- Lambda Functions
- Global and Local Scope
- Function Return Values
- Recursion in Python
Object-Oriented Programming (OOP)
- Object-Oriented Programming
- Classes and Objects
- the `__init__()` Constructor
- Instance Variables and Methods
- Class Variables and `@classmethod`
- Encapsulation and Data Hiding
- Inheritance and Subclasses
- Method Overriding and super()
- Polymorphism
- Magic Methods and Operator Overloading
- Static Methods
- Abstract Classes and Interfaces
Python Programs
- Array : Find median in an integer array
- Array : Find middle element in an integer array
- Array : Find out the duplicate in an array
- Array : Find print all subsets in an integer array
- Program : Array : Finding missing number between from 1 to n
- Array : Gap and Island problem
- Python Program stock max profit
- Reverse words in Python
- Python array duplicate program
- Coin change problem in python
- Python Write fibonacci series program
- Array : find all the pairs whose sum is equal to a given number
- Find smallest and largest number in array
- Iterate collections
- List comprehensions
- Program: Calculate Pi in Python
- String Formatting in Python
Find print all subsets in an integer array
In this article, we explore how to find and print all possible subsets of an integer array using the backtracking technique in Python. Subsets are combinations of elements from the array that can be empty, contain a single element, or consist of multiple elements. We will implement a recursive backtracking function to generate these subsets efficiently. By following this approach, we can systematically explore all possible combinations and print them as output. Understanding how to find subsets of an array is essential for various problem-solving scenarios in computer science and data analysis.
def print_all_subsets(arr, target):n = len(arr)
# Create a 2D table to store the subset sumsdp = [[False] * (target + 1) for _ in range(n + 1)]
# Initialize the first column as True (sum of 0 is possible)for i in range(n + 1):dp[i][0] = True
# Fill the table bottom-upfor i in range(1, n + 1):
for j in range(1, target + 1):
if j < arr[i - 1]:dp[i][j] = dp[i - 1][j]else:dp[i][j] = dp[i - 1][j] or dp[i - 1][j - arr[i - 1]]
# Traverse the last row to find subsets with the target sumsubsets = []def backtrack(i, current_sum, current_subset):
if i == 0 and current_sum == 0:subsets.append(current_subset)returnif i == 0 or current_sum < 0 or not dp[i][current_sum]:return
# Exclude the current elementbacktrack(i - 1, current_sum, current_subset)
# Include the current elementbacktrack(i - 1, current_sum - arr[i - 1], [arr[i - 1]] + current_subset)
backtrack(n, target, [])
return subsetsusage
arr = [2, 4, 6, 3, 8, 5]target = 10result = print_all_subsets(arr, target)for subset in result:print(subset)#Output
[4, 6][2, 8][2, 3, 5]