Program: How to convert Array to List in java?

package com.java2novice.arrays;

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

public class ArraysToList {

public static void main(String a[]){

String[] strArr = {"JAVA", "C++", "PERL", "STRUTS", "PLAY"};
List<String> strList = Arrays.asList(strArr);
System.out.println("Created List Size: "+strList.size());
System.out.println(strList);
}
}
Output:
Created List Size: 5
[JAVA, C++, PERL, STRUTS, PLAY]

Program: How to find or search array elements by binary

search?
package com.java2novice.arrays;

import java.util.Arrays;

public class BinarySearchOnCharArray {

public static void main(String a[]){

char[] chrArr = {'a','c','d','y','e','q','b'};
int index = Arrays.binarySearch(chrArr, 0, chrArr.length-1, 'q');
System.out.println("Char 'q' index is: "+index);
}
}
Output:
Char 'q' index is: 5

Program: How to copy array and increase size

dynamically?
package com.java2novice.arrays;

import java.util.Arrays;

public class MyArrayCopy {

public static void main(String a[]){

 int[] myArr = {2,4,2,4,5,6,3};
System.out.println("Array size before copy: "+myArr.length);
int[] newArr = Arrays.copyOf(myArr, 10);
System.out.println("New array size after copying: "+newArr.length);
}
}
Output:
Array size before copy: 7
New array size after copying: 10

Program: How to copy range of elements from an

array?
package com.java2novice.arrays;

import java.util.Arrays;

public class MyArrayRangeCopy {

public static void main(String a[]){

int[] myArr = {2,4,2,4,5,6,3};

System.out.println("My array elements:\n");
for(int num:myArr){
System.out.print(num+" ");
}
int[] newArr = Arrays.copyOfRange(myArr, 1, 4);
System.out.println("\nMy new array elements:\n");
for(int num:newArr){
System.out.print(num+" ");
}
}
}
Output:
My array elements:

2 4 2 4 5 6 3
My new array elements:

4 2 4

Program: How to compare two arrays and confirm

they are equal?
package com.java2novice.arrays;

import java.util.Arrays;

public class MyArrayDeepEquals {

 public static void main(String a[]){
String[] strArr = {"JAVA", "C++", "PERL", "STRUTS", "PLAY"};
String[] strArrCopy = {"JAVA", "C++", "PERL", "STRUTS", "PLAY"};
System.out.println("Are strArr and strArrCopy same? "
+Arrays.deepEquals(strArr, strArrCopy));
String[] strArrMod = {"JAVA", "C++", "PERL", "STRUTS"};
System.out.println("Are strArr and strArrMod same? "
+Arrays.deepEquals(strArr, strArrMod));
}
}
Output:
Are strArr and strArrCopy same? true
Are strArr and strArrMod same? false

Program: How to fill an array with default values?

package com.java2novice.arrays;

import java.util.Arrays;

public class MyArrayFill {

public static void main(String a[]){

String[] myArr = new String[10];

Arrays.fill(myArr, "Assigned");
for(String str:myArr){
System.out.println(str);
}
}
}
Output:
Assigned
Assigned
Assigned
Assigned
Assigned
Assigned
Assigned
Assigned
Assigned
Assigned

Program: How to sort an array?

package com.java2novice.arrays;

import java.util.Arrays;

public class MyArraySort {

 public static void main(String a[]){

int[] myArr = {3,2,56,12,98,23,56};

Arrays.sort(myArr);
for(int str:myArr){
System.out.println(str);
}
}
}
Output:
2
3
12
23
56
56
98

Program: How to sort an array using comparator?

package com.java2novice.arrays;

import java.util.Arrays;
import java.util.Comparator;

public class MyStringArraySorting {

public static void main(String a[]){

String[] strArr = {"JAVA", "C++", "PERL", "STRUTS", "PLAY"};

Arrays.sort(strArr,new Comparator<String>(){

@Override
public int compare(String o1, String o2) {
return o1.compareTo(o2);
}});

for(String str:strArr){
System.out.println(str);
}
}
}
Output:
C++
JAVA
PERL
PLAY
STRUTS
Program: Example for singleton class using static
block.
Since static blocks will be called only once, we can use static blocks to develop singleton class. Below example
shows how to create singleton classes using static block. To create singleton class, make constructor as private, so
that you cannot create object outside of the class. Create a private static variable of same class type, so that created
object will be pointed to this reference. Now create static block, and create object inside static block. Since static
block will be called only once, the object will be created only once.

package com.java2novice.staticexmp;

public class MyStaticSingleton {

public static void main(String a[]){

MySingleton ms = MySingleton.getInstance();
ms.testSingleton();
}
}

class MySingleton{

private static MySingleton instance;

static{
instance = new MySingleton();
}

private MySingleton(){
System.out.println("Creating MySingleton object...");
}

public static MySingleton getInstance(){

return instance;
}

public void testSingleton(){

System.out.println("Hey.... Instance got created...");
}
}
Output:
Creating MySingleton object...
Hey.... Instance got created...

Program: Example for static block vs constructor.

Java static blocks will be called when JVM loads the class into memory, means it will be called only once. But
constructor will be called everytime when you create an object. The below example can give you an idea about
execution.

package com.java2novice.staticexmp;
public class MyStaticVsConstructor {

static {
System.out.println("I am in static block");
System.out.println("Static block will be called first than
constructor!!!");
System.out.println("Static block will be called only once.");
}

public MyStaticVsConstructor(){
System.out.println("I am in constructor");
}

public static void main(String a[]){

MyStaticVsConstructor ksv1 = new MyStaticVsConstructor();
MyStaticVsConstructor ksv2 = new MyStaticVsConstructor();
MyStaticVsConstructor ksv3 = new MyStaticVsConstructor();
MyStaticVsConstructor ksv4 = new MyStaticVsConstructor();
}
}
Output:
I am in static block
Static block will be called first than constructor!!!
Static block will be called only once.
I am in constructor
I am in constructor
I am in constructor
I am in constructor
Program: Basic Enum example.
This example defines a basic enum type called Fruits. It contains few constants representing fruits. The switch case
uses these constants to execute conditions.

package com.java2novice.enums;

public class MyBasicEnum {

private Fruits myFruit;

public MyBasicEnum(Fruits fruit){

this.myFruit = fruit;
}

public void getFruitDesc(){

switch (myFruit) {
case GRAPE:
System.out.println("A grape is a non-climacteric fruit.");
break;

case APPLE:
System.out.println("The apple is the pomaceous fruit.");
break;

case MANGO:
System.out.println("The mango is a fleshy stone fruit.");
break;

case LEMON:
System.out.println("Lemons are slow growing varieties of
citrus.");
break;

default:
System.out.println("No desc available.");
break;
}
}

public static void main(String a[]){

MyBasicEnum grape = new MyBasicEnum(Fruits.GRAPE);
grape.getFruitDesc();
MyBasicEnum apple = new MyBasicEnum(Fruits.APPLE);
apple.getFruitDesc();
MyBasicEnum lemon = new MyBasicEnum(Fruits.LEMON);
lemon.getFruitDesc();
MyBasicEnum guava = new MyBasicEnum(Fruits.GUAVA);
guava.getFruitDesc();
}
}

enum Fruits {
GRAPE, APPLE, MANGO, LEMON,GUAVA
}
Output:
A grape is a non-climacteric fruit.
The apple is the pomaceous fruit.
Lemons are slow growing varieties of citrus.
No desc available.

Program: How to call enum, which is defined

inside a class?
If you declare Enum is a member of a class, then by default it is static. You can access it with reference to enclosing
class.

package com.java2novice.enums;

public class MyEnumInsideClass {

private MyWrapper.Fruit myFruit;

public MyEnumInsideClass(MyWrapper.Fruit fruit){

this.myFruit = fruit;
}

public void getFruitDesc(){

switch (myFruit) {
case GRAPE:
System.out.println("A grape is a non-climacteric fruit.");
break;

case APPLE:
System.out.println("The apple is the pomaceous fruit.");
break;

case MANGO:
System.out.println("The mango is a fleshy stone fruit.");
break;

case LEMON:
System.out.println("Lemons are slow growing varieties of
citrus.");
break;

default:
System.out.println("No desc available.");
break;
 }
}

public static void main(String a[]){

MyEnumInsideClass grape = new
MyEnumInsideClass(MyWrapper.Fruit.GRAPE);
grape.getFruitDesc();
MyEnumInsideClass apple = new
MyEnumInsideClass(MyWrapper.Fruit.APPLE);
apple.getFruitDesc();
MyEnumInsideClass lemon = new
MyEnumInsideClass(MyWrapper.Fruit.LEMON);
lemon.getFruitDesc();
MyEnumInsideClass guava = new
MyEnumInsideClass(MyWrapper.Fruit.GUAVA);
guava.getFruitDesc();
}
}

class MyWrapper{

enum Fruit {
GRAPE, APPLE, MANGO, LEMON,GUAVA
}
}
Output:
A grape is a non-climacteric fruit.
The apple is the pomaceous fruit.
Lemons are slow growing varieties of citrus.
No desc available.

Program: How to override toString() method with

enum?
By default the enum toString() method returns the constant name itself.

package com.java2novice.enums;

public class MyEnumtoString {

enum Fruit {
GRAPE{
public String toString(){
return "A grape is a non-climacteric fruit.";
}
},
APPLE{
public String toString(){
return "The apple is the pomaceous fruit.";
}
},
MANGO{
public String toString(){
 return "The mango is a fleshy stone fruit.";
}
},
LEMON{
public String toString(){
return "Lemons are slow growing varieties of citrus.";
}
}
}

public static void main(String a[]){

System.out.println(Fruit.GRAPE);
System.out.println(Fruit.APPLE);
System.out.println(Fruit.MANGO);
}
}
Output:
A grape is a non-climacteric fruit.
The apple is the pomaceous fruit.
The mango is a fleshy stone fruit.

Program: How to create custom constructor

enum?
This example gives you how to create custom constructor for enum. The constructor should be either private or
default scope, should not be protected or public. All elements defined in the enum must call constructor.

package com.java2novice.enums;

public class MyEnumCustomConstructor {

enum Department{

ACCOUNT(12),HR(24),FINANCE(100),SECURITY(108);

private int deptId;

Department(int id){
deptId = id;
}

public int getDeptId(){

return deptId;
}
}

public static void main(String a[]){

System.out.println("Accounts dept
id:"+Department.ACCOUNT.getDeptId());
System.out.println("HR dept id:"+Department.HR.getDeptId());
 System.out.println("Security dept
id:"+Department.SECURITY.getDeptId());
}
}
Output:
Accounts dept id:12
HR dept id:24
Security dept id:108

Program: How to convert Integer to primitive

types?
package com.java2novice.wrapper.integer;

public class MyIngegerByteValue {

public static void main(String a[]){

Integer itr = new Integer(10);
System.out.println("byte value: "+itr.byteValue());
System.out.println("double value: "+itr.doubleValue());
System.out.println("float value: "+itr.floatValue());
System.out.println("int value: "+itr.intValue());
System.out.println("long value: "+itr.longValue());
System.out.println("short value: "+itr.shortValue());
}
}
Output:
byte value: 10
double value: 10.0
float value: 10.0
int value: 10
long value: 10
short value: 10

Program: How to get Integer maximum and

minimum value?
package com.java2novice.wrapper.integer;

public class MyIntegerMaxMinValue {

public static void main(String a[]){

System.out.println("Integer Max Value: "+Integer.MAX_VALUE);
System.out.println("Integer Min Value: "+Integer.MIN_VALUE);
}
}
Output:
Integer Max Value: 2147483647
Integer Min Value: -2147483648
Program: How to convert String to Integer value?
By using Integer.valueOf() method, we can convert String to Integer value.

package com.java2novice.wrapper.integer;

public class MyStringToInteger {

public static void main(String a[]){

String str = "23";
Integer i = Integer.valueOf(str);
System.out.println("The integer value: "+i);
}
}
Output:
The integer value: 23

Program: How to convert integer to binary value?

By using Integer.toBinaryString() method, we can convert integer string to binary value.

package com.java2novice.wrapper.integer;

public class MyIntegerToBinary {

public static void main(String a[]){

Integer i = new Integer(20);
String binary = Integer.toBinaryString(i);
System.out.println("Binary value: "+binary);
}
}
Output:
Binary value: 10100

Program: How to convert integer to hexadecimal

value?
package com.java2novice.wrapper.integer;

public class MyIntegerToHex {

public static void main(String a[]){

Integer i = new Integer(20);
String hex = Integer.toHexString(i);
System.out.println("Hex value: "+hex);
}
}
Output:
Hex value: 14

Program: How to convert integer to octal value?

package com.java2novice.wrapper.integer;

public class MyIntegerToOctal {

public static void main(String a[]){

Integer i = new Integer(20);
String octal = Integer.toOctalString(i);
System.out.println("Octal value: "+octal);
}
}
Output:
Octal value: 24

Program: How to convert binary value to integer

value?
package com.java2novice.wrapper.integer;

public class MyBinaryToInteger {

public static void main(String a[]){

String binary = "1101001";
Integer i = Integer.parseInt(binary,2);
System.out.println("Integer value: "+i);
}
}
Output:
Integer value: 105

Program: How to convert hexadecimal value to

integer value?
package com.java2novice.wrapper.integer;

public class MyHexToInteger {

public static void main(String a[]){

String hex = "FF23";
Integer i = Integer.parseInt(hex,16);
System.out.println("Integer value: "+i);
}
}
Output:
Integer value: 65315
Program: How to convert octal value to integer
value?
package com.java2novice.wrapper.integer;

public class MyOctalToInteger {

public static void main(String a[]){

String octal = "7786";
Integer i = Integer.parseInt(octal,9);
System.out.println("Integer value: "+i);
}
}
Output:
Integer value: 5748

Program: Primitive boolean constants.

package com.java2novice.wrapper.booleanexp;

public class MyBooleanConstants {

public static void main(String a[]){

System.out.println("Boolean object corresponding to the primitive
value false"
+Boolean.FALSE);
System.out.println("Boolean object corresponding to the primitive
value true"
+Boolean.TRUE);
}
}
Output:
Boolean object corresponding to the primitive value falsefalse
Boolean object corresponding to the primitive value truetrue

Program: How to get cube root of a value in java?

public class MyCubeRtEx {

public static void main(String a[]){

System.out.println("Cube root of 10: "+Math.cbrt(10));

System.out.println("Cube root of 625: "+Math.cbrt(625));
System.out.println("Cube root of 1090: "+Math.cbrt(1090));
}
}
Output:
Cube root of 10: 2.154434690031884
Cube root of 625: 8.549879733383484
Cube root of 1090: 10.291424665715065
Program: Find out middle index where sum of
both ends are equal.
package com.java2novice.algos;

public class FindMiddleIndex {

public static int findMiddleIndex(int[] numbers) throws Exception {

int endIndex = numbers.length - 1;

int startIndex = 0;
int sumLeft = 0;
int sumRight = 0;
while (true) {
if (sumLeft > sumRight) {
sumRight += numbers[endIndex--];
} else {
sumLeft += numbers[startIndex++];
}
if (startIndex > endIndex) {
if (sumLeft == sumRight) {
break;
} else {
throw new Exception(
"Please pass proper array to match the
requirement");
}
}
}
return endIndex;
}

public static void main(String a[]) {

int[] num = { 2, 4, 4, 5, 4, 1 };
try {
System.out.println("Starting from index 0, adding numbers till
index "
+ findMiddleIndex(num) + " and");
System.out.println("adding rest of the numbers can be equal");
} catch (Exception ex) {
System.out.println(ex.getMessage());
}
}
}
Program: Write a singleton class.
package com.java2novice.algos;

public class MySingleton {

private static MySingleton myObj;

static{
myObj = new MySingleton();
}

private MySingleton(){

public static MySingleton getInstance(){

return myObj;
}

public void testMe(){

System.out.println("Hey.... it is working!!!");
}

public static void main(String a[]){

MySingleton ms = getInstance();
ms.testMe();
}
}

Program: Write a program to create deadlock

between two threads.
package com.java2novice.algos;

public class MyDeadlock {

String str1 = "Java";

String str2 = "UNIX";

Thread trd1 = new Thread("My Thread 1"){

public void run(){
while(true){
synchronized(str1){
synchronized(str2){
System.out.println(str1 + str2);
}
}
}
}
 };

Thread trd2 = new Thread("My Thread 2"){

public void run(){
while(true){
synchronized(str2){
synchronized(str1){
System.out.println(str2 + str1);
}
}
}
}
};

public static void main(String a[]){

MyDeadlock mdl = new MyDeadlock();
mdl.trd1.start();
mdl.trd2.start();
}
}

Program: Write a program to reverse a string

using recursive algorithm.
package com.java2novice.algos;

public class StringRecursiveReversal {

String reverse = "";

public String reverseString(String str){

if(str.length() == 1){
return str;
} else {
reverse += str.charAt(str.length()-1)
+reverseString(str.substring(0,str.length()-1));
return reverse;
}
}

public static void main(String a[]){

StringRecursiveReversal srr = new StringRecursiveReversal();
System.out.println("Result: "+srr.reverseString("Java2novice"));
}
}
Program: Write a program to convert decimal
number to binary format.
package com.java2novice.algos;

public class DecimalToBinary {

 public void printBinaryFormat(int number){
int binary[] = new int[25];
int index = 0;
while(number > 0){
binary[index++] = number%2;
number = number/2;
}
for(int i = index-1;i >= 0;i--){
System.out.print(binary[i]);
}
}

public static void main(String a[]){

DecimalToBinary dtb = new DecimalToBinary();
dtb.printBinaryFormat(25);
}
}
Program: Write a program to find perfect number
or not.
Description:
A perfect number is a positive integer that is equal to the sum
of its proper positive divisors, that is, the sum of its positive
divisors excluding the number itself. Equivalently, a perfect number
is a number that is half the sum of all of its positive divisors.
The first perfect number is 6, because 1, 2 and 3 are its proper
positive divisors, and 1 + 2 + 3 = 6. Equivalently, the number 6
is equal to half the sum of all its positive divisors:
( 1 + 2 + 3 + 6 ) / 2 = 6.
package com.java2novice.algos;

public class IsPerfectNumber {

public boolean isPerfectNumber(int number){

int temp = 0;
for(int i=1;i<=number/2;i++){
if(number%i == 0){
temp += i;
}
}
if(temp == number){
System.out.println("It is a perfect number");
return true;
} else {
System.out.println("It is not a perfect number");
return false;
}
}

public static void main(String a[]){

IsPerfectNumber ipn = new IsPerfectNumber();
System.out.println("Is perfect number: "+ipn.isPerfectNumber(28));
 }
}

Program: Write a program to implement

ArrayList.

package com.java2novice.algos;

import java.util.Arrays;

public class MyArrayList {

private Object[] myStore;

private int actSize = 0;

public MyArrayList(){
myStore = new Object[10];
}

public Object get(int index){

if(index < actSize){
return myStore[index];
} else {
throw new ArrayIndexOutOfBoundsException();
}
}

public void add(Object obj){

if(myStore.length-actSize <= 5){
increaseListSize();
}
myStore[actSize++] = obj;
}

public Object remove(int index){

if(index < actSize){
Object obj = myStore[index];
myStore[index] = null;
int tmp = index;
while(tmp < actSize){
myStore[tmp] = myStore[tmp+1];
myStore[tmp+1] = null;
tmp++;
}
actSize--;
return obj;
} else {
throw new ArrayIndexOutOfBoundsException();
}

}
 public int size(){
return actSize;
}

private void increaseListSize(){

myStore = Arrays.copyOf(myStore, myStore.length*2);
System.out.println("\nNew length: "+myStore.length);
}

public static void main(String a[]){

MyArrayList mal = new MyArrayList();
mal.add(new Integer(2));
mal.add(new Integer(5));
mal.add(new Integer(1));
mal.add(new Integer(23));
mal.add(new Integer(14));
for(int i=0;i<mal.size();i++){
System.out.print(mal.get(i)+" ");
}
mal.add(new Integer(29));
System.out.println("Element at Index 5:"+mal.get(5));
System.out.println("List size: "+mal.size());
System.out.println("Removing element at index 2: "+mal.remove(2));
for(int i=0;i<mal.size();i++){
System.out.print(mal.get(i)+" ");
}
}
}

Program: Write a program to find maximum

repeated words from a file.
package com.java2novice.algos;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.Map.Entry;

public class MaxDuplicateWordCount {

 public Map<String, Integer> getWordCount(String fileName){

FileInputStream fis = null;

DataInputStream dis = null;
BufferedReader br = null;
Map<String, Integer> wordMap = new HashMap<String, Integer>();
try {
fis = new FileInputStream(fileName);
dis = new DataInputStream(fis);
br = new BufferedReader(new InputStreamReader(dis));
String line = null;
while((line = br.readLine()) != null){
StringTokenizer st = new StringTokenizer(line, " ");
while(st.hasMoreTokens()){
String tmp = st.nextToken().toLowerCase();
if(wordMap.containsKey(tmp)){
wordMap.put(tmp, wordMap.get(tmp)+1);
} else {
wordMap.put(tmp, 1);
}
}
}
} catch (FileNotFoundException e) {
e.printStackTrace();
} catch (IOException e) {
e.printStackTrace();
} finally{
try{if(br != null) br.close();}catch(Exception ex){}
}
return wordMap;
}

public List<Entry<String, Integer>> sortByValue(Map<String, Integer>

wordMap){

Set<Entry<String, Integer>> set = wordMap.entrySet();

List<Entry<String, Integer>> list = new ArrayList<Entry<String,
Integer>>(set);
Collections.sort( list, new Comparator<Map.Entry<String, Integer>>()
{
public int compare( Map.Entry<String, Integer> o1,
Map.Entry<String, Integer> o2 )
{
return (o2.getValue()).compareTo( o1.getValue() );
}
} );
return list;
}

public static void main(String a[]){

MaxDuplicateWordCount mdc = new MaxDuplicateWordCount();
Map<String, Integer> wordMap = mdc.getWordCount("C:/MyTestFile.txt");
List<Entry<String, Integer>> list = mdc.sortByValue(wordMap);
for(Map.Entry<String, Integer> entry:list){
System.out.println(entry.getKey()+" ==== "+entry.getValue());
}
 }
}

Program: Write a program to find out duplicate

characters in a string.

package com.java2novice.algos;

import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class DuplicateCharsInString {

public void findDuplicateChars(String str){

Map<Character, Integer> dupMap = new HashMap<Character, Integer>();

char[] chrs = str.toCharArray();
for(Character ch:chrs){
if(dupMap.containsKey(ch)){
dupMap.put(ch, dupMap.get(ch)+1);
} else {
dupMap.put(ch, 1);
}
}
Set<Character> keys = dupMap.keySet();
for(Character ch:keys){
if(dupMap.get(ch) > 1){
System.out.println(ch+"--->"+dupMap.get(ch));
}
}
}

public static void main(String a[]){

DuplicateCharsInString dcs = new DuplicateCharsInString();
dcs.findDuplicateChars("Java2Novice");
}
}

Program: Write a program to find top two

maximum numbers in a array.
package com.java2novice.algos;

public class TwoMaxNumbers {

 public void printTwoMaxNumbers(int[] nums){
int maxOne = 0;
int maxTwo = 0;
for(int n:nums){
if(maxOne < n){
maxTwo = maxOne;
maxOne =n;
} else if(maxTwo < n){
maxTwo = n;
}
}
System.out.println("First Max Number: "+maxOne);
System.out.println("Second Max Number: "+maxTwo);
}

public static void main(String a[]){

int num[] = {5,34,78,2,45,1,99,23};
TwoMaxNumbers tmn = new TwoMaxNumbers();
tmn.printTwoMaxNumbers(num);
}
}

Program: Write a program to sort a map by value.

package com.java2novice.algos;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Map.Entry;

public class OrderByValue {

public static void main(String a[]){

Map<String, Integer> map = new HashMap<String, Integer>();
map.put("java", 20);
map.put("C++", 45);
map.put("Java2Novice", 2);
map.put("Unix", 67);
map.put("MAC", 26);
map.put("Why this kolavari", 93);
Set<Entry<String, Integer>> set = map.entrySet();
List<Entry<String, Integer>> list = new ArrayList<Entry<String,
Integer>>(set);
Collections.sort( list, new Comparator<Map.Entry<String, Integer>>()
{
public int compare( Map.Entry<String, Integer> o1,
Map.Entry<String, Integer> o2 )
{
 return (o2.getValue()).compareTo( o1.getValue() );
}
} );
for(Map.Entry<String, Integer> entry:list){
System.out.println(entry.getKey()+" ==== "+entry.getValue());
}
}
}

Program: Write a program to find common

elements between two arrays.
package com.java2novice.algos;

public class CommonElementsInArray {

public static void main(String a[]){

int[] arr1 = {4,7,3,9,2};
int[] arr2 = {3,2,12,9,40,32,4};
for(int i=0;i<arr1.length;i++){
for(int j=0;j<arr2.length;j++){
if(arr1[i]==arr2[j]){
System.out.println(arr1[i]);
}
}
}
}
}

Program: Write a program to find sum of each

digit in the given number using recursion.
package com.java2novice.algos;

public class MyNumberSumRec {

int sum = 0;

public int getNumberSum(int number){

if(number == 0){
return sum;
} else {
sum += (number%10);
getNumberSum(number/10);
}
return sum;
}
 public static void main(String a[]){
MyNumberSumRec mns = new MyNumberSumRec();
System.out.println("Sum is: "+mns.getNumberSum(223));
}
}

Program: Write a program to check the given

number is a prime number or not?
package com.java2novice.algos;

public class MyPrimeNumCheck {

public boolean isPrimeNumber(int number){

for(int i=2; i<=number/2; i++){

if(number % i == 0){
return false;
}
}
return true;
}

public static void main(String a[]){

MyPrimeNumCheck mpc = new MyPrimeNumCheck();
System.out.println("Is 17 prime number? "+mpc.isPrimeNumber(17));
System.out.println("Is 19 prime number? "+mpc.isPrimeNumber(19));
System.out.println("Is 15 prime number? "+mpc.isPrimeNumber(15));
}
}

Program: Write a program to find the given

number is Armstrong number or not?

package com.java2novice.algos;

public class MyArmstrongNumber {

public boolean isArmstrongNumber(int number){

int tmp = number;

int noOfDigits = String.valueOf(number).length();
int sum = 0;
int div = 0;
while(tmp > 0)
{
div = tmp % 10;
int temp = 1;
for(int i=0;i<noOfDigits;i++){
 temp *= div;
}
sum += temp;
tmp = tmp/10;
}
if(number == sum) {
return true;
} else {
return false;
}
}

public static void main(String a[]){

MyArmstrongNumber man = new MyArmstrongNumber();
System.out.println("Is 371 Armstrong number?
"+man.isArmstrongNumber(371));
System.out.println("Is 523 Armstrong number?
"+man.isArmstrongNumber(523));
System.out.println("Is 153 Armstrong number?
"+man.isArmstrongNumber(153));
}
}

Program: Write a program to convert binary to

decimal number.
package com.java2novice.algos;

public class BinaryToDecimal {

public int getDecimalFromBinary(int binary){

int decimal = 0;
int power = 0;
while(true){
if(binary == 0){
break;
} else {
int tmp = binary%10;
decimal += tmp*Math.pow(2, power);
binary = binary/10;
power++;
}
}
return decimal;
}

public static void main(String a[]){

BinaryToDecimal bd = new BinaryToDecimal();
System.out.println("11 ===> "+bd.getDecimalFromBinary(11));
System.out.println("110 ===> "+bd.getDecimalFromBinary(110));
System.out.println("100110 ===> "+bd.getDecimalFromBinary(100110));
}
}
Program: Write a program to check the given
number is binary number or not?
package com.java2novice.algos;

public class MyBinaryCheck {

public boolean isBinaryNumber(int binary){

boolean status = true;

while(true){
if(binary == 0){
break;
} else {
int tmp = binary%10;
if(tmp > 1){
status = false;
break;
}
binary = binary/10;
}
}
return status;
}

public static void main(String a[]){

MyBinaryCheck mbc = new MyBinaryCheck();
System.out.println("Is 1000111
binary? :"+mbc.isBinaryNumber(1000111));
System.out.println("Is 10300111
binary? :"+mbc.isBinaryNumber(10300111));
}
}
Program: Write a program for Bubble Sort in java.

package com.java2novice.algos;

public class MyBubbleSort {

// logic to sort the elements

public static void bubble_srt(int array[]) {
int n = array.length;
int k;
for (int m = n; m >= 0; m--) {
for (int i = 0; i < n - 1; i++) {
k = i + 1;
if (array[i] > array[k]) {
swapNumbers(i, k, array);
}
}
printNumbers(array);
 }
}

private static void swapNumbers(int i, int j, int[] array) {

int temp;
temp = array[i];
array[i] = array[j];
array[j] = temp;
}

private static void printNumbers(int[] input) {

for (int i = 0; i < input.length; i++) {

System.out.print(input[i] + ", ");
}
System.out.println("\n");
}

public static void main(String[] args) {

int[] input = { 4, 2, 9, 6, 23, 12, 34, 0, 1 };
bubble_srt(input);

}
}

Program: Write a program for Insertion Sort in

java.
package com.java2novice.algos;

public class MyInsertionSort {

public static void main(String[] args) {

int[] input = { 4, 2, 9, 6, 23, 12, 34, 0, 1 };

insertionSort(input);
}

private static void printNumbers(int[] input) {

for (int i = 0; i < input.length; i++) {

System.out.print(input[i] + ", ");
}
System.out.println("\n");
}

public static void insertionSort(int array[]) {

int n = array.length;
for (int j = 1; j < n; j++) {
int key = array[j];
int i = j-1;
 while ( (i > -1) && ( array [i] > key ) ) {
array [i+1] = array [i];
i--;
}
array[i+1] = key;
printNumbers(array);
}
}
}

Program: How to get distinct elements from an

array by avoiding duplicate elements?
package com.java2novice.algos;

public class MyDisticntElements {

public static void printDistinctElements(int[] arr){

for(int i=0;i<arr.length;i++){
boolean isDistinct = false;
for(int j=0;j<i;j++){
if(arr[i] == arr[j]){
isDistinct = true;
break;
}
}
if(!isDistinct){
System.out.print(arr[i]+" ");
}
}
}

public static void main(String a[]){

int[] nums = {5,2,7,2,4,7,8,2,3};

MyDisticntElements.printDistinctElements(nums);
}
}

Program: Write a program to convert string to

number without using Integer.parseInt() method.

package com.java2novice.algos;

public class MyStringToNumber {

public static int convert_String_To_Number(String numStr){

 char ch[] = numStr.toCharArray();
int sum = 0;
//get ascii value for zero
int zeroAscii = (int)'0';
for(char c:ch){
int tmpAscii = (int)c;
sum = (sum*10)+(tmpAscii-zeroAscii);
}
return sum;
}

public static void main(String a[]){

System.out.println("\"3256\" == "+convert_String_To_Number("3256"));
System.out.println("\"76289\" == "+convert_String_To_Number("76289"));
System.out.println("\"90087\" == "+convert_String_To_Number("90087"));
}
}

Program: Write a program to find two lines with

max characters in descending order.
package com.longest.lines;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Comparator;
import java.util.Set;
import java.util.TreeSet;

public class Main {

public static void main(String[] args) {

BufferedReader br = null;
String filePath = args[0];
int topList = 0;
Set<Entries> liSet = new TreeSet<Entries>(new MyComp());
try {
br = new BufferedReader(new FileReader(new File(filePath)));
String line = br.readLine();
topList = Integer.parseInt(line.trim());
while((line = br.readLine()) != null){
line = line.trim();
if(!"".equals(line)){
liSet.add(new Entries(line.length(), line));
}
}
int count = 0;
for(Entries ent:liSet){
 System.out.println(ent.line);
if(++count == topList){
break;
}
}
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}

public static class Entries{

Integer length;
String line;
public Entries(Integer l,String line){
length = l;
this.line = line;
}
}

public static class MyComp implements Comparator<Entries>{

@Override
public int compare(Entries e1, Entries e2) {
if(e2.length > e1.length){
return 1;
} else {
return -1;
}
}

}
}

Program: Write a program to find the sum of the

first 1000 prime numbers.
package com.primesum;

public class Main {

public static void main(String args[]){

int number = 2;
int count = 0;
long sum = 0;
while(count < 1000){
if(isPrimeNumber(number)){
sum += number;
count++;
 }
number++;
}
System.out.println(sum);
}

private static boolean isPrimeNumber(int number){

for(int i=2; i<=number/2; i++){

if(number % i == 0){
return false;
}
}
return true;
}
}

Program: Find longest substring without repeating

characters
package com.java2novice.algos;

import java.util.HashSet;
import java.util.Set;

public class MyLongestSubstr {

private Set<String> subStrList = new HashSet<String>();

private int finalSubStrSize = 0;

public Set<String> getLongestSubstr(String input){

//reset instance variables
subStrList.clear();
finalSubStrSize = 0;
// have a boolean flag on each character ascii value
boolean[] flag = new boolean[256];
int j = 0;
char[] inputCharArr = input.toCharArray();
for (int i = 0; i < inputCharArr.length; i++) {
char c = inputCharArr[i];
if (flag[c]) {
extractSubString(inputCharArr,j,i);
for (int k = j; k < i; k++) {
if (inputCharArr[k] == c) {
j = k + 1;
break;
}
flag[inputCharArr[k]] = false;
}
} else {
 flag[c] = true;
}
}
extractSubString(inputCharArr,j,inputCharArr.length);
return subStrList;
}

private String extractSubString(char[] inputArr, int start, int end){

StringBuilder sb = new StringBuilder();

for(int i=start;i<end;i++){
sb.append(inputArr[i]);
}
String subStr = sb.toString();
if(subStr.length() > finalSubStrSize){
finalSubStrSize = subStr.length();
subStrList.clear();
subStrList.add(subStr);
} else if(subStr.length() == finalSubStrSize){
subStrList.add(subStr);
}

return sb.toString();
}

public static void main(String a[]){

MyLongestSubstr mls = new MyLongestSubstr();
System.out.println(mls.getLongestSubstr("java2novice"));
System.out.println(mls.getLongestSubstr("java_language_is_sweet"));
System.out.println(mls.getLongestSubstr("java_java_java_java"));
System.out.println(mls.getLongestSubstr("abcabcbb"));
}
}

Program: Write a program to remove duplicates

from sorted array.
package com.java2novice.algos;

public class MyDuplicateElements {

public static int[] removeDuplicates(int[] input){

int j = 0;
int i = 1;
//return if the array length is less than 2
if(input.length < 2){
return input;
}
while(i < input.length){
if(input[i] == input[j]){
i++;
}else{
 input[++j] = input[i++];
}
}
int[] output = new int[j+1];
for(int k=0; k<output.length; k++){
output[k] = input[k];
}

return output;
}

public static void main(String a[]){

int[] input1 = {2,3,6,6,8,9,10,10,10,12,12};
int[] output = removeDuplicates(input1);
for(int i:output){
System.out.print(i+" ");
}
}
}