Find Password 1 – Wipro Sample Coding Question Solved – codewindow.in

import java.io.*;
import java.util.*;

class CodeWindow {
  public int findPassword(int input1, int input2, int input3, int input4, int input5) {
    ArrayList<Integer> arrStable = new ArrayList<Integer>(5);
    ArrayList<Integer> arrUnstable = new ArrayList<Integer>(5);

    if (stable_no(input1))
      arrStable.add(input1);
    else
      arrUnstable.add(input1);

    if (stable_no(input2))
      arrStable.add(input2);
    else
      arrUnstable.add(input2);

    if (stable_no(input3))
      arrStable.add(input3);
    else
      arrUnstable.add(input3);

    if (stable_no(input4))
      arrStable.add(input4);
    else
      arrUnstable.add(input4);

    if (stable_no(input5))
      arrStable.add(input5);
    else
      arrUnstable.add(input5);

    return Collections.max(arrStable) + Collections.min(arrUnstable);
  }

  static void frequency(int number, int[] result) {
    int temp = 0;
    while (number != 0) {
      temp = number % 10;
      if (temp < 0) {
        temp = -temp;
      }
      result[temp]++;
      number /= 10;
    }
  }

  static boolean stable_no(int number) {
    int[] result = new int[10];
    for (int i = 0; i < 10; ++i) {
      result[i] = 0;
    }
    int auxiliary = 0, status = 1;
    frequency(number, result);
    for (int i = 0; i < 10 && status == 1; ++i) {
      if (result[i] != 0) {
        if (auxiliary == 0) {
          auxiliary = result[i];
        } else if (auxiliary != result[i]) {
          status = 0;
        }
      }
    }
    if (status == 0) {
      return false;
    } else {
      return true;
    }
  }
}