Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles on Trending Technologies
Technical articles with clear explanations and examples
Print all Palindromic Levels of a Binary Tree
In this problem, we will print each palindromic level of the given binary tree. We can use the breadth−first search algorithm to traverse each level of the given binary tree and check whether a particular level of the binary tree is palindromic. If yes, we print the level in the output. Problem statement − We have given a binary tree, and we need to print all palindromic levels of the binary tree. If any particular level of the binary tree contains the same numbers from left to right and right to left, we can say that the current level is ...
Read MorePrint all Nodes Except Rightmost Node of Every Level of the Binary Tree
In this problem, we will print all the nodes of the binary tree except the rightmost node of each level. We will use the level order traversal to traverse the binary tree, and we won’t print the last node of each level, which is the rightmost node. Problem statement − We have given a binary tree containing different nodes. We need to print all nodes of the binary tree except right most node. Sample examples Input 7 / \ ...
Read MoreMinimize the Maximum difference between Adjacent Elements in an Array
In this problem, we will minimize the maximum difference between adjacent elements by removing any M elements from the array. The naïve approach to solving the problem is to pick total N − M array elements and check which set contains the minimum or maximum adjacent difference. The optimized approach uses the queue data structure to solve the problem. Problem statement : We have given an sorted array of numbers in sorted order. We have also given M. We need to remove M elements from the array such that we can minimize the maximum difference between the adjacent array ...
Read MoreProcessBuilder in Java to create a basic online Judge
Online judge is a platform that serves to compile, execute and evaluate programming solutions to a given problem. It is widely used for problem solving and organizing programming contests. To create a basic online judge in Java using ProcessBuilder class, define an instance of ProcessBuilder and specify the name of program and commands as arguments The ProcessBuilder class is used to create and manage operating system processes. It allows us to chain multiple processes, where the output of one process can be used as the input to another process. Also, it provides a variety of built-in methods such as redirectOutput(), ...
Read MoreDifference between JIT and JVM in Java
When we start learning Java, we often come across the terms like JIT and JVM. Having a good understanding of the relationship and differences between both terms is crucial, as they are part of fundamental concepts in the Java programming language. JVM is the main component of the Java Runtime Environment that executes Java bytecode, whereas JIT is a compiler available in the JVM. This article aims to explain the difference between JIT and JVM. JIT vs JVM in Java JVM It is an acronym that stands for Java Virtual Machine. The name itself suggests that it is something that ...
Read MoreDifference Between Source Code and Byte Code
When we start learning Java, we often come across the two terms Source code and Byte code. When a programmer writes Java code, it is in a form that a machine cannot understand. This code is termed as source code, which is easy to read and modify by humans, but not by machines. Therefore, before execution of code, we need to convert it into a machine readable format that is termed as machine code. However, Java first converts the source code to an intermediate code called byte code and then, into a machine code. Let’s discuss the difference between the ...
Read MoreDifference Between Length and Capacity in Java
In Java, the two terms length and capacity are related to the storage of elements in a collection like arrays, String and ArrayList. Length refers to the number of elements that are currently stored in a given collection, whereas capacity refers to the maximum number of elements that the collection can hold. In this article, we will explore the difference between Length and Capacity in Java. Length vs Capacity in Java Length To get the length of an array we use its ‘length’ property and we can get length of a String using its built-in method ‘length()’. In the ...
Read MoregetParameter() - Passing data from client to JSP
JSP stands for Java Server Pages and is used for the purpose of developing web based applications. A single JSP page consists of HTML tags for static content and JSP tags to construct dynamic content. The JSP tags start with ‘’. We save our JSP file with the extension ‘.jsp’. The getParameter() method of JSP takes an argument and retrieves data associated with it from the source and further pass it to the destination. The source could be an HTML or JSP page and the destination could be another JSP page. Syntax request.getParameter("source"); Steps of Passing data from client ...
Read MoreIterative Method to Find Height of Binary Tree
The binary tree is a data structure. Each node of the binary tree contains either 0, 1, or 2 nodes. So, the binary tree can contain multiple levels. Here, we need to write the iterative code using the loops to find the height of the binary tree. The total number of levels in the binary tree represents the height of the binary tree. Alternatively, we can say that the maximum depth of the binary tree from the root node is the height of the binary tree. Problem statement − We have given a binary tree. We need to ...
Read MoreHow to Efficiently Implement k Queues in a Single Array?
In some cases, we need to implement our own data structure for better usability and customization. Here, we need to implement the K Queues using the single array. The first solution that comes to mind is dividing the array into N/K parts and using each part of the array as a queue. Here, N is the array length. The problem with this solution is that we can’t utilize the array's space properly. If the array is not full, but any Mth queue indexes are full, we can’t insert an element to the Mth queue. So, we need an optimized approach. ...
Read More