Company: Meesho_17july
Difficulty: medium
Bitwise queries Problem Description Given an array A containing N integers. Your task is to answer Q queries where each query is of the following format: L R X: Find the largest number in the index range [L, R] that contains X number of 1's in its binary representation. Consider 0-based indexing. If there are no numbers present with X set bits in the provided range, then print 0. Complete the solve function. This function takes the following 4 parameters and returns an array of answers to the queries. Parameters: N: Represents the size of array A A: Represents the array of elements Q: Represents the size of the query array Queries: Represents the query array of each type Input Format Note: Use this input format if you are testing against custom input or writing code in a language where we don't provide boilerplate code. The first line contains two space-separated integers denoting N and Q. The second line contains N space-separated integers denoting the array. The next Q lines contain