Zoho Programming Questions With Answers PDF (C/C++/Java), Check Zoho Programming Questions

Zoho Programming Questions With Answers PDF | Zoho Programming Questions and Answers | Zoho Programming Round Questions | Zoho Programming Previous Year Questions | Zoho Programming Questions For Freshers 

Zoho Programming Questions With Answers PDF: The Zoho Programming Round tests essential concepts of programming, such as data structures, algorithms, and dynamic programming. The test comprises of two questions covering the following topics: array, string, and common mathematics. At least one program execution is required. You can execute the application as many times as necessary, and the execution with the highest score will be considered for the final scoring. When debugging the code, select “Run code” or “Run custom input” to view the output. In the section below, you can get the Zoho Advanced Programming Round Questions and Answers PDF/Zoho Programming Round Questions with Solutions.

The Zoho Programming Round in previous recruiting campaigns put a significant emphasis on fundamental programming principles, especially arrays. If you prepare sufficiently, passing the first round and subsequent rounds is easily achievable. To complete the coding tasks, you should utilize your programming skills and select a language you feel comfortable with, such as C, C++, Java, or even Python.. More details like Zoho Programming Round Questions and Answers, Zoho Programming Questions and Answers, Zoho Programming Round Questions and Answers, Hike, Increment, Annual Appraisal, etc. are available on this page

Zoho Programming Round Questions With Solutions

#include<bits/stdc++.h>
using namespace std;
map<int,string> m;
 
void fun(string s)
{
    string s1="",s2="";
    for(auto i:s)
    {
        if(i<='9'&&i>='0') s1+=i;
        else s2+=i;
    }
    m[stoi(s1)]=s2;
}
 
int main()
{
    string s;
    int c=0;
    getline(cin,s);
    istringstream ss(s);
    while(ss)
    {
        string word;ss>>word;
        if(word=="") break;
        fun(word);
        c++;
    }
    for(int i=0;i<c;i++)
    cout<<m[i]<<" ";
}

import java.util.*;
public class Main
{
  public static void main(String[] args)
{
   Scanner sc=new Scanner(System.in);
   String str=sc.nextLine();
   String[] arr=str.split(" ");
  String[] res=new String[arr.length];
  
for(int i=0;i<arr.length;i++)
{
   for(int j=0;j<arr[i].length();j++) { if(arr[i].charAt(j)>='0' && arr[i].charAt(j)<='9')
    {
      res[Integer.parseInt(arr[i].charAt(j)+"")]=arr[i].substring(0,j)+arr[i].substring(j+1,arr[i].length());
       break;
     }
}
}
String temp="";
for(int i=0;i<res.length;i++)
  temp=temp+res[i]+" ";
System.out.println(temp);
}
}

from collections import defaultdict
m=defaultdict(str)
s=list(map(str,input().split(" ")))
for i in s:
    s1=""
    s2=""
    for j in i:
        if j<='9' and j>='0':
            s1+=j
        else:
            s2+=j
    m[int(s1)]=s2
for i in range(len(s)):
    print(m[i],end=" ")

#include<bits/stdc++.h>
using namespace std;
 
double comb(int n,int r)
{
    if(r==0) return 1;
    return n*comb(n-1,r-1)/r;
}
int main()
{
   int n,r;
   cin>>n>>r;
   cout<<comb(n,r)/(1<<n);
}

import java.util.*;
class Main
{
public static int fact(int n)
{
  if(n==0)
   return 1;
  return n*fact(n-1);  
 }
public static double count_heads(int n, int r)
{
    double res;
    res = fact(n) / (fact(r) * fact(n - r));
    res = res / (Math.pow(2, n));
    return res;
}

public static void main(String[] args)
{
   Scanner sc=new Scanner(System.in);
   int n=sc.nextInt();
   int r=sc.nextInt();
   System.out.println(count_heads(n,r));
}
}

def comb(n, r):
    if r==0:
        return 1
    return n*comb(n-1, r-1)/r
    
n, r = map(int, input().split())
print(comb(n,r)/(1<<n))

C++  PROGRAM

#include<bits/stdc++.h>
using namespace std;int main()
{
    string s;
    int c=0;
    getline(cin,s);
    for (auto i:s)
    {
        if(i=='(') c++;
        if(i==')') c--;
    }
    cout<<(c==0);
}

PYTHON PROGRAM

s=input()
c=0
for i in s:
    if i =='(':
        c+=1
    elif (i==')') and c>0 :
        c-=1
print(int(c>0))

Q) Given a sentence with numbers representing a word’s location in the sentence, embedded within each word, and return the sorted sentence. 

Note: We are using a maximum of 0-9 numbers only for 1 sentence

Example 1

• Input:  is1 Thi0s T3est 2a
• Output:  This is a Test

Example 2

• Input:  t2o j3oin 4WonderBiz I0 Technolog5ies wan1t
• Output:  I want to join WonderBiz Technologies

C++ PROGRAM

#include<bits/stdc++.h>
using namespace std;
map<int,string> m;
 
void fun(string s)
{
    string s1="",s2="";
    for(auto i:s)
    {
        if(i<='9'&&i>='0') s1+=i;
        else s2+=i;
    }
    m[stoi(s1)]=s2;
}
 
int main()
{
    string s;
    int c=0;
    getline(cin,s);
    istringstream ss(s);
    while(ss)
    {
        string word;ss>>word;
        if(word=="") break;
        fun(word);
        c++;
    }
    for(int i=0;i<c;i++)
    cout<<m[i]<<" ";
}

JAVA PROGRAM

import java.util.*;
public class Main
{
  public static void main(String[] args)
{
   Scanner sc=new Scanner(System.in);
   String str=sc.nextLine();
   String[] arr=str.split(" ");
  String[] res=new String[arr.length];
  
for(int i=0;i<arr.length;i++)
{
   for(int j=0;j<arr[i].length();j++) { if(arr[i].charAt(j)>='0' && arr[i].charAt(j)<='9')
    {
      res[Integer.parseInt(arr[i].charAt(j)+"")]=arr[i].substring(0,j)+arr[i].substring(j+1,arr[i].length());
       break;
     }
}
}
String temp="";
for(int i=0;i<res.length;i++)
  temp=temp+res[i]+" ";
System.out.println(temp);
}
}

PYTHON  PROGRAM

from collections import defaultdict
m=defaultdict(str)
s=list(map(str,input().split(" ")))
for i in s:
    s1=""
    s2=""
    for j in i:
        if j<='9' and j>='0':
            s1+=j
        else:
            s2+=j
    m[int(s1)]=s2
for i in range(len(s)):
    print(m[i],end=" ")

Q) Write a program that receives a word A and some texts as input. You need to output the texts (without modifying them) in the ascending order of the number of occurrences of the word A in the texts. The input is as follows: an integer M(between 1 and 100, inclusive), followed by the word A in the next line, and some text in each of the M next lines.

Note: The texts and the word A contain only lowercase Latin letters (a,b,c…,z) and blank spaces (“ ”). The maximum size of the texts and the word A is 100 Characters. Every text has a different number of occurrences of the word A.

Note 2:you must print one text per line without modifying the texts.

Example 1

• Input: 2
  Java
  I hate java
  Python is a good programming language
• Output: Python is a good programming language
  I hate java

Example 2

• Input:  3
  python
  I like to code in python
  python is named after a show name monty python and not after the snake python
  I think python is good i think python is important than php
• Output: i like to code in python
  i think python is good i think python is important than php
  python is named after a show name monty python and not after the snake python

C++ PROGRAM 

#include<bits/stdc++.h>
using namespace std;
string s;
map<string,int> m2;
bool cmp(pair<string, int>& a,
         pair<string, int>& b)
{
    return a.second < b.second;
}
void sort(map<string, int>& M)
{
    vector<pair<string, int> > A;
    for (auto& it : M) {
        A.push_back(it);
    }
    sort(A.begin(), A.end(), cmp);
    for (auto& it : A) {
        for(int i=0;i<m2[it.first];i++)
        cout << it.first <<endl; } } int count(string s1) { istringstream ss(s1); int c=0; while(ss) { string w; ss>>w;
        if(w==s) c++;
    }
    return c;
}
int main()
{
    int n;getline(cin,s);n=stoi(s);
    getline(cin,s);
    transform(s.begin(),s.end(),s.begin(),::tolower);
    vector<string> v(n);
    vector<int> a(n);
    map<string,int> m;
    for(int i=0;i<n;i++)
    {
        getline(cin,v[i]);
        transform(v[i].begin(),v[i].end(),v[i].begin(),::tolower);
        m2[v[i]]++;
        m[v[i]]=count(v[i]);
    }
    sort(m);
}

JAVA PROGRAM 

import java.util.*;
public class Main
{

static int countOccurences(String str, String word)
{
    String a[] = str.split(" ");
 
    int count = 0;
    for (int i = 0; i < a.length; i++)
    {
      if (word.equals(a[i]))
        count++;
    }
 
    return count;
}
  public static void main(String[] args)
{
  Scanner sc=new Scanner(System.in);
  int n=sc.nextInt();
 sc.nextLine();
 String word=sc.next(); 
 //System.out.println(word);
 sc.nextLine();
 String arr[]=new String[n];
 for(int i=0;i<n;i++)
{
  arr[i]=sc.nextLine();
  //System.out.println(arr[i]); 
}
 TreeMap<Integer,String> map=new TreeMap<Integer,String>();	
  for(int i=0;i<n;i++)
{
   map.put(countOccurences(arr[i],word),arr[i]);
}

Set s=map.entrySet();
Iterator itr=s.iterator();
while(itr.hasNext())
{
  Map.Entry m=(Map.Entry)itr.next();

  System.out.println(m.getValue());
}

}
}

PYTHON PROGRAM 

from collections import defaultdict
d=defaultdict(int)
d1=defaultdict(int)
n=int(input())
s=input()
s=s.lower()
l=[]
for i in range(n):
    L=list(map(str,input().split()))
    s1=' '.join(i for i in L)
    c=0
    for j in L:
        if s==j:
            c+=1
    l.append(s1)
    d[i]=c
    d1[i]+=1
    c=0
d=sorted(d.items(),key=lambda a:a[1])
for i in d:
    for j in range(d1[i[0]]):
        print(l[i[0]])

Q) Write a program that will print the sum of diagonal elements of a 10X10 matrix. The program will take a total of 100 numbers as input (10 numbers will be input per line and each number will be separated by a space).

Example 1

• Input:    1  2 3 4 5 6 7 8 9 0
  0 1 2 3 4 5 6 7 8 0
  3 4 5 6 7 8 9 6 4 0
  2 3 4 5 6 7 8 9 3 2
  3 4 5 6 7 4 3 2 1 3
  3 4 5 6 2 4 4 2 4 6
  2 3 4 6 2 4 6 2 3 5
  2 3 5 6 2 4 6 2 3 5
  2 4 6 2 1 4 3 3 5 2
  3 3 5 2 4 6 2 1 4 6
• Output:  42

Example 2

• Input:   1 22 33 44 55 66 77 88 99 100
  100 1 88 77 66 55 44 33 22 11
  88 88 1 66 55 44 33 22 11 100
  88 77 66 1 44 33 22 11 100 99
  77 66 55 44  1 22  11 88 99 100
  66 55 44 33 22 1 77 88 99 100
  44 33 22 11 100 99 1 77 66 55
  33 22 11 100 99 88 77 1 55 44
  22 11 100 99 88 77 66 55 1 33
  100 11 22 33 44 55 99 88 77 1
• Output: 10

C++ PROGRAM

#include<bits/stdc++.h>
using namespace std;
 
int main()
{
    vector<vector<int>> v(10,vector<int>(10));
    for(int i=0;i<10;i++)
    for(int j=0;j<10;j++) cin>>v[i][j];
    int sum=0;
 
    for(int i=0;i<10;i++)
    sum+=v[i][i];
    cout<<sum;
}

import java.util.*;
public class Main
{
 public static boolean isVowel(char ch)
{
  return ch=='a' || ch=='e' || ch=='o' || ch=='i' || ch=='u' || ch=='A' || ch=='E' || ch=='I' || ch=='O' || ch=='U';
}
  public static void main(String[] args)
{
  Scanner sc=new Scanner(System.in);
  String str=sc.next();
  char arr[]=str.toCharArray(); 
 String res="";
 if(!isVowel(arr[0]))
  res+=arr[0];
 for(int i=1;i<arr.length;i++)
 {
    if(isVowel(arr[i])&&isVowel(arr[i-1]))
      res+=arr[i-1]+""+arr[i];
     if(!isVowel(arr[i]))
     res+=arr[i];
 }
System.out.println(res);
}

l=['a','e','i','o','u','A','E','I','O','U']
s=input()
s+=" "
s1=""
if len(s)==0:
    print("")
elif len(s)==1:
    if s[0] not in l:
        print(s)
else:
    if s[0] in l and s[1] in l:
        s1+=s[0]
    elif s[0] not in l :
        s1+=s[0]
 
    for i in range(1,len(s)-1):
        if s[i-1] not in l and s[i] in l and s[i+1] not in l:
            continue
        s1+=s[i]
 
    print(s1)

Keep an eye on Dailyrecruitment.in for the most up-to-date information about upcoming exams and results. Find out about official notices, Exam Patterns, Syllabus, Previous Question Papers, Coding Questions, Aptitude Questions, Expected Cut Off, Results, Merit List, Study Materials, and much more. Now is the time to bookmark in order to take advantage of even more amazing career opportunities.

Find More Govt Jobs in

Railway Job

Government Exam Result

Competitive Exam

Upcoming Jobs

Defence job

Engineering Job