TCS NQT Coding Question-5: Count of Elements

TCS NQT Coding Question-5: Count of Elements

In this post, we will see the solution of the Python Coding Question which is already asked in the TCS NQT Exam.

Problem Statement: Given an integer array Arr of size S the task is to find the count of elements whose value is greater than all of its left-hand elements.

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

For example:


As 70 is the first element, it will consider in the result.

80 and 90 are also the elements that are greater than all of its left hand elements.

Since total of 3 elements is present in the array that meets the condition.

Hence the output = 3.

Example 1:

5 -> Value of S, represents size of Arr
70-> Value of Arr[0]
40 -> Value of Arr[1]
80-> Value of Arr[2]
20-> Value of Arr[3]
90-> Value of Arr[4]
Output :

Example 2:
5 -> Value of S, represents size of Arr
30 -> Value of Arr[0]
40 -> Value of Arr[1]
50 -> Value of Arr[2]
80 -> Value of Arr[3]
90 -> Value of Arr[4]




# taking inputs
S = int(input())
Arr = list(map(int,input().strip().split()))

# initialize the value
max_value = 0
count_element = 0

# iterate through each element from the Arr
for element in Arr:
    # check for max if condition satisfied
    # then update the max value
    # and increment the count by 1
    if element > max_value:
        count_element += 1
        max_value = element

print("Result:", count_element)


70 40 80 20 90
Result: 3

Time complexity: O(N)
Space complexity: O(1)

Leave a Reply

Your email address will not be published. Required fields are marked *

📢 Need further clarification or have any questions? Let's connect!

Connect 1:1 With Me: Schedule Call

If you have any doubts or would like to discuss anything related to this blog, feel free to reach out to me. I'm here to help! You can schedule a call by clicking on the above given link.
I'm looking forward to hearing from you and assisting you with any inquiries you may have. Your understanding and engagement are important to me!

This will close in 20 seconds