### Problem Statement :

```You are given q queries. Each query is of the form two integers described below:
- 1 x: Insert x in your data structure.
- 2 y: Delete one occurence of y from your data structure, if present.
- 3 z: Check if any integer is present whose frequency is exactly z . If yes, print 1 else 0.

The queries are given in the form of a 2-D array querries of size q where queries[i] contains the operation, and queries[i] contains the data element. For example, you are given array

queries =  [ (1,1), (2,2), (3,2), (1,1), (1,1) , (2,1), (3,2) ] . The results of each operation are:

Operation   Array   Output
(1,1)       
(2,2)       
(3,2)                   0
(1,1)       [1,1]
(1,1)       [1,1,1]
(2,1)       [1,1]
(3,2)                   1

Return an array with the output: [0, 1] .

Function Description

Complete the freqQuery function in the editor below. It must return an array of integers where each element is a 1 if there is at least one element value with the queried number of occurrences in the current array, or 0 if there is not.

freqQuery has the following parameter(s):

queries: a 2-d array of integers

Input Format

The first line contains of an integer q, the number of queries.
Each of the next q lines contains two integers denoting the 2-d array queries.

Constraints

1 <= q <= 10^5
1 <= x, y,  z <= 10^9
1 <= queries[i]  <= 10^9

Output Format

Return an integer array consisting of all the outputs of queries of type 3.```

### Solution :

```                        ```Solution in Python :

In Python3 :

#!/bin/python3

import os
from collections import defaultdict

def freqQuery(queries):
elementFreq = defaultdict(int)
freqCount = defaultdict(int)
ans = []
for i, j in queries:
if i == 1:
if freqCount[elementFreq[j]]:
freqCount[elementFreq[j]] -= 1
elementFreq[j] += 1
freqCount[elementFreq[j]] += 1
elif i == 2:
if elementFreq[j]:
freqCount[elementFreq[j]] -= 1
elementFreq[j] -= 1
freqCount[elementFreq[j]] += 1
else:
# operation 3
if j in freqCount and freqCount[j]:
ans.append(1)
else:
ans.append(0)
return ans

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

q = int(input())

queries = []

for _ in range(q):
queries.append(map(int, input().rstrip().split()))

ans = freqQuery(queries)

fptr.write('\n'.join(map(str, ans)))
fptr.write('\n')

fptr.close()```
```

## No Prefix Set

There is a given list of strings where each string contains only lowercase letters from a - j, inclusive. The set of strings is said to be a GOOD SET if no string is a prefix of another string. In this case, print GOOD SET. Otherwise, print BAD SET on the first line followed by the string being checked. Note If two strings are identical, they are prefixes of each other. Function Descriptio

## Cube Summation

You are given a 3-D Matrix in which each block contains 0 initially. The first block is defined by the coordinate (1,1,1) and the last block is defined by the coordinate (N,N,N). There are two types of queries. UPDATE x y z W updates the value of block (x,y,z) to W. QUERY x1 y1 z1 x2 y2 z2 calculates the sum of the value of blocks whose x coordinate is between x1 and x2 (inclusive), y coor

## Direct Connections

Enter-View ( EV ) is a linear, street-like country. By linear, we mean all the cities of the country are placed on a single straight line - the x -axis. Thus every city's position can be defined by a single coordinate, xi, the distance from the left borderline of the country. You can treat all cities as single points. Unfortunately, the dictator of telecommunication of EV (Mr. S. Treat Jr.) do

## Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =