Core Java Programming Challenges #22 | Coding Challenges | Naresh IT

preview_player
Показать описание
Core Java Programming Challenges #22 | Coding Challenges | Naresh IT

💡 Also Watch

Java Programming Tutorials by Mr.Hari krishna:
Advanced Java Programming Tutorials by Mr.Nataraj:

Subscribe to our channel and hit the bell 🔔🔔🔔 icon to get video updates.

💡 Visit Our Websites
#CoreJava_Programing #Challenges #CoreJava #Quiz
--------------------------

💡 About NareshIT:

"Naresh IT is having 14+ years of experience in software training industry and the best Software Training Institute for online training, classroom training, weekend training, corporate training of Hadoop, Salesforce, AWS, DevOps, Spark, Data Science, Python, Tableau, RPA , Java, C#.NET, ASP.NET, Oracle, Testing Tools, Silver light, Linq, SQL Server, Selenium, Android, iPhone, C Language, C++, PHP and Digital Marketing in USA, Hyderabad, Chennai and Vijayawada, Bangalore India which provides online training across all the locations

--------------------------

💡 Our Online Training Features:
🎈 Training with Real-Time Experts
🎈 Industry Specific Scenario’s
🎈 Flexible Timings
🎈 Soft Copy of Material
🎈 Share Videos of each and every session.

--------------------------

💡 Please write back to us at

--------------------------

💡 Check The Below Links

Рекомендации по теме
Комментарии
Автор

public class Test{

public static void main(String[] args)
{
int[] arr={10, 20, 30, 40, 50, 60, 70};

int temp;
int n=arr.length;



for(int i=0;i<n/2;i++)
{
temp=arr[i];
arr[i]=arr[n-i-1];
arr[n-i-1]=temp;

}

for(int i:arr)
{
System.out.println(i);
}
}

}

cricbuffofficial
Автор

public static void main(String[] args) {
int ar[]= {1, 2, 3, 4, 5, 6, 7, 8};
for(int i=0;i<ar.length/2;i++) {
// reverse array
int temp=ar[i];
ar[i]=ar[ar.length-1-i];
ar[ar.length-1-i]=temp;
}
for(int i=0;i<ar.length;i++) {
// print array
System.out.print(ar[i]+" ");
}
}

prakashgoel
Автор

class Challenge22{
public static void main(String[] args) {
int[] a={1, 2, 3, 4, 5};
int i=0;
int j=a.length-1;
System.out.println(j);
while(i<j){
int temp=a[i];
a[i]=a[j];
a[j]=temp;
i++;
j--;
}
System.out.println("Array in descending order:");
for(int k=0;k<a.length;k++){
System.out.println(a[k]);
}

}
}

Yogesh-ldjs
Автор

import java.util.Arrays;

public class Challenge22 {
public static void main(String[] args) {
int a[] = {5, 7, 1, 4, 9};
int j = a.length-1, temp;
System.out.println("The original array"+Arrays.toString(a));
for(int i = 0;i <(a.length-1)/2;i++){
temp = a[i];
a[i] = a[j];
a[j] = temp;
j--;
}
System.out.println("The reveresed array"+Arrays.toString(a));
}
}

samahmahdi
Автор

public class Test {

public static void main(String[] args){
int[] arr = {1, 2, 3, 4, 5, 6, 7, 8};
int i = 0;
int j = arr.length-1;

while(i < j){
swap(arr, i, j);
i++;
j--;
}

}


private static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}

MaulikSakhida
Автор

public class JavaChallenge
{
public static void main(String[] args)
{
int arr[] = {2, 4, 1, 7, 3};
int i = 0;
int j = arr.length - 1;
int temp;
while(i<j)
{
temp = arr[i];
arr[i] = arr[j];
arr[j] =temp;
i++;
j--;
}
for(int x=0;x<arr.length;x++)
{
System.out.println(arr[x]+" ");
}
}
}

Sougata_
Автор

public static void main(String[] args) {
int c1[]= new int[]{1, 2, 3, 4, 5};

for(int i=0, j=c1.length-1;i<c1.length && j>=0;i++, j-- ) {
if(i==j) {
break;
}else {
int a = c1[i];
int b= c1[j];
c1[i]=b;
c1[j]=a;
}//else
}//for

}

pranavkaushal
Автор

public class CodeChallenge22_ReverseArray {


public static void main(String[] args) {
int[] a = { 5, 7, 66, 3, 33, 8 };
int mx_len = a.length;


for (int i = 0; i < a.length; i++) {


if (i < mx_len / 2) {
int b = a[i];
int e = a[mx_len - i - 1];


a[i] = e;
a[mx_len - i - 1] = b;
}
}
for (int z = 0; z < a.length; z++) {
System.out.print(a[z] + " ");
}



}


}

itisdawit
Автор

// Recursive method used in this program
import java.io.*;
class ReverseArray {

/* Function to reverse arr[] from start to end*/
static void reverseArray(int arr[], int start, int end)
{
int temp;
if (start >= end)
return;
temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
reverseArray(arr, start+1, end-1);
}

// method to print array

static void printArray(int arr[], int size)
{
for (int i=0; i < size; i++)
System.out.print(arr[i] + " ");
System.out.println("");
}
public static void main (String[] args) {
int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
printArray(arr, 10);
reverseArray(arr, 0, 9);
System.out.println("Reversed array is ");
printArray(arr, 10);
}
}

gsrcreations
join shbcf.ru