Articles on Trending Technologies

Technical articles with clear explanations and examples

Count maximum number of disjoint pairs having one element not less than k times the other in C++

C++
Nishu Kumari
Nishu Kumari
Updated on 24-Mar-2025 219 Views

In this article, we will discuss how to count the maximum number of disjoint pairs in an array, where for each pair (x, y), one element is not less than K times the other. The goal is to find the number of such valid pairs in the array using C++. Given an array of integers, the task is to find all pairs (i, j) such that: arr[i] > K * arr[j] or arr[j] > K * arr[i] holds true for a given constant K. The condition is that no element ...

Read More

Count pairs whose Bitwise AND exceeds Bitwise XOR from a given array

C++
Nishu Kumari
Nishu Kumari
Updated on 24-Mar-2025 248 Views

In this article, we will learn how to count pairs of numbers from a given array where the bitwise AND of the two numbers is greater than the bitwise XOR. Bitwise operations work on the individual bits of numbers. The AND operation results in 1 only when both bits are 1, while XOR gives 1 when the bits are different. Given an array of integers, we need to count how many pairs (i, j) exist such that the bitwise AND of the pair is greater than the bitwise XOR. In other words, for each pair of elements in the ...

Read More

C++ program for mirror of matrix across diagonal

C++
Nishu Kumari
Nishu Kumari
Updated on 24-Mar-2025 412 Views

In this article, we will discuss how to create a C++ program to generate the mirror image of a matrix across its diagonal. The diagonal mirror of a matrix means that we swap the elements at symmetric positions with respect to the diagonal. Let's break down the problem step by step and then look at the code that solves this problem. Understanding the Problem For any given matrix, the mirror image across the diagonal means that the element at position (i, j) will be swapped with the element at position (j, i). This operation is also known as transposing ...

Read More

How to find the greatest divisor that divides all the natural numbers in a given range [L, R]

C++
Nishu Kumari
Nishu Kumari
Updated on 24-Mar-2025 291 Views

In this article, we will explain how to find the greatest divisor that divides all the natural numbers in a given range [L, R]. The task is to identify the largest number that can divide every number between L and R, including both L and R. For example, in the range [6, 9] (which includes 6, 7, 8, and 9), the GCD is 1 because no number greater than 1 divides all of them. Now, let's go through the steps to solve this problem. Approach to Solve the Problem To solve this problem, we can follow these steps: ...

Read More

Sorting strings with decimal points in C++

C++
AYUSH MISHRA
AYUSH MISHRA
Updated on 21-Mar-2025 2K+ Views

A string containing decimal points is sorted to solve complex programming problems. This question was asked in the Accenture coding assessment in 2025. In C++, there are different ways to sort such strings efficiently. In this article, we are going to discuss various approaches to sorting strings that contain decimal points using C++. How to Sort Strings with Decimal Points? In this problem, we are given an array of strings, where each string represents a decimal number. The goal is to sort these strings in increasing numerical order while ensuring the correct handling of decimal values. Example 1 ...

Read More

Sorting an array of binary values - C++

C++
AYUSH MISHRA
AYUSH MISHRA
Updated on 21-Mar-2025 490 Views

Sorting an array of binary values (0s and 1s) is a common problem in programming. In C++, there are multiple ways to efficiently sort an array containing only 0s and 1s. In this article, we are going to learn various approaches to sorting an array of binary values using C++. How to Sort an Array of Binary Values? In this problem, we are given an array that consists of only 0s and 1s. The task is to sort the array in ascending order, which means all 0s should come before all 1s. Example 1 ...

Read More

How to declare a static String array in Java

Alshifa Hasnain
Alshifa Hasnain
Updated on 20-Mar-2025 2K+ Views

In this article, we will learn the declaration of static Strings array in Java. Arrays can be used to store multiple values in one variable. Static array has a specific size which cannot be increased in the later part of the program after creation. What is a Static String Array? A static array is a declared array as static, which means that it is associated with the class, not with a class instance. This brings the array into a shared state among all instances of the class. Static variables are loaded when the class is loaded, even before class instances ...

Read More

Java program to merge two files into a third file

Alshifa Hasnain
Alshifa Hasnain
Updated on 20-Mar-2025 4K+ Views

In this article, we will learn to merge two files into a third file in Java. Combining the contents of two files into a third file is a typical operation in file handling, frequently needed to aggregate data. Java offers efficient facilities such as BufferedReader and PrintWriter to accomplish this easily. ApproachThe following are the steps to merge the contents of two files into a third file in Java− Read the contents of the first file line by line using a BufferedReader. Write each line to the third file using a ...

Read More

First and last position of an element in a sorted array in C++

C++
AYUSH MISHRA
AYUSH MISHRA
Updated on 20-Mar-2025 4K+ Views

The first and last position of any element in a sorted array is a common operation in the world of programming. In C++, there are multiple ways to find the first and last position of an element in a sorted array. In this article, we are going to discuss various approaches for finding the first and last occurrence of an element in a sorted array using C++. How to Find the First and Last Position of an Element? In this problem, we are given a sorted array and a target element. We need to find the first and last ...

Read More

Sort an array which contain 1 to n values

AYUSH MISHRA
AYUSH MISHRA
Updated on 19-Mar-2025 6K+ Views

Sorting an array containing values from 1 to n means arranging the integers in their natural ascending order. This type of sorting problem is commonly encountered in competitive programming (for solving complex problems), where the array is guaranteed to have integers ranging from 1 to n. In this article, we will explore various approaches to solving this problem. In this problem, we are given an array containing values ranging from 1 to n in random order. Our goal is to sort the array in ascending order. Example 1 Input: int array[] = {3, 1, 2, ...

Read More
Showing 31231–31240 of 61,297 articles
Advertisements