Skip to content

Tag Archives: Geometric Progression

Given a positive integer n, the task is to find the sum of series  8/10 + 8/100 + 8/1000 + 8/10000. . . till Nth… Read More
Given a number N, find the N-th term in the series 2, 2, 4, 4, 6, 8, 8……… Examples: Input: N = 1Output: 2 Input:… Read More
Given two Geometric Progressions (a1, r1) and (a2, r2) where (x, y) represents GP with initial term x  and common ratio y and an integer… Read More
Given a positive integer N, the task is to check whether all the digits of the given integer N are the same or not. If… Read More
This article focuses on discussing the proof of why the root-mean-square of two positive numbers is always greater than their geometric mean. Before getting into… Read More
Given two integers A and R, representing the first term and the common ratio of a geometric sequence, the task is to find the sum… Read More
Given three integers A, D, and R representing the first term, common difference, and common ratio of an infinite Arithmetic-Geometric Progression, the task is to… Read More
Given an array arr[] of N integers, the task is to find the count of all subarrays from the given array of at least size… Read More
Given an array arr[] consisting of N integers, the following three operations can be performed on any element one at a time: Add one to… Read More
Given a sorted array arr[] consisting of distinct numbers, the task is to find the length of the longest subarray that forms a Geometric Progression.… Read More
Given a string S, the task is to find the count of maximum occurring subsequence P from S using only those characters whose indexes are… Read More
Given a Geometric Progression series in arr[] and Q queries in the form of [L, R], where L is the left boundary of the range… Read More
Given a number N, the first term ‘a’ and a common ratio ‘r’ of a Geometric Progression, the task is to find the product of… Read More
Given an integer array arr[] and an integer K, the task is to find the number of non-empty subsets S such that min(S) + max(S)… Read More

Start Your Coding Journey Now!