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
Count of obtuse angles in a circle with 'k' equidistant points between 2 given points in C++
We are given a circle with K equidistant points on its circumference. Also we are given two points A and B. The goal is to count the number of triangles possible using these points such that they have an obtuse angle ACB( angle greater than 90o) inside them. The points A and B are such that A < B.Here K=8, A=2, B=5, count of points=2 (C, C’) such that angle LACB, LAC’B are obtuse.Let us understand with examplesInput − k=10, A=2, B=4Output − Count of obtuse angles in a circle with ‘k' equidistant points between 2 given points are − ...
Read MoreCount number of ways to jump to reach end in C++
Given an array of positive numbers. Each element represents the maximum number of jumps that can be made from that index to reach the end of the array. The goal is to find the number of jumps that can be made from that element to reach the end. If arr[] is [ 1, 2, 3 ] then for 1 jumps can be 1, for 2 jumps can be 1 or 2 and for 3 jumps can be made 1, 2 or 3.For ExampleInputarr[] = {1, 2, 3}OutputCount of number of ways to jump to reach end are: 1 1 0ExplanationFor ...
Read MoreFind integers that divides maximum number of elements of the array in C++
In this problem, we are given an array arr[] of n integers.Our task is to find integers that divides maximum number of elements of the array. Problem Description: We need to find a number p which can divide the maximum number of elements of the array. In case, there are more than one such element we will return the smaller one.Let’s take an example to understand the problem, Input: arr[] = {4, 5, 6, 7, 8}Output: 2Explanation: The element 2 divides {4, 6, 8}.Solution ApproachA simple solution to the problem is by looping through the array and then for each element of the array, divide each ...
Read MoreCount of occurrences of a "1(0+)1" pattern in a string in C++
We are given a string str containing 0s, 1s and other alphabets . It also contains patterns of the form “1(0+)1” where 0+ means any number (>0) of consecutive 0s. The goal is to find such patterns ( “1(0+)1” ) inside string str.Let us understand with examplesInput − str = “abb010bb10111011”Output − Count of occurrences of a “1(0+)1” pattern in a string are − 2Explanation − The patterns inside str are highlighted: “abb010bb10111011”, “abb010bb10111011”Input − str = “01001011001001100”Output − Count of occurrences of a “1(0+)1” pattern in a string are − 4Explanation − The patterns inside str are highlighted: “01001011001001100”, ...
Read MoreCount number of ways to partition a set into k subsets in C++
Given two numbers e and p. The goal is to count the number of ways in which we can divide e elements of a set into p partitions/subsets.For ExampleInpute=4 p=2OutputCount of number of ways to partition a set into k subsets are: 7ExplanationIf elements are: a b c d then ways to divide them into 2 partitions are: (a, b, c)−(d), (a, b)−(c, d), (a, b, c)−(d), (a)−(b, c, d), (a, c)−(b, d), (a, c, d)−(b), (a, b, d)−(c). Total 7 ways.Inpute=2 p=2OutputCount of number of ways to partition a set into k subsets are: 1ExplanationIf elements are: a b ...
Read MoreFind K items with the lowest values in C++
In this problem, we are given a list that consists of items and their values and an integer k. Our task is to find K items with the lowest values. Problem description: We need to find k items from the list that have the lowest value.Let’s take an example to understand the problem, Input: item-value = { {item1, 200}, {item2, 100}, {item3, 500}, {item4, 400}} k = 2Output: item1 , item2Explanation: Two elements with least value are item1 with 200 and item2 with 100.Solution ApproachA solution to the problem is by finding k items with the least value greedily. We will first sort the item ...
Read MoreCount of pairs of (i, j) such that ((n % i) % j) % n is maximized in C++
We are given a number num as input. The goal is to find the number of pairs of form (i, j) such that ((num%i)%j)%num is maximized and i and j both are in range [1, num].Let us understand with examplesInput − num=4Output − Count of pairs of (i, j) such that ((n % i) % j) % n is maximized are − 3Explanation − Pairs will be: (3, 2), (3, 3), (3, 4)Input − num=6Output − Count of pairs of (i, j) such that ((n % i) % j) % n is maximized are − 4Explanation − Pairs will be: ...
Read MoreCount numbers < = N whose difference with the count of primes upto them is > = K in C++
Given two integers N and K, the goal is to find the count of numbers such that they follow below conditions −Number=K Where count is the number of prime numbers less than or equal to Number.For ExampleInputN = 5, K = 2OutputCount of numbers < = N whose difference with the count of primes upto them is > = K are: 2ExplanationThe numbers that follow the conditions are: 5 ( 5−2>=2 ) and 4 ( 4−2>=2 )InputN = 10, K = 6OutputCount of numbers < = N whose difference with the count of primes upto them is > = K ...
Read MoreFind k maximum elements of array in original order in C++
In this problem, we are given an array arr[] of n elements. Our task is to find k maximum elements of the array in original order. We need to find k maximum elements of the array and then print then as they were indexed originally.Let’s take an example to understand the problem, Input: arr[] = {5, 1, 3, 6, 2}, k = 2Output: 5, 6Explanation: The largest two elements of the array are 6 and 5. But 5 comes before 6 in the original array hence we have printed in that way.Solution ApproachTo solve the problem, and print k elements in the original order.For ...
Read MoreCount of strings where adjacent characters are of difference one in C++
We are given a num number as input. The goal is to count the number of possible strings of length num such that all adjacent characters have difference between ascii values as 1.If num is 2 then strings will be “ab”, “ba”, “bc”, “cb”, ……..”yz”, “zy”.Let us understand with examplesInput − num=3Output − Count of strings where adjacent characters are of difference one are − 98Explanation − Some sample strings are: “abc”, “aba”, “cde” …..”xyx”, “zyz”, “xyz”.Input − num=2Output − Count of strings where adjacent characters are of difference one are − 50Explanation − Some sample strings are: “ab”, “ba”, ...
Read More