github-actions[bot]
commented
3 hours ago @Aishwarya-S-Sharma
Welcome to the Project!
Thank you for opening this Issue 🙌! We’re thrilled to have you join us for Hacktoberfest 💖. We’ll review your submission and get back to you shortly.
In the meantime, please remember to give this repo a star! ⭐ We appreciate your contribution!
Aishwarya-S-Sharma
Floor in a Sorted Array
Problem: Given a sorted array arr[] of size n without duplicates, and given a value x. Floor of x is defined as the largest element k in arr[] such that k is smaller than or equal to x. Find the index of k(0-based indexing).
Examples Input: n = 7, x = 0 arr[] = {1,2,8,10,11,12,19} Output: -1 Explanation: No element less than 0 is found. So output is "-1".
Input: n = 7, x = 5 arr[] = {1,2,8,10,11,12,19} Output: 1 Explanation: Largest Number less than 5 is 2 (i.e k = 2), whose index is 1(0-based indexing).
Your Task: The task is to complete the function findFloor() which returns an integer denoting the index value of K or return -1 if there isn't any such number.