Find Leader Elements in an Array

Input: arr = [14, 9, 11, 7, 8, 5, 3]
Output: [14, 11, 8, 5, 3]
Explanation: 
14 is a leader because there are no elements to its right that are greater than 14.
11 is a leader because all elements to its right (7, 8, 5, 3) are smaller than 11.
8 is a leader because all elements to its right (5, 3) are smaller than 8.
5 is a leader because the element to its right (3) is smaller than 5.
3 is a leader because it is the rightmost element.

Input: arr = [16, 17, 4, 3, 5, 2]
Output: [17, 5, 2]
Explanation: 
17 is a leader because all elements to its right (4, 3, 5, 2) are smaller than 17.
5 is a leader because the elements to its right (2) are smaller than 5.
2 is a leader because it is the rightmost element.

public class Solution {
    public static List<Integer> findLeaders(int[] arr) {
        int n = arr.length;
        List<Integer> leaders = new ArrayList<>();
        int maxFromRight = arr[n - 1];

        // The rightmost element is always a leader
        leaders.add(maxFromRight);

        // Traverse the array from right to left
        for (int i = n - 2; i >= 0; i--) {
            if (arr[i] >= maxFromRight) {
                leaders.add(arr[i]);
                maxFromRight = arr[i];
            }
        }

        // Reverse to maintain the order as in the original array
        Collections.reverse(leaders);
        return leaders;
    }
}

def find_leaders(arr):
    n = len(arr)
    leaders = []
    max_from_right = arr[-1]

    # The rightmost element is always a leader
    leaders.append(max_from_right)

    # Traverse the array from right to left
    for i in range(n - 2, -1, -1):
        if arr[i] >= max_from_right:
            leaders.append(arr[i])
            max_from_right = arr[i]

    # Reverse to maintain the order as in the original array
    leaders.reverse()
    return leaders


# Example usage:
arr1 = [14, 9, 11, 7, 8, 5, 3]
print(find_leaders(arr1))  # Output: [14, 11, 8, 5, 3]

arr2 = [16, 17, 4, 3, 5, 2]
print(find_leaders(arr2))  # Output: [17, 5, 2]