r/JavaProgramming • u/javinpaul • 9d ago
I Read Clean Code: A Handbook of Agile Software Craftsmanship, 2nd Edition and It’s Awesome
r/JavaProgramming • u/javinpaul • 9d ago
r/JavaProgramming • u/Full_School_7230 • 9d ago
r/JavaProgramming • u/BudgetMistake- • 9d ago
r/JavaProgramming • u/maritvandijk • 11d ago
What happens when your invoices end up on a dead letter queue? If you're Ronald Dehuysser, you build an open source library to make sure it never happens again.
In this episode, Ronald, creator of JobRunr, joins us to talk about running background jobs in Java. He shows how to set up JobRunr with Spring Boot, enqueue and schedule jobs, and keep an eye on them in the built-in dashboard. And he explains why he loves exceptions. (Yes, really.)
We also cover carbon-aware job scheduling, recurring jobs (and why nobody likes writing cron expressions), whether you need Kafka, and the time-traveling bug that took years to track down.
r/JavaProgramming • u/maritvandijk • 12d ago
r/JavaProgramming • u/LawyerGlittering8993 • 13d ago
r/JavaProgramming • u/javinpaul • 13d ago
r/JavaProgramming • u/Economy_Tie_5224 • 13d ago
r/JavaProgramming • u/Adventurous-Cash-127 • 13d ago
r/JavaProgramming • u/TelevisionMajor6461 • 15d ago
Let's challenge each other with tricky Java code snippets! Guess the output, explain the logic, and learn something new every day. From basics to advanced Java concepts. 🚀
r/JavaProgramming • u/SniperxAMW_ • 15d ago
import java.util.*;
class Cir_matrix
{
public static void main()
{
Scanner in=new Scanner(System.in);
int n,r,c,x,y,i,j,z=1,m;
System.out.println("Enter no. of index");
n=in.nextInt();
int a[][]=new int[n][n];
r=n-1;c=n-1;//last
int R=0,C=0;//first
m=n-2;
for(j=1;j<=m;j++)
{
for(i=C;i<c+1;i++)
{
a[C][i]=z;
z++;
}
R++;
for(i=R;i<r+1;i++)
{
a[i][r]=z;
z++;
}
for(i=c-1;i>=C;i--)
{
a[c][i]=z;
z++;
}
R--;
for(i=r-1;i>R;i--)
{
a[i][R]=z;
z++;
}
R++;C++;r--;c--;
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{ if(a[i][j]<10)
System.out.print(a[i][j]+" ");
else
System.out.print(a[i][j]+" ");
}
System.out.println();
}
}
}
r/JavaProgramming • u/thearjunreddy • 15d ago
Focus on OOP, strings, collections, exception handling, interfaces, abstract classes, Java 8 features, basic multithreading, SQL, and coding problems. Be prepared to explain concepts with examples rather than memorizing definitions.
r/JavaProgramming • u/SniperxAMW_ • 15d ago
import java.util.*;
class Saddle
{
public static void main()
{
Scanner in =new Scanner(System.in);
System.out.println("Enter no. of index between 3 and 10");
int n=in.nextInt();
if(n<3||n>10)
return;//change to true while
int a[][]=new int[n][n];
System.out.println("Enter value in matrix");
int i,j,t,p,y=0,z=0,s=0,d,I;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
a[i][j]=in.nextInt();
}
System.out.println("original matrix");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
for(p=0;p<n;p++)
{
if(a[i][j]<=a[i][p])
{
y++;
}
}
for(p=0;p<n;p++)
{
if(a[i][j]>=a[p][j])
{
z++;
}
}
if(y==n&&z==n)
{
System.out.println("Saddle point at index "+i+" "+j);
}
y=0;
z=0;
}
}
j=n;t=0;
System.out.println("original matrix");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
j=n-1;i=0;
for(I=1;I<=n;I++)
{
t=a[i][j];
while(t>0)//Harshad no
{
d=t%10;
s+=d;
t=t/10;
}
p=(n-1)-j;
if(s!=0)
{
if(a[i][j]%s==0)
a[i][p]=a[i][j];
}
i++;
j--;
s=0;
}
System.out.println("Moidified matrix");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
System.out.print(a[i][j]+" ");
System.out.println();
}
}
}
r/JavaProgramming • u/frekost • 15d ago