Zoho Interview Questions With Answers 2023 (FAQ): Programming, Technical & HR Round Q/A

Zoho Interview Questions With Answers 2023 | Zoho Interview Programming Questions | Zoho Interview Questions For  Freshers | Zoho Interview Questions For Experienced | Zoho Technical Interview Questions Answers

Zoho Interview Questions With Answers 2023 | Zoho HR Interview Questions Answers: To increase your chances of landing a job, it’s critical to prepare for interviews. You can perform better in the interview by doing your research in advance. Only those who pass the Zoho Exam will be eligible to proceed to the interview procedure. In most Zoho interviews, you’ll be asked about your personality, credentials, experience, and how well you’d match the position. In this article, we examine samples of Zoho interview questions as well as sample responses to some of the most common questions. Zoho only performs one interview per candidate. They will ask both technical and HR questions at this stage. When interviewing for the Zoho profile, the interviewer will ask both CS/IT and Non-CS/IT students the same difficulty level question. Here you may get the Upcoming Interview Questions

Zoho Technical Interview Questions 

• Introduction
• Which is your strongest programming language?
• JAVA is an object-oriented language. Why?
• Why do we say JAVA is platform-independent?
• What is a stepper motor?
• How does it start?
• What is a rotor?
• How does an induction motor work?
• What are Kirchoff laws?
• This internship you have mentioned, can you tell me more about it? What was your job? What were your tasks, team, etc?

Zoho HR Interview Questions 

• What do you consider to be your strengths and weaknesses?
• Data Structures
• Approach the given Scenario
• Database Concepts
• And Some logical puzzles
• Where do you see yourself in five years?
• Why do you want to join Zoho?
• Any questions?

Zoho Technical Interview Questions Answers

Q)  Write a program to find the Fibonacci series up to nth terms using JAVA.

public class Main
 {
   public static void main (String[]args)
   {

     int num = 15;
     int a = 0, b = 1;

     // Here we are printing 0th and 1st terms
       System.out.print (a + " , " + b + " , ");

     int nextTerm;

     // printing the rest of the terms here
     for (int i = 2; i < num; i++)
       {
      nextTerm = a + b;
      a = b;
          b = nextTerm;
          System.out.print (nextTerm + " , ");
       }


   }
 }

import java.util.*;
public
class Main {
    public
    static boolean balancedParenthesis(String str) {
        Stack stack = new Stack();
        for (int i = 0; i < str.length(); i++) {
            char x = str.charAt(i);
            if (x == '(' || x == '[' || x == '{') {
                stack.push(x);
                continue;
            }
            if (stack.isEmpty()) return false;
            char check;
            switch (x) {
                case ')':
                    check = stack.pop();
                    if (check == '{' || check == '[') return false;
                    break;
                case '}':
                    check = stack.pop();
                    if (check == '(' || check == '[') return false;
                    break;
                case ']':
                    check = stack.pop();
                    if (check == '(' || check == '{') return false;
                    break;
            }
        }
        return (stack.isEmpty());
    }
    public
    static void main(String[] args) {
        String str = "()(())";
        if (balancedParenthesis(str))
            System.out.println("True");
        else
            System.out.println("False");
    }
}

#include 

int main(){

   int mat[4][4] = {{0, 0, 0, 1}, 
                    {0, 1, 1, 1}, 
                    {1, 1, 1, 1}, 
                    {0, 0, 0, 0}};

   int max_count=0, index=-1;

   for(int i=0; i<4; i++){
     int count = 0;
     for(int j=0; j<4; j++){ 
         if(mat[i][j]==1) 
            count++; 
         
     } 
     if(count>max_count)
     {
        max_count = count;
        index = i;
     }
   }

   printf("Index of row with maximum 1s is %d", index);

}

// Palindrome program in C
#include 

// Palindrome is a number that is same if read forward/backward
// Ex : 12321
int main ()
{
    int num, reverse = 0, rem, temp;
    num=11211;
    printf("The number is :%d\n",num);
 
    temp = num;
    
    //loop to find reverse number
    while(temp != 0)
    {
        rem = temp % 10;
        reverse = reverse * 10 + rem;
        temp /= 10;
    };
    
    // palindrome if num and reverse are equal
    if (num == reverse)
        printf("%d is Palindrome\n", num);
    else
        printf("%d is Not Palindrome\n", num);

}
// Time Complexity : O(N)
// Space Complexity : O(1)
// Where N is number of digits in num

//C Program to Count possible decodings of a given digit sequence
#include
#include
#include
using namespace std;

int cnt_decoding_digits(char *dig, int a)
{
    // Initializing an array to store results     
    int cnt[a+1]; 
    cnt[0] = 1;
    cnt[1] = 1;

    for (int k = 2; k <= a; k++)
    {
        cnt[k] = 0;

        // If the last digit not equal to 0, then last digit must added to the number of words
        if (dig[k-1] > '0')
            cnt[k] = cnt[k-1];

        // In case second last digit is smaller than 2 and last digit is smaller than 7, then last two digits form a valid character
        if (dig[k-2] == '1' || (dig[k-2] == '2' && dig[k-1] < '7'))
            cnt[k] += cnt[k-2];
    }
    return cnt[a];
}

int main()
{
    char dig[15];
    cout<<"Enter the sequence : "; cin>>dig;
    int a = strlen(dig);
    cout<<"Possible count of decoding of the sequence : "<< cnt_decoding_digits(dig, a);
    return 0;
}

#include 
//Recursive function to calculate the factorial
int fact(int n){

   if(n <= 1) //Base Condition
   return 1;

   return n*fact(n-1);
}

//Driver Code
int main(){

   int n=5;
   int factorial = fact(n);

   while(factorial%10==0)
   {
        factorial /= 10;
   }

   printf("%d",factorial%10);
}

class Main {
 
    // Method to find factorial of the given number
    static int factorial(int n)
    {
        if(n==0 || n==1)
        return 1;
        
        return n*factorial(n-1);
    }
 
    // Driver method
    public static void main(String[] args)
    {
        int num = 5;
        int fact = factorial(num);
        
        int res;
        
        while(fact%10==0){
            fact /=10;
        }
        
        System.out.println(fact%10);
    }
}