GENERATING SEQUENCE:

a=1,b=3,c=6,N=17
1,3,6,8,11,13......16th element is 41
____________________________________________
import java.io.*;
import java.util.*;
class UserMainCode
{

public int seriesN(int input1,int input2,int input3,int input4){

int[] a=new int[input4];
a[0]=input1;
a[1]=input2;
a[2]=input3;
int o=input2-input1;
int e=input3-input2;
for(int i=3;i<input4;i++)
{
if(i%2==0)
a[i]=a[i-1]+e;
else
a[i]=a[i-1]+o;
}
return a[input4-1];
}
}
**************************************************************************
FIND RESULT AFTER ALTERNATE ADD_AUB ON N
N=6,
opt 1=6-5+4-3+2-1=3
opt 2=6+5-4+3-2+1=9
__________________________________________
import java.io.*;
import java.util.*;
class UserMainCode
{

public int AddSub(int input1,int input2){

int s=input1;
if(input2==1)
{
for(int i=1;i<input1;i++)
{
if(i%2==0)
s+=input1-i;
else
s-=input1-i;
}
}
if(input2==2)
{
for(int i=1;i<input1;i++)
{
if(i%2!=0)
s+=input1-i;
else
s-=input1-i;
}
}
 return s;

}
}
**************************************************************************
STABLE-UNSTABLE
12,1313,122,678,898
stable-1313+12+678
unstable-122+898
stable-unstable=983
_________________________________
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){
// Read only region end
// Write code here...
int[] a=new int[5];
a[0]=input1;
a[1]=input2;
a[2]=input3;
a[3]=input4;
a[4]=input5;
int[] b=new int[5];
b[0]=input1;
b[1]=input2;
b[2]=input3;
b[3]=input4;
b[4]=input5;
int stable=0,unstable=0,r=0,t;
for(int i=0;i<a.length;i++)
{
int[] h=new int[10];
while(a[i]>0)
{
r=a[i]%10;
h[r]++;
a[i]/=10;
}
t=0;
for(int j=0;j<10;j++)
{
if(h[j]==h[r]||h[j]==0)
t++;
}
if(t==10)
stable+=b[i];
else
unstable+=b[i];
}
return stable-unstable;
}
}
**************************************************************************
CALCULATE SUM OF NON-PRIME INDEX VALUES
10,20,30,40,50,60,70,80,90,100
non prime index numbers 10,20,50,70,90,100=340
_________________________________________________
import java.io.*;
import java.util.*;
class UserMainCode
{

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

int sum=input1[0]+input1[1];
for(int i=2;i<input1.length;i++)
{
int c=0;
for(int j=2;j<=i;j++)
{
if(i%j==0)
c++;
}
if(c!=1)
sum+=input1[i];
}
return sum;
}
}
**************************************************************************
FIND THE ONE DIGIT TO BE REMOVED TO FORM PALINDROME
12332-1 SHOULD BE REMOVED
981894-4 SHOULD BE REMOVED
______________________________________________________
import java.io.*;
import java.util.*;
class UserMainCode
{

public int digitRemove_Palin(int input1){

int rev=0,no=input1,m=0;
char w='3';
while(input1>0)
{
int r=input1%10;
rev=(rev*10)+r;
input1/=10;
}
if(rev==no)
m=-1;
else
{
int[] h=new int[10];
while(no>0)
{
h[no%10]++;
no/=10;
}
for(int i=0;i<10;i++)
{
if(h[i]%2==1)
m=i;
}
 }
return m;
}
}

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

// Read only region start

class UserMainCode
{

public int digitRemove_Palin(int input1){

// Read only region end
// Write code here...
int d[]=new int[]{0,0,0,0,0,0,0,0,0,0};
int r=0,c=0,in=-1;
StringBuffer sb=new StringBuffer(String.valueOf(input1));
if(sb.toString().equals(sb.reverse().toString()))
return -1;
else
{
int i,f=0,v=0;
for(i=0;i<sb.length();i++)
{
f=0;
String k=String.valueOf(input1);
StringBuffer s=new StringBuffer(k);
v=k.charAt(i)-'0';
s.delete(i,i+1);

if(s.toString().equals(s.reverse().toString()))
{
f=1;
break;
}

}
if(f==1)
return v;
else
return -1;
}
}
}

**************************************************************************
NAMBIAR NUMBER
import java.io.*;
import java.util.*;

// Read only region start

class UserMainCode
{
 public int nnGenerator(String input1){
// Read only region end
// Write code here...
char[] ch=input1.toCharArray();
int a[]=new int[10];
String s1=" ";
int i=0;
for(i=0;i<ch.length;i++)
{
a[i]=(int)ch[i]-48;
}
int sum=0;
for(i=0;i<10;)
{
sum=a[i];
if(sum%2==0)
{
i++;
while(sum%2==0&&i<10){
sum+=a[i]; i++;}
s1=s1+sum;
}
else{
i++;
while(sum%2!=0&&i<10){
sum+=a[i]; i++;}
s1=s1+sum;
}

}
s1=s1.trim();
sum=Integer.parseInt(s1);
return sum;
}
}
***********************************************************************************
**********************
USERID 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

int s1=input1.length();
int s2=input2.length();
String longer="";
String smaller="";
String output1="";
if(s1==s2)
{
if(input1.compareTo(input2)>0)
{
longer=input1;
 smaller=input2;
}
else
{
longer=input2;
smaller=input1;
}
}

if(s1>s2){
longer=input1;
smaller=input2;
}
else if(s1<s2)
{
longer=input2;
smaller=input1;
}
String pin=Integer.toString(input3);
String output=smaller.charAt(smaller.length()-1)+longer+pin.charAt(input4-
1)+pin.charAt(pin.length()-input4);
for(int i=0;i<output.length();i++)
{
if(Character.isLowerCase(output.charAt(i)))
{
output1+=Character.toUpperCase(output.charAt(i));
}
else
{
output1+=Character.toLowerCase(output.charAt(i));
}
}
return output1;
}
}
***********************************************************************************
***********************************************************

ROBOT MOVEMENT:
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

String path[]=input3.split("-");
int x=Integer.parseInt(path[0]);
int y=Integer.parseInt(path[1]);
String pos=path[2];
String arr[]=input4.split(" ");
int f=0;
for(String s:arr)
{
if(s.equals("R"))
 {
if(pos.equals("N"))
pos="E";
else if(pos.equals("E"))
pos="S";
else if(pos.equals("S"))
pos="W";
else
pos="N";
}
else if(s.equals("L"))
{
if(pos.equals("N"))
pos="W";
else if(pos.equals("E"))
pos="N";
else if(pos.equals("S"))
pos="E";
else
pos="S";
}
else if(f!=1)
{
if(pos.equals("N"))
{
if(input2>y)
y=y+1;
else
f=1;
}
else if(pos.equals("S"))
{
if(y>0)
y=y-1;
else
f=1;
}
else if(pos.equals("E"))
{
if(input1>x)
x=x+1;
else
f=1;
}
else
{
if(x>0)
x=x-1;
else
f=1;
}
}
}
if(f!=1)
return String.valueOf(x)+"-"+String.valueOf(y)+"-"+String.valueOf(pos);
else
return String.valueOf(x)+"-"+String.valueOf(y)
+"-"+String.valueOf(pos)+"-"+"ER";
 }
}

***********************************************************************************
******************************************************

FIND STRING CODE

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

// Read only region start

class UserMainCode
{

public int findStringCode(String input1){

// Read only region end
// Write code here...
int i,j,sum;
String ans="";
String origin="abcdefghijklmnopqrstuvwxyz";
input1=input1.toLowerCase();
String[] s1=input1.split(" ");
for(i=0;i<s1.length;i++)
{sum=0;
if(s1[i].length()%2==0)
{
for(j=0;j<s1[i].length()/2;j++)
{

char a=s1[i].charAt(j);
char b=s1[i].charAt(s1[i].length()-j-1);
int index1=origin.indexOf(a)+1;
int index2=origin.indexOf(b)+1;
sum+=Math.abs(index1-index2);
}
ans=ans+sum;
}
else if(s1[i].length()%2!=0)
{
for(j=0;j<s1[i].length()/2;j++)
{

char a=s1[i].charAt(j);
char b=s1[i].charAt(s1[i].length()-j-1);
int index1=origin.indexOf(a)+1;
int index2=origin.indexOf(b)+1;
sum+=Math.abs(index1-index2);
}
char c3=s1[i].charAt(s1[i].length()/2);
int i3=origin.indexOf(c3)+1;
sum=sum+i3;
ans=ans+sum;
}
}
return Integer.parseInt(ans);
}
}
***********************************************************************************
************************************************
GET CODE THROUGH STRINGS

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

// Read only region start

class UserMainCode
{

public int getCodeThroughStrings(String input1){

// Read only region end
// Write code here...
String[] s1=input1.split(" ");
int i,sum=0,ans=0;
boolean b=true;
for(i=0;i<s1.length;i++)
sum=sum+s1[i].length();
while(b)
{
while(sum>0)
{
ans+=sum%10;
sum=sum/10;
}
if(ans>=10)
{
sum=ans;
ans=0;
}
else
b=false;
}
return ans;
}
}
***********************************************************************************
*************************************************************
FIND POSSIBLE WORDS
import java.io.*;
import java.util.*;

// Read only region start

class UserMainCode
{

public String identifyPossibleWords(String input1,String input2){

// Read only region end

String[] ar=input2.split(":");
String temp="",fin="";
int count=0;
for(int i=0;i<ar.length;i++){
temp=ar[i];
count=0;
if(temp.length()==input1.length()){
for(int j=0;j<temp.length();j++){
if(input1.charAt(j)!='_'){
if(Character.toUpperCase(input1.charAt(j))==Character.toUpperCase(temp.charAt(j))){
count++;
}
}
}
if(count==temp.length()-1) fin=fin+temp.toUpperCase()+":";
}
}
if(fin=="") return "ERROR-009";
return fin.substring(0,fin.length()-1);

}
}
***********************************************************************************
*****************************************************************
ENCODED STRINGS
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
//Write code here...
int x=input1.length();
int y=input2.length();
int z=input3.length();
int a=0,b=0,c=0;
String f="";
String m="";
String e="";
if(x%3==1){
a=x/3;
b=x/3+1;
c=x/3;
}
else if(x%3==2){
a=x/3+1;
b=x/3;
c=x/3+1;
}
else if(x%3==0){
a=x/3;
b=x/3;
c=x/3;
}
for(int i=0;i<a;i++)
f=f+input1.charAt(i);
for(int i=a;i<a+b;i++)
m=m+input1.charAt(i);
for(int i=a+b;i<x;i++){
if(Character.isUpperCase(input1.charAt(i)))
e=e+Character.toLowerCase(input1.charAt(i));
else if(Character.isLowerCase(input1.charAt(i)))
e=e+Character.toUpperCase(input1.charAt(i));
}
if(y%3==1){
a=y/3;
b=y/3+1;
c=y/3;
}
else if(y%3==2){
a=y/3+1;
b=y/3;
c=y/3+1;
}
else if(y%3==0){
a=y/3;
b=y/3;
c=y/3;
}
for(int i=0;i<a;i++)
f=f+input2.charAt(i);
for(int i=a;i<a+b;i++)
m=m+input2.charAt(i);
for(int i=a+b;i<y;i++){
if(Character.isUpperCase(input2.charAt(i)))
e=e+Character.toLowerCase(input2.charAt(i));
else if(Character.isLowerCase(input2.charAt(i)))
e=e+Character.toUpperCase(input2.charAt(i));
}
if(z%3==1){
a=z/3;
b=z/3+1;
c=z/3;
}
else if(z%3==2){
a=z/3+1;
b=z/3;
c=z/3+1;
}
else if(z%3==0){
a=z/3;
b=z/3;
c=z/3;
}
for(int i=0;i<a;i++)
f=f+input3.charAt(i);
for(int i=a;i<a+b;i++)
m=m+input3.charAt(i);
for(int i=a+b;i<z;i++){
if(Character.isUpperCase(input3.charAt(i)))
e=e+Character.toLowerCase(input3.charAt(i));
else if(Character.isLowerCase(input3.charAt(i)))
e=e+Character.toUpperCase(input3.charAt(i));
}
Result p=new Result(f,m,e);
return p;
}
}
***********************************************************************************
***************************************************