Skip to main content

Posts

Showing posts from June, 2018

Finding Second Highest element in an Array

package com.sbs.java8.praticse; public class SecondHightestClass { public static void main(String[] args) { final Integer[] intArray = { 10, 2, 36, 7, 29, 30, 100, 20, 90, 83, 87 }; final int n = intArray.length; int sortPointer = intArray.length; for (int m = n; m > (n - sortPointer); m--) { for (int i = 0; i < n - 1; i++) { int j = i + 1; if (intArray[i] > intArray[j]) { int temp = intArray[i]; intArray[i] = intArray[j]; intArray[j] = temp; } } sortPointer--; } System.out.println(intArray[n - 2]); } }

Anogram Java Program

package com.sbs.java8.praticse; import java.util.Arrays; public class AnagramClass { public static void main(String[] args) { String firstString = "1MASS1111124"; String secondString = "1SAMS1111124"; boolean status = false; if (validateString(firstString,secondString)) { char array1[] = firstString.toLowerCase().toCharArray(); char array2[] = secondString.toLowerCase().toCharArray(); Arrays.sort(array1); Arrays.sort(array2); status = Arrays.equals(array1, array2); } System.out.println("Anogram Status " + status); } private static boolean validateString(String string,String string2) { if (string == null || string.isEmpty()) { return false; } if (string2 == null || string2.isEmpty()) { return false; } if(string.length() != string2.length()){ return false; } return true; } }