Most Asked Coding Questions In Placements

// The code used a recursive function to return gcd of p and q 
 int gcd(int p, int q) 
 { 

   // checking divisibility by 0 
    if (p == 0) 
       return q; 
  
    if (q == 0) 
       return p; 

    // base case 
    if (p == q) 
      return p; 
    
   // p is greater  
    if (p > q) 
        return gcd(p-q, q);   

    else
        return gcd(p, q-p); 
 } 

// Driver program to test above function 
int main() 
{ 
    int p = 98, q = 56; 
    printf("GCD of %d and %d is %d ", p, q, gcd(p, q)); 
    return 0; 
}

//C++ Program
//GCD of Two Numbers
#include
using namespace std;
// Recursive function declaration
int findGCD(int, int);
// main program
int main()
{
        int first, second;
        cout<<"Enter First Number: ";
        cin>>first;
        cout<<"Enter second Number: ";
        cin>>second;
        cout<<"GCD of "<<first<<" and "<<second<<" is "<<findGCD(first,second);
        return 0;
}
//body of the function
int findGCD(int first, int second)
{
        // 0 is divisible by every number
        if(first == 0)
        {    
           return second;
        }
        if(second == 0)
        {    
           return first;
        }
        // both numbers are equal
        if(first == second)
        {
           return first;
        }
        // first is greater
        else if(first > second)
        {
           return findGCD(first - second, second);
        }
        return findGCD(first, second - first);
}

import java.util.Scanner;
public class gcd_or_hcf
{
	public static void main(String[] args)
	{
		//scanner class declaration
		Scanner sc = new Scanner(System.in);
		//input from the user		
		System.out.print("Enter the first number : ");		
		int num1 = sc.nextInt();
		//input from the user
		System.out.print("Enter the second number : ");		
		int num2 = sc.nextInt();
		int n = 1;
		System.out.print("HCF of "+num1+" and "+num2+" is ");
		if( num1 != num2)
		{
			while(n != 0)
			{
				//storing remainder
				n = num1 % num2;			
				if(n != 0)
				{
					num1 = num2;
					num2 = n;
				}
			}
			//result
			System.out.println(num2);			
		}
		else
			System.out.println("Wrong Input");
		//closing scanner class(not compulsory, but good practice)
		sc.close();									
	}
}

num1 = int(input("Enter First Number:"))
num2 = int(input("Enter Second Number:"))


def gcdFunction(num1, num2):
    if num1 > num2:
        small = num2
    else:
        small = num1
    for i in range(1, small+1):
        if (num1 % i == 0) and (num2 % i == 0):
            gcd = i
    print("GCD of two Number: {}".format(gcd))

gcdFunction(num1, num2)

#include 
#include 

int main()
{
    //Initializing variable.
    char str[100];  
    int i,length=0,flag=0;

    //Accepting input.
    printf("Enter  the string : ");
    gets(str);
    length=strlen(str);

    //Initializing for loop.
    for(i=0;i<length/2;i++)  
    {
      //Checking if string is palindrome or not.
      if(str[i]==str[length-i-1])
      flag++;

    }
      //Printing result.
      if(flag==i)
 	   printf("String entered is palindrome");
      else
           printf("String entered is not palindrome");

      return 0;
}

#include 
#include 
using namespace std;

int main()
{
    //Initializing variable.
    char str[100];  
    int i,length=0,flag=0;

    //Accepting input.
    cout<<"Enter  the string : "<<endl;
    gets(str);
    length=strlen(str);

    //Initializing for loop.
    for(i=0;i<length/2;i++)  
    {
      //Checking if string is palindrome or not.
      if(str[i]==str[length-i-1])
      flag++;

    }
      //Printing result.
      if(flag==i)
 	cout<<"String entered is palindrome";
      else
        cout<<"String entered is not palindrome";

      return 0;
}

import java.util.Scanner;

public class StringIsAPalindromeOrNot {

	public static void main(String[] args) {
		Scanner sc =new Scanner(System.in);
		 System.out.println("Enter string");
		String s = sc.next();
		String rev = "";
		for (int i = s.length()-1; i >=0 ; i--) 
			rev=rev+s.charAt(i);
		if(s.equals(rev))
			System.out.println("String is palindrome");
		else 
			System.out.println("String is not palindrome");

	}

}

#take user input
String1 = input('Enter the String :')
#initialize string and save reverse of 1st string
String2 = String1[::-1]
#check if both matches
if String1 == String2:
    print('String is palindromic')
else:
    print('Strings is not palindromic')