int HaxRevenue(struct Garage garages[], int n)
{
    if (garages == NULL)
        return -1;
    int ans = -1;
    for (int i = 0; i < n; i++)
    {
        int revenue = (100 * garages[i].bikes) + (250 * garages[i].cars) + (500 * garages[i].trucks);
        ans = (revenue > ans) ? revenue : ans;
    }
    return ans;
}


C++ code
Accenture ✅

return max(arr),arr.index(max(arr)
Python 3✅

Today anyone give Exam DE Shaw OA?

def NextSmallerNumber(a):
    if a is None:
        return None

    n = len(a)
    result = [-1] * n
    stack = []

    for i in range(n - 1, -1, -1):
        while stack and stack[-1] >= a[i]:
            stack.pop()

        if stack:
            result[i] = stack[-1]

        stack.append(a[i])

    return result


Python 3✅