Find Building Where Alice and Bob Can Meet | Segment Tree | Binary Search | Leetcode 2940

Thanks bro

Nice Explanation 👍

does the binary search is applicable for unsorted array ?

amazing explanation

very neat and clean explanation

What an explaination Sir , hatsoff

Python code is giving TLE

Thank you very much.

Thank you sir :)

what is wrong in my code

vector<int> leftmostBuildingQueries(vector<int>& heights, vector<vector<int>>& queries)
{
int n = queries.size() ;
vector<int> ans( n , -1 ) ;

for( int i = 0 ; i < n ; i++ )
{
int a = queries[i][0] ;
int b = queries[i][1] ;

for( int j = max(a,b) ; j < heights.size() ; j++ )
{
if( heights[a] <= heights[j] && heights[b] <= heights[j] )
{
ans[i] = j ;
break;
}
}

}

return ans ;
}

Amazing explanation sir ❤