Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
6 views2 pages

TCS Coding Question 2

The document describes a coding problem that requires counting the number of elements in an integer array that are greater than all previous elements, including the first element. It provides examples and constraints for the input size and values. Additionally, it includes code implementations in C++, Java, and Python to solve the problem.

Uploaded by

govindeverything
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

TCS Coding Question 2

The document describes a coding problem that requires counting the number of elements in an integer array that are greater than all previous elements, including the first element. It provides examples and constraints for the input size and values. Additionally, it includes code implementations in C++, Java, and Python to solve the problem.

Uploaded by

govindeverything
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

TCS Coding Question

Given an integer array Arr of size N the task is to find the count of elements whose value is greater than all of its prior
elements.

Note : 1st element of the array should be considered in the count of the result.

For example,
Arr[]={7,4,8,2,9}
As 7 is the first element, it will consider in the result.
8 and 9 are also the elements that are greater than all of its previous elements.
Since total of 3 elements is present in the array that meets the condition.
Hence the output = 3.
Example 1:

Input
5 -> Value of N, represents size of Arr
7-> Value of Arr[0]
4 -> Value of Arr[1]
8-> Value of Arr[2]
2-> Value of Arr[3]
9-> Value of Arr[4]

Output :
3

Example 2:
5 -> Value of N, represents size of Arr
3 -> Value of Arr[0]
4 -> Value of Arr[1]
5 -> Value of Arr[2]
8 -> Value of Arr[3]
9 -> Value of Arr[4]

Output :
5

Constraints

 1<=N<=20
 1<=Arr[i]<=10000
Code: C++

#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,c=0,a,m=INT_MIN;
cin>>n;
while(n--)
{
cin>>a;
if(a>m)
{
m=a;
c++;
}
}
cout<< c;
}

Code JAVA

import java.util.*;
class Main
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++)
arr[i]=sc.nextInt();
int max=Integer.MIN_VALUE;
int count=0;
for(int i=0;i< n;i++)
{ if(arr[i] >max)
{
max=arr[i];
count++;
}
}
System.out.println(count);
}
}

Code : Python

import sys
n=int(input())
c=0
m=-sys.maxsize-1
while n:
n-=1
a=int(input())
if a>m:
m=a
c+=1
print(c)

You might also like