Scribd
Upload
27 views5 pages

Java Solutions for Coding Challenges

The document contains code for 6 Java programs that solve different problems: 1) SavePrisoner finds the position of a prisoner after some steps. 2) HowManyCanSee counts how many buildings each person can see from their position in a line of buildings. 3) SherlockArray checks if an array is balanced by summing halves. 4) BraveArray finds the length of the longest subarray with ascending numbers. 5) BeautifulWords checks if a word only contains vowels in alternating order. 6) BalancedBrackets checks if brackets in a string are balanced using a stack.

Uploaded by

arunchinnathambi
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
27 views5 pages

Java Solutions for Coding Challenges

The document contains code for 6 Java programs that solve different problems: 1) SavePrisoner finds the position of a prisoner after some steps. 2) HowManyCanSee counts how many buildings each person can see from their position in a line of buildings. 3) SherlockArray checks if an array is balanced by summing halves. 4) BraveArray finds the length of the longest subarray with ascending numbers. 5) BeautifulWords checks if a word only contains vowels in alternating order. 6) BalancedBrackets checks if brackets in a string are balanced using a stack.

Uploaded by

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

SavePrisoner:

package savePrisoner;
import [Link].*;
public class SavePrisoner {

public static void main(String[] args)


{
Scanner sc=new Scanner([Link]);
int t=[Link]();
while(t-->0)
{
int np=[Link]();
int ns=[Link]();
int start=[Link]();
int pos=0;
if(ns>np)
{
pos=ns%np+start-1;
}
else
{
pos=ns+start-1;
}
[Link](pos);
}
}
}

HowManyCanSee

package howmanycansee;

/**
*
* @author 101874
*/
import [Link].*;
public class HowManyCanSee {

/**
* @param args the command line arguments
*/
public static void main(String[] args)
{
Scanner sc=new Scanner([Link]);
int n=[Link]();
int ar[]=new int[n];
int see[] =new int[n];
for(int i=0;i<n;i++)
ar[i]=[Link]();
int crt=0,cnt=0;
for(int i=0;i<n;i++)
{
crt=ar[i];
cnt=1;
for(int j=i-1;j>0;j--)
{
if(crt>ar[j])
cnt++;
else
{
//if (ar[j]>ar[j-1])
// cnt++;
break;
}
}
see[i]=cnt;
}
for(int i=0;i<n;i++)
[Link](see[i]);
}

SherlockArray:

package sherlockarray;

import [Link];

public class SherlockArray {

public static void main(String[] args)


{
// TODO code application logic here
Scanner sc=new Scanner([Link]);
int n=[Link]();
boolean flag=false;
int[] ar=new int[n];
for(int i=0;i<n;i++)
ar[i]=[Link]();
int lsum=0,rsum=0;
for(int i=1;i<n-1;i++)
{
lsum=0;
rsum=0;
for(int j=0;j<i;j++)
lsum+=ar[j];
for(int k=i+1;k<n;k++)
rsum+=ar[k];
if(lsum==rsum)
{
flag=true;
break;
}

}
if(flag)
[Link]("Yes");
else
[Link]("No");
}

}
BraveArray:

package bravearray;
import [Link].*;
public class BraveArray
{
public static void main(String[] arg)
{
Scanner sc=new Scanner([Link]);
int n=[Link]();
int flag=-1;
int[] ar=new int[n];
for(int i=0;i<n;i++)
ar[i]=[Link]();
int cnt=0,tcnt=0;

for(int i=0;i<n-1;i++)
{
if(ar[i]<ar[i+1])
{
if(flag==1)
{
tcnt++;
}
else if(flag==0 | flag==-1)
{
flag=1;
cnt=cnt<tcnt?tcnt:cnt;
tcnt=2;
}
}
else
{
if(flag==1 |flag ==-1)
{
flag=0;
cnt=cnt<tcnt?tcnt:cnt;
tcnt=2;
}
else
tcnt++;
}
}

[Link](cnt);
}
}

BeautifulWords:

package beautifulwords;
import [Link].*;
public class BeautifulWords {

public static void main(String[] args) {


// TODO code application logic here

Scanner sc =new Scanner([Link]);


String s=[Link]().toLowerCase();
int len=[Link]();
boolean flag=true;
for(int i=0;i<len-1;i++)
{
if(([Link](i)!=[Link](i+1)))
{
if(isVowel([Link](i))&&isVowel([Link](i+1))){
flag=false;
break;}
}
else
{
flag=false;
break;
}
}
if(flag)
[Link]("Beautiful Word");
else
[Link]("Not a Beautiful Word");
}
private static boolean isVowel(char c)
{
boolean flag=false;
if(c=='a'|c=='e'|c=='i'|c=='o'|c=='u')
flag=true;
return flag;
}

BalancedBrackets;

package balancedbrackets;

/**
*
* @author 101874
*/
import [Link].*;
public class BalancedBrackets {

public static void main(String[] args)


{
Scanner sc=new Scanner([Link]);
int t=[Link]([Link]());
while(t-->0){
char[] s=[Link]().toCharArray();
char[] stack=new char[[Link]];
int sTop=-1;
boolean flag=true;
for(int i=0;i<[Link];i++)
{
if(s[i]=='{'|s[i]=='('|s[i]=='[')
{
stack[++sTop]=s[i];
}
else
{
if(stack[sTop]=='{'&&s[i]=='}')
{
stack[sTop--]='\0';
}
else if(stack[sTop]=='('&&s[i]==')')
{
stack[sTop--]='\0';
}
else if(stack[sTop]=='['&&s[i]==']')
{
stack[sTop--]='\0';
}
else
{
flag =false;
break;
}
}
}
if(flag)
[Link]("Yes");
else
[Link]("No");
}
}

You might also like