Factorial Program using loop in java
Let's see the factorial Program using loop in Java.
#Source_code
#14

#Output
#14

Print all subarrays with 0 sum
Google Translate Icon

Given an integer array, print all subarrays with zero-sum.
Note that the problem deals with subarrays that are contiguous, i.e., whose elements occupy consecutive positions in the array.

#Data_Structure

Using Brute-Force

A naive solution is to consider all subarrays and find their sum. If the subarray sum is equal to 0, print it. The time complexity of the naive solution is O(n3) as there are n2 subarrays in an array of size n, and it takes O(n) time to find the sum of its elements. We can optimize the method to run in O(n2) time by calculating the subarray sum in constant time.
#Source_code
#Data_structure

Java 20 What's new in JDK 20 ?

With Oracle ongoing six-month release cadence and critical path updates, Java continues to thrive due to the core it is built upon: Trust, Innovation, and Predictability. JDK 20, the latest release of the java SE Platform, continues improving on the preview and incubator features unveiled in earlier versions. The new release includes improvement to the Java language and libraries, as well as updates to the Java concurrency model being developed via Project Loom.

Factorial Program using recursion in java
Let's see the factorial program in java using recursion.
#Source_code
#15

#Output
#15

Armstrong Number Java Program
The following Java program prints all the Armstrong numbers up to the specified limit.

Armstrong Number in Java
in this section, we will discuss what is Armstrong number and also create Java programs to check if the given number is an Armstrong number or not. The Armstrong number program frequently asked in java coding interviews and academics.
#Source_coude
#16

#Output
#16

Let's create another java program that checks if the number is an Armstrong number or not,

Armstrong Number
An Armstrong number is a positive m-digit number that is equal to the sum of the mth power of their digits. It is also known as pluperfect, or Plus Perfect, or Narcissistic number. It is an OEIS sequence A005188. Let's understand it through an example.
#Source_code
#17

Z Garbage Collector: The next Generation
The Z Garbage Collector (ZGC) - a scale, low-latency garbage collector providing sub-millisecond max pause times-continues to evolve. This session will review the design goals behind ZGC and provide a look into the impact of the upcoming support for multiple generations. It will also present general guidance on selecting a garbage collector given use case characteristics.

Let's create a program that generates random numbers using the random() method.

How to Generate Random Number in Java
In Java programming, we often required to generate random numbers while we develop applications. Many applications have the feature to generate numbers randomly, such as to verify the user many applications use the OTP. The best example of random numbers is dice. Because when we throw it, we get a random number between 1 to 6.

In this post, we will learn what is a random number and how to generate random numbers in Java.
#Source_code
#18

#Output
#18

Sort binary array in linear time

Given a binary array, sort it in linear time and constant space. The output should print all zeroes, followed by all ones.
#Data_structure

Practice this problem

A simple solution would be to count the total number of 0’s present in the array, say k, and fill the first k indices in the array by 0 and all remaining indices by 1.
#Source_code
#Data_structure