## Removing a number from array to make it Geometric Progression

Given an array arr[] of N positive elements, the task is to find whether it is possible to convert this array into Geometric Progression (GP)… Read More »

- Must do Math for Competitive Programming
- Array of Vectors in C++ STL
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- Reverse a singly Linked List in groups of given size | Set 3
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Shortest Path Faster Algorithm
- Maximum sum path in a Matrix
- Maximum number of unique values in the array after performing given operations
- Count of subarrays having exactly K distinct elements
- Role of SemiColon in various Programming Languages
- Basic Algorithm Techniques Not Taught in Academics
- Sum of GCD of all possible sequences
- Knapsack with large Weights
- Why Data Structures and Algorithms Are Important to Learn?
- Maximum LCM among all pairs (i, j) from the given Array
- Minimum possible travel cost among N cities
- Traveling Salesman Problem using Genetic Algorithm
- Minimum Cost Graph
- Longest subsequence having difference atmost K
- Count of subarrays which start and end with the same element
- Huffman Coding using Priority Queue
- Find lexicographically smallest string in at most one swaps
- Median of an unsorted array using Quick Select Algorithm
- Word Break Problem | DP-32 | Set - 2
- Operator Overloading '<<' and '>>' operator in a linked list class
- Sort an Array which contain 1 to N values in O(N) using Cycle Sort
- Longest Mountain Subarray
- Find last remaining element after reducing the Array
- Minimum increment or decrement required to sort the array | Top-down Approach

Given an array arr[] of N positive elements, the task is to find whether it is possible to convert this array into Geometric Progression (GP)… Read More »

Given three positive integers x, y and n, the task is to find count of all numbers from 1 to n that can be formed… Read More »

Emirp is the word “prime” spelled backwards, and it refers to a prime number that becomes a new prime number when you reverse its digits.… Read More »

A number n is said to be Abundant Number if sum of all the proper divisors of the number denoted by sum(n) is greater than… Read More »

Given an array of n distinct elements, find the minimum number of swaps required to sort the array. Examples: Input : {4, 3, 2, 1}… Read More »

Given an integer n, the task is to find the nth hexagonal number . The nth hexagonal number Hn is the number of distinct dots… Read More »

Given a number N, the task is to find out maximum sum of distinct numbers such that the Least Common Multiple of all these numbers… Read More »

A number n is said to be Powerful Number if for every prime factor p of it, p2 also divides it. For example:- 36 is… Read More »

For such cases, time complexity of the loop is O(log(log(n))).The following cases analyse different aspects of the problem. Case 1 : filter_none edit close play_arrow… Read More »

Padovan Sequence similar to Fibonacci sequence with similar recursive structure. The recursive formula is, P(n) = P(n-2) + P(n-3) P(0) = P(1) = P(2) =… Read More »

Given an array of integers and a number k. We can pair two number of array if difference between them is strictly less than k.… Read More »

Juggler Sequence is a series of integer number in which the first term starts with a positive integer number a and the remaining terms are… Read More »

Given an array of distinct positive integers and a number x, find the number of pairs of integers in the array whose XOR is equal… Read More »

A number n is said to be Deficient Number if sum of all the divisors of the number denoted by divisorsSum(n) is less than twice… Read More »

An integer number in base 10 which is divisible by sum of it digits is said to be a Harshad Number. An n-harshad number is… Read More »