Number of indexes with equal elements in given range
Last Updated :
15 Mar, 2023
Given N numbers and Q queries, every query consists of L and R, task is to find the number of such integers i (L<=i<R) such that Ai=Ai+1. Consider 0-based indexing.
Examples :
Input : A = [1, 2, 2, 2, 3, 3, 4, 4, 4]
Q = 2
L = 1 R = 8
L = 0 R = 4
Output : 5
2
Explanation: We have 5 index i which has
Ai=Ai+1 in range [1, 8). We have
2 indexes i which have Ai=Ai+1
in range [0, 4).
Input :A = [3, 3, 4, 4]
Q = 2
L = 0 R = 3
L = 2 R = 3
Output : 2
1
A naive approach is to traverse from L to R (Exclusive R) and count the number of index i which satisfies the condition Ai=Ai+1 for every query separately.
Below is the implementation of the naive approach :
C++
// CPP program to count the number of indexes
// in range L R such that Ai = Ai+1
#include <bits/stdc++.h>
using namespace std;
// function that answers every query in O(r-l)
int answer_query(int a[], int n, int l, int r)
{
// traverse from l to r and count
// the required indexes
int count = 0;
for (int i = l; i < r; i++)
if (a[i] == a[i + 1])
count += 1;
return count;
}
// Driver Code
int main()
{
int a[] = { 1, 2, 2, 2, 3, 3, 4, 4, 4 };
int n = sizeof(a) / sizeof(a[0]);
// 1-st query
int L, R;
L = 1;
R = 8;
cout << answer_query(a, n, L, R) << endl;
// 2nd query
L = 0;
R = 4;
cout << answer_query(a, n, L, R) << endl;
return 0;
}
// Java program to count the number of
// indexes in range L R such that
// Ai = Ai+1
class GFG {
// function that answers every query
// in O(r-l)
static int answer_query(int a[], int n,
int l, int r)
{
// traverse from l to r and count
// the required indexes
int count = 0;
for (int i = l; i < r; i++)
if (a[i] == a[i + 1])
count += 1;
return count;
}
// Driver Code
public static void main(String[] args)
{
int a[] = {1, 2, 2, 2, 3, 3, 4, 4, 4};
int n = a.length;
// 1-st query
int L, R;
L = 1;
R = 8;
System.out.println(
answer_query(a, n, L, R));
// 2nd query
L = 0;
R = 4;
System.out.println(
answer_query(a, n, L, R));
}
}
// This code is contributed by
// Smitha Dinesh Semwal
# Python 3 program to count the
# number of indexes in range L R
# such that Ai = Ai + 1
# function that answers every
# query in O(r-l)
def answer_query(a, n, l, r):
# traverse from l to r and
# count the required indexes
count = 0
for i in range(l, r):
if (a[i] == a[i + 1]):
count += 1
return count
# Driver Code
a = [1, 2, 2, 2, 3, 3, 4, 4, 4]
n = len(a)
# 1-st query
L = 1
R = 8
print(answer_query(a, n, L, R))
# 2nd query
L = 0
R = 4
print(answer_query(a, n, L, R))
# This code is contributed by
# Smitha Dinesh Semwal
// C# program to count the number of
// indexes in range L R such that
// Ai = Ai+1
using System;
class GFG {
// function that answers every query
// in O(r-l)
static int answer_query(int []a, int n,
int l, int r)
{
// traverse from l to r and count
// the required indexes
int count = 0;
for (int i = l; i < r; i++)
if (a[i] == a[i + 1])
count += 1;
return count;
}
// Driver Code
public static void Main()
{
int []a = {1, 2, 2, 2, 3, 3,
4, 4, 4};
int n = a.Length;
// 1-st query
int L, R;
L = 1;
R = 8;
Console.WriteLine(
answer_query(a, n, L, R));
// 2nd query
L = 0;
R = 4;
Console.WriteLine(
answer_query(a, n, L, R));
}
}
// This code is contribute by anuj_67.
<?php
// PHP program to count the
// number of indexes in
// range L R such that
// Ai = Ai+1
// function that answers
// every query in O(r-l)
function answer_query($a, $n,
$l, $r)
{
// traverse from l to r and
// count the required indexes
$count = 0;
for ($i = $l; $i < $r; $i++)
if ($a[$i] == $a[$i + 1])
$count += 1;
return $count;
}
// Driver Code
$a = array(1, 2, 2, 2, 3,
3, 4, 4, 4 );
$n = count($a);
// 1-st query
$L = 1;
$R = 8;
echo (answer_query($a, $n,
$L, $R). "\n");
// 2nd query
$L = 0;
$R = 4;
echo (answer_query($a, $n,
$L, $R). "\n");
// This code is contributed by
// Manish Shaw(manishshaw1)
?>
<script>
// javascript program to count the number of
// indexes in range L R such that
// Ai = Ai+1
// function that answers every query
// in O(r-l)
function answer_query(a, n, l, r)
{
// traverse from l to r and count
// the required indexes
var count = 0;
for (var i = l; i < r; i++)
if (a[i] == a[i + 1])
count += 1;
return count;
}
// Driver Code
var a = [1, 2, 2, 2, 3, 3, 4, 4, 4]
var n = a.length;
// 1-st query
var L, R;
L = 1;
R = 8;
document.write(answer_query(a, n, L, R) + "<br>");
// 2nd query
L = 0;
R = 4;
document.write(answer_query(a, n, L, R));
</script>
Time Complexity : O(R - L) for every query
Auxiliary Space: O(1)
Efficient approach: We can answer queries in O(1) time. The idea is to precompute a prefix array prefixans such that prefixans[i] stores the total count of the index from 0 to i that obeys the given condition. prefixans[R-1]-prefix[L-1] returns the total count of an index in the range [L, r) for every query.
Below is the implementation of the efficient approach :
C++
// CPP program to count the number of indexes
// in range L R such that Ai=Ai+1
#include <bits/stdc++.h>
using namespace std;
const int N = 1000;
// array to store count of index from 0 to
// i that obey condition
int prefixans[N];
// precomputing prefixans[] array
int countIndex(int a[], int n)
{
// traverse to compute the prefixans[] array
for (int i = 0; i < n; i++) {
if (a[i] == a[i + 1])
prefixans[i] = 1;
if (i != 0)
prefixans[i] += prefixans[i - 1];
}
}
// function that answers every query in O(1)
int answer_query(int l, int r)
{
if (l == 0)
return prefixans[r - 1];
else
return prefixans[r - 1] - prefixans[l - 1];
}
// Driver Code
int main()
{
int a[] = { 1, 2, 2, 2, 3, 3, 4, 4, 4 };
int n = sizeof(a) / sizeof(a[0]);
// pre-computation
countIndex(a, n);
int L, R;
// 1-st query
L = 1;
R = 8;
cout << answer_query(L, R) << endl;
// 2nd query
L = 0;
R = 4;
cout << answer_query(L, R) << endl;
return 0;
}
// Java program to count
// the number of indexes
// in range L R such that
// Ai=Ai+1
class GFG {
public static int N = 1000;
// Array to store count
// of index from 0 to
// i that obey condition
static int prefixans[] = new int[1000];
// precomputing prefixans[] array
public static void countIndex(int a[], int n)
{
// traverse to compute
// the prefixans[] array
for (int i = 0; i < n; i++) {
if (i + 1 < n && a[i] == a[i + 1])
prefixans[i] = 1;
if (i != 0)
prefixans[i] += prefixans[i - 1];
}
}
// function that answers
// every query in O(1)
public static int answer_query(int l, int r)
{
if (l == 0)
return prefixans[r - 1];
else
return prefixans[r - 1] -
prefixans[l - 1];
}
// Driver Code
public static void main(String args[])
{
int a[] = {1, 2, 2, 2, 3, 3, 4, 4, 4};
int n = 9;
// pre-computation
countIndex(a, n);
int L, R;
// 1-st query
L = 1;
R = 8;
System.out.println(answer_query(L, R));
// 2nd query
L = 0;
R = 4;
System.out.println(answer_query(L, R));
}
}
// This code is contributed by Jaideep Pyne
# Python program to count
# the number of indexes in
# range L R such that Ai=Ai+1
N = 1000
# array to store count
# of index from 0 to
# i that obey condition
prefixans = [0] * N;
# precomputing
# prefixans[] array
def countIndex(a, n) :
global N, prefixans
# traverse to compute
# the prefixans[] array
for i in range(0, n - 1) :
if (a[i] == a[i + 1]) :
prefixans[i] = 1
if (i != 0) :
prefixans[i] = (prefixans[i] +
prefixans[i - 1])
# def that answers
# every query in O(1)
def answer_query(l, r) :
global N, prefixans
if (l == 0) :
return prefixans[r - 1]
else :
return (prefixans[r - 1] -
prefixans[l - 1])
# Driver Code
a = [1, 2, 2, 2,
3, 3, 4, 4, 4]
n = len(a)
# pre-computation
countIndex(a, n)
# 1-st query
L = 1
R = 8
print (answer_query(L, R))
# 2nd query
L = 0
R = 4
print (answer_query(L, R))
# This code is contributed by
# Manish Shaw(manishshaw1)
// C# program to count the
// number of indexes in
// range L R such that Ai=Ai+1
using System;
class GFG
{
static int N = 1000;
// array to store count
// of index from 0 to
// i that obey condition
static int []prefixans = new int[N];
// precomputing prefixans[] array
static void countIndex(int []a,
int n)
{
// traverse to compute
// the prefixans[] array
for (int i = 0; i < n - 1; i++)
{
if (a[i] == a[i + 1])
prefixans[i] = 1;
if (i != 0)
prefixans[i] += prefixans[i - 1];
}
}
// function that answers
// every query in O(1)
static int answer_query(int l, int r)
{
if (l == 0)
return prefixans[r - 1];
else
return prefixans[r - 1] -
prefixans[l - 1];
}
// Driver Code
static void Main()
{
int []a = new int[]{1, 2, 2, 2,
3, 3, 4, 4, 4};
int n = a.Length;
// pre-computation
countIndex(a, n);
int L, R;
// 1-st query
L = 1;
R = 8;
Console.WriteLine(answer_query(L, R));
// 2nd query
L = 0;
R = 4;
Console.WriteLine(answer_query(L, R));
}
}
// This code is contributed by
// Manish Shaw(manishshaw1)
<?php
// PHP program to count the
// number of indexes in
// range L R such that Ai=Ai+1
$N = 1000;
// array to store count
// of index from 0 to
// i that obey condition
$prefixans = array_fill(0, $N, 0);
// precomputing
// prefixans[] array
function countIndex($a, $n)
{
global $N, $prefixans;
// traverse to compute
// the prefixans[] array
for ($i = 0; $i < $n - 1; $i++)
{
if ($a[$i] == $a[$i + 1])
$prefixans[$i] = 1;
if ($i != 0)
$prefixans[$i] +=
$prefixans[$i - 1];
}
}
// function that answers
// every query in O(1)
function answer_query($l, $r)
{
global $N, $prefixans;
if ($l == 0)
return $prefixans[$r - 1];
else
return ($prefixans[$r - 1] -
$prefixans[$l - 1]);
}
// Driver Code
$a = array(1, 2, 2, 2,
3, 3, 4, 4, 4);
$n = count($a);
// pre-computation
countIndex($a, $n);
// 1-st query
$L = 1;
$R = 8;
echo (answer_query($L, $R) . "\n");
// 2nd query
$L = 0;
$R = 4;
echo(answer_query($L, $R)."\n");
// This code is contributed by
// Manish Shaw(manishshaw1)
?>
<script>
// JavaScript program to count the number of indexes
// in range L R such that Ai=Ai+1
const N = 1000;
// array to store count of index from 0 to
// i that obey condition
let prefixans = new Uint8Array(N);
// precomputing prefixans[] array
function countIndex(a, n)
{
// traverse to compute the prefixans[] array
for (let i = 0; i < n; i++) {
if (a[i] == a[i + 1])
prefixans[i] = 1;
if (i != 0)
prefixans[i] += prefixans[i - 1];
}
}
// function that answers every query in O(1)
function answer_query(l, r)
{
if (l == 0)
return prefixans[r - 1];
else
return prefixans[r - 1] - prefixans[l - 1];
}
// Driver Code
let a = [ 1, 2, 2, 2, 3, 3, 4, 4, 4 ];
let n = a.length;
// pre-computation
countIndex(a, n);
let L, R;
// 1-st query
L = 1;
R = 8;
document.write(answer_query(L, R) + "<br>");
// 2nd query
L = 0;
R = 4;
document.write(answer_query(L, R) + "<br>");
// This code is contributed by Manoj.
</script>
Time complexity: O(n)
Auxiliary Space: O(n)
Similar Reads
Numbsubarrayer of elements less than or equal to a given number in a given Given an array 'a[]' and number of queries q. Each query can be represented by l, r, x. Your task is to print the number of elements less than or equal to x in the subarray represented by l to r. Examples: Input : arr[] = {2, 3, 4, 5} q = 2 0 3 5 0 2 2 Output : 4 1 Number of elements less than or eq
12 min read
Find frequency of the elements in given ranges Given a 2-dimensional integer array arr[] representing N ranges, each of type [starti, endi] (starti, endi ≤ 109) and Q queries represented in array query[], the task is to find the maximum occurrence of query[i] (query[i] ≤ 109) in the given ranges for all i in the range [0, Q-1]. Examples: Input:
15+ min read
Minimize XOR with power of 2 to make elements in range equal Given an array A[] of size N (0 ? A[i] ? 109). The following operations can be performed on the array. Choose a random integer X such that it is a power of 2.Choose an index from 0 to N-1 and replace A[i] with A[i] ? X, where, ? represent the binary XOR operation. The task is to answer Q queries whe
14 min read
Smallest index in given range of indices which is not equal to X Given an integer array arr[] of size N, and Q queries of the form of {L, R, X}, the task is to find the smallest index between L and R from the given array such that arr[i] != X. If no such index exists in array, print -1. Examples: Input: arr[] = {1, 2, 1, 1, 3, 5}, query[][] = {{0, 3, 1}, {1, 5, 2
10 min read
Count of numbers with all digits same in a given range Given two integers L and R denoting the starting and end values of a range, the task is to count all numbers in that range whose all digit are same, like 1, 22, 444, 3333, etc.Example: Input: L = 12, R = 68 Output: 5 Explanation: { 22, 33, 44, 55, 66} are the numbers with same digits in the given ra
9 min read