DEV Community: Biswa ranjan Patra

down and left side triangle in java

Biswa ranjan Patra — Wed, 04 Jun 2025 03:44:06 +0000

`public class DownLeftTrangle {

public static void main(String[] args) {
    for(int i=1;i<=5;i++)
    {
        for(int j=i;j<=5;j++)
        {
            System.out.print(j);
        }
        System.out.println();
    }

}

output:-

12345
2345
345
45
5

left triangle in not use inbuild method in java

Biswa ranjan Patra — Wed, 04 Jun 2025 03:41:08 +0000

`public class lefttrangle {

public static void main(String[] args) {
    for(int i=0;i<=4;i++){

        for(int j=0;j<=i;j++)
        {
            System.out.print(j);
        }
        System.out.println();
    }

}

}
`output :-

0
01
012
0123
01234

count vowel(a,e,i,o,u) & show element not use inbuild method

Biswa ranjan Patra — Wed, 04 Jun 2025 03:39:19 +0000

`public class Vowel {

public static void main(String[] args)
{
    String[] name= {"Hello","Bye","Notokay"};
    int vowelcount=0;
    for (int i = 0; i < name.length; i++) {
        String name1=name[i];// saparate the index
         char s=' '; // to create the empty charater
        for(int j=0;j<name1.length();j++)
        {
       char h=name1.charAt(j);// saparate the char 
       if(h=='a'||h=='e'||h=='i'||h=='o'||h=='u'||h=='A'||h=='E'||h=='I'||h=='O'||h=='U')
       {
           vowelcount ++;
           s=h;     
       }}
        System.out.println( s);    
    }       
    System.out.println("print the name "+ vowelcount ++);       
}}

`
OUTPUT:-

o
e
a
print the name 6

Fibonacci series

Biswa ranjan Patra — Sun, 01 Jun 2025 14:58:39 +0000

`public class fibonocser {

    public static void main(String[] args) {
        int n = 10;
        int a = 0, b = 1;
        System.out.print("Fibonacci Series: " + a + " " + b);

        for (int i = 2; i < n; i++) {
            int next = a + b;
            System.out.print(" " + next);
            a = b;
            b = next;
        }
    }

Fibonacci series without third variable

Biswa ranjan Patra — Sun, 01 Jun 2025 14:56:30 +0000

public class fib_no_series {
public static void main(String[] args) {
int f = -1;
int s = 1;
while ((f + s) < 13) {
System.out.println(f + s + " ");
s = f + s;
f = s - f;
}
}
}

print desanding order {10,9,8,7,6,5,4,3,2,1}

Biswa ranjan Patra — Sun, 01 Jun 2025 14:43:30 +0000

`public class DuplicateValueinArray {

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

// swapping number
num=a[j];
a[j]=a[i];
a[i]=num;

        }


    }
    System.out.println(a[i]);
}


}

}
`
output:-
10
9
8
7
6
5
4
3
2
1

Find the Duplicate value in an array integer, not use collection

Biswa ranjan Patra — Sun, 01 Jun 2025 11:13:02 +0000

package patten;

public class DuplicateValueinArray {

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

// how to find the duplicate in this Array .
for(int i=0;i<a.length;i++)
{
int key =a[i];
int count=1;
for(int j=1+i;j<a.length;j++)
{
if( key==a[j])
{
a[j]= '';
count++;
}

}
if(key!='')
{
System.out.println(key+" duplicate"+ count);
}
}

}
}

OUTPUT:-

1 duplicate2
2 duplicate2
3 duplicate2
4 duplicate1
5 duplicate1
6 duplicate1
7 duplicate1