CᴏᴅɪɴɢNᴇʀᴅ 💸🐾

Given an array arr[], the task is to reverse the array. Reversing an array means rearranging the elements such that the first element becomes the last, the second element becomes second last and so on.

Given an array of integers arr[], the task is to move all the zeros to the end of the array while maintaining the relative order of all non-zero elements.

Given an array of positive integers arr[] of size n, the task is to find second largest distinct element in the array. Note: If the second largest element does not exist, return -1.

print(f"{"Boom":_^20}")

#include <stdio.h>

int check_dual_int(int arr[], int length) {
    for (int i = 0; i < length; i++) {
        for(int j=i+1; j< length; j++) {
            if(arr[i] == arr[j]) {
                return 1;
            }
        }
    }
    return 0;
}

int main() {
    int arr[] = {1, 2, 3, 1};
    int length = sizeof(arr) / sizeof(arr[0]);

    if(check_dual_int(arr, length) == 1) {
        printf("True");
    } else {
        printf("False");
    };
    return 0;
}

print(eval(input("")))