Number of occurrence (GFG)

 Given a sorted array A of size N and a number X, you need to find the number of occurrences of X in A.

Input:
The first line of input contains an integer T denoting the number of test cases. T testcases follow. Each testcase contains two lines of input: The first line contains N and X(element whose occurrence needs to be counted). The second line contains the elements of the array separated by spaces.

Output:
For each testcase, print the count of the occurrences of X in the array, if count is zero then print -1.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 105
1 ≤ A[i] ≤ 103
1 <= X <= 103

Example:
Input:
2
7 2
1 1 2 2 2 2 3
7 4
1 1 2 2 2 2 3
Output:
4
-1

Explanation:
Testcase 1: 2 occurs 4 times in 1 1 2 2 2 2 3
Testcase 2: 4 is not present in 1 1 2 2 2 2 3

SOLUTION:

t=int(input())

for i in range(t):

    x,y = map(int,input().split())

    li = list(map(int,input().split()))

    if y in li:

        print(li.count(y))

    else:

        print('-1')

Comments

Post a Comment

Popular posts from this blog

Short Notes Of computer Network

Image
  OSI Layers,data units and Functions: Layers Data Units Functions Application Layer Data Mail Services,Directory Serices,FTAM Presentation Layer Data Encryption/Decryption, Compression Session Layer Data Session Establishment, Synchronization,Dialog Controller Transport Layer Segments,Datagram Segementation Network Layer Packets Traffic control,Fragmentation,Routing Data Link Layer Frames Flow control,Error control,Access control Physical Layer Bits Bit Synchronization,Bit rate control,Physical Topologies Layers and their uses – Physical Layer Network Topologies: Mesh Topology: In mesh topology, every device is connected to another device via particular channel.If suppose, N number of devices are connected with each other, then total number of links required to connect NC 2 . Bus Topology: Bus topology is a network type in which every computer and network device is connected to single cable. If N devices are connected, then the number of cables required 1 which is known as backbone ca
Read more

Short Note of Data Structure

  Arrays   An array is collection of items stored at continuous memory locations. The idea is to declare multiple items of same type together.  Array declaration:  In C, we can declare an array by specifying its and size or by initializing it or by both. // Array declaration by specifying size int arr[10]; // Array declaration by initializing elements int arr[] = {10, 20, 30, 40}; // Array declaration by specifying size and // initializing elements int arr[6] = {10, 20, 30, 40} Formulas:    Length of Array = UB - LB + 1 Given the address of first element, address of any other element is calculated using the formula:- Loc (arr [k]) = base (arr) + w * k w = number of bytes per storage location of for one element k = index of array whose address we want to calculate Elements of two-dimensional arrays ( mXn ) are stored in two ways:- Column major order: Elements are stored column by column, i.e. all elements of first column are stored, and then all elements of
Read more

Implement stack using array

  Implement stack using array   Write a program to implement a Stack using Array. Your task is to use the class as shown in the comments in the code editor and complete the functions push() and pop() to implement a stack.  Example 1 : Input : push(2) push(3) pop() push(4) pop() Output : 3, 4 Explanation : push(2) the stack will be {2} push(3) the stack will be {2 3} pop() poped element will be 3,   the stack will be {2} push(4) the stack will be {2 4} pop() poped element will be 4 Example 2: Input : pop() push(4) push(5) pop() Output : -1, 5 Your Task: You are required to complete two methods  push() and pop().  The push() method takes one argument, an integer  'x'  to be pushed into the stack and  pop()  which returns an integer present at the top and popped out from the stack. If the stack is empty then return  -1  from the pop() method. Expected Time Complexity  : O(1) for both  push()  and  pop() . Expected Auixilliary Space  : O(1) for both
Read more