Sorted subsequence of size 3 in linear time using constant space
Last Updated :
18 Sep, 2023
Given an array, the task is to find three elements of this array such that they are in sorted form i.e. for any three elements a[i], a[j] and a[k], they follow this relationship: a[i] < a[j] < a[k] where i < j < k. This problem must be solved using constant space or no extra space.
This problem is already solved in linear time using linear space: Find a sorted sub-sequence of size 3 in Linear Time
Examples:
Input: arr[] = {12, 11, 10, 5, 2, 6, 30}
Output: 5 6 30
or 2 6 30
Explanation: Answer is 5, 6, 30 because 5 < 6 < 30
and they occur in this sequence in the array.
Input: arr[] = {5, 7, 4, 8}
Output: 5 7 8
Explanation: Answer is 5 ,7 ,8 because 5 < 7 < 8
and they occur in the same sequence in the array
Solution: The objective is to find three elements a, b, and c such that a < b < c, and the elements must occur in the same sequence in the array.
Approach: The problem deals with finding three elements a, b, c where a < b < c and they must appear in the same order as in the array. So the intuition at any step must be followed as such. One of the variable (small) should store the smallest element of the array, and the second variable large will be assigned a value when there is already a smaller value present in the (small) variable. This will lead to the formation of a pair of two variables which will form the first two elements of the required sequence. Similarly, if another value can be found in the array that is assigned when the first two variables are already assigned and has a smaller value than the present element the search for the third value would be complete. This completes the triplet a, b and c such that a < b < c, in similar sequence to the array.
Algorithm
- Create three variables, small- Stores the smallest element,large- stores the second element of the sequence, i- loop counter
- Move along the input array from start till end.
- If the present element is smaller than or equal to variable small, update the variable.
- Else if the present element is smaller than or equal to variable large, update the variable. So here we get a pair (small, large) at this instant, where small < large and they occur in the required sequence.
- Else if the previous two cases fail to match, break the loop as we have got a pair where the present element is greater than both variables small and large. Store the index in variable i.
- If the break statement has not been encountered then it is guaranteed that no such triplet exists.
- Else there is a triplet satisfies the criteria but the variable small might have been updated to a new smaller value.
- So Traverse the array from start to index i.
- Re-assign the variable small to any element less than large, it is guaranteed that there exists one.
- Print the values small, large and ith array element
Implementation:
C++
// C/C++ program to find a sorted sub-sequence of
// size 3 using constant space
#include <bits/stdc++.h>
using namespace std;
// A function to fund a sorted sub-sequence of size 3
void find3Numbers(int arr[], int n)
{
// Initializing small and large(second smaller)
// by INT_MAX
int small = INT_MAX, large = INT_MAX;
int i;
for (i = 0; i < n; i++)
{
// Update small for smallest value of array
if (arr[i] <= small)
small = arr[i];
// Update large for second smallest value of
// array after occurrence of small
else if (arr[i] <= large)
large = arr[i];
// If we reach here, we found 3 numbers in
// increasing order : small, large and arr[i]
else
break;
}
if (i == n)
{
printf("No such triplet found");
return;
}
// last and second last will be same, but first
// element can be updated retrieving first element
// by looping upto i
for (int j = 0; j <= i; j++)
{
if (arr[j] < large)
{
small = arr[j];
break;
}
}
printf("%d %d %d", small, large, arr[i]);
return;
}
// Driver program to test above function
int main()
{
int arr[] = {5, 7, 4, 8};
int n = sizeof(arr)/sizeof(arr[0]);
find3Numbers(arr, n);
return 0;
}
// Java program to find a sorted subsequence of
// size 3 using constant space
class GFG
{
// A function to fund a sorted subsequence of size 3
static void find3Numbers(int arr[], int n)
{
// Initializing small and large(second smaller)
// by INT_MAX
int small = +2147483647, large = +2147483647;
int i;
for (i = 0; i < n; i++)
{
// Update small for smallest value of array
if (arr[i] <= small)
small = arr[i];
// Update large for second smallest value of
// array after occurrence of small
else if (arr[i] <= large)
large = arr[i];
// If we reach here, we found 3 numbers in
// increasing order : small, large and arr[i]
else
break;
}
if (i == n)
{
System.out.print("No such triplet found");
return;
}
// last and second last will be same, but first
// element can be updated retrieving first element
// by looping upto i
for (int j = 0; j <= i; j++)
{
if (arr[j] < large)
{
small = arr[j];
break;
}
}
System.out.print(small+" "+large+" "+arr[i]);
return;
}
// Driver program
public static void main(String arg[])
{
int arr[] = {5, 7, 4, 8};
int n = arr.length;
find3Numbers(arr, n);
}
}
// This code is contributed by Anant Agarwal.
# Python3 program to find a sorted subsequence
# of size 3 using constant space
# Function to fund a sorted subsequence of size 3
def find3Numbers(arr, n):
# Initializing small and large(second smaller)
# by INT_MAX
small = +2147483647
large = +2147483647
for i in range(n):
# Update small for smallest value of array
if (arr[i] <= small):
small = arr[i]
# Update large for second smallest value of
# array after occurrence of small
elif (arr[i] <= large):
large = arr[i]
# If we reach here, we found 3 numbers in
# increasing order : small, large and arr[i]
else:
break
if (i == n):
print("No such triplet found")
return
# last and second last will be same, but
# first element can be updated retrieving
# first element by looping upto i
for j in range(i + 1):
if (arr[j] < large):
small = arr[j]
break
print(small," ",large," ",arr[i])
return
# Driver program
arr= [5, 7, 4, 8]
n = len(arr)
find3Numbers(arr, n)
# This code is contributed by Anant Agarwal.
// C# program to find a sorted sub-sequence of
// size 3 using constant space
using System;
class GFG {
// A function to fund a sorted sub-sequence
// of size 3
static void find3Numbers(int []arr, int n)
{
// Initializing small and large(second smaller)
// by INT_MAX
int small = +2147483647, large = +2147483647;
int i;
for (i = 0; i < n; i++)
{
// Update small for smallest value of array
if (arr[i] <= small)
small = arr[i];
// Update large for second smallest value of
// array after occurrence of small
else if (arr[i] <= large)
large = arr[i];
// If we reach here, we found 3 numbers in
// increasing order : small, large and arr[i]
else
break;
}
if (i == n)
{
Console.Write("No such triplet found");
return;
}
// last and second last will be same, but first
// element can be updated retrieving first element
// by looping upto i
for (int j = 0; j <= i; j++)
{
if (arr[j] < large)
{
small = arr[j];
break;
}
}
Console.Write(small + " " + large + " " + arr[i]);
return;
}
// Driver program
public static void Main()
{
int []arr = {5, 7, 4, 8};
int n = arr.Length;
find3Numbers(arr, n);
}
}
<br>
// This code is contributed by nitin mittal
<?php
// PHP program to find a sorted
// subsequence of size 3 using
// constant space
// A function to fund a sorted
// subsequence of size 3
function find3Numbers($arr, $n)
{
// Initializing small and
// large(second smaller)
// by INT_MAX
$small = PHP_INT_MAX;
$large = PHP_INT_MAX;
$i;
for($i = 0; $i < $n; $i++)
{
// Update small for smallest
// value of array
if ($arr[$i] <= $small)
$small = $arr[$i];
// Update large for second
// smallest value of after
// occurrence of small
else if ($arr[$i] <= $large)
$large = $arr[$i];
// If we reach here, we
// found 3 numbers in
// increasing order :
// small, large and arr[i]
else
break;
}
if ($i == $n)
{
echo "No such triplet found";
return;
}
// last and second last will
// be same, but first
// element can be updated
// retrieving first element
// by looping upto i
for($j = 0; $j <= $i; $j++)
{
if ($arr[$j] < $large)
{
$small = $arr[$j];
break;
}
}
echo $small," ", $large," ", $arr[$i];
return;
}
// Driver Code
$arr = array(5, 7, 4, 8);
$n = count($arr);
find3Numbers($arr, $n);
// This code is contributed by anuj_67.
?>
<script>
// JavaScript program to find a
// sorted sub-sequence of
// size 3 using constant space
// A function to fund a sorted sub-sequence
// of size 3
function find3Numbers(arr, n)
{
// Initializing small and large(second smaller)
// by INT_MAX
let small = +2147483647, large = +2147483647;
let i;
for (i = 0; i < n; i++)
{
// Update small for smallest value of array
if (arr[i] <= small)
small = arr[i];
// Update large for second smallest value of
// array after occurrence of small
else if (arr[i] <= large)
large = arr[i];
// If we reach here, we found 3 numbers in
// increasing order : small, large and arr[i]
else
break;
}
if (i == n)
{
document.write("No such triplet found");
return;
}
// last and second last will be same, but first
// element can be updated retrieving first element
// by looping upto i
for (let j = 0; j <= i; j++)
{
if (arr[j] < large)
{
small = arr[j];
break;
}
}
document.write(small + " " + large + " " + arr[i]);
return;
}
let arr = [5, 7, 4, 8];
let n = arr.length;
find3Numbers(arr, n);
</script>
Complexity Analysis:
- Time Complexity: O(n).
As the array is traversed only twice, the time complexity is O(2*n) which is equal to O(n). - Space Complexity: O(1).
Since only three elements are stored, the space complexity is constant or O(1).
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