Company: AURIGO

You want to transmit N packets over a network where each packet needs to be encrypted before being sent. Each packet has some integer data represented by the array data[]. To encrypt the data, you need to perform operations on the N packets. You are given 3 more arrays of length Q: 1. typeOfOperation[]: each element denotes the type of operation to be performed on data[i] (1 or 2), 2. numberOfPack ets[]: each element denotes the number of packets the operation applies to, 3. X[]: the value used in the operation.

There are two types of operations:
Type 1: Modify the first numberOfPackets[i] elements of data[] as (data[0] xor X[i], data[1] xor X[i], ..., data[a-1] xor X[i]).
Type 2: Modify the last numberOfPackets[i] elements of data[] as (data[N-1] xor X[i], data[N-2] xor X[i], ..., data[N-a] xor X[i]).

Your task is to return the encrypted data[] array after performing Q operations.

Input:
input1: Array of integers denoting data[]
input2: Integer N, the length of data[]
input3: Array of integers denoting typeOfOperation[]
input4: Array of integers denoting numberOfPackets[]
input5: Array of integers denoting X[]
input6: Integer Q, the length of the above 3 arrays

Output:
Return an array of N integers denoting the encrypted data[].

Example 1:
input1: [10, 9, 12, 3]
input2: 4
input3: [1, 2]
input4: [2, 1]
input5: [5, 10]
input6: 2
Output: [15, 12, 12, 9]

Explanation:
First operation is Type 1 on the first 2 packets: (10 xor 5) = 15, (9 xor 5) = 12 → data = [15, 12, 12, 3]
Second operation is Type 2 on the last 1 packet: (3 xor 10) = 9 → data = [15, 12, 12, 9]

Example 2:
input1: [30, 10, 3]
input2: 3
input3: [2, 1]
input4: [1, 2]
input5: [6, 18]
input6: 2
Output: [12, 24, 5]

Explanation:
First operation is Type 2 on the last 1 packet: (3 xor 6) = 5 → data = [30, 10, 5]
Second operation is Type 1 on the first 2 packets: (30 xor 18) = 12, (10 xor 18) = 24 → data = [12, 24, 5] Show More

Ticket Distribution

Consider that John has N friends and there are M different types of tickets available for an event. Each friend i, including John (i.e., N + 1 people), possesses some ticket which is represented by a non-negative integer ticket[i]. The value at the last index of the array ticket[] denotes the ticket John has. Out of the N friends that John has, count the number of friends wh ose binary representation of tickets differs from the binary representation of the ticket John has by at most K integers.

Input Specification:
input1: An integer N denoting the number of John's friends
input2: An integer M denoting the number of types of tickets available
input3: An integer K
input4: An integer array ticket[] of size N+1

Output Specification:
Return an integer value representing the number of John's friends whose tickets differ in at most K bits from the ticket John has.

Example 1:
input1: 2
input2: 3
input3: 2
input4: [5,6,7]
Output: 2

Explanation: The 1st friend's ticket 5 is (0101)₂, 2nd friend's ticket 6 is (0110)₂, and John's ticket 7 is (0111)₂. The bit difference between 5 and 7 is 1, and between 6 and 7 is 1. Both are less than or equal Show More