Subarray, Subsequence and Subsets in Python
Last Updated :
23 Jul, 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
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem