Articles on Trending Technologies

Technical articles with clear explanations and examples

Print digit's position to be removed to make a number divisible by 6 in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 420 Views

In this problem, we are given number and we have to remove more digit from the number. So that the new number formed after removal is divisible by 6.Let’s take an example to learn the concept better −Input : 1324 Output : 4Explanation − on removing the 4th number we will get 132 which is divisible by 6.Here, we are given a number and we have to return the position from where the number is removed to make it divisible by 6.For solving this problem, we will try to create a logic that solves the problem. For this, we will ...

Read More

Coordinates of rectangle with given points lie inside in C++

Ayush Gupta
Ayush Gupta
Updated on 11-Mar-2026 340 Views

In this tutorial, we will be discussing a program to find the coordinates of rectanglewith given points lying inside.For this we will be provided with some coordinate points. Our task is to find the smallest rectangle such that all the points lie inside it and it should have its sides parallel to the coordinate axis.Example#include using namespace std; //calculating the coordinates of smallest rectangle void print_rectangle(int X[], int Y[], int n){    //finding minimum and maximum points    int Xmax = *max_element(X, X + n);    int Xmin = *min_element(X, X + n);    int Ymax = *max_element(Y, Y ...

Read More

Minimum toggles to partition a binary array so that it has first 0s then 1s in C++

Narendra Kumar
Narendra Kumar
Updated on 11-Mar-2026 238 Views

Problem statementGiven an array of n integers containing only 0 and 1. Find the minimum toggles (switch from 0 to 1 or vice-versa) required such the array the array become partitioned, i.e., it has first 0s then 1s.ExampleIf arr[] = {1, 0, 0, 1, 1, 1, 0} then 2 toggle is required i.e. toggle first one and last zero.AlgorithmIf we observe the question, then we will find that there will definitely exist a point from 0 to n-1 where all elements left to that point should contains all 0’s and right to point should contains all 1’sThose indices which don’t ...

Read More

Minimum value among AND of elements of every subset of an array in C++

Narendra Kumar
Narendra Kumar
Updated on 11-Mar-2026 285 Views

Problem statementGiven an array of integers, the task is to find the AND of all elements of each subset of the array and print the minimum AND value among all those.ExampleIf arr[] = {1, 2, 3, 4, 5} then (1 & 2) = 0 (1 & 3) = 1 (1 & 4) = 0 (1 & 5) = 1 (2 & 3) = 2 (2 & 4) = 0 (2 & 5) = 0 (3 & 4) = 0 (3 & 5) = 1 (4 & 5) = 4AlgorithmThe minimum AND value of any subset of the array will be ...

Read More

Print all sequences of given length in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 956 Views

In this problem, we are given two integer values, k, and n. And we have to print all the sequences of length k from numbers from 1 to n in sorted order.Let’s take an example to understand the topic −Input:k = 2 ; n = 3 Output: 1 1 1 2 1 3 2 1 2 2 2 3 3 1 3 2 3 3So in this problem, we have to print the sequence as stated above.A simple way to solve this problem is by incrementing integers of the sequence till they get to the max value i.e. n. The ...

Read More

Minimum value of "max + min" in a subarray in C++

Narendra Kumar
Narendra Kumar
Updated on 11-Mar-2026 528 Views

Problem statementGiven a array of n positive elements we need to find the lowest possible sum of max and min elements in a subarray given that size of subarray should be greater than equal to 2.ExampleIf arr[] = {10, 5, 15, 7, 2, 1, 3} then sum of “max + min” is 3 when we add “2 + 1”.AlgorithmAdding any element to a subarray would not increase sum of maximum and minimum.Since the max of an array will never decrease on adding elements to the array. It will only increase if we add larger elements. So it is always optimal ...

Read More

Print consecutive characters together in a line in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 426 Views

In this problem, we are given a string of characters and we have to print the same string in such a way that if two or more characters are consecutive then print them together in a single line otherwise print them in different lines i.e. with a line break.Let’s take an example to understand the concept better, Input : abcxstk Output : abc x st kExplanation − Since abc are in a sequence they are printed in a line. Then comes x which is not in sequence, so we add a linebreak here. Next is s which is not a ...

Read More

Counting the number of groups Java regular expression

Maruthi Krishna
Maruthi Krishna
Updated on 11-Mar-2026 1K+ Views

You can treat multiple characters as a single unit by capturing them as groups. You just need to place these characters inside a set of parentheses.You can count the number of groups in the current match using the groupCount() method of the Matcher class. This method calculates the number of capturing groups in the current match and returns it.Exampleimport java.util.regex.Matcher; import java.util.regex.Pattern; public class Test {    public static void main(String[] args) {       String str1 = "This is an example HTML script where ever alternative word is bold.";       //Regular expression to match contents of ...

Read More

Print all Semi-Prime Numbers less than or equal to N in C++

sudhir sharma
sudhir sharma
Updated on 11-Mar-2026 688 Views

In this problem, we are given an integer N. and we have to print all the semiprime numbers that are less than or equal to N.Before solving this problem, let’s understand what is a semi-prime number.A semi-prime number is a number whose value is the product of two distinct prime numbers.Let’s take an example, 21 = 3*7 is a semiprime number.25 = 5*5 is not a semiprime number.Now, let’s take an example of semiprime numbers less than or equal to n.Input: N = 15 Output: 6 10 14 15To solve this problem, we have to take each number less than ...

Read More

Minimum value that divides one number and divisible by other in C++

Narendra Kumar
Narendra Kumar
Updated on 11-Mar-2026 250 Views

Problem statementGiven two integer p and q, the task is to find the minimum possible number x such that q % x = 0 and x % p = 0. If the conditions aren’t true for any number, then print -1.ExampleIf p = 3 and q = 66 then answer is 3 as: 66 % 3 = 0 3 % 3 = 0AlgorithmIf a number x satisfies the given condition, then it’s obvious that q will be divided by p i.e. q % p = 0 because x is a multiple of p and q is a multiple of xSo ...

Read More
Showing 28031–28040 of 61,299 articles
Advertisements