Ninja was very fond of patterns. For a given integer ‘N’, he wants to make the N-Star Diamond.
Example:
Input: ‘N’ = 3
Output:
*
***
*****
*****
***
*
The first and only line of each test case contains an integer ‘N’.
Print the pattern as specified.
1 <= N <= 20
Time Limit: 1 sec
3
*
***
*****
*****
***
*
1
*
*
Iterate to all the cells.
Approach:
The solution is iterating on the pattern and print every cell using ‘*’ or spaces.
The steps are as follows :
Function void nDiamond(int ‘N’)
O( N * N ), Where N is the given input integer.
Two nested loops are running (2*N)*(2*N-1) times so that time complexity would be the order of N*N.
Hence the time complexity is O( N * N ).
O(1)
Since we are using constant extra space.
All tags
Sort by
Interview problems
These the basic code of Python
def nStarDiamond(n: int) -> None:
for i in range(n):
for space in range(n-i-1):
print(end=' ')
for j in range(2*i+1):
print('*', end='')
print()
for i in range(n, 0, -1):
for space in range(n-i):
print(end=' ')
for j in range(2*i-1):
print('*', end='')
print()
passInterview problems
codz with JAVA
public class Solution {
public static void nStarDiamond(int n) {
for( int i = 1; i <= n; i++){
for ( int j = 1; j <= n-i; j++){
System.out.print(" ");
}
for ( int j = 1; j <= 2*i -1; j++){
System.out.print("*");
}
System.out.println();
}
for ( int i = n; i >= 1; i--){
for ( int j = 1; j <= n-i; j++ ){
System.out.print(" ");
}
for ( int j = 1; j <= 2*i - 1; j++){
System.out.print("*");
}
System.out.println();
}
}
}
Interview problems
cpp
void nStarDiamond(int n) {
// Write your code here.
for(int i=0; i<n; i++){
//space
for(int j=0; j<(n-i-1); j++){
cout<<" ";
}
//star
for(int j=0; j<(2*i+1); j++){
cout<<"*";
}
//space
for(int j=0; j<(n-i-1); j++){
cout<<" ";
}
cout<<endl;
}
for(int i=0; i<n; i++){
//space
for(int j=0; j<i; j++){
cout<<" ";
}
//star
for(int j=0; j<2*n-2*i-1;j++){
cout<<"*";
}
//space
for(int j=0; j<i; j++){
cout<<" ";
}
cout<<endl;
}
}
Interview problems
solution
void nStarDiamond(int n) {
// Write your code here.
for(int i=0;i<n;i++){
int x=n;
for(int j=n;j>i+1;j--){
cout<<" ";
}
for(int j=0;j<(2*i+1);j++){
cout<<"*";
}
for (int j = n; j>i+1; j--) {
cout << " ";
}
cout<<endl;
}
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
cout<<" ";
}
for(int j=n;j>(2*i-n+1);j--){
cout<<"*";
}
for (int j = 0; j < i; j++) {
cout << " ";
}
cout<<endl;
}
}
Interview problems
c++ code
void nStarDiamond(int n) {
for(int i=1;i<=n;i++){
for(int j=0;j<=n-i-1;j++){
cout<<" ";
}
for(int j=0;j<2*i-1;j++){
cout<<"*";
}
cout<<endl;
}
for(int i=1;i<=n;i++){
for(int j=0;j<i-1;j++){
cout<<" ";
}
for(int j=0;j<2*(n-i)+1;j++){
cout<<"*";
}
cout<<endl;
}
}Interview problems
nstarDiamond
void nStarDiamond(int n) {
// Write your code here.
for(int i=0;i<n;i++){
//space
for(int j=0;j<n-i-1;j++){
cout<<" ";
}
//star
for(int j=0;j<2*i+1;j++){
cout<<"*";
}
//space
for(int j=0;j<n-i-1;j++){
cout<< " ";
}
cout<<endl;
}
for(int i=0;i<n;i++){
//space
for(int j=0;j<i;j++){
cout<< " ";}
//star
for(int j=0;j<2*n-(2*i+1);j++){
cout<<"*";
}
//space
for(int j=0;j<i;j++){
cout<< " ";
}
cout<<endl;
}
}
Interview problems
in c++
void nStarDiamond(int n) {
// Write your code here.
for(int i=0; i<n; i++){
for(int j=0; j<n-i-1; j++){
cout<< " ";
}
for(int k=0; k<2*i+1; k++){
cout<< "*";
}
cout<<endl;
}
for(int i=0; i<n; i++){
for(int j=0; j<i; j++){
cout<< " ";
}
for(int k=0; k<2*n-(2*i +1); k++){
cout<< "*";
}
cout<< endl;
}
}
Interview problems
Beginner Friendly Solution || C++
void nStarDiamond(int n) {
// Write your code here.
for(int i = 1;i<=n;i++){
for(int j =0;j<n-i;j++){
cout<<" ";
}
for(int k = 0;k<(2*i)-1;k++){
cout<<"*";
}
cout<<endl;
}
for(int i = n;i>=1;i--){
for(int j =0;j<n-i;j++){
cout<<" ";
}
for(int k = 0;k<(2*i)-1;k++){
cout<<"*";
}
cout<<endl;
}
}
Interview problems
Java code for diamond pattern
public class Solution {
public static void nStarDiamond(int n) {
// Write your code here
//first half
for (int i=1; i<=n;i++){
//space
for (int j=1;j<=n-i;j++){
System.out.print(" ");
}
//star
for(int k=1;k<=(2*i)-1;k++){
System.out.print("*");
}
System.out.println();
}
//second half
for (int i=1; i<=n;i++){
//space
for (int j=1;j<=i-1;j++){
System.out.print(" ");
}
//star
for(int k=1;k<=(2*n)-(2*i-1);k++){
System.out.print("*");
}
System.out.println();
}
}
}
Interview problems
Java Code
public static void nStarDiamond(int n) {
int a = 0;
int b = n;
for(int i=0; i<=n*2; i++){
for(int j=1; j<(n*2); j++){
if(i<n){
if( j < n - a){
System.out.print(" ");
}else if(j <= n + a){
System.out.print("*");
}
}else if(i>n){
if( j < n - b){
System.out.print(" ");
}else if(j <= n + b){
System.out.print("*");
}
}
}
if(i!=n){System.out.println();}
a++;
if(i>=n){
b--;
}
}
}
