Zoos  Hackerearth practice problem solution
Problem:
Code:
Solution by ( C language):
#include<stdio.h>
#include<string.h>
int main()
{
char s[20];
int x,y=0,a=0,i,l;
gets(s);
l=strlen(s);
for(i=0;i<=l–1;i++)
{
x=s[i];
if(x==122)
y++;
else
a++;
}
if(2*y==a)
printf(“Yes”);
else
printf(“No”);
return 0;
}
Recommended Post:

Hackerearth Problems:
 Very Cool numbers  Hacker earth solution
 Birthday party  Hacker earth solution
 Most frequent  hacker earth problem solution
 program to find symetric difference of two sets
 cost of balloons  Hacker earth problem solution
 Chacha o chacha  hacker earth problem solution
 jadu and dna  hacker earth solution
 Bricks game  hacker earth problem
 AntiPalindrome strings  hacker earth solution
 connected components in the graph  hacker earth data structure
 odd one out  hacker earth problem solution
 Minimum addition  Hackerearth Practice problem
 The magical mountain  Hackerearth Practice problem
 The first overtake  Hackerearth Practice problem
Data structure:
 Program to find cycle in the graph
 Implementation of singly link list
 Implementation of queue by using link list
 Algorithm of quick sort
 stack by using link list
 program to find preorder post order and inorder of the binary search tree
 Minimum weight of spanning tree
 Preorder, inorder and post order traversal of the tree
Key points: