🔥 Binary Search Question Asked in Zoho | Find Floor in Sorted Array | Java DSA Explained

Cracked a real Zoho interview question using Binary Search

In this video, we solve the famous:
👉 Find Floor in Sorted Array problem asked in Zoho interviews.

📌 Problem Statement:
Given a sorted array and an integer X, find the index of the largest element less than or equal to X.

Example:
Input:
arr = [1, 2, 8, 10, 10, 12, 19]
x = 5

Output:
1

Because 2 is the largest number ≤ 5.

⏱ Time Complexity:
O(log n)

💾 Space Complexity:
O(1)

🔥 Perfect for:
Zoho Interview Preparation
Product-Based Company Interviews
DSA Practice
Binary Search Concepts
Java Interview Questions
Placement Preparation

#Zoho #BinarySearch #Java #DSA #CodingInterview #LeetCode #GeeksForGeeks #Programming #JavaProgramming #PlacementPreparation #InterviewQuestions

Видео 🔥 Binary Search Question Asked in Zoho | Find Floor in Sorted Array | Java DSA Explained канала SheCodes & Grows