convert array to collection

import java.util.Arrays;
import java.util.List;
import java.util.Iterator;

public class ArraysExample
{
public static void main(String[] args)
{
String[] array = {"Happy", "New", "Year", "2006"};
List list = Arrays.asList(array);

Iterator iterator = list.iterator();
while (iterator.hasNext())
{
System.out.println((String) iterator.next());
}
}
}




output:


Happy
New
Year
2006

copy array(particular array elements incl.)

public class ArrayCopyDemo{
public static void main(String[] args){
char[] copyFrom = {'a','b','c','d','e','f','g','h','i','j'};
char[] copyTo = new char[5];
System.arraycopy(copyFrom, 2, copyTo, 0, 5);
System.out.println(new String (copyTo));
}
}



Output of the program:

C:\tamana>javac ArrayCopyDemo.java
C:\tamana>java ArrayCopyDemo
cdefg
C:\tamana

palindrome

public class Yo
{
public static void main(String[] args)
{
String string="yooy";//my palindrome word
String reverse = new StringBuffer(string).reverse().toString();
System.out.println("String before reverse: "+string);
System.out.println("String after reverse: "+reverse);
if(reverse.equals(string))
{System.out.println("it is a palindromepalindrome");}
}
}

to find size of array

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

int num[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
String days[] = {"Sunday","Monday","Tuesday", "Wednesday",
"Thursday","Friday","Saturday"};
System.out.println("size of num[]: " + num.length);
System.out.println("size of days[]: " + days.length);
}
}

get a string.....

import java.io.*;

public class GetUserInput {
public static void main (String[] args) {
System.out.print("Enter your name and press Enter: ");
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String name = null;
try {
name = br.readLine();
} catch (IOException e) {
System.out.println("Error!");
System.exit(1);
}
System.out.println("Your name is " + name);
}
}

find missing letters in a sentence

import java.util.Scanner;
class yo
{public static void main(String args[]){
String sentence;int len;int i=0;
Scanner in=new Scanner(System.in);
sentence=in.nextLine();
System.out.println("entered sentence is "+sentence);
len=sentence.length();
char alpha[]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
char miss[]=new char[2];System.out.println("length is"+len);
while(i{
{char letter;
letter=sentence.charAt(i);
for(int j=0;j<26;j++)
{if(letter==alpha[j]){alpha[j]=miss[0];}}i++;
}}
System.out.print("missing letters are");
for(i=0;i<26;i++)
{System.out.print(alpha[i]);}
}}

Nearest prime number

import java.util.Scanner;
public class yp{public static void main(String args[]){
int i,j,n;
Scanner in=new Scanner(System.in);
i=in.nextInt();
int value=1;
for(j=2;j<=i;j++)
{if(j==i){value=i;}if(i%j==0){i--;}}
System.out.println("nearest prime number is"+value);}
}

Factors

this pgm ll let u to find the factors of a given number......



import java.util.Scanner;
public class yp{public static void main(String args[]){
int i,j,n;
Scanner in=new Scanner(System.in);
i=in.nextInt();
for(j=1;j{
if(i%j==0)
{
System.out.println(j);
}
}
}
}

fibonacci series

this pgm asks u to enter a number.then it will display fibonacci series values....


import java.util.Scanner;
public class yp{public static void main(String args[]){
int n;int j=0;
Scanner in=new Scanner(System.in);
n=in.nextInt();
for(j=0;j}
public static int fibonacci(int n)
{
if(n==0||n==1)
{return 1;}
else
{return fibonacci(n-1)+fibonacci(n-2);}
}
}

string reverse

this pgm ll get a string form u and displays the string length then reverse string is display


import java.util.Scanner;
public class reverse_string{public static void main(String args[]){
String s;
Scanner in=new Scanner(System.in);
System.out.println("enter the string");s=in.nextLine();
int len=s.length();
System.out.println("length of string is"+len);int i;

while(len>0){
char yo=s.charAt(len-1);System.out.print(yo);len=len-1;}


}}