Scribd
Upload
3K views

MileStone-2 Exam Question Answer (Maybe)

The document contains code to solve several problems: 1. Find the sum of elements at prime index positions in an array. It uses a method to check if a number is prime. 2. Find a PIN number by finding the max and min digits of input numbers, multiplying them together and subtracting a fourth input. 3. Several methods to find the sum of prime numbers in an array, excluding either the largest or smallest prime number.

Uploaded by

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

MileStone-2 Exam Question Answer (Maybe)

The document contains code to solve several problems: 1. Find the sum of elements at prime index positions in an array. It uses a method to check if a number is prime. 2. Find a PIN number by finding the max and min digits of input numbers, multiplying them together and subtracting a fourth input. 3. Several methods to find the sum of prime numbers in an array, excluding either the largest or smallest prime number.

Uploaded by

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

Calculate sum of Prime Index values in an array

import java.util.ArrayList;

public class SumOfPrimeIndexvalue {


public static int sumOfPrimeIndexvalues(int []input1,int
input2)
{
int sum=0;
ArrayList<Integer>arr=new ArrayList<>();
for(int i=0;i<input2;i++)
{
if(isPrime(i)==true)
{
arr.add(input1[i]);
}
}
for( int i=0;i<arr.size();i++)
{
sum+=arr.get(i);
}
return sum;
}
public static boolean isPrime(int n)
{
if(n<=1)
return false;
for(int i=2;i<n;i++)
{
if(n%i==0)
return false;
}
return true;
}
public static void main(String[] args) {
System.out.println("Main.main()");
// int array[]={10,20,30,40,50,60,70,80,90,100};
// int array[]={-4,5};
int array[]={-1,-2,-3,3,4,-7};
System.out.println(sumOfPrimeIndexvalues(array,
array.length));
}
}

Find PIN

import java.util.ArrayList;
import java.util.Scanner;

public class FindPin {


public static int pin(int input1,int input2,int input3,int
input4)
{
ArrayList<Integer> arr=new ArrayList<>();
ArrayList<Integer> maxArray=new ArrayList<>();
ArrayList<Integer> minArray=new ArrayList<>();

arr.add(input1);
arr.add(input2);
arr.add(input3);

for(int i=0;i<arr.size();i++)
{
maxArray.add(max(arr.get(i)));
minArray.add(min(arr.get(i)));
}
int pin=((maxArray.get(0)*minArray.get(0))+
(maxArray.get(1)*minArray.get(1))+
(maxArray.get(2)*minArray.get(2)))-input4;

return pin;
}
public static int max(int input)
{
int maxNo=Integer.MIN_VALUE;
char ch[]=Integer.toString(input).toCharArray();
for(int i=0;i<ch.length;i++)
{
if(Integer.parseInt(String.valueOf(ch[i]))>maxNo)
{
maxNo=Integer.parseInt(String.valueOf(ch[i]));
}
}
return maxNo;

}
public static int min(int input)
{
int minNo=Integer.MAX_VALUE;
char ch[]=Integer.toString(input).toCharArray();
for(int i=0;i<ch.length;i++)
{
if(Integer.parseInt(String.valueOf(ch[i]))<minNo)
{
minNo=Integer.parseInt(String.valueOf(ch[i]));
}
}
return minNo;

}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();

System.out.println(pin(input1,input2,input3,input4));

}
}

Find sum of all Prime Numbers in the array, except the largest
prime number

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

public class PrimeNumberArrayExceptLargest {


public static int primeNumberArray(int input1[],int
input2)
{
int sum=0;
ArrayList<Integer>arr=new ArrayList<>();

for(int i=0;i<input2;i++)
{
if(isPrime(input1[i])==true)
{
arr.add(input1[i]);
}
}
if(arr.isEmpty())
{
Arrays.sort(input1);
for(int i=0;i<input2-1;i++)
{
sum+=input1[i];
}
}
else
{
int max=Collections.max(arr);
arr.remove(max);
for (Integer integer : arr) {
sum+=integer;
}
}
return sum;
}
public static boolean isPrime(int n)
{
if(n<=1)
return false;
for(int i=2;i<n;i++)
{
if(n%i==0)
return false;
}
return true;
}
public static void main(String[] args) {
// int array[]={10,41,18,50,43,31,29,25,59,96,67};
int array[]={10,20,30,40};
System.out.println(primeNumberArray(array,
array.length));

}
}
Find sum of all Prime Numbers in the array, except the smallest
prime number

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;

public class PrimeNumberArrayExceptSmallest {


public static int primeNumberArraySmallest(int
input1[],int input2)
{
int sum=0;
ArrayList<Integer>arr=new ArrayList<>();

for(int i=0;i<input2;i++)
{
if(isPrime(input1[i])==true)
{
arr.add(input1[i]);
}
}
if(arr.isEmpty())
{
Arrays.sort(input1);

for(int i=1;i<input2;i++)
{
sum+=input1[i];
}
}
else
{
int min=Collections.min(arr);
for (Integer integer : arr) {
sum+=integer;
}
sum-=min;
}
return sum;
}
public static boolean isPrime(int n)
{
if(n<=1)
return false;
for(int i=2;i<n;i++)
{
if(n%i==0)
return false;
}
return true;
}
public static void main(String[] args) {
// int array[]={10,41,18,50,43,31,29,25,59,96,67};
int array[]={10,20,30,40};
System.out.println(primeNumberArraySmallest(array,
array.length));
}
}

Find PIN (Part-2)

import java.util.ArrayList;
import java.util.Scanner;

public class FindPin_2 {


public static int pinPart_2(int input1,int input2,int
input3,int input4)
{
ArrayList<Integer> arr=new ArrayList<>();
ArrayList<Integer> maxArray=new ArrayList<>();
ArrayList<Integer> minArray=new ArrayList<>();

arr.add(input1);
arr.add(input2);
arr.add(input3);

for(int i=0;i<arr.size();i++)
{
maxArray.add(max(arr.get(i)));
minArray.add(min(arr.get(i)));
}

int
pin=((maxArray.get(0)*minArray.get(0))*(maxArray.get(1)*minArr
ay.get(1))*(maxArray.get(2)*minArray.get(2)))-input4;

return pin;
}
public static int max(int input)
{
int maxNo=Integer.MIN_VALUE;
char ch[]=Integer.toString(input).toCharArray();
for(int i=0;i<ch.length;i++)
{
if(Integer.parseInt(String.valueOf(ch[i]))>maxNo)
{
maxNo=Integer.parseInt(String.valueOf(ch[i]));
}
}
return maxNo;
}
public static int min(int input)
{
int minNo=Integer.MAX_VALUE;
char ch[]=Integer.toString(input).toCharArray();
for(int i=0;i<ch.length;i++)
{
if(Integer.parseInt(String.valueOf(ch[i]))<minNo)
{
minNo=Integer.parseInt(String.valueOf(ch[i]));
}
}
return minNo;
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int input1=sc.nextInt();
int input2=sc.nextInt();
int input3=sc.nextInt();
int input4=sc.nextInt();

System.out.println(pinPart_2(input1,input2,input3,input4));
}
}

The String Decoder


A:1
B:11
C:111

import java.io.*;
public class Code35 {
static String stringDecode(String s){
StringBuffer sb=new StringBuffer();
int count=0;
for(int i=0;i<s.length();i++){
char ch=s.charAt(i);
if(ch=='0'){
sb.append((char)('A'+count-1));
count=0;
}
else if(ch=='1'){
count++;
}
}
return sb.toString();
}

public static void main(String[] args) throws Exception {


BufferedReader inp=new BufferedReader(new
InputStreamReader(System.in));
String s=inp.readLine();
System.out.println(stringDecode(s));
}
}

Find the Order

Input1: ACZa
Input2: tbGB

import java.io.*;
public class Code15 {
static String test(String s1,String s2){
StringBuffer sb=new StringBuffer();

int f=incrOrDec(s1);
if(f==-1){
return "invalid";
}

if(f==0){
int count=0;
for(int i=0;i<s2.length();i++){
int j=i+1;
while(j<s2.length() &&
s2.charAt(i)<=s2.charAt(j)){
j++;
}

if(j!=s2.length()){
count=(j-i)+1;
break;
}
}

sb.append("<Increasing>:");
sb.append(count);
}
else{
int count=0;
for(int i=0;i<s2.length();i++){
int j=i+1;
while(j<s2.length() &&
s2.charAt(i)>=s2.charAt(j)){
j++;
}
if(j!=s2.length()){
count=(j-i)+1;
break;
}
}

sb.append("<Decreasing>:");
sb.append(count);
}

return sb.toString();
}

static int incrOrDec(String s){


if(s.charAt(0)<=s.charAt(1)){
int i=1;
while(i<s.length() && s.charAt(i-1)<=s.charAt(i)){
i++;
}

if(i!=s.length()){
return -1;
}

return 0;
}

else{
int i=1;
while(i<s.length() && s.charAt(i-1)>=s.charAt(i)){
i++;
}

if(i!=s.length()){
return -1;
}
return 1;
}
}

public static void main(String[] args) throws Exception {


BufferedReader inp=new BufferedReader(new
InputStreamReader(System.in));
String s1=inp.readLine();
String s2=inp.readLine();

System.out.println(test(s1, s2));
}
}

Find first repeated element in the given array from the tail of the
array

If input1={1,2,4,1,2,8} representing the given array, and


Input2=6 representing the number of elements in the array. Then the result should be 2
which is the first repeated number in the array from the rear end.

public class FirstRepeatedElementFromTail {


private static int solve(int arr[], int length) {
int res = 0;
int temp = 0;
for (int i=arr.length-1; i>=0; i--) {
if(arr[i] == 0 || arr[i] < 0) continue;
else {
temp = arr[i];
for (int j=i-1; j>=0; j--) {
if(temp == arr[j]) {
res = temp;
return res;
}
}
}
res = temp;
}
return res;
}

public static void main(String[] args) {


int arr []= new int[] {1,2,4,1,2,8};
// int arr []= new int[] {1,2,6,7,5};
//1,4,2,5,3,8,9,5 //1,4,2,1,3,8,9,5
//0,0,0,0,-4,-8,-
7,0 //1,2,6,7,5
System.out.println(solve (arr, arr.length));
}

Find first repeated element in the given array from the first index

If input1={1,2,4,1,2,8} representing the given array, and


Input2=6 representing the number of elements in the array. Then the result should be 1
which is the first repeated number in the array.

public class Demo{


public static void firstIndex(int input1[],int input2)
{
int k=0;
int max=input2;
for(int i=0;i<input2;i++)
{
if(max<input1[i])
{
max=input1[i];
}
}
int []a=new int[max+1];
int []b=new int[max+1];

for(int i=0;i<input2;i++)
{
if(a[input1[i]]!=0)
{
b[input1[i]]=1;
k=1;
continue;
}
else
{
a[input1[i]]=i+1;
}
}
if(k==0)
System.out.println(input1[max-1]);
else
{
int min=max+1;
for(int i=0;i<max+1;i++)
{
if(a[i]!=0&& min>a[i]&&b[i]!=0)
{
min=a[i];
}
}
System.out.println(input1[min-1]);
}
System.out.println();
}
public static void logic(int input1[],int n)
{
int i,t;
for(i=0;i<n/2;i++)
{
t=input1[i];
input1[i]=input1[n-i-1];
input1[n-i-1]=t;
}
}
public static void main(String[] args) {
// int arr[]={1,2,4,1,2,8};
// int arr[]={0,0,0,0,0,0};
// int arr[]={1,2,3,4,5,6};
int arr[]={-1,-2,-3};
int n=arr.length;
logic(arr, n);
firstIndex(arr, n);
}
}

public class Main {


private static int solve(int arr[], int length) {
int res = 0;
int temp = 0;
for (int i=0; i<arr.length; i++) {
if(arr[i] == 0 || arr[i] < 0) continue;
else {
temp = arr[i];
for (int j=i+1; j<arr.length; j++) {
if(temp == arr[j]) {
res = temp;
return res;
}
}
}
res = temp;
}
return res;
}

public static void main(String[] args) {


int arr []= new int[] {0,0,0,0,-4,-8,-7,0};
// int arr []= new int[] {1,2,6,7,5};
//1,4,2,5,3,8,9,5 //1,4,2,1,3,8,9,5
//0,0,0,0,-4,-8,-
7,0 //1,2,6,7,5
System.out.println(solve (arr, arr.length));
}

Find ordered words count

import java.io.*;

public class Code7 {


static int test(String s){
int count=0;
String str[]=s.split(" ");
for(int i=0;i<str.length;i++){
s=str[i];
int max=0;
boolean temp=true;
for(int j=0;j<s.length();j++){
if(s.charAt(j)>=max){
max=s.charAt(j);
}
else{
temp=false;
break;
}
}
if(temp){
count++;
}
}
return count;
}
public static void main(String[] args) throws Exception {
BufferedReader inp=new BufferedReader(new
InputStreamReader(System.in));
String str=inp.readLine();
System.out.println(test(str));
}
}

You might also like