{"id":458,"date":"2020-06-10T11:06:16","date_gmt":"2020-06-10T11:06:16","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=458"},"modified":"2022-03-28T23:19:29","modified_gmt":"2022-03-28T23:19:29","slug":"find-the-leader","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/find-the-leader\/","title":{"rendered":"Find the Leader"},"content":{"rendered":"

\"\"<\/p>\n

CONCEPTS USED:<\/h3>\n
\n

Basic Mathematics<\/p>\n<\/blockquote>\n

DIFFICULTY LEVEL:<\/h3>\n
\n

Medium<\/p>\n<\/blockquote>\n

PROBLEM STATEMENT(<\/code>SIMPLIFIED)<\/code>:<\/h3>\n
\n

Print all those elements that have no element greater than them in the right side of the array. Print elements from right to left.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

For Example:<\/h4>\n
Input : A[] = [1, 2, 3, 4, 5]\n\nOutput : 5\n\nExplanation : Only 5 has no element greater than it on its right.<\/code><\/pre>\n
Input : A[] = [1, 4, 3, 2]\n\nOutput : 2 3 4 \n\nExplanation : 2, 3, and 4 have no elements greater than them on their right while 1 has 4, 3 and 2 greater than it on its right.<\/code><\/pre>\n
SOLVING APPROACH:<\/h3>\n
BRUTE FORCE METHOD:<\/h4>\n
\n
    \n
  1. \n
    Run two nested loops, outer loop for selecting an element and inner loop for picking each element one by one on its right and checking if the selected element is not less than the picked element. After running one complete inner loop, if the selected element was not less than any of the picked element, print its value else move ahead.  <\/p>\n<\/li>\n
  2. \n
    Outer loop will run from right to left as we need to print elements from the right.  <\/p>\n<\/li>\n
  3. \n
    Time Complexity<\/code> of this solution is O(N2<\/sup>).<\/p>\n<\/li>\n<\/ol>\n<\/blockquote>\n
    SOLUTIONS:<\/h3>\n\t\t\t\t\t\t