Tech Mahindra Super Coder Questions and Answers

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int solve(vector v)
{
    int n = v.size();
    if (n == 0)
        return 0;
    int mx = v[0];
    for (int i = 1; i < n; i++)
        mx = max(mx, v[i]);
        if (mx <= 0)
            return 0;
        int mxSum = 0;
        int cSum = 0;
        for (int i = 0; i < n; i++)
        {
            cSum += v[i];
            if (cSum < 0) cSum = 0; mxSum = max(mxSum, cSum); } return mxSum; } int main() { int n; cin >> n;
    int price[n];
    for (int i = 0; i < n; i++) { cin >> price[i];
    }
    vector diff;
    for (int i = n-2; i >=0 ; i--)
        diff.push_back(price[i] - price[i+1]);
    int ans = solve(diff);
    if(ans<0)
    {
        cout<<0<< endl;
    }
    else
    {
        cout<< ans<< endl;
    }
    return 0;
}

n=int(input())
arr=[]

ans=[0]

for i in range(n):

    arr.append(int(input()))

for i in range(n-1):

    x=min(arr[i+1:])-arr[i]
    if x<0:
        ans.append(x)

print(-1*min(ans))

import java.util.*;
class Solution {
  public static int solve(ArrayList < Integer > list) {
    int n = list.size();
    if (n == 0)
      return 0;
    int max = list.get(0);
    for (int i = 1; i < n; i++)
      max = Math.max(max, list.get(i));
    if (max <= 0)
      return 0;
    int maxSum = 0;
    int sum = 0;

    for (int i = 0; i < n; i++) {
      sum = sum + list.get(i);
      if (sum < 0)
        sum = 0;
      maxSum = Math.max(maxSum, sum);
    }
    return maxSum;
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int arr[] = new int[n];

    for (int i = 0; i < n; i++)
      arr[i] = sc.nextInt();
    ArrayList < Integer > list = new ArrayList();

    for (int i = n - 2; i >= 0; i--)
      list.add(arr[i] - arr[i + 1]);
    int res = solve(list);

    if (res < 0)
      System.out.println(0);
    else
      System.out.println(res);
  }
}