MindTree Coding Questions in Easy Section -1

July 8, 2019

MindTree Automata Coding Questions and Programs

Also, if you want to study for MindTree and get previous questions in MindTree Quants, Verbal and Logical section, visit our MindTree Dashboard here.

Please also comment down the code in other languages.

Ques. Find GCD of two Integers?

#include 
int main()
{
    int n1, n2, i, gcd;

    printf("Enter two integers: ");
    scanf("%d %d", &n1, &n2);

    for(i=1; i <= n1 && i <= n2; ++i)
    {
        // Checks if i is factor of both integers
        if(n1%i==0 && n2%i==0)
            gcd = i;
    }

    printf("G.C.D of %d and %d is %d", n1, n2, gcd);

    return 0;
}

Option 2 if Numbers are both Positive and Negative?

#include 
int main()
{
    int n1, n2;

    printf("Enter two integers: ");
    scanf("%d %d",&n1,&n2);

    // if user enters negative number, sign of the number is changed to positive
    n1 = ( n1 > 0) ? n1 : -n1;
    n2 = ( n2 > 0) ? n2 : -n2;

    while(n1!=n2)
    {
        if(n1 > n2)
            n1 -= n2;
        else
            n2 -= n1;
    }
    printf("GCD = %d",n1);

    return 0;
}

6 comments on “MindTree Coding Questions in Easy Section -1”