Java Codes Basic to Advance

Reverse Decreasing Star pattern of number n

******
*****
****
***
**
*

CODE :

 

public class pattern1 {

    public static void reverseStar(int n) {
        // reverse pattern
        for (int i = n; i >= 0; i--) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        reverseStar(6);

    }

}

970 views</> ᴍᴜᴋᴇsʜ </>, edited 11:20

Java Codes Basic to Advance

Print Hollow Rectangle Pattern using java .

public class Hollowrect {
    public static void HollowrectPattern(int noOfRows, int noOfCols) {
        // for rows outer loop
        for (int i = 1; i <= noOfRows; i++) {
            // inner loop
            for (int j = 1; j <= noOfCols; j++) {
                // cell (i,j)
                if (i == 1 || i == noOfRows || j == 1 || j == noOfCols) {
                    System.out.print("*");

                } else {
                    System.out.print(" ");
                }

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        HollowrectPattern(4, 7);

    }
}

OutPut:

*******
*     *
*     *
*******

❤1

1.61K views</> ᴍᴜᴋᴇsʜ </>, edited 11:30

Java Codes Basic to Advance

Inverted Half Rotated Pyramid

public class invertrothalfpyramid {
    

    public static void inverted_half_pyramid(int n) {
        // outer loop
        for (int i = 1; i <= n; i++) {
            // empty space
            for (int j = 1; j <= n - i; j++) {
                System.out.print(" ");

            }
            // star
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        // InvertedHalfPiramid(4, 4);
        inverted_half_pyramid(4);

    }
}

Output:

   *
  **
 ***
****

❤1

1.31K views</> ᴍᴜᴋᴇsʜ </>, edited 06:45

Java Codes Basic to Advance

Inverted half pyramid of number .

public class invertedpyra {
    public static void Inverted_half_pyramid(int n) {
        for (int i = 1; i <= n; i++) {
            // inner loop

            for (int j = 1; j <= n - i + 1; j++) {
                System.out.print(j);

            }
            System.out.println();
        }
    }
    public static void main(String[] args) {
        Inverted_half_pyramid(6);
    }
}

Output:

❤2

1.17K views</> ᴍᴜᴋᴇsʜ </>, edited 07:16

Java Codes Basic to Advance

Ai telegram chatbot creation project

https://youtu.be/s6EQACzmLII?si=pnDL8IdAPC7HSlJl

YouTube

How to Build an AI Chatbot for Telegram using Telegraf and Node.js

This video is tutorial of AI Chatbot project. In this video I explained how to create Ai chatbot. Used Telegraf and axios to make this bot.

Keys:
create ai chatbot telegram, telegram ai chatbot tutorial, telegram bot with telegraf js, telegraf node js chatbot…

1.12K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, 04:32

Java Codes Basic to Advance

Floyd`s Triangle Pattern.

public class floydtriangle {
    public static void floyd(int n) {
        int count = 1;
        for (int i = 1; i <= n; i++) {

            for (int j = 1; j <= i; j++) {

                System.out.print(count + " ");
                count++;
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        floyd(5);

    }
}

OutPut:

1 
2 3
4 5 6
7 8 9 10
11 12 13 14 15

1.07K views</> ᴍᴜᴋᴇsʜ </>, 15:20

Java Codes Basic to Advance

0-1 Triangle Pattern

public class zeroone {
    public static void zeroOne_Triangle(int n) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                if ((i + j) % 2 == 0) {
                    System.out.print("1 ");

                } else {
                    System.out.print("0 ");

                }

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        zeroOne_Triangle(5);

    }
}

Output:

❤2

1.14K views</> ᴍᴜᴋᴇsʜ </>, 15:45

Java Codes Basic to Advance

Forwarded from Cᴏᴅᴇs Sɴɪᴘᴘᴇᴛs (</> ᴍᴜᴋᴇsʜ </>)

Butterfly Pattern using java of number n

public class Butterflypattern {
    public static void butterfly_pattern(int n) {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

            }
            for (int j = 1; j <= 2 * (n - i); j++) {
                System.out.print(" ");

            }
            for (int index = 1; index <= i; index++) {
                System.out.print("*");

            }
            System.out.println();

        }
        for (int i = n; i >= 1; i--) {
            for (int j = 1; j <= i; j++) {
                System.out.print("*");

            }
            for (int j = 1; j <= 2 * (n - i); j++) {
                System.out.print(" ");

            }
            for (int index = 1; index <= i; index++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        butterfly_pattern(5);

    }
}

Output:

*        *
**      **
***    ***
****  ****
**********
**********
****  ****
***    ***
**      **
*        *

❤1

1.66K views</> ᴍᴜᴋᴇsʜ </>, 16:34

Java Codes Basic to Advance

Solid Rhombus Pattern for number n

 public class solidrhomus {
    public static void solidrhomus_pattern(int n) {
        for (int i = 1; i <= n; i++) {
            
            for (int index = 1; index <= 2 * (n - i); index++) {
                System.out.print(" ");

            }
            for (int index = 1; index <= n; index++) {
                System.out.print("* ");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        solidrhomus_pattern(5);

    }
}

Output:

        * * * * * 
      * * * * *
    * * * * *
  * * * * *
* * * * *

1.21K views</> ᴍᴜᴋᴇsʜ </>, edited 16:49

Java Codes Basic to Advance

Hollow Rhombus Pattern for number n

public class hollowrhombus {
    public static void hollowrhombus_pattern(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 <= n; j++) {
                if (i == 1 | i == n | j == 1 | j == n) {
                    System.out.print("*");

                } else {
                    System.out.print(" ");

                }

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        hollowrhombus_pattern(5);

    }
}

Output:

    *****
   *   *
  *   *
 *   *
*****

1.3K views</> ᴍᴜᴋᴇsʜ </>, edited 17:08

Java Codes Basic to Advance

Forwarded from Cᴏᴅᴇs Sɴɪᴘᴘᴇᴛs (</> ᴍᴜᴋᴇsʜ </>)

Diamond Pattern of number n

public class diamond {
    public static void diamond_pattern(int n) {
        for (int i = 1; i <= n; i++) {
            // blank space
            for (int j = 1; j <= (n - i); j++) {
                System.out.print(" ");

            }
            // star
            for (int j = 1; j <= 2 * (i - 1) + 1; j++) {
                System.out.print("*");

            }
            System.out.println();

        }
        for (int i = n; i >= 1; i--) {
            // blank space
            for (int j = 1; j <= (n - i); j++) {
                System.out.print(" ");

            }
            // star
            for (int j = 1; j <= 2 * (i - 1) + 1; j++) {
                System.out.print("*");

            }
            System.out.println();

        }

    }

    public static void main(String[] args) {
        diamond_pattern(5);

    }
}

Output:

    *
   ***
  *****
 *******
*********
*********
 *******
  *****
   ***
    *

1.47K views</> ᴍᴜᴋᴇsʜ </>, 17:34

Java Codes Basic to Advance

Reverse an array

 public class reverseArr {
    public static void reverse(int numbers[]) {
        int start = 0;
        int last = numbers.length - 1;
        while (start < last) {
            int temp = numbers[last];
            numbers[last] = numbers[start];
            numbers[start] = temp;
            start++;
            last--;

        }

    }

    public static void main(String[] args) {
        int numbers[] = { 2, 4, 6, 8, 10, 12, 14, 16 };
        reverse(numbers);
        for (int i = 0; i < numbers.length; i++) {
            System.out.print(numbers[i] + " ");

        }

    }
}
// time complexbilty: 0(n)
// space complexbilty: 0(1)

Output:

 16 14 12 10 8 6 4 2

1.38K views</> ᴍᴜᴋᴇsʜ </>, 15:38

Java Codes Basic to Advance

Subarray

public class subArr {
    public static void subArray(int numbers[]) {
        for (int i = 0; i < numbers.length; i++) {
            int start = i;
            // subarr
            for (int j = i; j < numbers.length; j++) {
                int end = j;
                // System.out.print(numbers[j]);
                for (int k = start; k <= end; k++) {
                    System.out.print(+numbers[k] + " ");

                }
                System.out.println();

            }
            System.out.println();
        }

    }

    public static void main(String[] args) {
        int numbers[] = { 2, 4, 6, 8, 10 };
        subArray(numbers);

    }
}

Output:

❤1

1.6K views</> ᴍᴜᴋᴇsʜ </>, edited 17:21

Java Codes Basic to Advance

Maximum Subarray sum using Kadane's Algorithm.

 import java.util.*;

public class Kadane {
    public static void kaddanelgoSum(int numbers[]) {
        int currsum = 0;
        int maxsum = Integer.MIN_VALUE;
        for (int index = 0; index < numbers.length; index++) {
            currsum = currsum + numbers[index];

            if (currsum < 0) {
                currsum = 0;

            }
            // System.out.println(currsum);
            // if (maxsum < currsum) {
            // maxsum = currsum;

            // }
            maxsum = Math.max(currsum, maxsum);

        }
        System.out.println("max sum is : " + maxsum);

    }

    public static void main(String[] args) {
        // int numbers[] = { 2, 3, 4, 5 };
        int numbers[] = { -2, -3, 4, -1, -2, 1, 5, -3, };
        kaddanelgoSum(numbers);

    }
}

Output:

max sum is : 7

❤4

2K views</> ᴍᴜᴋᴇsʜ </>, 16:23

Java Codes Basic to Advance

Your Favorite language?

Anonymous Poll

288 voters1.95K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, 03:12

Java Codes Basic to Advance

TrapRainWater Code time complexibilty O(n)

public class traprainwat {
    public static int trapwater(int height[]) {
        // left max
        int n = height.length;
        int leftMax[] = new int[n];
        leftMax[0] = height[0];
        for (int i = 1; i < n; i++) {
            leftMax[i] = Math.max(height[i], leftMax[i - 1]);
        }

        // for (int i = 0; i < n; i++) {
        // System.out.print(leftMax[i]);
        // }

        // right max
        int rightMax[] = new int[n];
        rightMax[n - 1] = height[n - 1];

        for (int i = n - 2; i >= 0; i--) {
            rightMax[i] = Math.max(rightMax[i + 1], height[i]);

        }
        // for (int i = 0; i < rightMax.length; i++) {
        // System.out.print(rightMax[i]);

        // }

        // loop
        int traprainw = 0;
        for (int i = 0; i < n; i++) {
            // waterlevel=min(leftmax,rightmax)
            int waterlevel = Math.min(leftMax[i], rightMax[i]);
            // traprainwater=waterlevel-height[i]
            traprainw += waterlevel - height[i];

        }
        return traprainw;

    }

    public static void main(String[] args) {

        int height[] = { 4, 2, 0, 6, 3, 2, 5 };
        System.out.println(trapwater(height));

    }
}

Output:

❤2🔥2

2.51K views</> ᴍᴜᴋᴇsʜ </>, edited 05:56

Java Codes Basic to Advance

Best time to buy /sell any stock

public class buysell {
    public static int buySellStock(int prices[]) {
        int MaxProfit = 0;
        int buyPrice = Integer.MAX_VALUE;
        for (int index = 0; index < prices.length; index++) {
            if (buyPrice < prices[index]) {
                int profit = prices[index] - buyPrice;
                MaxProfit = Math.max(profit, MaxProfit);

            } else {
                buyPrice = prices[index];

            }

        }
        return MaxProfit;

    }

    public static void main(String[] args) {
        int prices[] = { 7, 1, 5, 6, 2, 3 };
        System.out.println(buySellStock(prices));
    }
}

Output:

❤2🔥2

3.03K views</> ᴍᴜᴋᴇsʜ </>, edited 15:26

Java Codes Basic to Advance

Join @LogicBots

For
Getting Updates of our bots
Sujjestion for new bot
Sujjestion for new features

https://t.me/logicBots

2.05K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, 04:26

Java Codes Basic to Advance

// Shows Indian Time

import java.time.*;
import java.time.format.DateTimeFormatter;

public class ISTTime {
    public static void main(String[] args) {
        // Get current time in IST
        ZoneId istZone = ZoneId.of("Asia/Kolkata");
        ZonedDateTime istTime = ZonedDateTime.now(istZone);

        DateTimeFormatter formatter = DateTimeFormatter.ofPattern("dd-MM-yyyy HH:mm:ss");

        System.out.println("Time (IST): " + istTime.format(formatter));
    }
}

// Output: t.me/c/2304534698/149

❤5

2.44K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, edited 02:33

Java Codes Basic to Advance

New Bot

@VideoCompress0bot

Direct send your large size video to this bot and it will convert to small size

Warning: Don't send already compressed video or low quality video other wise it will increase those size instead decreasing

❤1

2.68K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, 04:05

Java Codes Basic to Advance

Join BCA/MCA developers group on arattai
A Indian chat app by zoho Supported by government

https://chat.arattai.in/groups/t43545f313237373536333834333438343434363931355f32303030353533333235382d47437c3031303131353032353136343137353935303935383035393830

chat.arattai.in

BCA MCA ( Developers )

❤1

3.09K viewsराम सियाराम सियाराम जय जय राम 🙏 तुम साथ हो जो मेरे, किस चीज की कमी है ।, 16:50

About

Blog

Apps

Platform