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
Programming Articles
Page 1416 of 2547
Print all Proth primes up to N in C++
In this problem, we are given an integer N and we have to print all proth prime numbers less than or equal to N.Proth Prime NumberA proth prime number is a positive integer whose value can be represented as n = k* 2n + 1. where k is an odd positive integer and n is a positive integer and both satisfy the 2n > k.Examples − 3, 5, 13…..Let’s take an example to understand the topic better −Input: N = 23 Output: 3, 5, 13, 17.For this, we will find all the prime numbers less than N(for this we will ...
Read MoreConvert to number with digits as 3 and 8 only in C++
In this tutorial, we will be discussing a program to convert a number to have digits as 3 and 8 only.For this we will be provided with a random number. Our task is to convert its digits to be only 3 and 8 by either adding/subtracting 1 from the number or converting digits of the number to any desired digit.Example#include using namespace std; //calculating minimum operations required int cal_min(long long int num){ //calculating remainder and operations int rem; int count = 0; while (num) { rem = num % 10; if (!(rem == 3 || rem == 8)) count++; num /= 10; } return count; } int main(){ long long int num = 2341974; cout
Read MorePrint characters having odd frequencies in order of occurrence in C++
In this problem, we are given string str by the user. And we have to print only those characters whose frequencies of occurrence in an odd number.To solve this problem, we have to find the total frequency of occurrence of a character in a string. And print only those characters of the string that have odd frequencies of occurrence.Let’s take an example to understand the topic better −Input : adatesaas. Output : dteExplanation −The characters with their frequency of occurrence are −a4d1t1e1s2Characters with odd frequency are d, t, e.AlgorithmNow let's try to create an algorithm to solve this problem −Step ...
Read MorePrint calendar for a given year in C++
In this problem, we are given a year and we want to print the calendar for that year.The year calendar shows all days, months on every date of the month. And here we will create a program that will return the calendar of the current year.For this, we will need some calculations like, Number of days in a specific monthJanuary, March, May, July, August, October, December has 31 days.February has 28 days in a nonleap year and 29 days in a leap year.April, June, September, November has 30 days.Start Day (weekday) on the monthBased on the year and month, the ...
Read MoreNon capturing groups Java regular expressions:
Using capturing groups you can treat multiple characters as a single unit. You just need to place the characters to be grouped inside a set of parentheses. For example −(.*)(\d+)(.*)If you are trying to match multiple groups the match results of each group is captured. You can get the results a group by passing its respective group number to the group() method. 1, 2, 3 etc.. (from right to left) group 0 indicates the whole match.Exampleimport java.util.Scanner; import java.util.regex.Matcher; import java.util.regex.Pattern; public class CapturingGroups { public static void main( String args[] ) { System.out.println("Enter input text"); ...
Read MorePrint Bracket Number in C++
In this problem, we are given expression. And we have to print the bracket number sequence. Let’s look at an example to understand the problem better.Example, Input : ((()())()) Output : 1233442551Explanation − Here we have encountered 5 bracket pairs and we have printed them in a sequence of their[ occurrence.Now since we know about the problem, let’s create a solution to this solution.The solution to this problem requires a stack data structure. We will use one variable that keeps the count of the number of left brackets and stack keeps track of right brackets. We will count left brackets ...
Read MorePrint bitwise AND set of a number N in C++
In this problem, we have to print all the numbers from 0 to n which are Bitwise AND of a binary of n.Let’s take an example to understand the concept better.Input : N = 4. Output : 0 4 Explanation : 0 & 4 = 0 1 & 4 = 0 2 & 4 = 0 3 & 4 = 0 4 & 4 = 4. Input : N = 6 Output : 0, 2, 4, 6To solve this problem, we need to use bitwise operators. Using these we will find the required subsets. We ...
Read MorePrint Binary Tree levels in sorted order in C++
In this problem, we are given a binary tree and we have to print all nodes at a level in sorted order of their values.Let’s take an example to understand the concept better, Input −Output −20 6 15 2 17 32 78To solve this problem, we need to print a sorted order of each level of the tree. For this, we need to create a queue and two priority queues. The NULL separator is used to separate two levels.ExampleProgram to illustrate the logic −#include #include #include using namespace std; struct Node { int data; struct Node ...
Read MoreGetting the list of all the matches Java regular expressions
Java does not provide any method to retrieve the list of all matches we need to use Lists and add the results to it in the while loop.Exampleimport java.util.ArrayList; import java.util.Iterator; import java.util.Scanner; import java.util.regex.Matcher; import java.util.regex.Pattern; public class ListOfMatches{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter input text: "); String input = sc.nextLine(); String regex = "\d+"; //Creating a pattern object Pattern pattern = Pattern.compile(regex); ArrayList list = new ArrayList(); ...
Read MorePrint all Prime Quadruplet of a number less than it in C++
In this problem, we are given a positive integer N, and we have to print all prime quadruplet less than or equal to n.Prime quadruplets are the set of four prime numbers calculated as {p, p+2, p+6, p+8}. Example − 5 7 11 13.Let’s take an example to understand the problem −Input: N = 15 Output: 5 7 11 13.To solve this problem, a simple approach is to generate all quadruplets of prime number p and check if all p, p+2, p+6, p+8 are prime numbers. This solution is easy but is more complex for the compiler.Another efficient approach is ...
Read More