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
How to save, edit, and drop a snippet in JShell in Java 9?
Java Shell or JShell is an official REPL(Read-Evaluate-Print-Loop) introduced with Java 9. It provides an interactive shell for quickly prototyping, debugging and without the need for the main() method or the need to compile the code before executing it. JShell is easily started by typing "jshell" in the command prompt. What are Snippets? JShell allows the execution of Java statements, variables, methods, class definitions, imports, and expressions. These pieces of Java code are referred to as snippets. Every snippet is assigned an ID(unique) that we can use later to reference it. Example Below is an example to represent a snippet ...
Read MoreWhen to use the ofNullable() method of Stream in Java 9?
In this article, we will learn to use the ofNullable() method of Stream in Java 9. We will first go through the Stream class, after that we will learn about the ofNullable() method along with its syntax and real-world use cases. Stream Class Stream was introduced in Java 8, the Stream API is used to process collections of objects. It represents a sequence of elements that support various operations to perform computations in parallel. Creating an instance of a stream: Stream stream; A stream is not a type of data structure, it takes input from Collections, Arrays, etc. The ofNullable() ...
Read MoreHow To Get the Arc Length from Given Angle in Java?
An arc of a circle is a segment or portion of the circumference of a circle. In other words, a curve between a pair of distinct points. The length of the arc refers to the length between two points along the arc (two points along a section of a circle or curve). It is a percentage of the circumference of the circle. When two lines intersect each other, the common meeting point is called a vertex and the geometrical figure between the two arms/lines is called an angle. Following diagram will help you to understand the arc and its length: ...
Read MoreC++ Program to Solve the Dominating Set Problem
In this article, we will explain the dominating set problem and implement it's solution in C++. First of all, let's understand what a dominating set is. Dominating Set of a Graph A dominating set for a graph is a subset of the set of all the vertices. Every vertex that is not in the dominating set should be adjacent of at least one vertex in the dominating set. To understand this clearly, consider the following graph: In the above graph, the set of vertices {B, D} is one of the dominating sets, because: ...
Read MoreC++ Program to Generate a Random Subset by Coin Flipping
The subsets of a set refers to all the possible combinations of choosing elements from the set. For example, if we have a set {1, 2}, the subsets are {}, {1}, {2}, and {1, 2}. In this article, we will learn how to generate a random subset for a set using coin flipping technique in C++. // Set of elements int arr[] = {1, 2, 3}; // Subsets of the above set {}, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3} Coin Flipping Technique The coin flipping technique is a simple way ...
Read MoreCount elements less than or equal to a given value in a sorted rotated array in C++
A sorted and rotated array is an array that is sorted in ascending or descending order and then rotated either left or right by a specific number of elements. There should exist exactly one pivot point around which the array is rotated. Example Here is an example of counting elements less than or equal to a given value in the sorted and rotated array: Case 1 The given array is: 30 40 50 10 20 Given value = 25 Output Count: 2 (10, 20) Case 2 The given array is: 10 20 30 40 ...
Read MoreFind the number of elements greater than k in a sorted array using C++
In this problem, we are given an array arr[] consisting of N sorted integer values and an integer k. Our task is to Find the number of elements greater than k in a sorted array. Example Here are some examples of counting the array elements greater than the given target element: Input: arr = {6, 12, 16, 23, 32, 45, 48, 50} target = 20 Output: 5 Input: arr = {6, 12, 15, 20, 32, 45, 48, 50} target = 20 Output: 4 Finding number of elements greater than k in a sorted arrayHere is a list of ...
Read Morefdim() in C++
C++ fdim() Function The fdim() function returns the positive difference between two floating-point values. For example, if we have two arguments, a and b, respectively, then it will return a-b if a > b, else it will return 0. This function is defined under or header files and supports float, double, and long double overloads. Syntax Here is the following syntax for fdim() function in C++. In the following syntax, data_type defines the type of data it will take as input and return. data_type fdim(data_type value_1, data_type value_2); Parameters This method accepts two parameters of floating type (i.e., can ...
Read MoreHow to find the last occurrence of an element in a Java List?
In this article, we will learn how to find the last occurrence of an element in a Java List. It is a collection in which we can store and access elements in serial order. We can use the following ways to find the last occurrence of an element in a Java List: Using a For Loop LastIndexOf() Method Using Stream API Using a For Loop We would use a for loop to iterate through the list in reverse order and check if the desiredelement is equal ...
Read MoreHow to determine if all elements are the same in a Java List?
In this article, we will explore how to determine if all elements in a Java List are the same. The following are the ways to achieve this: Using a For Loop Using Stream API Using a For Loop We will iterate through the list and compare each element with the first element. If we find any element that is not equal to the first element, we will return false. If we reach the end of the list without finding any different element, we will return true. Example In the below ...
Read More