Is Even?
[Link]
public int isEven(int input1){
input1=[Link](input1);
if(input1==0 || input1%2==0)
return 2;
else
return 1;
Is Odd?
[Link]
input1=[Link](input1);
if(input1==0 || input1%2==0)
if(input1%2!=0)
return 2;
else
return 1;
Return last digit of the given number
[Link]
return ([Link](input1%10));
Return second last digit of given number
[Link]
public int secondLastDigitOf(int input1){
// Read only region end
input1=[Link](input1);
if([Link](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([Link](input1).length()==1)
return -1;
else
return (([Link](input1)/10)%10);
Sum of last digits of two given numbers
[Link]
public int addLastDigits(int input1,int input2){
input1=[Link](input1);
input2=[Link](input2);
return ((input1%10)+(input2%10));
Is N an exact multiple of M?
[Link]
public int isMultiple(int input1,int input2){
if(input1==0 || input2==0)
return 3;
else if([Link](input1)%input2==0)
return 2;
else
return 1;
Of given 5 numbers, how many are even?
[Link]
int count=0;
if([Link](input1)%2==0 || input1==0)
count++;
if([Link](input2)%2==0 || input2==0)
count++;
if([Link](input3)%2==0 || input3==0)
count++;
if([Link](input4)%2==0 || input4==0)
count++;
if([Link](input5)%2==0 || input5==0)
count++;
return count;
Of given 5 numbers, how many are odd?
[Link]
public int countEvens(int input1,int input2,int input3,int input4,int input5){
// Read only region end
int count=0;
if([Link](input1)%2!=0 && input1!=0)
count++;
if([Link](input2)%2!=0 && input2!=0)
count++;
if([Link](input3)%2!=0 && input3!=0)
count++;
if([Link](input4)%2!=0 && input4!=0)
count++;
if([Link](input5)%2!=0 && input5!=0)
count++;
return count;
Of 5 numbers, how many are even or odd?
[Link]
public int countEvensOdds(int input1,int input2,int input3,int input4,int input5,String input6){
int count=0;
if([Link]("odd"))
if([Link](input1)%2!=0 && input1!=0)
count++;
if([Link](input2)%2!=0 && input2!=0)
count++;
if([Link](input3)%2!=0 && input3!=0)
count++;
if([Link](input4)%2!=0 && input4!=0)
count++;
if([Link](input5)%2!=0 && input5!=0)
count++;
return count;
else
if([Link](input1)%2==0 || input1==0)
count++;
if([Link](input2)%2==0 || input2==0)
count++;
if([Link](input3)%2==0 || input3==0)
count++;
if([Link](input4)%2==0 || input4==0)
count++;
if([Link](input5)%2==0 || input5==0)
count++;
return count;
Is Prime?
[Link]
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
[Link]
public int nFactorial(int input1){
if(input1==1)
return 1;
else
return input1*nFactorial(input1-1);
}
Nth Fibonacci
[Link]
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;
[Link](a+" ");
return a;
Nth Prime
[Link]
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
[Link]
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
[Link]
public int allDigitsCount(int input1){
return ([Link](input1).length());
Unique Digits Count
[Link]
public int uniqueDigitsCount(int input1){
HashSet<Integer> h=new HashSet<Integer>();
while(input1>0)
{
[Link](input1%10);
input1=input1/10;
}
return [Link]();
}
Non-Repeated Digits’ Count
[Link]
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<[Link]();i++)
{
if([Link](i)==c)
{
[Link]("ip ="+[Link](i)+" char =:"+c);
count++;
}
}
if(count==1)
{
count2++;
[Link]("count2="+count2);
}
}
return count2;
}
digitSum : sum of all digits in N
[Link]
public int digitSum(int input1){
boolean flag=true;
if(input1<0)
{
flag=false;
input1=[Link](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
[Link]
public int EvenDigitsSum(int input1){
int sum=0;
while(input1>0)
{
if((input1%10)%2==0)
sum+=input1%10;
input1=input1/10;
}
[Link]("output is:="+sum);
return sum;
}
digitSum odd: sum of odd digits in N
[Link]
public int OddDigitsSum(int input1){
int sum=0;
while(input1>0)
{
if((input1%10)%2!=0)
sum+=input1%10;
input1=input1/10;
}
[Link]("output is:="+sum);
return sum;
}
}
digitSum opt: sum of even or odd digits
[Link]
public int EvenOddDigitsSum(int input1,String input2){
if([Link]("odd"))
{
int sum=0;
while(input1>0)
{
if((input1%10)%2!=0)
sum+=input1%10;
input1=input1/10;
}
[Link]("output is:="+sum);
return sum;
}
else if([Link]("even"))
{
int sum=0;
while(input1>0)
{
if((input1%10)%2==0)
sum+=input1%10;
input1=input1/10;
}
[Link]("output is:="+sum);
return sum;
}
return 0;
}
Is Palindrome Number?
[Link]
public int isPalinNum(int input1){
String s=""+input1;
if([Link]()%2!=0)
{
String s1=([Link](0,[Link]()/2));
StringBuffer sb=new StringBuffer();
[Link]([Link]([Link]()/2+1));
[Link]();
String rev=[Link](([Link]()).toString());
if([Link](rev))
return 2;
else
return 1;
}
else
{
String s1=([Link](0,[Link]()/2));
StringBuffer sb=new StringBuffer();
[Link]([Link]([Link]()/2));
[Link]();
String rev=[Link](([Link]()).toString());
if([Link](rev))
return 2;
else
return 1;
}
}
Is Palindrome Possible?
[Link]
import [Link].*;
import [Link].*;
// 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){
[Link](ip%10);
ip=ip/10;
[Link](i);
i++;
}
int j=0,count=0;
for(int k :l)
{
if([Link](l, [Link](j))%2==0)
count++;
j++;
}
//[Link]("count "+count);
if(count>[Link]()/2)
return 2;
//[Link]("palindrome");
else
return 1;
//[Link]("not palindrome");
}
}
}
Create PIN using alpha, beta, gamma
[Link]
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>();
[Link](input1%10);
[Link](input2%10);
[Link](input3%10);
[Link](input1/10%10);
[Link](input2/10%10);
[Link](input3/10%10);
[Link](input1/10/10%10);
[Link](input2/10/10%10);
[Link](input3/10/10%10);
while(input1>0)
{
[Link](input1%10);
input1=input1/10;
}
while(input2>0)
{
[Link](input2%10);
input2=input2/10;
}
while(input3>0)
{
[Link](input3%10);
input3=input3/10;
}
return
([Link](max)*1000+[Link](hundreds)*100+[Link](tens)*10+Collections.
min(ones));
}
Weight of a hill pattern
[Link]
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;
}
[Link]("\n");
k++;
input2=input2+input3;
input1--;
}
return sum;
}
Return second word in Uppercase
[Link]
public String secondWordUpperCase(String input1){
// Read only region end
String s[]=[Link](" ");
if([Link]==1)
return "LESS";
else
return s[1].toUpperCase();
}
is Palindrome (string)
[Link]
public int isPalindrome(String input1){
String s=[Link]();
if([Link]()%2!=0)
{
String s1=([Link](0,[Link]()/2));
StringBuffer sb=new StringBuffer();
[Link]([Link]([Link]()/2+1));
[Link]();
String rev=[Link](sb);
if([Link](rev))
return 2;
else
return 1;
}
else
{
String s1=([Link](0,[Link]()/2));
StringBuffer sb=new StringBuffer();
[Link]([Link]([Link]()/2));
[Link]();
String rev=[Link](sb);
if([Link](rev))
return 2;
else
return 1;
}
}
public int findStringCode(String input1){
// Read only region end
input1=[Link]();
String[] s=[Link](" ");
int length=0;
int length2=[Link]-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)
[Link](s[length].charAt(left));
[Link](s[length].charAt(right));
[Link](s[length].charAt(left)-s[length].charAt(right));
sum+=[Link]((s[length].charAt(left)-s[length].charAt(right)));
left=left+1;
right=right-1;
if(s[length].length()%2!=0)
{
sum+=[Link](s[length].charAt(left)-64);
[Link]("odd char="+s[length].charAt(left));
//[Link](s[length].charAt(left)-64);
[Link](sum);
sum=0;
length=length+1;
StringBuffer s2=new StringBuffer();
for(int i:l)
[Link](i);
String s3=[Link]();
sum=[Link](s3);
return sum;
Code 2
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
public int findStringCode(String input1){
// Read only region end
input1=[Link]();
String[] ip=[Link](" ");
int mid=0,sum=0,sum2=0;
StringBuffer sb=new StringBuffer();
for(String temp:ip)
int j=[Link]()-1;
for(int i=0;i<=j;i++)
sum2=0;
[Link]([Link](i)+"-"+[Link](j));
sum2+=[Link](([Link](i)-64)-([Link](j)-64));
[Link]("temp sum= "+sum2);
sum+=sum2;
j--;
if([Link]()%2!=0)
[Link]([Link]([Link]()/2));
sum+=[Link]([Link]()/2)-64;
[Link]("odd "+sum);
else
[Link]("even "+sum);
[Link](sum);
sum=0;
[Link]([Link]());
return [Link]([Link]());
}
public int getCodeThroughStrings(String input1){
// Read only region end
input1=[Link]();
String[] s=[Link](" ");
int length=[Link]-1;
int sum=0;
int sum2=0;
while(length>=0)
{
sum+=s[length].length();
[Link](sum);
while(sum>9)
while(sum>0)
sum2+=sum%10;
sum=sum/10;
sum=sum2;
sum2=0;
[Link](sum);
length=length-1;
[Link]("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];
[Link](input1[i]);
}
Result r=new Result(input1[0],sum);
return r;
}
Decreasing sequence
import [Link].*;
import [Link].*;
// 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++;
[Link]("num1="+input1[i]);
[Link]("num2="+input1[i+1]);
}
if(max<count)
{
num++;
max=count;
seq=count2;
[Link](max);
[Link](seq);
[Link]("count="+num);
//seq=0;
count=0;
i++;
}
}
Result r= new Result(num,seq);
return r;
}
}
}
Code2
import [Link].*;
import [Link].*;
// 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])
{
[Link](input1[i]+"compared with"+input1[i+1]);
output1++;
flag=1;
if(max<output1)
{
max=output1;
[Link]("max ="+max);
}
if(i==input2-2){
seq++;
[Link]("final seq ="+seq);
}
}
else
{
[Link]("Entered else");
if(output1>1)
{
[Link]("Entered seq");
seq++;
[Link]("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 [Link].*;
import [Link].*;
// 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)
{
[Link](input1[i]%10);
if(freq<[Link](l,input1[i]%10))
{
freq=[Link](l,input1[i]%10);
digit=input1[i]%10;
[Link]("frequncy ="+freq);
[Link]("Digit ="+digit);
}
else if(freq==[Link](l,input1[i]%10))
{
freq=[Link](l,input1[i]%10);
if(digit<input1[i]%10)
digit=input1[i]%10;
[Link]("frequncy ="+freq);
[Link]("Digit ="+digit);
}
[Link]("Frequency of
"+input1[i]%10+"is"+[Link](l,input1[i]%10));
input1[i]=input1[i]/10;
}
}
return digit;
}
}
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
{
public int sumOfPowerOfDigits(int input1){
// Read only region end
int sum=0;
StringBuffer s=new StringBuffer();
[Link](input1);
[Link]();
String s2=[Link]();
input1=[Link](s2);
while(input1>0)
{
sum+=[Link](input1%10,input1/10%10);
input1=input1/10;
}
return sum;
}
}
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
{
public int sumOfSumsOfDigits(int input1){
// Read only region end
StringBuffer sb=new StringBuffer();
[Link](input1);
[Link]();
String tmp=[Link]();
input1=[Link](tmp);
String s=input1+"";
int length=[Link]();
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;
[Link]("sum="+sum);
[Link]("temp="+temp);
}
temp=input1/10;
input1=input1/10;
[Link]("num="+temp);
}
return sum;
}
}
Code
import [Link].*;
import [Link].*;
// 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=[Link]();
//int length2=[Link]();
//int length3=[Link]();
ArrayList<String> a=new ArrayList<String>();
[Link](input1);
[Link](input2);
[Link](input3);
int quo,rem;
String first,second,third;
String op1="",op2="",op3="";
quo=length/3;
rem=length%3;
[Link]("Length="+length);
for(String temp:a)
{
length=[Link]();
[Link]("Length"+length);
quo=length/3;
rem=length%3;
if(length%3==0)
{
[Link]("Entered if");
first=([Link](0,quo));
second=([Link](quo,quo+quo));
third=([Link](quo+quo));
op1+=first;
op2+=second;
op3+=third;
[Link](first+" "+second+" "+third);
}
else if(length%3==1)
{
[Link]("Entered else if1 ");
first=([Link](0,quo));
second=([Link](quo,quo+quo+1));
third=([Link](quo+quo+1));
[Link](first+" "+second+" "+third);
op1+=first;
op2+=second;
op3+=third;
}
else if(length%3==2)
{
[Link]("Entered else if2");
first=([Link](0,quo+1));
second=([Link](quo+1,quo+quo+1));
third=([Link](quo+quo+1));
[Link](first+" "+second+" "+third);
op1+=first;
op2+=second;
op3+=third;
}
[Link]("Exit");
}
[Link](op1);
[Link](op2);
[Link](op3);
StringBuilder tmp=new StringBuilder(op3);
for (int index = 0; index < [Link](); index++) {
char c = [Link](index);
if ([Link](c)) {
[Link](index, [Link](c));
} else {
[Link](index, [Link](c));
}
}
op3=[Link]();
Result r=new Result(op1,op2,op3);
return r;
}
}
Code
import [Link].*;
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
{
public String identifyPossibleWords(String input1,String input2){
// Read only region end
input1=[Link]("_",".").toUpperCase();
String[] ip2=[Link](":");
String op="";
for(String s:ip2)
{
if([Link](input1, [Link]())==true)
op+=[Link]()+" ";
}
op=[Link]();
if([Link]()==0)
return "ERROR-009";
else
{
op=[Link](" ",":");
return op;
}
}
}
USER ID GENERATION
import [Link].*;
import [Link].*;
// 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([Link]()<[Link]())
{
[Link]("first string is smaller");
last=[Link]([Link]()-1)+"";
longer=input2;
pin=[Link]((input4)-1)+""+[Link]([Link]()-input4);
[Link](pin);
}
else if([Link]()>[Link]())
{
[Link]("second string is smaller");
last=[Link]([Link]()-1)+"";
longer=input1;
pin=[Link]((input4)-1)+""+[Link]([Link]()-input4);
[Link](pin);
}
else if([Link]()==[Link]())
{
if([Link](input2)<0){
[Link]("first string is smaller but both are equal");
last=[Link]([Link]()-1)+"";
longer=input2;
}
else if([Link](input2)>0){
[Link]("second string is smaller but both are equal");
last=[Link]([Link]()-1)+"";
longer=input1;
}
else
{
[Link]("first string is smaller and both are equal");
last=[Link]([Link]()-1)+"";
longer=input2;
}
pin=[Link]((input4)-1)+""+[Link]([Link]()-input4);
[Link](pin);
}
StringBuffer sb=new StringBuffer(longer);
for(int i=0;i<[Link]();i++)
{
if([Link]([Link](i)))
{
[Link](i,[Link]([Link](i)));
[Link]([Link](i));
}
else
{
[Link](i,[Link]([Link](i)));
[Link]([Link](i));
}
}
longer=[Link]();
[Link](last+""+longer+""+pin);
return ([Link]()+""+longer+""+pin);
}
}
CODE
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
{
public int digitRemove_Palin(int input1){
// Read only region end
StringBuffer sb=new StringBuffer(input1+"");
if((input1+"").equals([Link]().toString()))
return -1;
String ip=input1+"";
char[] cc=[Link]();
ArrayList<Character> c= new ArrayList<Character>();
for(char temp:cc)
[Link](temp);
String op="";
for(char temp:cc){
[Link]("frquency of"+temp+"is"+[Link](c,temp));
if([Link](c,temp)==1)
{
op+=temp+"";
}
}
[Link](op);
if([Link]()>1)
return [Link]([Link]([Link]()-1)+"");
else
return [Link]([Link](0)+"");
}
}
import [Link].*;
import [Link].*;
// 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<[Link];i++)
{
if(i==0||i==1)
{
[Link](input1[i]);
sum+=input1[i];
}
else
{
if(isprime(i)==1)
{
[Link](input1[i]);
sum+=input1[i];
}
}
}
[Link](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 [Link].*;
import [Link].*;
// 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;
[Link](input1);[Link](input2);[Link](input3);[Link](input4);[Link](input5);
for(int temp:ar)
{
flag=0;
[Link]();
int temp3=temp;
while(temp3>0)
{
[Link](temp3%10);
temp3=temp3/10;
}
freq=[Link](tar,[Link](0));
for(int temp2:tar)
if([Link](tar,temp2)!=freq)
flag=1;
if(flag==1)
unstable+=temp;
else
stable+=temp;
}
return stable-unstable;
}
}
Nambiar Number
Code
import [Link].*;
import [Link].*;
// Read only region start
class UserMainCode
{
public int nnGenerator(String input1){
// Read only region end
int len=[Link]();
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]=[Link](k)-48;
}
for(i=0;i<[Link];)
{
if(a[i]%2==0)
f=0;
else
f=1;
sum=a[i++];
if(f==0)
{
while(i<[Link]&&sum%2==0)
{
sum+=a[i++];
}
}
else
{
while(i<[Link]&&sum%2!=0)
{
sum+=a[i++];
}
}
res+=sum;
}
return ([Link](res));
}
}
Robot
import [Link].*;
import [Link].*;
// 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=[Link]("-");
int r=[Link](s2[0]);
int c=[Link](s2[1]);
if(r>input1||c>input2)
return (input3+"-ER");
String[] s=[Link](" ");
//[Link](s2[2]);
for(String ip:s)
{
[Link]("ip"+ip);
switch(ip)
{
case "L":
[Link]("Left");
if(s2[2].equals("E")){
s2[2]="N";
[Link](s2[2]);break;}
else if(s2[2].equals("N")){
s2[2]="W";
[Link](s2[2]);break;}
else if(s2[2].equals("W")){
s2[2]="S";
[Link](s2[2]);break;}
else if(s2[2].equals("S")){
s2[2]="E";
[Link](s2[2]);break;}
case "R":
[Link]("Right");
if(s2[2].equals("E")){
s2[2]="S";[Link](s2[2]);break;}
else if(s2[2].equals("S")){
s2[2]="W";[Link](s2[2]);break;}
else if(s2[2].equals("W")){
s2[2]="N";[Link](s2[2]);break;}
else if(s2[2].equals("N")){
s2[2]="E";[Link](s2[2]);break;}
case "M":
[Link]("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");
[Link]("Move");
break;
}
[Link](r+"-"+c+"-"+s2[2]);
}
return (r+"-"+c+"-"+s2[2]);
}
}
