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
Find the number of binary strings of length N with at least 3 consecutive 1s in C++
Suppose, we have an integer N, We have to find the number of all possible distinct binary strings of the length N, which have at least three consecutive 1s. So if n = 4, then the numbers will be 0111, 1110, 1111, so output will be 3.To solve this, we can use the Dynamic programming approach. So DP(i, x) indicates number of strings of length i with x consecutive 1s in position i + 1 to i + x. Then the recurrence relation will be like −DP(i, x) = DP(i – 1, 0) + DP(i – 1, x + 1).The ...
Read MorePerl Array Variables
An array is a variable that stores an ordered list of scalar values. Array variables are preceded by an "at" (@) sign. To refer to a single element of an array, you will use the dollar sign ($) with the variable name followed by the index of the element in square brackets.Here is a simple example of using array variables −Example#!/usr/bin/perl @ages = (25, 30, 40); @names = ("John Paul", "Lisa", "Kumar"); print "\$ages[0] = $ages[0]"; print "\$ages[1] = $ages[1]"; print "\$ages[2] = $ages[2]"; print "\$names[0] = $names[0]"; print "\$names[1] = $names[1]"; print "\$names[2] = $names[2]";Here we used escape sign ...
Read MoreFind common elements in three sorted arrays in C++
Suppose we have three arrays with some elements. We have to find all the common elements that are present in these three arrays. Suppose these elements are [10, 12, 15, 20, 25], [10, 12, 13, 15] and [10, 12, 15, 24, 25, 26], then the common elements in these three arrays are 10, 12 and 15.Suppose current element traversed in array A1 be x, A2 be y and A3 be z. We can have the following cases for them −If x, y, and z are same, then we will print any of them, and increase each array elements by 1When ...
Read MoreFind sum of even factors of a number using C++.
In this section, we will see how we can get the sum of all even prime factors of a number in an efficient way. There is a number say n = 480, we have to get all factors of this. The prime factors of 480 are 2, 2, 2, 2, 2, 3, 5. The sum of all even factors is 2+2+2+2+2 = 10. To solve this problem, we have to follow this rule −When the number is divisible by 2, add them into the sum, and divide the number by 2 repeatedly.Now the number must be odd. So we will ...
Read MorePerl Hash Variables
A hash is a set of key/value pairs. Hash variables are preceded by a percent (%) sign. To refer to a single element of a hash, you will use the hash variable name followed by the "key" associated with the value in curly brackets.Here is a simple example of using hash variables −Example#!/usr/bin/perl %data = ('John Paul', 45, 'Lisa', 30, 'Kumar', 40); print "\$data{'John Paul'} = $data{'John Paul'}"; print "\$data{'Lisa'} = $data{'Lisa'}"; print "\$data{'Kumar'} = $data{'Kumar'}";OutputThis will produce the following result −$data{'John Paul'} = 45 $data{'Lisa'} = 30 $data{'Kumar'} = 40
Read MoreFind the number of integers from 1 to n which contains digits 0's and 1's only in C++
Suppose, we have a number n. Our task is to find the number of integers from 1 to n, which contains digits 0s and 1s only. So if n = 15, then output will be. As the numbers are 1, 10, 11To solve this, we will create integers using 0s and 1s using recursive function. Following code will help us to understand this better.Example#include using namespace std; int numberOfValues(int p, int n) { if (p > n) return 0; return 1 + numberOfValues(p * 10, n) + numberOfValues(p * 10 + 1, n); } int main() { int n = 120; cout
Read MorePerl Variable Context
Perl treats the same variable differently based on Context, i.e., the situation where a variable is being used. Let's check the following example −Example#!/usr/bin/perl @names = ('John Paul', 'Lisa', 'Kumar'); @copy = @names; $size = @names; print "Given names are : @copy"; print "Number of names are : $size";OutputThis will produce the following result −Given names are : John Paul Lisa Kumar Number of names are : 3Here @names is an array, which has been used in two different contexts. First, we copied it into another array, i.e., list, so it returned all the elements assuming that context is ...
Read MoreFind consecutive 1s of length >= n in binary representation of a number in C++
Suppose, we have two integers x and n, our task is to search for the first consecutive stream of 1s (32-bit binary) which is greater than or equal to the value of n in length and return its position. If no such string exists, then return -1. For example, if x = 35, and n = 2, then result will be 31. The binary representation of 35 in a 32-bit integer is like −00000000000000000000000000100011. So two consecutive 1s are present at index 31, so the answer is 31.To solve this problem, we have to find the number of leading zeros, ...
Read MorePerl Numeric Scalars
A scalar is most often either a number or a string. Following example demonstrates the usage of various types of numeric scalars −Example#!/usr/bin/perl $integer = 200; $negative = -300; $floating = 200.340; $bigfloat = -1.2E-23; # 377 octal, same as 255 decimal $octal = 0377; # FF hex, also 255 decimal $hexa = 0xff; print "integer = $integer"; print "negative = $negative"; print "floating = $floating"; print "bigfloat = $bigfloat"; print "octal = $octal"; print "hexa = $hexa";OutputThis will produce the following result −integer = 200 negative = -300 floating = 200.34 bigfloat = -1.2e-23 octal = 255 hexa = 255
Read MoreFind the number of integers x in range (1,N) for which x and x+1 have same number of divisors in C++
Suppose, we have an integer N, we have to find the number of integers 1 < x < N, for which x and x + 1 has same number of positive divisors. So if N = 3, then output will be 1, as divisor of 1 is 1, divisor of 2 is 1 and 2, and divisor of 3 is 1 and 3.To solve this, we will find the number of divisors of all numbers below N, and store them in an array. Then count number of integers x such that x, such that x + 1 have the same ...
Read More