Page Contents
- 1 Diamond Pattern Program In Java that Most Asked in Interview
- 1.1 And below Java concepts are used to print that patterns
- 1.2 1). Program to print half pyramid pattern using star(*) in Java
- 1.3 2). Program to print left half diamond pattern using star(*) in Java
- 1.4 3). Program to print full diamond pattern using star(*) in Java
- 1.5 Also prepare these Java Pattern Programs:
Interview Content
- C Programming Coding Questions
- C Pattern Programming Questions
- C Programming Interview Questions
- Java Programming Coding Questions
- Java Pattern Programming Questions
- Java Programming Interview Questions
- Python Programming Coding Questions
- Python Pattern Programming Questions
- Python Programming Interview Questions
- SQL Interview Questions
Diamond Pattern Program In Java that Most Asked in Interview
And below Java concepts are used to print that patterns
- For Loop
- While Loop
- if..else
1). Program to print half pyramid pattern using star(*) in Java
import java.util.*;
class Main{
public static void main(String ...a){
int i,j,k;
Scanner sc= new Scanner(System.in);
System.out.print("enter the number of row for half diamond: ");
int n= sc.nextInt();
for(i=1;i<=n;i++)
{
for(k=1;k<=i;k++){
System.out.print("*");
}
System.out.println("");
}
for(i=n;i>1;i--)
{
for(k=i;k>1;k--){
System.out.print("*");
}
System.out.println("");
}
}
}
Output
2). Program to print left half diamond pattern using star(*) in Java
import java.util.*;
class Main{
public static void main(String ...a){
int i,j,k;
Scanner sc= new Scanner(System.in);
System.out.print("enter the number of row for half diamond: ");
int n= sc.nextInt();
for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++){
System.out.print(" ");
}
for(k=0;k<=i;k++){
System.out.print("*");
}
System.out.println("");
}
for(i=n-1;i>0;i--)
{
for(j=n;j>=i;j--){
System.out.print(" ");
}
for(k=i;k>0;k--){
System.out.print("*");
}
System.out.println("");
}
}
}
Output
3). Program to print full diamond pattern using star(*) in Java
import java.util.*;
class Main{
public static void main(String ...a){
int i,j,k;
Scanner sc= new Scanner(System.in);
System.out.print("enter the number of row for full diamond: ");
int n= sc.nextInt();
for(i=0;i<n;i++)
{
for(j=0;j<n-i-1;j++){
System.out.print(" ");
}
for(k=0;k<2*i+1;k++){
System.out.print("*");
}
System.out.println("");
}
for(i=n-1;i>0;i--)
{
for(j=n-1;j>=i;j--){
System.out.print(" ");
}
for(k=2*i-1;k>0;k--){
System.out.print("*");
}
System.out.println("");
}
}
}
Output
Latest Uploads on Website
- AVL Tree with explanation
- Radix sort algorithm explanation with example
- Quick Sort Algorithm with explanation
- Bubble sorting algorithm with Bubble sort program in C
- Insertion sort algorithm and program in C
- Selection Sort Algorithm and Program in C
- Linear probing technique explanation with example
- Collision in Hashing and Collision resolution technique
- Hashing in data structure with its types
- Binary search tree operations with Program
- Binary search tree in data structure
- Binary search algorithm in data structure with explanation
- linear search in data structure with Algo and Program