11.

Character Replacement Problem

import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
String str=snr.nextLine();
char ch1=snr.next().charAt(0);
char ch2=snr.next().charAt(0);
String res=str.replace(ch1,'#').replace(ch2,ch1).replace('#',ch2);
System.out.println(res);
}
}
java -cp /tmp/iRE6jdLxGp/Main
apples
a
p
paales
----------------------------------------------------------------------------
12.Find the Minimum Value and Its Index in the Array Problem
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int n=snr.nextInt();
int arr[]=new int[n];
int res=0,count=0;
for(int i=0;i<n;i++){
arr[i]=snr.nextInt();
}
int minVal=arr[0];
int minInd=0;
for(int i=0;i<n;i++){
if(arr[i]<minVal){
minVal=arr[i];
minInd=i;
}
}
System.out.println(minVal+","+minInd);
}
}
java -cp /tmp/kC96uYRbNr/Main
5
5
2
4
1
3
1,3
-----------------------------------------------------------------------------
13.Find the Average of All Positive Numbers in an Array Problem
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int n=snr.nextInt();
int arr[]=new int[n];
int res=0,count=0;
for(int i=0;i<n;i++){
arr[i]=snr.nextInt();
 }
for(int i=0;i<n;i++){
if(arr[i]>0){
res+=arr[i];
count++;
}
}
System.out.println(res/count);
}
}
java -cp /tmp/F86lXF1DsD/Main
5
5
2
-4
1
3
2
-------------------------------------------------------------------------
14.Count the Occurrences of a Given Element in an Array Problem
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int n=snr.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++){
arr[i]=snr.nextInt();
}
int count=0;
int element=snr.nextInt();
for(int i=0;i<n;i++){
if(element==arr[i]){
count++;
}
}
System.out.println(count);
}
}
java -cp /tmp/dYPHQhKg48/Main
5
5
2
4
1
2
2
2
------------------------------------------------------------------------------
15. Check if an Array Contains a Given Element Problem
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int n=snr.nextInt();
int arr[]=new int[n];
for(int i=0;i<n;i++){
arr[i]=snr.nextInt();
}
 int count=0;
int element=snr.nextInt();
for(int i=0;i<n;i++){
if(element==arr[i]){
count++;
break;
}
}
if(count!=0){
System.out.println("True");
}
else{
System.out.println("False");
}
}
}
java -cp /tmp/asYVmA6ife/Main
5
5
2
4
1
3
2
True

=== Code Execution Successful ===

------------------------------------------------------------------------
16. Calculate Prime Sum Problem
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int m=snr.nextInt();
int n=snr.nextInt();
int sum=0;
for(int i=m;i<=n;i++){
int res=0;
for(int j=2;j<i;j++){
if(i%j==0){
res=1;
break;
}
}
if(res==0){
sum+=i;
}
}
System.out.println(sum);
}
}
java -cp /tmp/HiXTlQFCD0/Main
10
50
311
-----------------------------------------------------------------------------------
------
17.DIGIT SUM DIFFERENCE PROBLEM:
import java.util.Scanner;
public class Main{
public static void main(String args[]){
Scanner snr=new Scanner(System.in);
int m=snr.nextInt();
int n=snr.nextInt();
int sum=0,sum1=0,rem;
for(int i=m;i<=n;i++){
if(i%4==0){
int num=i;
while(num>0){
rem=num%10;
sum=sum+rem;
num=num/10;
}
}
if(i%7==0){
int num=i;
while(num>0){
rem=num%10;
sum1=sum1+rem;
num=num/10;
}
}
}
System.out.println(sum-sum1);
}
}
java -cp /tmp/HiXTlQFCD0/Main
50
120
61