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
Difference between Gradle and Maven
Gradle is a tool which is used in Java development. One of its main jobs is to create automation tools. Maven is used as an alternative to Gradle but it is older and helps in building the tools which are best for a project. Developers can make a choice between them on the basis of their requirements for a project. In this article, we will discuss the difference between Gradle and Maven. What is Gradle? Gradle is an open-source automation system which uses domain-specific language called Groovy. This is a programming language that uses XML for the configuration of a ...
Read MoreJava program to find length of the longest substring without repeating characters
In Java, substrings are part of the string which contains the continuous character of the string of any length from 1 to complete string. We are given a string and we have to find the length of the largest substring from the given string that only contains the unique characters. We will see three types of methods: finding every substring, sliding windows, and two-pointers. Problem Statement Given a string, write a Java program to find length of the longest substring without repeating characters − Input thisisthegivenstring Output The length of the longest substring that contains only unique characters is: ...
Read MoreDifference between Propositional Logic and Predicate Logic
Logical reasoning is one of the main subjects of computer science and mathematics. This reasoning helps in making the decisions of whether different types of mathematical arguments are correct or not. It can be divided into propositional logic and predicate logic. Both of these topics are required for different subjects like mathematics, philosophy, computer science, etc. These concepts are very complex and are used in creating various types of arguments. Let us discuss the difference between propositional logic and predicate logic. What is Propositional Logic? A proposition consists of a truth value which should not be ambiguous to the two ...
Read MoreJava program to find the first non-repeating character from a stream of characters
Finding the first non-repeating character in a string is a common programming problem. It involves finding the first character that appears only once in the string. This task helps understand how to manipulate strings and use basic data structures in Java. Problem Statement Given a string, identify the first character that does not repeat. If all characters repeat, indicate that there is no non-repeating character. Input tutorialspoint Output The first non-repeating character of the string is T Steps to find the first non-repeating character from a stream of characters Below are the steps to find the first non-repeating character from a ...
Read MoreCount Alternating Subarray
The Count Alternating Subarrays are used to count the number of subarrays where no two adjacent elements are similar. we can also call these subarrays as alternating subarrays. Problem Statement Before understanding what is "Count Alternating Subarrays" let's see what is a sub-array, and alternating sub-arrays. A subarray is part of an array formed by removing some or no prefixes of the array and removing some or no suffix elements of the given array. While dividing an array into multiple sub-arrays there ...
Read MoreProgram to find the Maximum Prime Difference
The Maximum Prime Difference is a problem used to determine the largest difference between indices of two prime numbers in a given array. Problem Statement Here, we have given an array of integers as nums. our task is to find the maximum prime difference between the indices of any two prime numbers in an array. In the given array if we have only one prime number then it returns 0 and if no prime number returns -1. Example Scenario 1 Input: arr = [11, 4, 7, 6, 13] Output: 4 The prime numbers are 11 (index 0), ...
Read MoreMinimum Operations to Make Median of Array Equal to K
The problem “Minimum Operations to Make the Median of the Array Equal to K” is used to adjust the elements of an integer array so that its median becomes equal to a given value k. In one operation, you can increase or decrease any element by 1. Problem Statement The goal is to find the minimum number of such operations to make the median of the array equal to K. The median of an array is the middle element when the array is sorted in non-decreasing order. The larger one is considered the median if there are two middle ...
Read MoreLongest Strictly Increasing or Strictly Decreasing Subarray
The Longest Strictly Increasing or Strictly Decreasing Subarray problem is used to find the maximum length of the contiguous subarray within a given array where the elements are either strictly increasing or strictly decreasing. Problem Statement Given an array of integers nums, return the length n of the longest subarray of n which is either strictly increasing or strictly decreasing. Example Scenario 1 Input: nums = [1, 3, 2, 4, 3, 5, 4, 6] Output: n = 2 The longest strictly increasing subarrays are [1, 3], [2, 4], [3, 5], and [4, 6]. The longest strictly decreasing subarrays ...
Read MoreLatest Time You Can Obtain After Replacing Characters
The Latest Time You Can Obtain After Replacing Characters sub-task is applied to an input string, in which the string is represented as a 12-hour format time when the maximum number of characters are replaced by '?'. In a 12-hour format time, "HH:MM” where HH is an element from the set {00, 01, …, 10, 11} and MM is also an element from the set {00, 01, …, 59}. The earliest possible time is 00:00, and the latest time is 11:59. Problem Statement In this problem statement, the goal is to replace all "?" characters in the string s ...
Read MoreProgram to find a Score of a String
The Score of a String is a concept which is used to calculate the score based on the sum of the absolute differences between the ASCII values of adjacent characters in the string. Problem Statement Given a string s, calculate the score of the string. The score is defined as the sum of the absolute differences between the ASCII values of adjacent characters. Example Scenario 1 Input: s="abc" Output: 2 The ASCII values of the characters in s are 'a' = 97, 'b' = 98, 'c' = 99. So, the score of s = |97-98|+|98-99|= 1+1 ...
Read More