Find Maximum

Problem Statement

Input Format

First line contains n. Second line contains n elements.

Output Format

Print the maximum data value.

Constraints

1 <= n <= 100

Sample Input

5
10 50 30 20 40

Sample Output

50

Explanation

Traverse the circular linked list using a do-while loop and track the maximum node value.

Starter Code

#include <stdio.h>
#include <stdlib.h>

struct Node {
    int data;
    struct Node *next;
};

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here to find maximum in circular linked list
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB