Given an array arr[] of size n, the task is to find all the Leaders in the array. An element is a Leader if it is greater than or equal to all the elements to its right side.
Note: The rightmost element is always a leader.
Examples:
Input: arr[] = [16, 17, 4, 3, 5, 2]
Output: [17 5 2]
Explanation: 17 is greater than all the elements to its right i.e., [4, 3, 5, 2], therefore 17 is a leader. 5 is greater than all the elements to its right i.e., [2], therefore 5 is a leader. 2 has no element to its right, therefore 2 is a leader.
Input: arr[] = [1, 2, 3, 4, 5, 2]
Output: [5 2]
Explanation: 5 is greater than all the elements to its right i.e., [2], therefore 5 is a leader. 2 has no element to its right, therefore 2 is a leader.
[Naive Approach] Using Nested Loops - O(n^2) Time and O(1) Space:
Use two loops. The outer loop runs from 0 to size - 1 and one by one pick all elements from left to right. The inner loop compares the picked element to all the elements on its right side. If the picked element is greater than all the elements to its right side, then the picked element is the leader.
C++
#include <bits/stdc++.h>
using namespace std;
// Function to find the leaders in an array
vector<int> leaders(vector<int>& arr) {
vector<int> res;
int n = arr.size();
for (int i = 0; i < n; i++) {
int j;
// Check elements to the right
// of the current element
for (j = i + 1; j < n; j++) {
// If a larger element is found,
// break the loop
if (arr[i] < arr[j])
break;
}
// If no larger element was found,
// the current element is a leader
if (j == n)
res.push_back(arr[i]);
}
return res;
}
int main() {
vector<int> arr = { 16, 17, 4, 3, 5, 2 };
vector<int> result = leaders(arr);
for (int res : result) {
cout << res << " ";
}
cout << endl;
return 0;
}
#include <stdio.h>
#include <stdlib.h>
// Function to find the leaders in an array
int* leaders(int arr[], int n, int* resSize) {
int* result = (int*)malloc(n * sizeof(int));
int count = 0;
for (int i = 0; i < n; i++) {
int j;
// Check elements to the right
for (j = i + 1; j < n; j++) {
// If a larger element is found
if (arr[i] < arr[j])
break;
}
// If no larger element was found
if (j == n)
result[count++] = arr[i];
}
*resSize = count;
return result;
}
int main() {
int arr[] = { 16, 17, 4, 3, 5, 2 };
int n = sizeof(arr) / sizeof(arr[0]);
int resSize;
int* result = leaders(arr, n, &resSize);
for (int i = 0; i < resSize; i++) {
printf("%d ", result[i]);
}
printf("\n");
free(result);
return 0;
}
import java.util.ArrayList;
class GfG {
// Function to find the leaders in an array
static ArrayList<Integer> leaders(int[] arr) {
ArrayList<Integer> result = new ArrayList<>();
int n = arr.length;
for (int i = 0; i < n; i++) {
int j;
// Check elements to the right
for (j = i + 1; j < n; j++) {
// If a larger element is found
if (arr[i] < arr[j])
break;
}
// If no larger element was found
if (j == n)
result.add(arr[i]);
}
return result;
}
public static void main(String[] args) {
int[] arr = { 16, 17, 4, 3, 5, 2 };
ArrayList<Integer> result = leaders(arr);
for (int res : result) {
System.out.print(res + " ");
}
System.out.println();
}
}
# Function to find the leaders in an array
def leaders(arr):
result = []
n = len(arr)
for i in range(n):
# Check elements to the right
for j in range(i + 1, n):
# If a larger element is found
if arr[i] < arr[j]:
break
else:
# If no larger element was found
result.append(arr[i])
return result
if __name__ == "__main__":
arr = [16, 17, 4, 3, 5, 2]
result = leaders(arr)
print(" ".join(map(str, result)))
using System;
using System.Collections.Generic;
class GfG {
// Function to find the leaders in an array
static List<int> Leaders(int[] arr) {
List<int> result = new List<int>();
int n = arr.Length;
for (int i = 0; i < n; i++) {
int j;
// Check elements to the right
for (j = i + 1; j < n; j++) {
// If a larger element is found
if (arr[i] < arr[j])
break;
}
// If no larger element was found
if (j == n)
result.Add(arr[i]);
}
return result;
}
static void Main() {
int[] arr = { 16, 17, 4, 3, 5, 2 };
List<int> result = Leaders(arr);
foreach (int res in result) {
Console.Write(res + " ");
}
Console.WriteLine();
}
}
// Function to find the leaders in an array
function leaders(arr) {
const result = [];
const n = arr.length;
for (let i = 0; i < n; i++) {
let j;
// Check elements to the right
for (j = i + 1; j < n; j++) {
// If a larger element is found
if (arr[i] < arr[j])
break;
}
// If no larger element was found
if (j === n)
result.push(arr[i]);
}
return result;
}
const arr = [16, 17, 4, 3, 5, 2];
const result = leaders(arr);
console.log(result.join(" "));
[Expected Approach] Using Suffix Maximum - O(n) Time and O(1) Space:
The idea is to scan all the elements from right to left in an array and keep track of the maximum till now. When the maximum changes its value, add it to the result. Finally reverse the result
C++
#include <bits/stdc++.h>
using namespace std;
// Function to find the leaders in an array
vector<int> leaders(vector<int>& arr) {
vector<int> res;
int n = arr.size();
// Start with the rightmost element
int maxRight = arr[n - 1];
// Rightmost element is always a leader
res.push_back(maxRight);
// Traverse the array from right to left
for (int i = n - 2; i >= 0; i--) {
if (arr[i] >= maxRight) {
maxRight = arr[i];
res.push_back(maxRight);
}
}
// Reverse the result array to maintain
// original order
reverse(res.begin(), res.end());
return res;
}
int main() {
vector<int> arr = { 16, 17, 4, 3, 5, 2 };
vector<int> res = leaders(arr);
for (int x : res) {
cout << x << " ";
}
cout << endl;
return 0;
}
#include <stdio.h>
#include <stdlib.h>
// Function to find the leaders in an array
int* leaders(int arr[], int n, int* resSize) {
int* result = (int*)malloc(n * sizeof(int));
int count = 0;
// Start with the rightmost element
int maxRight = arr[n - 1];
// Rightmost element is always a leader
result[count++] = maxRight;
// Traverse the array from right to left
for (int i = n - 2; i >= 0; i--) {
if (arr[i] >= maxRight) {
maxRight = arr[i];
result[count++] = maxRight;
}
}
// Reverse the result array
for (int i = 0; i < count / 2; i++) {
int temp = result[i];
result[i] = result[count - i - 1];
result[count - i - 1] = temp;
}
*resSize = count;
return result;
}
int main() {
int arr[] = { 16, 17, 4, 3, 5, 2 };
int n = sizeof(arr) / sizeof(arr[0]);
int resSize;
int* result = leaders(arr, n, &resSize);
for (int i = 0; i < resSize; i++) {
printf("%d ", result[i]);
}
printf("\n");
return 0;
}
import java.util.ArrayList;
import java.util.Collections;
class GfG {
// Function to find the leaders in an array
static ArrayList<Integer> leaders(int[] arr) {
ArrayList<Integer> result = new ArrayList<>();
int n = arr.length;
// Start with the rightmost element
int maxRight = arr[n - 1];
// Rightmost element is always a leader
result.add(maxRight);
// Traverse the array from right to left
for (int i = n - 2; i >= 0; i--) {
if (arr[i] >= maxRight) {
maxRight = arr[i];
result.add(maxRight);
}
}
// Reverse the result list to maintain
// original order
Collections.reverse(result);
return result;
}
public static void main(String[] args) {
int[] arr = { 16, 17, 4, 3, 5, 2 };
ArrayList<Integer> result = leaders(arr);
for (int res : result) {
System.out.print(res + " ");
}
System.out.println();
}
}
# Function to find the leaders in an array
def leaders(arr):
result = []
n = len(arr)
# Start with the rightmost element
maxRight = arr[-1]
# Rightmost element is always a leader
result.append(maxRight)
# Traverse the array from right to left
for i in range(n - 2, -1, -1):
if arr[i] >= maxRight:
maxRight = arr[i]
result.append(maxRight)
# Reverse the result list to maintain
# original order
result.reverse()
return result
if __name__ == "__main__":
arr = [16, 17, 4, 3, 5, 2]
result = leaders(arr)
print(" ".join(map(str, result)))
using System;
using System.Collections.Generic;
class GfG {
// Function to find the leaders in an array
static List<int> Leaders(int[] arr){
List<int> result = new List<int>();
int n = arr.Length;
// Start with the rightmost element
int maxRight = arr[n - 1];
// Rightmost element is always a leader
result.Add(maxRight);
// Traverse the array from right to left
for (int i = n - 2; i >= 0; i--) {
if (arr[i] >= maxRight) {
maxRight = arr[i];
result.Add(maxRight);
}
}
// Reverse the result list to maintain original
// order
result.Reverse();
return result;
}
static void Main(){
int[] arr = { 16, 17, 4, 3, 5, 2 };
List<int> result = Leaders(arr);
foreach(int res in result){
Console.Write(res + " ");
}
Console.WriteLine();
}
}
// Function to find the leaders in an array
function leaders(arr)
{
const result = [];
const n = arr.length;
// Start with the rightmost element
let maxRight = arr[n - 1];
// Rightmost element is always a leader
result.push(maxRight);
// Traverse the array from right to left
for (let i = n - 2; i >= 0; i--) {
if (arr[i] >= maxRight) {
maxRight = arr[i];
result.push(maxRight);
}
}
// Reverse the result array to maintain
// original order
result.reverse();
return result;
}
// Driver code
const arr = [ 16, 17, 4, 3, 5, 2 ];
const result = leaders(arr);
console.log(result.join(" "));
Illustration:
arr[] = {16, 17, 4, 3, 5, 2}
Initially : maxRight = 2, res[] = { 2 }
- i = 4, maxRight = 5, res[] = { 2, 5 }
- i= 3, maxRight = 5, res[] = { 2, 5 }
- i = 2, maxRight = 5, res[] = { 2, 5 }
- i = 1, maxRight = 17, res[] = { 2, 5, 17 }
- i = 0, maxRight = 17, res[] = { 2, 5, 17 }
Reverse res[] = {17, 5, 2} and return
Leaders in an Array | SDE Sheet | Arrays
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