100% found this document useful (5 votes)
3K views

Java Solved Programs PDF

The document contains code snippets for various math and number related problems including checking if a number is even or odd, finding the last/second last digit of a number, adding the last digits of two numbers, checking if a number is a multiple of another, counting even/odd numbers in a list, checking if a number is prime, calculating factorial, Fibonacci, nth prime, number of primes in a range, counting all/unique/non-repeated digits, summing all/even digits in a number. Each code snippet is linked to an online code testing URL.

Uploaded by

Dhanalakshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
100% found this document useful (5 votes)
3K views

Java Solved Programs PDF

The document contains code snippets for various math and number related problems including checking if a number is even or odd, finding the last/second last digit of a number, adding the last digits of two numbers, checking if a number is a multiple of another, counting even/odd numbers in a list, checking if a number is prime, calculating factorial, Fibonacci, nth prime, number of primes in a range, counting all/unique/non-repeated digits, summing all/even digits in a number. Each code snippet is linked to an online code testing URL.

Uploaded by

Dhanalakshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 59

Is Even?

https://tests.mettl.com/authenticateKey/2bd025dc

public int isEven(int input1){

input1=Math.abs(input1);

if(input1==0 || input1%2==0)

return 2;

else

return 1;

Is Odd?

https://tests.mettl.com/authenticateKey/dbdac2a9

input1=Math.abs(input1);

if(input1==0 || input1%2==0)

if(input1%2!=0)

return 2;

else

return 1;

Return last digit of the given number

https://tests.mettl.com/authenticateKey/454f012b

return (Math.abs(input1%10));

Return second last digit of given number

https://tests.mettl.com/authenticateKey/9f87004e

public int secondLastDigitOf(int input1){

// Read only region end

input1=Math.abs(input1);

if(String.valueOf(input1).length()==1)

return -1;
else

return ((input1/10)%10);

Last test case failed for the below code

class UserMainCode

public int secondLastDigitOf(int input1){

// Read only region end

if(String.valueOf(input1).length()==1)

return -1;

else

return ((Math.abs(input1)/10)%10);

Sum of last digits of two given numbers

https://tests.mettl.com/authenticateKey/783a1fcf

public int addLastDigits(int input1,int input2){

input1=Math.abs(input1);

input2=Math.abs(input2);

return ((input1%10)+(input2%10));

Is N an exact multiple of M?

https://tests.mettl.com/authenticateKey/36c4ef58
public int isMultiple(int input1,int input2){

if(input1==0 || input2==0)

return 3;

else if(Math.abs(input1)%input2==0)

return 2;

else

return 1;

Of given 5 numbers, how many are even?

https://tests.mettl.com/authenticateKey/8edbe922

int count=0;

if(Math.abs(input1)%2==0 || input1==0)

count++;

if(Math.abs(input2)%2==0 || input2==0)

count++;

if(Math.abs(input3)%2==0 || input3==0)

count++;

if(Math.abs(input4)%2==0 || input4==0)

count++;

if(Math.abs(input5)%2==0 || input5==0)

count++;

return count;
Of given 5 numbers, how many are odd?

https://tests.mettl.com/authenticateKey/67147bd5

public int countEvens(int input1,int input2,int input3,int input4,int input5){

// Read only region end

int count=0;

if(Math.abs(input1)%2!=0 && input1!=0)

count++;

if(Math.abs(input2)%2!=0 && input2!=0)

count++;

if(Math.abs(input3)%2!=0 && input3!=0)

count++;

if(Math.abs(input4)%2!=0 && input4!=0)

count++;
if(Math.abs(input5)%2!=0 && input5!=0)

count++;

return count;

Of 5 numbers, how many are even or odd?

https://tests.mettl.com/authenticateKey/607636d7

public int countEvensOdds(int input1,int input2,int input3,int input4,int input5,String input6){

int count=0;

if(input6.equals("odd"))

if(Math.abs(input1)%2!=0 && input1!=0)

count++;

if(Math.abs(input2)%2!=0 && input2!=0)

count++;

if(Math.abs(input3)%2!=0 && input3!=0)

count++;

if(Math.abs(input4)%2!=0 && input4!=0)

count++;

if(Math.abs(input5)%2!=0 && input5!=0)

count++;
return count;

else

if(Math.abs(input1)%2==0 || input1==0)

count++;

if(Math.abs(input2)%2==0 || input2==0)

count++;

if(Math.abs(input3)%2==0 || input3==0)

count++;

if(Math.abs(input4)%2==0 || input4==0)

count++;

if(Math.abs(input5)%2==0 || input5==0)

count++;

return count;

Is Prime?

https://tests.mettl.com/authenticateKey/b1efaa3d

public int isPrime(int input1){

boolean flag=true;;
for(int i=2;i<input1/2;i++)

if(input1%i==0)

flag=false;

return 1;

if(flag==true)

return 2;

else

return 1;

Factorial of a number

https://tests.mettl.com/authenticateKey/8c1f2ae

public int nFactorial(int input1){

if(input1==1)

return 1;

else

return input1*nFactorial(input1-1);

}
Nth Fibonacci

https://tests.mettl.com/authenticateKey/f390cadf

public long nthFibonacci(int input1){

int n, a = 0, b = 0, c = 1;

n = input1;

for(int i = 1; i <= n; i++)

a = b;

b = c;

c = a + b;

System.out.print(a+" ");

return a;

Nth Prime

https://tests.mettl.com/authenticateKey/34fdaa41
public int NthPrime(int input1){

int num=1,count=0,i;

while(count<input1)

num=num+1;

for(i=2;i<=num;i++)

if(num%i==0)

break;

if(i==num)

count++;

return num;

Number of Primes in a specified range

https://tests.mettl.com/authenticateKey/87c41143
public int countPrimesInRange(int input1,int input2){

int i,num,count=0;

for(num=input1;num<=input2;num++)

for(i=2;i<=num;i++)

if(num%i==0)

break;

if(i==num)

count++;

return count;

All Digits Count

https://tests.mettl.com/authenticateKey/ed6b4da
public int allDigitsCount(int input1){

return (String.valueOf(input1).length());

Unique Digits Count

https://tests.mettl.com/authenticateKey/b7aac4a5

public int uniqueDigitsCount(int input1){


HashSet<Integer> h=new HashSet<Integer>();
while(input1>0)
{
h.add(input1%10);
input1=input1/10;
}
return h.size();
}

Non-Repeated Digits’ Count

https://tests.mettl.com/authenticateKey/e46500f5

public int nonRepeatDigitsCount(int input1){


String s=""+input1;
int count=0,count2=0,i;
char digit[]={'0','1','2','3','4','5','6','7','8','9'};

for(char c:digit)
{
count=0;
for(i=0;i<s.length();i++)
{
if(s.charAt(i)==c)
{
System.out.println("ip ="+s.charAt(i)+" char =:"+c);
count++;
}
}
if(count==1)
{
count2++;
System.out.println("count2="+count2);
}

}
return count2;
}

digitSum : sum of all digits in N


https://tests.mettl.com/authenticateKey/ab1d60cc
public int digitSum(int input1){
boolean flag=true;
if(input1<0)
{
flag=false;
input1=Math.abs(input1);
}
int input2=input1;
int sum=0;
while(input1>9)
{
while(input2>0)
{
sum+=input2%10;
input2=input2/10;
}
input1=sum;
input2=input1;
sum=0;
}

if(flag==false)
return -input1;
else
return input1;
}

digitSum even: sum of even digits in N

https://tests.mettl.com/authenticateKey/b55d1714

public int EvenDigitsSum(int input1){


int sum=0;
while(input1>0)
{
if((input1%10)%2==0)
sum+=input1%10;
input1=input1/10;
}
System.out.println("output is:="+sum);
return sum;
}
digitSum odd: sum of odd digits in N

https://tests.mettl.com/authenticateKey/738fdee0

public int OddDigitsSum(int input1){


int sum=0;
while(input1>0)
{
if((input1%10)%2!=0)
sum+=input1%10;
input1=input1/10;
}
System.out.println("output is:="+sum);
return sum;

}
}

digitSum opt: sum of even or odd digits

https://tests.mettl.com/authenticateKey/a05abbcf

public int EvenOddDigitsSum(int input1,String input2){


if(input2.equals("odd"))
{
int sum=0;
while(input1>0)
{
if((input1%10)%2!=0)
sum+=input1%10;
input1=input1/10;
}
System.out.println("output is:="+sum);
return sum;

}
else if(input2.equals("even"))
{
int sum=0;
while(input1>0)
{
if((input1%10)%2==0)
sum+=input1%10;
input1=input1/10;
}
System.out.println("output is:="+sum);
return sum;

}
return 0;
}
Is Palindrome Number?

https://tests.mettl.com/authenticateKey/28c41d9d

public int isPalinNum(int input1){


String s=""+input1;
if(s.length()%2!=0)
{
String s1=(s.substring(0,s.length()/2));
StringBuffer sb=new StringBuffer();
sb.append(s.substring(s.length()/2+1));
sb.reverse();
String rev=String.valueOf((sb.reverse()).toString());
if(s1.equals(rev))
return 2;
else
return 1;
}
else
{
String s1=(s.substring(0,s.length()/2));
StringBuffer sb=new StringBuffer();
sb.append(s.substring(s.length()/2));
sb.reverse();
String rev=String.valueOf((sb.reverse()).toString());
if(s1.equals(rev))
return 2;
else
return 1;
}
}
Is Palindrome Possible?

https://tests.mettl.com/authenticateKey/f4fdb02

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

// Read only region start


class UserMainCode
{

public int isPalinNumPossible(int input1){


// Read only region end
int ip=input1;
if(input1<10)
{
return 2;
}
else
{
String s =""+input1;
List<Integer> l= new ArrayList<Integer>();
int i=0;
while(ip>0){
l.add(ip%10);
ip=ip/10;
l.get(i);
i++;
}
int j=0,count=0;
for(int k :l)
{
if(Collections.frequency(l, l.get(j))%2==0)
count++;
j++;
}
//System.err.println("count "+count);
if(count>s.length()/2)
return 2;
//System.err.println("palindrome");
else
return 1;
//System.err.println("not palindrome");
}

}
}
Create PIN using alpha, beta, gamma

https://tests.mettl.com/authenticateKey/be582d9f

public int createPIN(int input1,int input2,int input3){


List<Integer> max=new ArrayList<Integer>();
List<Integer> ones=new ArrayList<Integer>();
List<Integer> tens=new ArrayList<Integer>();
List<Integer> hundreds=new ArrayList<Integer>();
ones.add(input1%10);
ones.add(input2%10);
ones.add(input3%10);

tens.add(input1/10%10);
tens.add(input2/10%10);
tens.add(input3/10%10);

hundreds.add(input1/10/10%10);
hundreds.add(input2/10/10%10);
hundreds.add(input3/10/10%10);
while(input1>0)
{
max.add(input1%10);
input1=input1/10;
}
while(input2>0)
{
max.add(input2%10);
input2=input2/10;
}
while(input3>0)
{
max.add(input3%10);
input3=input3/10;
}
return
(Collections.max(max)*1000+Collections.min(hundreds)*100+Collections.min(tens)*10+Collections.
min(ones));
}
Weight of a hill pattern

https://tests.mettl.com/authenticateKey/d612c0e6
public int totalHillWeight(int input1,int input2,int input3){
int k=1,sum=0;
while(input1>0)
{

for(int j=1;j<=k;j++)
{
sum+=input2;
}
System.out.println("\n");
k++;
input2=input2+input3;
input1--;
}
return sum;
}
Return second word in Uppercase

https://tests.mettl.com/authenticateKey/4a72723f
public String secondWordUpperCase(String input1){
// Read only region end
String s[]=input1.split(" ");
if(s.length==1)
return "LESS";
else
return s[1].toUpperCase();

}
is Palindrome (string)

https://tests.mettl.com/authenticateKey/ffe8042

public int isPalindrome(String input1){


String s=input1.toUpperCase();
if(s.length()%2!=0)
{
String s1=(s.substring(0,s.length()/2));
StringBuffer sb=new StringBuffer();
sb.append(s.substring(s.length()/2+1));
sb.reverse();
String rev=String.valueOf(sb);
if(s1.equals(rev))
return 2;
else
return 1;
}
else
{
String s1=(s.substring(0,s.length()/2));
StringBuffer sb=new StringBuffer();
sb.append(s.substring(s.length()/2));
sb.reverse();
String rev=String.valueOf(sb);
if(s1.equals(rev))
return 2;
else
return 1;
}

}
public int findStringCode(String input1){

// Read only region end

input1=input1.toUpperCase();

String[] s=input1.split(" ");

int length=0;

int length2=s.length-1;

int sum=0;

List<Integer> l=new ArrayList<Integer>();

int left,right;

while(length<=length2)

right=s[length].length()-1;

left=0;

while(left<right)

System.out.println(s[length].charAt(left));

System.out.println(s[length].charAt(right));

System.out.println(s[length].charAt(left)-s[length].charAt(right));

sum+=Math.abs((s[length].charAt(left)-s[length].charAt(right)));

left=left+1;

right=right-1;

if(s[length].length()%2!=0)
{

sum+=Math.abs(s[length].charAt(left)-64);

System.out.println("odd char="+s[length].charAt(left));

//l.add(s[length].charAt(left)-64);

l.add(sum);

sum=0;

length=length+1;

StringBuffer s2=new StringBuffer();

for(int i:l)

s2.append(i);

String s3=s2.toString();

sum=Integer.parseInt(s3);

return sum;

Code 2

import java.io.*;

import java.util.*;

// Read only region start

class UserMainCode

public int findStringCode(String input1){

// Read only region end

input1=input1.toUpperCase();
String[] ip=input1.split(" ");

int mid=0,sum=0,sum2=0;

StringBuffer sb=new StringBuffer();

for(String temp:ip)

int j=temp.length()-1;

for(int i=0;i<=j;i++)

sum2=0;

System.out.println(temp.charAt(i)+"-"+temp.charAt(j));

sum2+=Math.abs((temp.charAt(i)-64)-(temp.charAt(j)-64));

System.out.println("temp sum= "+sum2);

sum+=sum2;

j--;

if(temp.length()%2!=0)

System.out.println(temp.charAt(temp.length()/2));

sum+=temp.charAt(temp.length()/2)-64;

System.out.println("odd "+sum);

else

System.out.println("even "+sum);

sb.append(sum);

sum=0;

System.out.println(sb.toString());

return Integer.parseInt(sb.toString());

}
public int getCodeThroughStrings(String input1){

// Read only region end

input1=input1.toUpperCase();

String[] s=input1.split(" ");

int length=s.length-1;

int sum=0;

int sum2=0;

while(length>=0)
{

sum+=s[length].length();

System.out.println(sum);

while(sum>9)

while(sum>0)

sum2+=sum%10;

sum=sum/10;

sum=sum2;

sum2=0;

System.out.println(sum);

length=length-1;

System.out.println("final sum is"+sum);

return sum;

}
public class Result{
public final int output1;
public final int output2;

public Result(int out1, int out2){


output1 = out1;
output2 = out2;
}
}

public Result findOriginalFirstAndSum(int[] input1,int input2){


// Read only region end
int sum=input1[input2-1];
for(int i=input2-2;i>=0;i--)
{
input1[i]=input1[i]-input1[i+1];
sum+=input1[i];
System.out.println(input1[i]);
}
Result r=new Result(input1[0],sum);
return r;
}

Decreasing sequence
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public class Result{


public final int output1;
public final int output2;

public Result(int out1, int out2){


output1 = out1;
output2 = out2;
}
}

public Result decreasingSeq(int[] input1,int input2){


// Read only region end
int max=0,seq=0,num=0;;
int count=0;
int count2=0;
if(input2<=1)
{
Result r= new Result(0,0);
return r;
}
else
{
for(int i=0;i<input2-1;i++)
{
if(input1[i]>input1[i+1])
{
count++;
count2++;
System.out.println("num1="+input1[i]);
System.out.println("num2="+input1[i+1]);
}

if(max<count)
{
num++;
max=count;
seq=count2;
System.out.println(max);
System.out.println(seq);
System.out.println("count="+num);
//seq=0;
count=0;
i++;
}
}

Result r= new Result(num,seq);


return r;
}

}
}

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

// Read only region start


class UserMainCode
{

public class Result{


public final int output1;
public final int output2;

public Result(int out1, int out2){


output1 = out1;
output2 = out2;
}
}

public Result decreasingSeq(int[] input1,int input2){


// Read only region end
int output1=1,output2=1,seq=0,max=0,flag=0;
for(int i=0;i<input2-1;i++)
{

if(input1[i]>input1[i+1])
{
System.out.println(input1[i]+"compared with"+input1[i+1]);
output1++;
flag=1;
if(max<output1)
{
max=output1;
System.out.println("max ="+max);
}
if(i==input2-2){
seq++;
System.out.println("final seq ="+seq);
}
}
else
{
System.out.println("Entered else");

if(output1>1)
{
System.out.println("Entered seq");
seq++;
System.out.println("seq ="+seq);
flag=0;
}
i++;
output1=1;
}

}
Result res;
if(max==0)
res= new Result(0,0);
else
res= new Result(seq,max);
return res;
}
}
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public int mostFrequentlyOccurringDigit(int[] input1,int input2){


// Read only region end
List<Integer> l=new ArrayList<Integer>();
int freq=0,digit=input1[0]%10;
for(int i=0;i<input2;i++)
{
while(input1[i]>0)
{
l.add(input1[i]%10);
if(freq<Collections.frequency(l,input1[i]%10))
{
freq=Collections.frequency(l,input1[i]%10);
digit=input1[i]%10;
System.out.println("frequncy ="+freq);
System.out.println("Digit ="+digit);
}
else if(freq==Collections.frequency(l,input1[i]%10))
{
freq=Collections.frequency(l,input1[i]%10);
if(digit<input1[i]%10)
digit=input1[i]%10;
System.out.println("frequncy ="+freq);
System.out.println("Digit ="+digit);
}
System.out.println("Frequency of
"+input1[i]%10+"is"+Collections.frequency(l,input1[i]%10));
input1[i]=input1[i]/10;
}

}
return digit;

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

// Read only region start


class UserMainCode
{

public int sumOfPowerOfDigits(int input1){


// Read only region end
int sum=0;
StringBuffer s=new StringBuffer();
s.append(input1);
s.reverse();
String s2=s.toString();
input1=Integer.parseInt(s2);
while(input1>0)
{
sum+=Math.pow(input1%10,input1/10%10);
input1=input1/10;
}
return sum;
}
}
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public int sumOfSumsOfDigits(int input1){


// Read only region end
StringBuffer sb=new StringBuffer();
sb.append(input1);
sb.reverse();
String tmp=sb.toString();
input1=Integer.parseInt(tmp);
String s=input1+"";
int length=s.length();
int temp=input1;
int sum=0;
for(int i=0;i<length;i++)
{

for(int j=i;j<length;j++)
{
sum+=temp%10;
temp=temp/10;
System.out.println("sum="+sum);
System.out.println("temp="+temp);
}
temp=input1/10;
input1=input1/10;
System.out.println("num="+temp);
}
return sum;
}
}
Code

import java.io.*;
import java.util.*;
// Read only region start
class UserMainCode
{

public class Result{


public final String output1;
public final String output2;
public final String output3;

public Result(String out1, String out2, String out3){


output1 = out1;
output2 = out2;
output3 = out3;
}
}
public Result encodeThreeStrings(String input1,String input2,String input3){
// Read only region end
int length=input1.length();
//int length2=input2.length();
//int length3=input3.length();
ArrayList<String> a=new ArrayList<String>();
a.add(input1);
a.add(input2);
a.add(input3);
int quo,rem;
String first,second,third;
String op1="",op2="",op3="";
quo=length/3;
rem=length%3;
System.out.println("Length="+length);

for(String temp:a)
{
length=temp.length();
System.out.println("Length"+length);
quo=length/3;
rem=length%3;
if(length%3==0)
{
System.out.println("Entered if");
first=(temp.substring(0,quo));
second=(temp.substring(quo,quo+quo));
third=(temp.substring(quo+quo));
op1+=first;
op2+=second;
op3+=third;
System.out.println(first+" "+second+" "+third);
}
else if(length%3==1)
{
System.out.println("Entered else if1 ");
first=(temp.substring(0,quo));
second=(temp.substring(quo,quo+quo+1));
third=(temp.substring(quo+quo+1));
System.out.println(first+" "+second+" "+third);
op1+=first;
op2+=second;
op3+=third;
}
else if(length%3==2)
{
System.out.println("Entered else if2");
first=(temp.substring(0,quo+1));
second=(temp.substring(quo+1,quo+quo+1));
third=(temp.substring(quo+quo+1));
System.out.println(first+" "+second+" "+third);
op1+=first;
op2+=second;
op3+=third;
}
System.out.println("Exit");
}
System.out.println(op1);
System.out.println(op2);
System.out.println(op3);
StringBuilder tmp=new StringBuilder(op3);
for (int index = 0; index < tmp.length(); index++) {
char c = tmp.charAt(index);
if (Character.isLowerCase(c)) {
tmp.setCharAt(index, Character.toUpperCase(c));
} else {
tmp.setCharAt(index, Character.toLowerCase(c));
}
}
op3=tmp.toString();
Result r=new Result(op1,op2,op3);
return r;

}
}
Code

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

// Read only region start


class UserMainCode
{

public String identifyPossibleWords(String input1,String input2){


// Read only region end
input1=input1.replaceAll("_",".").toUpperCase();
String[] ip2=input2.split(":");
String op="";
for(String s:ip2)
{
if(Pattern.matches(input1, s.toUpperCase())==true)
op+=s.toUpperCase()+" ";
}
op=op.trim();
if(op.length()==0)
return "ERROR-009";
else
{
op=op.replaceAll(" ",":");
return op;
}
}
}
USER ID GENERATION

import java.io.*;
import java.util.*;
// Read only region start
class UserMainCode
{

public String userIdGeneration(String input1,String input2,int input3,int input4){


// Read only region end
String last="",longer="",pin="",temp=input3+"";
if(input1.length()<input2.length())
{
System.out.println("first string is smaller");
last=input1.charAt(input1.length()-1)+"";
longer=input2;
pin=temp.charAt((input4)-1)+""+temp.charAt(temp.length()-input4);
System.out.println(pin);

}
else if(input1.length()>input2.length())
{
System.out.println("second string is smaller");
last=input2.charAt(input2.length()-1)+"";
longer=input1;
pin=temp.charAt((input4)-1)+""+temp.charAt(temp.length()-input4);
System.out.println(pin);
}
else if(input1.length()==input2.length())
{
if(input1.compareTo(input2)<0){
System.out.println("first string is smaller but both are equal");
last=input1.charAt(input1.length()-1)+"";
longer=input2;
}
else if(input1.compareTo(input2)>0){
System.out.println("second string is smaller but both are equal");
last=input2.charAt(input2.length()-1)+"";
longer=input1;
}
else
{
System.out.println("first string is smaller and both are equal");
last=input1.charAt(input1.length()-1)+"";
longer=input2;
}

pin=temp.charAt((input4)-1)+""+temp.charAt(temp.length()-input4);
System.out.println(pin);
}
StringBuffer sb=new StringBuffer(longer);
for(int i=0;i<sb.length();i++)
{
if(Character.isLowerCase(sb.charAt(i)))
{
sb.setCharAt(i,Character.toUpperCase(sb.charAt(i)));
System.out.println(sb.charAt(i));
}
else
{
sb.setCharAt(i,Character.toLowerCase(sb.charAt(i)));
System.out.println(sb.charAt(i));
}

}
longer=sb.toString();
System.out.println(last+""+longer+""+pin);
return (last.toUpperCase()+""+longer+""+pin);
}
}

CODE

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

// Read only region start


class UserMainCode
{

public int digitRemove_Palin(int input1){


// Read only region end
StringBuffer sb=new StringBuffer(input1+"");
if((input1+"").equals(sb.reverse().toString()))
return -1;

String ip=input1+"";
char[] cc=ip.toCharArray();
ArrayList<Character> c= new ArrayList<Character>();
for(char temp:cc)
c.add(temp);
String op="";
for(char temp:cc){
System.out.println("frquency of"+temp+"is"+Collections.frequency(c,temp));
if(Collections.frequency(c,temp)==1)
{
op+=temp+"";
}
}
System.out.println(op);
if(op.length()>1)
return Integer.parseInt(op.charAt(op.length()-1)+"");
else
return Integer.parseInt(op.charAt(0)+"");
}
}
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public int sumOfNonPrimeIndexValues(int[] input1,int input2){


// Read only region end
int sum=0;
for(int i=0;i<input1.length;i++)
{
if(i==0||i==1)
{
System.out.println(input1[i]);
sum+=input1[i];
}
else
{
if(isprime(i)==1)
{
System.out.println(input1[i]);
sum+=input1[i];
}
}
}
System.out.println(sum);
return sum;
}
public int isprime(int n)
{
for(int i=2;i<n;i++)
{
if(n%i==0)
return 1;
}
return 0;
}
}
Code
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public int findPassword(int input1,int input2,int input3,int input4,int input5){


ArrayList<Integer> ar=new ArrayList<Integer>();
ArrayList<Integer> tar=new ArrayList<Integer>();
int stable=0,unstable=0,flag=0;
int freq=0;
ar.add(input1);ar.add(input2);ar.add(input3);ar.add(input4);ar.add(input5);
for(int temp:ar)
{
flag=0;
tar.clear();
int temp3=temp;
while(temp3>0)
{
tar.add(temp3%10);
temp3=temp3/10;
}
freq=Collections.frequency(tar,tar.get(0));

for(int temp2:tar)
if(Collections.frequency(tar,temp2)!=freq)
flag=1;

if(flag==1)
unstable+=temp;
else
stable+=temp;
}
return stable-unstable;
}
}

Nambiar Number
Code
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public int nnGenerator(String input1){


// Read only region end
int len=input1.length();
int sum=0;
int i,j;
int f=0;
String res="";
int []a=new int[len];
for(int k=len-1;k>=0;k--)
{
a[k]=input1.charAt(k)-48;

}
for(i=0;i<a.length;)
{
if(a[i]%2==0)
f=0;
else
f=1;
sum=a[i++];
if(f==0)
{
while(i<a.length&&sum%2==0)
{
sum+=a[i++];
}
}
else
{
while(i<a.length&&sum%2!=0)
{
sum+=a[i++];
}
}
res+=sum;
}
return (Integer.parseInt(res));

}
}
Robot
import java.io.*;
import java.util.*;

// Read only region start


class UserMainCode
{

public String moveRobot(int input1,int input2,String input3,String input4){


// Read only region end
int row=input1,col=input2;
String[] s2=input3.split("-");
int r=Integer.parseInt(s2[0]);
int c=Integer.parseInt(s2[1]);
if(r>input1||c>input2)
return (input3+"-ER");
String[] s=input4.split(" ");
//System.out.println(s2[2]);
for(String ip:s)
{
System.out.println("ip"+ip);
switch(ip)
{
case "L":
System.out.println("Left");
if(s2[2].equals("E")){
s2[2]="N";
System.out.println(s2[2]);break;}
else if(s2[2].equals("N")){
s2[2]="W";
System.out.println(s2[2]);break;}
else if(s2[2].equals("W")){
s2[2]="S";
System.out.println(s2[2]);break;}
else if(s2[2].equals("S")){
s2[2]="E";
System.out.println(s2[2]);break;}

case "R":
System.out.println("Right");
if(s2[2].equals("E")){
s2[2]="S";System.out.println(s2[2]);break;}
else if(s2[2].equals("S")){
s2[2]="W";System.out.println(s2[2]);break;}
else if(s2[2].equals("W")){
s2[2]="N";System.out.println(s2[2]);break;}
else if(s2[2].equals("N")){
s2[2]="E";System.out.println(s2[2]);break;}

case "M":
System.out.println("row="+r+"col="+c);
if(s2[2].equals("E"))
if((r+1)<=row)
r=r+1;
else
return (r+"-"+c+"-"+s2[2]+"-ER");
else if(s2[2].equals("N"))
if((c+1)<=col)
c=c+1;
else
return (r+"-"+c+"-"+s2[2]+"-ER");
else if(s2[2].equals("W"))
if((r-1)<=row && (r-1)>=0)
r=r-1;
else
return (r+"-"+c+"-"+s2[2]+"-ER");
else if(s2[2].equals("S"))
if((c-1)<=col && (c-1)>=0)
c=c-1;
else
return (r+"-"+c+"-"+s2[2]+"-ER");
else
return (r+"-"+c+"-"+s2[2]+"-ER");
System.out.println("Move");
break;
}
System.out.println(r+"-"+c+"-"+s2[2]);
}
return (r+"-"+c+"-"+s2[2]);
}
}

You might also like