Cisco OA 2024-October | Binary Search & Search Spaces | Off-campus

Question 1: Finding the Floor Problem Statement Given an array, you have to find the floor of a number X. The floor of a number X is defined as the largest number in the array that is less than or equal to X. Input Format The first line of input contains N - the size of the array. The next line contains N integers, the elements of the array. The next line contains Q - number of queries. Each of ...