Euclid's Algorithm (Greatest Common Divisor)

Following is how to find the greatest common divisor of two positive numbers, m and n, using Euclid's Algorithm.

1. Divide m by n and let r be the remainder.
2. If r is 0, n is the answer; if r is not 0, continue to step 3.
3. Set m = n and n = r. Go back to step 1.

 Below is my implementation of this algorithm.

#include <stdio.h>

int greatestCommonDivisor(int m, int n)
{
    int r;

    /* Check For Proper Input */
    if((m == 0) || (n == 0))
        return 0;
    else if((m < 0) || (n < 0))
        return -1;

    do
    {
        r = m % n;
        if(r == 0)
            break;
        m = n;
        n = r;
    }
    while(true);

    return n;
}

int main(void)
{
    int num1 = 600, num2 = 120;
    int gcd = greatestCommonDivisor(num1, num2); 

    printf("The GCD of %d and %d is %d\n", num1, num2, gcd);

    getchar();
    return 0;
}

Anagram

Anagram in c: c program to check whether two strings are anagrams or not, string is assumed to consist of alphabets only. Two words are said to be anagrams of each other if the letters from one word can be rearranged to form the other word. From the above definition it is clear that two strings are anagrams if all characters in both strings occur same number of times. For example "abc" and "cab" are anagram strings, here every character 'a', 'b' and 'c' occur only one time in both strings. Our algorithm tries to find how many times characters appear in the strings and then comparing their corresponding counts.

C anagram programming code

#include <stdio.h>
 
int check_anagram(char [], char []);
 
int main()
{
   char a[100], b[100];
   int flag;
 
   printf("Enter first string\n");
   gets(a);
 
   printf("Enter second string\n");
   gets(b);
 
   flag = check_anagram(a, b);
 
   if (flag == 1)
      printf("\"%s\" and \"%s\" are anagrams.\n", a, b);
   else
      printf("\"%s\" and \"%s\" are not anagrams.\n", a, b);
 
   return 0;
}
 
int check_anagram(char a[], char b[])
{
   int first[26] = {0}, second[26] = {0}, c = 0;
 
   while (a[c] != '\0')
   {
      first[a[c]-'a']++;
      c++;
   }
 
   c = 0;
 
   while (b[c] != '\0')
   {
      second[b[c]-'a']++;
      c++;
   }
 
   for (c = 0; c < 26; c++)
   {
      if (first[c] != second[c])
         return 0;
   }
 
   return 1;
}

Reverse the elements in an array

#include<stdio.h>
#include<conio.h>
void main()
{
int a[100],b[100],n,i,j;
clrscr();
printf("Enter the number of elements in the array ");
scanf("%d",&n);
printf("Enter %d numbers \n",n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
 }
for(i=0,j=(n-1);i<n,j>=0;i++,j--)
{
b[j]=a[i];
}
printf("The orignal array is\n ");
for(i=0;i<n;i++)
{
printf("%d ",a[i]);
}

printf("The new array is\n ");
for(i=0;i<n;i++)
{
printf("%d ",b[i]);
}
getch();
}

BSMS ( Basics of Simulation and System Modelling )

Basics of Simulation and System Modelling provide you a general knowledge of Real life probability and its applications. The link provided here gives you the basics of Mathematics and Probability Techniques required for the Subject.

DBMS ( Data Base Management System ) Assignment

DBMS Assignment [ Unit 1 & 2 ] - Ques with Solutions in pdf.

DBMS Assignment [ Unit 2 & 3 ] - Ques with Solutions in pdf.

DBMS Assignment [ Unit 4 & 5 ] - Ques with Solutions in pdf.

Print the Matrix in Diagonal (Zig-Zag) Order

class ArrayDemo25
{
static void PrintDOrderWise(int x[][])
{
int i, j, k;
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + x[i][j]);
}
System.out.println(" ");
}
for(k=0;k<(2*x.length)-1;k++)
{
if(k%2==0)
{
for(i=x.length-1;i>=0;i--)
{
for(j=0;j<x[i].length;j++)
{
if(i+j==k)
System.out.print(" " + x[i][j]);
}
}
}
if(k%2!=0)
{
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
if(i+j==k)
System.out.print(" " + x[i][j]);
}
}
}
System.out.println(" ");
}
}
public static void main(String... S)
{
PrintDOrderWise(new int[][]{{1,4,25},{5,7,44},{2,45,7}});
}
}

Print the Matrix Diagonal Wise

class ArrayDemo24
{
static void PrintDWise(int x[][])
{
int i, j, k;
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + x[i][j]);
}
System.out.println(" ");
}
for(k=0;k<(2*x.length)-1;k++)
{
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
if(i+j==k)
System.out.print(" " + x[i][j]);
}
}
System.out.println(" ");
}
}
public static void main(String... S)
{
PrintDWise(new int[][]{{1,4,25},{5,7,44},{2,45,7}});
}
}

Intersection of 2 Arrays

class ArrayDemo23
{
static void Intersection(int x[], int y[])
{
int i;
int z[]=MergeSort(x, y);
System.out.println(" ");
if(z[0]==z[1])
System.out.print(z[0]);
for(i=1;i<z.length-1;i++)
{
if(z[i]==z[i+1] && z[i-1]!=z[i])
System.out.print(" "+z[i]+" ");
}
}
static int[] Sort(int x[])
{
int i,j,temp,count[];
for(i=0;i<x.length;i++)
{
for(j=i;j<x.length;j++)
{
if(x[i]>x[j])
{
temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
}
return x;
}
static int[] MergeSort(int x[], int y[])
{
int z[], i;
z = new int[x.length+y.length];
for(i=0;i<x.length;i++)
{
z[i] = x[i];
}
for(i=x.length;i<x.length+y.length;i++)
{
z[i] = y[i-x.length];
}
for(i=0;i<z.length;i++)
{
System.out.print(" " + z[i] + " ");
}
return(Sort(z));
}
public static void main(String... S)
{
Intersection((new int[]{1,4,25,5,7,44,2,45,7,23,74}),(new int[]{1,4,2,4,6,0,4,42,53,44,24,0}));
}
}

Unio of two Arrays

class ArrayDemo22
{
static void Union(int x[], int y[])
{
int i;
int z[]=MergeSort(x, y);
System.out.println(" ");
for(i=0;i<z.length-1;i++)
{
if(z[i]!=z[i+1])
System.out.print(" "+z[i]+" ");
}
System.out.print(" "+z[z.length-1]);
}
static int[] Sort(int x[])
{
int i,j,temp,count[];
for(i=0;i<x.length;i++)
{
for(j=i;j<x.length;j++)
{
if(x[i]>x[j])
{
temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
}
return x;
}
static int[] MergeSort(int x[], int y[])
{
int z[], i;
z = new int[x.length+y.length];
for(i=0;i<x.length;i++)
{
z[i] = x[i];
}
for(i=x.length;i<x.length+y.length;i++)
{
z[i] = y[i-x.length];
}
for(i=0;i<z.length;i++)
{
System.out.print(" " + z[i] + " ");
}
return(Sort(z));
}
public static void main(String... S)
{
Union((new int[]{1,4,25,5,7,44,2,45,7,23,74}),(new int[]{1,4,2,4,6,4,42,53,44,24,0}));
}
}

Sort two Arrays by merging them to one Array ( Merge_Sort )

class ArrayDemo21
{
static void MergeSort(int x[], int y[])
{
int z[], i;
z = new int[x.length+y.length];
for(i=0;i<x.length;i++)
{
z[i] = x[i];
}
for(i=x.length;i<x.length+y.length;i++)
{
z[i] = y[i-x.length];
}
for(i=0;i<z.length;i++)
{
System.out.print(" " + z[i] + " ");
}
Sort(z);
}
static void Sort(int x[])
{
int i,j,temp,count[];
for(i=0;i<x.length;i++)
{
for(j=i;j<x.length;j++)
{
if(x[i]>x[j])
{
temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
}
System.out.println();
for(i=0;i<x.length;i++)
{
System.out.print(" "+x[i]+" ");
}
}
public static void main(String... S)
{
MergeSort((new int[]{1,4,25,5,7,44,2,45,7,23,74}),(new int[]{1,4,2,4,6,4,42,53,44,24,0}));
}
}

Sort the 2-Dimentional Array

class ArrayDemo20
{
static void Sort1(int x[][])
{
int i,j,k,temp;
for(k=0;k<x.length;k++)
{
for(i=0;i<x[k].length;i++)
{
System.out.print(" "+x[k][i]+" ");
}
System.out.println();
}
for(k=0;k<x.length;k++)
for(i=0;i<x[k].length;i++)
{
for(j=i;j<x[k].length;j++)
{
if(x[k][i]>x[k][j])
{
temp = x[k][i];
x[k][i] = x[k][j];
x[k][j] = temp;
}
}
}
System.out.println();
for(k=0;k<x.length;k++)
{
for(i=0;i<x[k].length;i++)
{
System.out.print(" "+x[k][i]+" ");
}
System.out.println();
}
}
public static void main(String... S)
{
Sort1(new int[][]{{7,4,11,25},{44,5,87,2,62},{45,67,57},{23,74}});
}
}

Find Maximum Occurance using function name void MaxOneRow(int x[][])

class ArrayDemo18
{
static void MaxOneRow(int x[][])
{
int i,j,temp,count[];
count = new int[x.length];
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" "+x[i][j]+" ");
}
System.out.println();
}
for(i=0;i<x.length;i++)
{
temp = 0;
for(j=0;j<x[i].length;j++)
{
if(x[i][j] == 1)
{
temp++;
}
}
count[i]=temp;
}
temp = count[0];
j=0;
for(i=0;i<count.length;i++)
{
if(temp<count[i])
{
temp = count[i];
j = i;
}
}
System.out.println("    " + j);
}
public static void main(String... S)
{
MaxOneRow(new int[][]{{0,0,0,1,1},{0,0,1,1,1},{0,1,1,1,1},{0,0,0,0,1}});
}
}

Shift the Elements of array : Descending negetive and ascending positive

class ArrayDemo17
{
static void Shift(int x[])
{
int i,j,temp,count;
for(i=0;i<x.length;i++)
{
System.out.print(" "+x[i]+" ");
}
for(i=0;i<x.length;i++)
{
for(j=i;j<x.length;j++)
{
if(x[i]>x[j])
{
temp = x[i];
x[i] = x[j];
x[j] = temp;
}
}
}
System.out.println("");
count=0;
for(i=0;i<x.length;i++)
{
if(x[i]<0)
count++;
}
for(i=count-1;i>=0;i--)
{
System.out.print(" "+x[i]+" ");
}
for(i=count;i<x.length;i++)
{
System.out.print(" "+x[i]+" ");
}
}
public static void main(String... S)
{
Shift(new int[]{1,12,3,4,5,6,7,5,10,-1,-3,0});
}
}

Single Occurance of elements in the Array

class ArrayDemo16
{
static int[] SingleOccur(int x[])
{
int i,temp=0,a[],j,counter,k=0;
a = new int[x.length];
for(i=0;i<x.length;i++)
{
System.out.print(" "+x[i]);
}
temp = x[0];
for(i=0;i<x.length;i++)
{
counter = 0;
for(j=0;j<=i;j++)
{
if(x[i]==x[j])
counter++;
}
if(counter==1)
{
a[k] = x[i];
k++;
}
}
return a;
}
public static void main(String... S)
{
int i;
int y[]=(SingleOccur(new int[]{1,12,3,4,5,5,4,3,4,6,7,5,4,1,1,1,1,1}));
System.out.println("");
for(i=0;i<y.length;i++)
System.out.print(" "+y[i]+" ");
}
}

Count the frequency of elements in Array

class ArrayDemo15
{
static void FrequencyCount(int x[])
{
int i,temp=0, count=0,j,counter;
for(i=0;i<x.length;i++)
{
System.out.print(" "+x[i]);
}
temp = x[0];
System.out.println("\nElement Frequency");
for(i=0;i<x.length;i++)
{
counter = 0;
for(j=0;j<=i;j++)
{
if(x[i]==x[j])
counter++;
}
if(counter==1)
{
temp = x[i];
count = 0;
for(j=0;j<x.length;j++)
{
if(temp == x[j])
{
count++;
}
}
System.out.println("    "+x[i]+"       "+count);
}
}
}
public static void main(String... S)
{
FrequencyCount(new int[]{1,12,3,4,5,5,4,3,4,6,7,5,4,1,1,1,1,1});
}
}

Transpose of a Matrix

class ArrayDemo14
{
static void MatrixT(int x[][])
{
int i, j;
for(i=0;i<x.length;i++)
  {
for(j=0;j<x[i].length;j++)
{
System.out.print(" "+x[i][j]+" ");
}
System.out.println("");
}
System.out.println("");
for(i=0;i<x.length;i++)
  {
for(j=0;j<x[i].length;j++)
{
System.out.print(" "+x[j][i]+" ");
}
System.out.println("");
}
}
public static void main(String... S)
{
MatrixT(new int[][]{{1,2,3},{4,5,6},{7,8,9}});
}
}

Summing up all the Matrix in all directions

class ArrayDemo7
{
static void MatrixSum(int x[][])
{
int i, j, sum;
for(i=0;i<x.length;i++)
{
sum=0;
System.out.print(" ");
for(j=0;j<x[i].length;j++)
{
System.out.print("  " + x[i][j] + " ");
sum += x[i][j];
}
System.out.print(" "+sum);
System.out.println(" ");
}
sum=0;
for(i=0;i<x.length;i++)
  for(j=x[i].length-1;j>=0;j--)
if(i==j)
sum += x[i][j];
System.out.print(sum);
for(i=0;i<x.length;i++)
{
sum = 0;
for(j=0;j<x[i].length;j++)
{
sum += x[j][i];
}
System.out.print(" "+sum+" ");
}
sum=0;
for(i=0;i<x.length;i++)
  for(j=0;j<x[i].length;j++)
if(i==j)
sum += x[i][j];
System.out.print(" "+sum);
}
public static void main(String... S)
{
MatrixSum(new int[][]{{1,2,3},{4,5,6},{7,8,9}});
}
}

Multiplication of two matrices

class ArrayDemo6
{
static void MatrixMul(int x[][], int y[][])
{
int i, j, k, l, c[][];
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + x[i][j] + " ");
}
System.out.print("     ");
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + y[i][j] + " ");
}
System.out.println(" ");
}
for(i=0;i<x.length;i++)
{
for(j=0;j<y[i].length;j++)
{
k = 0;
    l = 0;
c = new int[3][3];
while(l<x[j].length && k<y.length)
{
c[i][j] += x[i][l] * y[k][j];
k++;
l++;
}
System.out.print(" " + c[i][j] + " ");
}
System.out.println("");
}
}
public static void main(String... S)
{
MatrixMul((new int[][]{{1,2,3},{4,5,6},{7,8,9}}),(new int[][]{{4,5,6},{7,8,9},{1,2,3}}));
}
}

Addition of two Matrices

class ArrayDemo5
{
static void MatrixAdd(int x[][], int y[][])
{
int i, j;
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + x[i][j] + " ");
}
System.out.print("     ");
for(j=0;j<x[i].length;j++)
{
System.out.print(" " + y[i][j] + " ");
}
System.out.println(" ");
}
for(i=0;i<x.length;i++)
{
for(j=0;j<x[i].length;j++)
{
System.out.print(" ");
System.out.print(x[i][j]+y[i][j]);
System.out.print(" ");
}
System.out.println("\t");
}
}
public static void main(String... S)
{
MatrixAdd((new int[][]{{1,2,3},{4,5,6},{7,8,9}}),(new int[][]{{4,5,6},{7,8,9},{1,2,3}}));
}
}

Minimum in the Array

class ArrayDemo2
{

static int min(int x[])
{
int i=0;
int temp=x[0];
for(i=0;i<x.length;i++)
{
if(temp>x[i])
temp = x[i];
}
return temp;
}
public static void main(String... S)
{
System.out.println(min(new int[]{1,2,4,6,8,7}));
}
}

Maximum in the Array

class ArrayDemo1
{
static int max(int x[])
{
int i=0;
int temp=x[0];
for(i=0;i<x.length;i++)
{
if(temp<x[i])
temp = x[i];
}
return temp;
}
public static void main(String... S)
{
System.out.println(max(new int[]{1,2,4,6,8,7}));
}
}

Convert Binary String into Integer value

class StringDemo28
{
static int BinaryToDecimal(String s1)
{
return Integer.parseInt(s1, 2);
}
public static void main(String... s)
{
System.out.println(BinaryToDecimal("10101010"));
}
}

Calculate Mathematical expression from a String input

class StringDemo27
{
static int expression(String s1)
{
int i, result;
String x[] = s1.split("\\+");
result = Integer.parseInt(x[0]);
for(i=1;i<x.length;i++)
{
result += Integer.parseInt(x[i]);
}
return result;
}
public static void main(String... s)
{
System.out.println(expression("10+20+20+20"));
}
}

Count the frequency of Word in a String

class StringDemo26
{
static void wordfrequencyCount(String s)
{
String S[] = s.split(" ");
int i, j, count=0;
for(i=0;i<S.length;i++)
{
count=0;
for(j=0;j<i;j++)
{
if(S[i].compareTo(S[j])==0)
count++;
}
if(count==0)
{
for(j=i;j<S.length;j++)
{
if(S[i].compareTo(S[j])==0)
count++;
}
System.out.println(S[i] + "\t\t" + count);
}
}
}
public static void main(String... s)
{
wordfrequencyCount("i love india india is my country");
}
}

Compare two Strings without using predefined function

class StringDemo25
{
static int compare(String s1, String s2)
{
int n=s1.length(), m=s2.length(), i=0;
if(m==n)
{
while(i<n && s1.charAt(i) == s2.charAt(i))
i++;
if(i==m)
return 0;
else
return (int) s1.charAt(i)-s2.charAt(i);
}
else
{
if(m>n)
return (int) -s2.charAt(n);
else
return (int) s1.charAt(m);
}
}
public static void main(String... s)
{
System.out.println(compare("India","Indian"));
}
}

Check the Equlity of two Strings

class StringDemo20
{
static boolean Equals(String s1, String s2)
{
int count=0;
if(s1.length()==s2.length())
{
while(count<s1.length() && s1.charAt(count) == s2.charAt(count))
count++;
if(count == s1.length())
return true;
else
return false;
}
else
return false;
}
public static void main(String... s)
{
System.out.println(Equals("India","India"));
}
}

Replace one sub-string with desired String

class StringDemo19
{
static String replace(String s1, String s2, String s3)
{
s1 += ' ';
int i;
String x[] = s1.split(s2), result="";
result += x[0];
for(i=1;i<x.length;i++)
{
result += s3 + x[i];
}
return result;
}
public static void main(String... s)
{
System.out.println(replace("i am an indian", "am", "love"));
}
}

Find a string in another string

class StringDemo18
{
static boolean find(String s1, String s2)
{
int i, j, count=0, substr=0;
for(i=0;i<s1.length();i++)
{
if(s1.charAt(i) == s2.charAt(0))
{
count = 0;
while(count<s2.length() && s1.charAt(i+count) == s2.charAt(count))
{
count++;
}
if(count == s2.length())
{
substr++;
}
}
}
if(substr>0)
return true;
else
return false;
}
public static void main(String... s)
{
System.out.println(find("i am an indian", "i"));
}
}

Sort words of the String

import java.util.Arrays;
class StringDemo17
{
static String sortedWord(String s)
{
s = s.trim();
int n = StringDemo1.wordCount(s);
int i, j=0;
String str[], result="";
str = new String[n];
for(i=0;i<n;i++)
{
str[i] = "";
}
str[0] += s.charAt(0);
for(i=1;i<s.length()-1;i++)
{
if(s.charAt(i-1) != ' ' && s.charAt(i) == ' ' && s.charAt(i+1) != ' ')
j++;
else
str[j] += s.charAt(i);
}
str[n-1] += s.charAt(s.length()-1);
Arrays.sort(str);
for(i=0;i<n;i++)
{
result += str[i]+' ';
}
return result;
}
public static void main(String... s)
{
System.out.println(sortedWord("I am an Indian"));
}
}

Print String with sorted characters

import java.util.Arrays;
class StringDemo16
{
static void sortedOrder(String s)
{
char c[]=s.toCharArray();
Arrays.sort(c);
int i;
for(i=0;i<c.length;i++)
System.out.print(c[i]);
}
public static void main(String... s)
{
sortedOrder("I am an Indian");
}
}

Print String with Single Occurance

class StringDemo15
{
static String SingleOccurance(String s)
{
int i,count=1;
String c1="", c2="";
for(i=0;i<s.length()-1;i++)
{
count=1;
if(s.charAt(i) == s.charAt(i+1))
{
while(i+count<s.length() && s.charAt(i) == s.charAt(i+count))
++count;
c1 += s.charAt(i);
c2 += count;
i = i+count-1;
}
else
{
c1 += s.charAt(i);
c2 += count;
}
}
if(s.charAt(s.length()-2) != s.charAt(s.length()-1))
{
c1 += s.charAt(i);
c2 += count;
}
return c1;
}
public static void main(String... s)
{
System.out.println(SingleOccurance("nniiitttttinnn"));
}
}

Toggle the String

class StringDemo14
{
static String ChangeCase(String s)
{
int i, j;
char c;
String s1="";
for(i=0;i<s.length();i++)
{
j = s.charAt(i);
if(j<=90 && j>=65)
j = (j+32);
else if(j>=97 && j<=122)
j = (j-32);
c = (char)j;
s1 += c;
}
return s1;
}
public static void main(String... S)
{
System.out.println(ChangeCase("InDia"));
}
}

Count frequency of characters in String and print in ascending order

class StringDemo13
{
static void frequencyCount(String s)
{
char c[] = s.toCharArray();
String s1="", s2="";
int i, j, count=0;
for(i=0;i<c.length;i++)
{
count=0;
for(j=0;j<i;j++)
{
if(c[i] == c[j])
count++;
}
if(count==0)
{
for(j=i;j<c.length;j++)
{
if(c[i] == c[j])
count++;
}
s1+=c[i];
s2+=count;
}
}
char c1[] = s1.toCharArray();
char c2[] = s2.toCharArray();
int key1, key2;
for(i=1;i<c2.length;i++)
{
key2 = c2[i];
key1 = c1[i];
j=i-1;
while(j>=0 && key2<c2[j])
{
c2[j+1] = c2[j];
c1[j+1] = c1[j];
j--;
}
c1[j+1] = (char)key1;
c2[j+1] = (char)key2;
}
for(i=0;i<c1.length;i++)
{
System.out.println(c1[i]+"  "+c2[i]);
}
}
public static void main(String... s)
{
frequencyCount("nniiitttttinnn");
}
}

Count the sequence of String

class StringDemo12
{
static void sequenceCount(String s)
{
int i,count=1;
for(i=0;i<s.length()-1;i++)
{
count=1;
if(s.charAt(i) == s.charAt(i+1))
{
while(i+count<s.length() && s.charAt(i) == s.charAt(i+count))
++count;
System.out.println(s.charAt(i) + "  " + count);
i = i+count-1;
}
else
System.out.println(s.charAt(i) + "  " + count);
}
if(s.charAt(s.length()-2) != s.charAt(s.length()-1))
System.out.println(s.charAt(s.length()-1) + "  " + count);
}
public static void main(String... s)
{
sequenceCount("nniiitttttinnn");
}
}

Count characters in the String

class StringDemo11
{
static int charCount(String s)
{
char c[] = s.toCharArray();
return c.length;
}
public static void main(String... s)
{
System.out.println(charCount("i am an indian"));
}
}

Count Vowels in the String

class StringDemo10
{
static int vowelCount(String s)
{
int i, count=0;
for(i=0;i<s.length();i++)
{
if(s.charAt(i) == 'a' || s.charAt(i) == 'e' || s.charAt(i) == 'i' || s.charAt(i) == 'o' || s.charAt(i) == 'u')
count ++;
}
return count;
}
public static void main(String... s)
{
System.out.println(vowelCount("i am an indian"));
}
}

Remove spaces from String

class StringDemo9
{
static String squeeze(String s)
{
String c = "";
int i;
for(i=0;i<s.length();i++)
{
if(s.charAt(i) != ' ')
c += s.charAt(i);
}
return c;
}
public static void main(String... s)
{
System.out.println(squeeze("    i am an indian"));
}
}

Trim the String without trim()

class StringDemo4
{
static String Reverse(String s)
{
int n = s.length();
String c = "";
int i;
for(i=n;i>0;i--)
{
c += s.charAt(i-1);
}
return c;
}
public static void main(String... s)
{
System.out.println(Reverse("i am an indian"));
}
}
class StringDemo6
{
static String LTrim(String s)
{
String c = "";
int i=0;
while( s.charAt(i) == ' ' )
{
i++;
}
while(i<s.length())
{
c += s.charAt(i);
i++;
}
return c;
}
public static void main(String... s)
{
System.out.println(LTrim("    i am an indian"));
}
}
class StringDemo7
{
static String RTrim(String s)
{
s = StringDemo4.Reverse(s);
s = StringDemo6.LTrim(s);
s = StringDemo4.Reverse(s);
return s;
}
public static void main(String... s)
{
System.out.println(RTrim("    i am an indian    "));
}
}
class StringDemo8
{
static String AllTrim(String s)
{
s = StringDemo6.LTrim(s);
s = StringDemo7.RTrim(s);
return s;
}
public static void main(String... s)
{
System.out.println(AllTrim("    i am an indian"));
}
}