1) Identify Possible Words:

https://tests.mettl.com/authenticateKey/13486c16

public class IdentifyPossibleWords {

static String PossibleWords(String input1,String input2)
{
int i,j;
input1 = input1.toUpperCase();
input2 = input2.toUpperCase();
String word="", res="";
String[] words = input2.split(":");
for(i=0;i<words.length;i++)
{
word = words[i];
if(input1.length()==word.length())
{
for(j=0;j<input1.length();j++)
{
if(input1.charAt(j)!='_' && input1.charAt(j)!=word.charAt(j))
{
break;
}
}
if(j==input1.length())
{
res=res + word+":";
}
}
}
return res.length()==0?"ERROR-009":res.substring(0,res.length()-1);
}
public static void main(String[] args) {
String fin = PossibleWords("Fi_er","Fixer:Filer:fiber:fibre:tailor:offer");
System.out.println(fin);
}
}

2) 2nd Word UpperCase:

https://tests.mettl.com/authenticateKey/4a72723f

public class Second_upper {

public static String Upper(String s)
{
String str = s;
String ch[] = str.split(" ");
//int len =str.length();
return ch[1].toUpperCase();

}
public static void main(String[] args) {
String res =Upper("Hello welcome guys");
System.out.println(res);
 }
}

3) IsPalinStr
https://tests.mettl.com/authenticateKey/ffe8042
//Write a program to accept a String from the command prompt and display whether the string
is a palindrome or not.
class Pali2{
public static void main(String[] args) {

String s = "fad";
int len = s.length();
String rev = "";

for (int i = len-1; i>=0; i--) {

rev=rev+s.charAt(i);
}
System.out.println(rev);
if(s.equals(rev))
{
System.out.println("Palindrome");
}
else
{
System.out.println("Not a Palindrome");
}
}
}
4) WeightOfString:
https://tests.mettl.com/authenticateKey/387952fc

import java.io.*;
import java.util.*;
class WeightOfString
{
public static int Weight(String input1,int input2)
{
String str=input1.toUpperCase();
int sum=0;
for(int i=0;i<input1.length();i++)
{
if(input2==0)
 {
if(str.charAt(i)=='A' || str.charAt(i)=='E' ||str.charAt(i)=='I' || str.charAt(i)=='O' ||
str.charAt(i)=='U' || !Character.isLetter(str.charAt(i)))
{
continue;
}
else
{
int a=str.charAt(i)-64;
sum+=a;
}
}
else
{
if(!Character.isLetter(str.charAt(i)))
continue;
else
{
int a=str.charAt(i)-64;
sum+=a;
}
}
}
return sum;
}
public static void main(String[] args) {
int res =Weight("Hello",0);
System.out.println(res);
}
}
5) MostFrequentDigit
https://tests.mettl.com/authenticateKey/916310b8

Logic 1:
public class MostRepDigit
{
public static void main(String[] args) {
int a=222, b = 312, c = 300,d = 100; //233233
String st = String.valueOf(a)+String.valueOf(b)+String.valueOf(c)
+String.valueOf(d);
System.out.println(st);
int len = st.length();
int[] freq =new int[10];//0 to 9
for(int i = 0;i<len;i++)
{
 int digit = st.charAt(i) - '0';
freq[digit]++;
}
/*for(int i=0;i<10;i++)
{
System.out.println(freq[i]);
}*/
int max = freq[0];
for(int i=0;i<10;i++)
{
if(max<freq[i])
{
max = freq[i];
}
}
System.out.println("Number of repeatitons of a number: "+max);
int collect=0;
for(int i=0;i<10;i++)
{
if(freq[i]==max)
{
collect = i;
System.out.println("Most Frequent Value: "+collect);
}

}
}
Logic 2:

class Frequncy{
public static void main(String args[]){
int w=222,v=312,c=300,d=100;
int b[]={w,v,c,d};
int a[]=new int[50];
int y[]=new int[10];
int k=0;
for(int i=0;i<b.length;i++)
while(b[i]>0){
int x=b[i]%10;
a[k]=x;
k++;
b[i]=b[i]/10;
}
for(int i=0;i<k;i++){
for(int j=0;j<10;j++){
if(a[i]==j)
y[j]++;
}

}
int max=y[0];
for(int i=1;i<y.length;i++)
{
if(max<y[i])
max=y[i];
}
for(int i=0;i<y.length;i++)
{
if(max==y[i])
System.out.println(i);

}
}
}
6) UserIdGeneration:
https://tests.mettl.com/authenticateKey/592740f3

class PasswordSmallerLargerNumber {
public static String passw(String input1,String input2,int input3,int input4)
{
String s1 = input1;
String s2 =input2;
int m = input3;
int N= input4;
String longer = "",smaller="";
if(s1.length()>s2.length())
{
longer =s1;
smaller =s2;
}
else
{
smaller = s1;
longer = s2;
}
if(s1.length()==s2.length())
{
if(s1.compareTo(s2)>0)
{
longer = s1;
smaller =s2;
}
else
{
smaller =s1;
longer = s2;
}
}
String num = String.valueOf(m);
String result ="";

String r = smaller.charAt(smaller.length()-
1)+longer+num.charAt(N-1)+num.charAt(num.length()-N);
for(int i=0;i<r.length();i++)
{
 if(Character.isLowerCase(r.charAt(i)))
{
result = result+Character.toUpperCase(r.charAt(i));
}
else
{
result = result+Character.toLowerCase(r.charAt(i));
}
}
return result;
}
public static void main(String[] args) {
String res = passw("Hanu","Ram",5647,2);
System.out.println(res);
}
}

7) FindPasswordStableUnstable:
https://tests.mettl.com/authenticateKey/5106dfd

class PasswordStableUnstable {
public static int password(int input1,int input2,int input3,int input4, int
input5)
{
int[] arr = {input1,input2,input3,input4,input5};
int stable=0,unstable=0;
for(int i =0;i<arr.length;i++)
{
int[] freq = new int[10];
int arr1 = arr[i];
int max=0;
while(arr1>0)
{
int e =arr1%10;
freq[e]++;
arr1=arr1/10;
if(freq[e]>max) // 0 0 2 0 0 0 0 2 //max=2
{
max = freq[e];
}
}
int l;
for(l=0;l<10;l++)
{
if(freq[l]!=0 && freq[l]!=max)
{
break;
}
}

if(l==10)
{
stable+=arr[i];
}
 else
{
unstable+=arr[i];
}

}
return (stable - unstable);
}
public static void main(String[] args) {
int pass = password(455,257,3300,110,303);
System.out.println(pass);
}
}

8) WeightHillPattern:
https://tests.mettl.com/authenticateKey/d612c0e6

public class HillsPattern {

public static int totalHillWeight(int input1,int input2,int input3)
{
int sum=0;
for(int i = 0;i<input1;i++)
{
for(int j=0;j<=i;j++)
{
sum = sum+input2;
}
input2 = input2+input3;
}
return sum;
}

public static void main(String[] args) {

int t = totalHillWeight(4,1,5);
System.out.println(t);
}
}

9) SumOfPowerOfDigits:
https://tests.mettl.com/authenticateKey/92437794

10) CyclicOrder:
https://tests.mettl.com/authenticateKey/1ddbe65e

11) QuadraticRoots:
12) FindNumberOfProblems:

13) Nth Fibonacii:

 public class Demo{
static int fibo(int num){
int first = 0, second = 1, temp;
if (num == 0)
return first;
if (num == 1)
return second;
for (int i = 2; i <= num; i++){
temp = first + second;
first = second;
second = temp;
}
return second;
}
public static void main(String args[]){
int num = 7;
System.out.print("The 7th fibonacci number is : ");
System.out.println(fibo(num));
}
}

14) StepNumber:

public class StepNumber {

static String Step(int input1)
{
String str = String.valueOf(input1);
int len = str.length();
int[] arr = new int[len];
int rem =0;
String out = "";
if(len == 1)
{
out = str+"-false";
}
else
{
int i=len;
while(input1!=0)
{
rem = input1%10;
arr[i-1] = rem;
input1 = input1/10;
i--;
}
int k =1;
int count=0;
for(int j=0;j<len-1;j++)
 {

if(arr[j]-arr[k]==1 || arr[j]-arr[k]==-1) //0 1 //1 2 //2 3

{
count++;
}
k++;

}
if(count ==len-1)
{
out = str+"-true";
}
else
{
out = str+"-false";
}

}
return out;
}
public static void main(String[] args) {
String res = Step(707); //9849
System.out.println(res);
}
}

15) DigiLock:

public class DigiLock {

public int Lock(int in1,int in2,int in3)

{
int a[] = {in1,in2,in3};
int temp = 0, x = 0, y = 0, z = 0, k = 0, l = 0, m = 0, max = 0, key =
0;
int u[] = new int[3];
int t[] = new int[3];
int h[] = new int[3];
for(int i=0;i<a.length;i++)
{
u[i] = a[i]%10;
temp = a[i]/10;
t[i] = temp%10;
h[i] = a[i]/100;
}
x = Math.min(u[0], Math.min(u[1], u[2]));
y = Math.min(t[0], Math.min(t[1], t[2]));
z = Math.min(h[0], Math.min(h[1], h[2]));
k = Math.max(u[0], Math.max(u[1], u[2]));
l = Math.max(t[0], Math.max(t[1], t[2]));
m = Math.max(h[0], Math.max(h[1], h[2]));
 max = Math.max(k, Math.max(l, m));
key = (1000*max) + (100*z) + (10*y) +x;
return key;
}
public static void main(String[] args) {
DigiLock sol = new DigiLock();
int fin = sol.Lock(143, 540, 034);
System.out.println(fin);
}

16)