P R I N T A L P H A B E T S

package org.interview.test;

public class PrintAlphabets {

public static void main(String [] args) throws Exception {
char x = 'a';

for (x ='a'; x <= 'z' ; x++) {
System.out.print(x);
}
System.out.println();

char y = 'a';
while (y <= 'z') {
System.out.print(y);
y++;
}

System.out.println();

char c = 'a';
do {
System.out.print(c);
c++;
} while (c <= 'z');
}
}

L I N E A R S E A R C H

package org.interview.test;

import java.util.Scanner;

/**
 * Above code locate first instance of element to found, you can modify it for multiple 
 * occurrence of same element and count how many times it occur in the list. 
 * Similarly you can find if an alphabet is present in a string.
 *
 */
public class LinearSearch {

public static void main (String [] args) throws Exception {
int c, n, search, array[];
 
   Scanner in = new Scanner(System.in);
   System.out.println("Enter number of elements");
   n = in.nextInt(); 
   array = new int[n];
 
   System.out.println("Enter " + n + " integers");
 
   for (c = 0; c < n; c++)
     array[c] = in.nextInt();
 
   System.out.println("Enter value to find");
   search = in.nextInt();
 
   for (c = 0; c < n; c++)
   {
     if (array[c] == search)     /* Searching element is present */
     {
        System.out.println(search + " is present at location " + (c + 1) + ".");
         break;
     }
  }
  if (c == n)  /* Searching element is absent */
     System.out.println(search + " is not present in array.");
}
}

S Y S T E M C O M M A N D S

package org.interview.test;

import java.net.InetAddress;
import java.util.Random;

public class SystemCommands {

public static void main (String [] args) throws Exception {
Runtime rt = Runtime.getRuntime();
//rt.exec("notepad");
//rt.exec("mspaint");

System.out.println("Free memory in JVM before Garbage Collection = "+rt.freeMemory());
   rt.gc();
   System.out.println("Free memory in JVM after Garbage Collection = "+rt.freeMemory());
     System.out.println(InetAddress.getLocalHost());
     
     int c;
     Random t = new Random();
  
     // random integers in [0, 100]
  
     for (c = 1; c <= 10; c++) {
       System.out.println(t.nextInt(100));
     }
     
}
}

P R I M E N U M B E R

package org.interview.test;

import java.util.ArrayList;
import java.util.List;

public class PrimeNumbers {


public static void main(String [] args) throws Exception {
PrimeNumbers pn = new PrimeNumbers();
int number =18;
List<Integer> l = new ArrayList<Integer>();
for(int i=2; i< number; i++){
if(pn.isPrime(i)) {
l.add(i);
}
}
System.out.println("IsPrime:" + l);


}


// Find prime number from a number.
public boolean isPrime(int number) {
for (int i=2; i< number; i++){
if(number%i == 0){
return false;
}
}
return true;
}

}

P A L I N D R O M E

package org.interview.test;

import java.util.Scanner;

public class Palindrome {

public static void main(String [] args) throws Exception {
String original , reverse = "";
Scanner sc = new Scanner(System.in);
System.out.println("Enter:" );
original = sc.next();

int length = original.length();

System.out.println("Length:"+length);

for(int i =length-1; i >= 0; i--) {
reverse = reverse + original.charAt(i);
}

System.out.println("Reverse:"+ reverse);

if(original.equals(reverse)) {
System.out.println(original+" - is palindrome of - " + reverse);
}
}

}

= = = = = = = = = = = = = = = = = Reverse String recursive and iterative = = = = = = = = = = = = = = = = = = = = = 

package com.test;

import java.io.FileNotFoundException;
import java.io.IOException;

public class StringReverseExample {

    public static void main(String args[]) throws FileNotFoundException, IOException {

        //original string
        String str = "Sony is going to introduce Internet TV soon";
        System.out.println("Original String: " + str);

        //reversed string using Stringbuffer
        String reverseStr = new StringBuffer(str).reverse().toString();
        System.out.println("Reverse String in Java using StringBuffer: " + reverseStr);

        //iterative method to reverse String in Java
        reverseStr = reverse(str);
        System.out.println("Reverse String in Java using Iteration: " + reverseStr);

        //recursive method to reverse String in Java
        reverseStr = reverseRecursively(str);
        System.out.println("Reverse String in Java using Recursion: " + reverseStr);

    }

    public static String reverse(String str) {
        StringBuilder strBuilder = new StringBuilder();
        char[] strChars = str.toCharArray();

        for (int i = strChars.length - 1; i >= 0; i--) {
            strBuilder.append(strChars[i]);
        }

        return strBuilder.toString();
    }

    public static String reverseRecursively(String str) {

        //base case to handle one char string and empty string
        if (str.length() < 2) {
            return str;
        }

        return reverseRecursively(str.substring(1)) + str.charAt(0);

    }
}

Largest Number

package org.interview.test;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class LargestNumber {

public static void main (String [] args ) throws Exception {

List<Integer> il = new ArrayList<Integer>();

Scanner sc = new Scanner(System.in);

int i;
do{
i  = sc.nextInt();
il.add(i);
} while (i != -1);
System.out.println("List:"+il);

for (int in : il) {
if (in > i)
i = in;
}

System.out.println("Largest Number:"+ i);


}
}

Floyd Triangle

package org.interview.test;

import java.util.Scanner;

public class FloydTriangle {

/*
*In Floyd triangle there are n integers in the nth row and a total of (n(n+1))/2 integers 
*in n rows. This is a simple pattern to print but helpful in learning how to create other 
*patterns. Key to develop pattern is using nested loops appropriately.
*/
public static void main (String [] args) throws Exception {
int n, num = 1, c, d;
     Scanner in = new Scanner(System.in);
 
     System.out.println("Enter the number of rows of floyd's triangle you want");
     n = in.nextInt();
 
     System.out.println("Floyd's triangle :-");
 
     for ( c = 1 ; c <= n ; c++ )
     {
        for ( d = 1 ; d <= c ; d++ )
        {
           System.out.print(num+" ");
           num++;
        }
 
        System.out.println();
     }
}
}