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 1313 of 2547
Count binary strings with k times appearing adjacent two set bits in C++
We are given with integers N and K. We have binary strings of length N, containing 0’s and 1’s only. The goal is to find the number of such strings of length N that have K consecutive 1’s. I.e, if N=3, and K=2, then count all 3-digit binary strings possible that have 2 consecutive 1’s.Example − 111, here adjacent 1’s appear twice ( K times ).In 011 and 110 adjacent 1’s appeared once only.We will solve this by storing the results of previous values.Taking 3D array count[x][y][z]. Where x is N, y is K and z is last digit of ...
Read MoreFind k-th smallest element in BST (Order Statistics in BST) in C++
Suppose we have a binary search tree and a value K as input, we have to find K-th smallest element in the tree.So, if the input is likek = 3, then the output will be 15.To solve this, we will follow these steps −Define a function find_kth_smallest(), this will take root, count, k, if root is NULL, then −return NULLleft = find_kth_smallest(left of root, count, k)if left is not NULL, then −return left(increase count by 1)if count is same as k, then −return rootreturn find_kth_smallest(right of root, count, k)From the main method, do the following −count := 0res = find_kth_smallest(root, ...
Read MoreCount how many times the given digital clock shows identical digits in C++
Suppose we have a digital clock of type HH:MM. Which shows the time in hours and minutes only. We are given a number of hours and minutes as input. The goal is to count the number of times all digits are the same. H=M.This happens 3 times a day, first at 00:00 midnight, then at 11:11 and last at 22:22. As time is represented in 24 hour format.InputInput: 12 hours 22 minutes.Output2Explanation − For times 00:00 and 11:11. Twice in 12 hours.InputInput: 48 hours 22 minutes.Output5Explanation − For times 00:00 and 11:11, 22:22 .Approach used in the below program is ...
Read MoreFind longest bitonic sequence such that increasing and decreasing parts are from two different arrays in C++
ConceptWith respect of given two arrays, our task to determine the longest possible bitonic sequence so that increasing part must be from first array and should be a subsequence of first array. In the same way, decreasing part of must be from second array and should be a subsequence of it.Inputarr1[] = {2, 6, 3, 5, 4, 6}, arr2[] = {9, 7, 5, 8, 4, 3}Output2, 3, 4, 6, 9, 7, 5, 4, 3Inputarr1[] = {3, 1, 2, 4, 5}, arr2[] = {6, 4, 3, 2}Output1, 2, 4, 5, 6, 4, 3, 2MethodSo the concept is to implement longest increasing ...
Read MoreMaximize big when both big and small can be exchanged in C++
We are given a big object let’s say, ‘a’ and a small object let’s say, ‘b’. The choices for the object ‘a’ and ‘b’ depend upon the user. In the example below, we are taking objects to be toys which are big as well as small as per the size characteristics. The task is to calculate the maximum number of big toys that can be achieved by giving the small toys in return.Input − big_toys = 8, small_toys = 20, a = 6, b = 4Output − Maximize big when both big and small can be exchanged are − 11Explanation ...
Read MoreFind longest palindrome formed by removing or shuffling chars from string in C++
ConceptWith respect of a given string, determine the longest palindrome that can be formed by removing or shuffling characters from the string. Finally return only one palindrome if it hasbeen observed that there is multiple palindrome strings of longest length.InputpqrOutputp OR q OR rInputppqqrrOutputpqrrqp OR qprrpq OR rqppqr OR any other palindromic string of length 6.InputpqpOutputpqpMethodHere, We can partition any palindromic string into three parts – beg, mid and end. With respectof palindromic string of odd length say 2n + 1, here ‘beg’ consists of first n characters of the string, ‘mid’ consists of only 1 character that means (n ...
Read MoreMaximum number of contiguous array elements with same number of set bits in C++
We are given with an unsorted array of integer elements and the task is to calculate the two major things i.e.Elements with same number of set bitsAlso, Elements with the same set bits should be contiguous in nature.Inputint arr[] = { 5, 8, 1, 2, 9, 12}Output − Maximum number of contiguous array elements with same number of set bits are − 3Explanation − we will calculate the binary digits for the elements of an array and calculate their set bits.arr[0] = 5 => 0101 => total set bits are -: 2 arr[1] = 8 => 1000 => total set ...
Read MoreFind lost element from a duplicated array in C++
ConceptWith respect of given two arrays which are duplicates of each other except one element, that means one element from one of the array is missing, our task to determine that missing element.Inputarr1[] = {2, 5, 6, 8, 10} arr2[] = {5, 6, 8, 10}Output22 is missing from second array.Inputarr1[] = {3, 4, 5, 6} arr2[] = {3, 4, 5, 6, 7}Output77 is missing from first array.MethodHere, we apply one simple solution where we iterate over arrays and verify element by element and mark the missing element when an unmatched is detected. But the drawback of this solution is that ...
Read MoreMaximum length subarray with difference between adjacent elements as either 0 or 1 in C++
We are given an array of any size and the task is to find the subarray of the given array with the elements having difference between adjacent elements as 0 or 1.Input − int arr[] = { 2, 1, 5, 6, 3, 4, 7, 6}Output − Maximum length subarray with difference between adjacent elements as either 0 or 1 are − 2Explanation − The adjacent elements in an array with difference as 0 or 1 are {2, 1}, {5, 6}, { 3, 4} and {7.6}. Therefore, the maximum length of subarray is 2.Input − int arr[] = { 2, 1, ...
Read MoreFind maximum difference between nearest left and right smaller elements in C++
ConceptWith respect of a given an array of integers, our task is to determine the maximum absolute difference between the nearest left and the right smaller element of every element in the array. It should be noted that if there is no smaller element on right side or left side of any element then we accept zero as the smaller element. Here, for example for the leftmost element, the nearest smaller element on the left side is set as 0. In the same way, for rightmost elements, the smaller element on the right side is set as 0.Inputarr[] = {3, ...
Read More