Find the farthest smaller number in the right side | Function to find the farthest smaller number in the right side ; To store minimum element in the range i to n ; If current element in the suffix_min is less than a [ i ] then move right ; Print the required answer ; Driver code
function farthest_min ( a , n ) { let suffix_min = new Array ( n ) ; suffix_min [ n - 1 ] = a [ n - 1 ] ; for ( let i = n - 2 ; i >= 0 ; i -- ) { suffix_min [ i ] = Math . min ( suffix_min [ i + 1 ] , a [ i ] ) ; } for ( let i = 0 ; i < n ; i ++ ) { let low = i + 1 , high = n - 1 , ans = - 1 ; while ( low <= high ) { let mid = Math . floor ( ( low + high ) / 2 ) ; if ( suffix_min [ mid ] < a [ i ] ) { ans = mid ; low = mid + 1 ; } else high = mid - 1 ; } document . write ( ans + " " ) ; } } let a = [ 3 , 1 , 5 , 2 , 4 ] ; let n = a . length ; farthest_min ( a , n ) ;