Java Program to print the number of elements present in an array17 Mar 2025 | 1 min read In this program, we need to count and print the number of elements present in the array. The number of elements present in the array can be found by calculating the length of the array.  Length of above array is 5. Hence, the number of elements present in the array is 5. Algorithm
Program:Output: Number of elements present in given array: 5 Next TopicJava Programs |
In this program, we will create a doubly linked list and delete a node from the end of the list. If the list is empty, print the message "List is empty". If the list is not empty, tail's ious node will become the new tail...
6 min read
12344321 123**321 12****21 1******1 Algorithm: STEP 1: START STEP 2: SET lines=4 STEP 3: DEFINE i, j. STEP 4: SET space=0 STEP 5: SET i=0 STEP 6: REPEAT STEP 7 TO 20 UNTIL i STEP 7: SET j=1 STEP 8: REPEAT STEP 9 UNTIL j <= space. STEP 9: PRINT " " and SET J=J+1 STEP 10: SET...
2 min read
Seven segments display is an output display device. It provides a way to display information in the form of images, text, or decimal numbers. It is an alternative to complex dot matrix displays. Seven segment displays are widely used in digital or electronic devices like calculators,...
8 min read
In this program, we will create a doubly linked list and count the number of nodes present in the list. To count the node, we traverse through the list by incrementing the counter by 1. What count of nodes presents above doubly linked list is 5. Algorithm Define...
5 min read
In this program, we will create a circular linked list and print all the nodes present in the list. Circular Linked List: The circular linked list is a kind of linked list. First thing first, the node is an element of the list, and it has two...
4 min read
In this program, we need to create the binary tree by inserting nodes and displaying nodes in in-order fashion. A typical binary tree can be represented as follows: In the binary tree, each node can have at most two children. Each node can have zero, one...
4 min read
In this program, we need to check whether two trees are identical or not. For two trees to be identical, they have to satisfy two conditions: Structure of both the trees should be the same. Nodes present in one tree should be present in another tree. Above diagram...
4 min read
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. Armstrong Number An Armstrong number is a positive...
5 min read
Java program to print the following pattern on the console 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Algorithm: STEP 1: START STEP 2: SET n=5. STEP 3: SET i=0. REPEAT STEP 4 to STEP 8 UNTIL i<=n. STEP 4: SET j=0.REPEAT STEP 5 to STEP 6 UNTIL...
1 min read
Java Convert long to int We can convert long to int in java using typecasting. To convert higher data type into lower, we need to perform typecasting. Typecasting in java is performed through typecast operator (datatype). Here, we are going to learn how to convert long primitive type into...
1 min read
We request you to subscribe our newsletter for upcoming updates.
We provides tutorials and interview questions of all technology like java tutorial, android, java frameworks
G-13, 2nd Floor, Sec-3, Noida, UP, 201301, India
Python
Java
JavaScript
SQL
C
C++
HTML
CSS
React
Node.js
Spring Boot
C#
PHP
MySQL
MongoDB
AI
ML
DSA
DBMS
OS
Aptitude
Reasoning