1.

Sum of Longest ODD sequence in an array

public class SumOfLongestOddSeq {

public static void main(String[] args) {

// TODO Auto-generated method stub
//int []
a={13,15,12,18,18,14,5,12,13,32,33,5,1,77,78,79}
;
//int[] a={12,-13,15,10,11,-23,45,77,-
88,-1,5,3,7,-23,-49,-7};
//int[]
a={32,33,25,97,12,18,13,15,17,0,4,32,9,7,78,79};

int[]
a={32,30,20,98,12,18,12,16,18,0,4,32,8,6,78,80};

int i,sum=0,seq_count=0;

int longSeq = 0,longSum=0;

int evenc=0;

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

//odd
if(a[i] % 2 != 0){
sum = sum + a[i];
seq_count++;

if(seq_count == longSeq){
longSum = longSum + sum;
}
 if(seq_count > longSeq){
longSeq = seq_count;
longSum = sum;
}

//even
if(a[i] % 2 == 0)
{
sum = 0;
seq_count = 0;
evenc++;
}

}
if(evenc == a.length){
longSum = -1;
}

System.out.println("Longest ODD seq

Sum:"+longSum);

2. Find Password (Stable and Unstable)

import java.util.Arrays;

public class FindPassword_stable_unstable {

 public static void main(String[] args) {

int
input1=12,input2=1313,input3=122,input4=678,inpu
t5=898;

String num;

int sum=0;

int i;

int input[] =
{input1,input2,input3,input4,input5};

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

if(isStable(input[i]))
{
//stable
sum = sum + input[i];
}
else
{
//unstable
sum = sum - input[i];
}
}

System.out.println(sum);

private static boolean isStable(int num){

 int freq[] = new int[10];
Arrays.fill(freq, 0);
int firstVal = 0;

String s;
boolean stable = true;
//num = 1233
s = String.valueOf(num);

for(int p=0;p<s.length();p++){

freq[Integer.parseInt(String.valueOf(s.charA
t(p)))]++;
}

for(int i=0;i<freq.length;i++)
{
if(freq[i] > 0){
//get first non zero frequency
value and stop
firstVal = freq[i];
break;
}
}

for(int k=0;k<freq.length;k++){
if(freq[k] != 0 && freq[k] !=
firstVal){
stable = false;
break;
}
}

return stable;
 }