Subarray, Subsequence and Subsets in Python
Last Updated :
30 Apr, 2025
Algorithms and data manipulation are areas where it is important to grasp the ideas behind subarrays, subsequences as well as subsets. This article introduces the concepts of subarrays, subsequences along with subsets in Python. You will find out what these terms actually mean and how they differ from one another in Python. Such an ability will help you solve many coding problems that involve arrays, sequences, as well as set manipulations.
What is Subarray?
An array is a collection of values stored in a continuous block of memory. A subarray is a portion of that array, also stored continuously. In other words, a subarray is any consecutive part of the original array.
Example:
Input: arr = [1, 2, 3]
Output: [[1], [1,2], [1, 2, 3], [2], [2,3], [3]]
Input: arr = [2, 5, 7, 6]
Output: [[2], [2, 5], [2,5,7], [2,5,7,6], [5], [5, 7], [5,7,6], [7], [7, 6], [6]]
Approach:
Iterating over all possible starting and ending indices of subarrays within the given array. For each combination of start and end indices, extracts the corresponding subarray from the original array and adds it to a result list.
Here's a step-by-step breakdown of the approach:
- Initialize variables, n: Length of the input array, result: An empty list to store the subarrays.
- Use a for loop to iterate over all indices i from 0 to n-1. This loop determines the starting point of each subarray.
- For each start index i, use another for loop to iterate over all indices j from i+1 to n. This loop determines the ending point of each subarray, ensuring that the subarray starts at i and ends at j.
- Use array slicing arr[i:j] to extract the subarray from the original array.
- Append the extracted subarray to the result list.
- After iterating over all possible start and end indices, return the result list containing all the subarrays of the input array.
Below is the implementation of the above approach:
Python
a = [1, 2, 3]
n = len(a)
res = []
for i in range(n):
for j in range(i + 1, n + 1):
res.append(a[i:j])
print(res)
Output[[1], [1, 2], [1, 2, 3], [2], [2, 3], [3]]
Explanation: Outer loop sets the start index i and the inner loop sets the end index j. For each pair of indices, it slices the array a[i:j] to create a subarray, which is then added to the res list.
What is Subsequence ?
A subsequence is different from a subarray. While a subarray is a contiguous portion of an array, a subsequence is a sequence of elements from the array that may or may not be consecutive. In other words, a subsequence can be formed by selecting certain elements from the array, in the same order as they appear in the original array, but the selected elements don't have to be next to each other.
Example:
Input: arr = [1, 2, 3] Output: [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
Input: arr = [2,4,5,1]
Output: [] [2] [4] [5] [1] [2,4] [2,5] [2,1] [4,5] [4,1] [5,1] [2,4,5] [2,4,1] [2,5,1] [4,5,1] [2,4,5,1]
Approach:
The idea is to building up the set of subsequences incrementally. It starts with an empty subsequence and then iteratively adds each element of the input array to all existing subsequences.
Here's a step-by-step breakdown of the approach:
- Create a list result and initialize it with an empty list []. This represents the empty subsequence, which is always a subsequence of any array.
- Use a for loop to iterate over each element arr[i] in the input array.
- Inside the loop, use a list comprehension to generate new subsequences by adding the current element arr[i] to each existing subsequence in result.
- The expression [sub + [arr[i]] for sub in result] iterates over the current result list and creates a new subsequence by appending arr[i] to each existing subsequence sub.
- The resulting list of new subsequences is then added to the result list using the += operator.
- After iterating over all elements, the result list contains all possible subsequences of the input array. Return this list.
Below is the implementation of the above approach:
Python
a = [1, 2, 3]
res = [[]]
for x in a:
res += [s + [x] for s in res]
print(res)
Output[[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
Explanation: This code generates all subsequences of a by iterating over each element x and adding it to all existing subsequences in res, then appending the new subsequences to res.
What is Subset ?
A subset is a collection of elements that are part of a larger set or array. Unlike a subarray, which must be a contiguous sequence of elements from the original array, a subset can contain any combination of elements from the original array, in any order.
Example:
Input: arr = [1, 2, 3]
Output: [[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
Input: arr = [2,4,5,1]
Output: [] [2] [4] [5] [1] [2,4] [2,5] [2,1] [4,5] [4,1] [5,1] [2,4,5] [2,4,1] [2,5,1] [4,5,1] [2,4,5,1]
Approach:
The idea is to building up the set of subsets incrementally. It starts with the empty set and then iteratively adds each element of the input set to all existing subsets.
Here's a step-by-step breakdown of the approach:
- Create a list result and initialize it with an empty list []. This represents the empty set, which is always a subset of any set.
- Use a for loop to iterate over each element elem in the input set.
- Inside the loop, use a list comprehension to generate new subsets by adding the current element elem to each existing subset in result.
- The expression [sub + [elem] for sub in result] iterates over the current result list and creates a new subset by appending elem to each existing subset sub.
- The resulting list of new subsets is then added to the result list using the += operator.
- After iterating over all elements, the result list contains all possible subsets of the input set. Return this list.
Below is the implementation of the above approach:
Python
a = [1, 2, 3]
res = [[]]
for x in a:
res += [s + [x] for s in res]
print(res)
Output[[], [1], [2], [1, 2], [3], [1, 3], [2, 3], [1, 2, 3]]
Explanation: This code iterates over each element x in a and adds x to all existing subsets in res. It then appends the new subsets to res. The result is a list of all subsets of a, including the empty subset and the full set.
Difference Between Subarray, Subsequence and Subsets
Let's explore the difference between these three terms subarray, subsequence and subsets, often used in array and set problems, but each with its own unique rules.
Feature | Subarray | Subsequence | Subsets |
---|
Definition | Contiguous elements within an array | Elements arranged in order, not necessarily adjacent | Collection of elements from a set, possibly unordered |
---|
Example | [1, 2, 3] has subarrays [1], [1, 2], [2, 3], [1, 2, 3], etc. | [1, 3] is a subsequence of [1, 2, 3] | {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3} |
---|
Length | Length is variable, depending on array size and position | Length can be shorter, equal to, or longer than original sequence | Length varies from 0 to original set size |
---|
Position | Must be contiguous within the original array | Elements may not be adjacent, but order must be maintained | Any combination of elements from the original set |
---|
Use Cases | Often used in algorithms such as Kadane's algorithm | Useful in problems involving sequences or strings | Commonly used in combinatorial problems and optimization algorithms |
---|
Complexity | Typically computed in linear time | Often requires dynamic programming for efficient computation | Computation complexity can be exponential |
---|
Related Article:
Similar Reads
Python Tutorial | Learn Python Programming Language
Python Tutorial â Python is one of the most popular programming languages. Itâs simple to use, packed with features and supported by a wide range of libraries and frameworks. Its clean syntax makes it beginner-friendly.Python is:A high-level language, used in web development, data science, automatio
10 min read
DSA Tutorial - Learn Data Structures and Algorithms
DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
7 min read
Non-linear Components
In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
Quick Sort
QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s
12 min read
Merge Sort - Data Structure and Algorithms Tutorials
Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge
14 min read
Bubble Sort Algorithm
Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir
8 min read
Breadth First Search or BFS for a Graph
Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta
15+ min read
Data Structures Tutorial
Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st
2 min read
Binary Search Algorithm - Iterative and Recursive Implementation
Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc
15 min read
Insertion Sort Algorithm
Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T
9 min read