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

Core Java Programming Challenges #32 | 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

[neerajjain]

// find all leaders element in the array
// a element which is greater that all element that is right size of that element is a leader element
public class Challenge31 {
public static void main(String[] args) {
int arr[] = { 3, 9, 4, 5, 7, 6, 1 };
for (int i = 0; i < arr.length; i++) {
boolean isLeader = true;
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] < arr[j]) {
isLeader = false;
break;
}
}
if (isLeader) {
System.out.println("Find leader element is : " + arr[i]);
}
}
}
}

[Sougata_]

public class JavaChallenge
{
public static void main(String[] args)
{
int arr[] = {12, 2, 9, 4, 3, 5, 8, 1};
for(int i=0;i<arr.length-1;i++)
{
int count = 0;
for(int j=i+1;j<arr.length;j++)
{
if(arr[j]>arr[i])
{
count++;
break;
}
}
if(count==0)
{
System.out.println("the leader element is:"+arr[i]);
}
}
}
}

[prakashgoel]

public static void main(String[] args) {
int a[]= {12, 2, 9, 4, 3, 5, 8, 1};
for (int i = 0; i < a.length-1; i++) {
int count=0;
for (int j = i+1; j < a.length; j++) {
if(a[i]<a[j]) {


}
}
if(count==0) {
System.out.print(a[i]+" ");
}
}
}

[kuntaldas]

public class LeaderElements {

public static void main(String[] args) {
int a[]= {12, 2, 9, 4, 3, 5, 8, 1};
for(int i=0;i<a.length-1;i++) {
int max=a[i];int count=0;
for(int j=i+1;j<a.length;j++) {
if(a[j]>max) {


}

}
if(count>0)
continue;
System.out.println(a[i]);
}
}

}

[sreedharkamera]

class Test
{
public static void main(String[] args)
{

int arr[]= {12, 2, 9, 4, 3, 5, 8, 1};
int k=arr.length;

for(int i=0;i<k;i++)
{

for(int j=i+1;j<k;j++)
{
if(arr[i]<=arr[j]) //checking current element same as next element
{

break;
}
if(j==k-1)
{
System.out.println("Leader element:"+arr[i]);
}

}
}

}

}

[SunilKumarSunil]

public static void main(String[] args) {
int[] arr = {12, 2, 9, 4, 3, 5, 8, 1};
for(int i = 0;i<arr.length;i++)
{
int count = 0;
for(int j = i+1;j<arr.length;j++)
{
if(arr[i]>arr[j])
{
= 1;
}
else if(arr[i]<arr[j])
{
= 0;

}

}
if(count==1)
{
System.out.print(arr[i]+" ");
}
}
}

[samahmahdi]

//Finding all LEADERS elements in Array

import java.util.List;
import java.util.ArrayList;

public class Challenge32 {
public static void main(String[] args) {
int a[] = {4, 2, 7, 1, 3, 0, 2, 1};
int count = 0;
List<Integer> leaders = new ArrayList<>();
for(int i=0;i<a.length;i++){
count = 0;
for (int j= i+1; j<a.length; j++){
if(a[i]<a[j])
break;
else count++;
}
if(count == a.length - i-1 && count !=0)
leaders.add(a[i]);
}
System.out.println("The leaders : "+leaders);
}
}

[aravindbabucg]

Formatted console io operations note I need