## Find a pair (n,r) in an integer array such that value of nPr is maximum

Given an array of non-negative integers arr[], the task is to find a pair (n, r) such that nPr is maximum possible and r ≤… Read More »

- Iterative approach to print all permutations of an Array
- Print all the permutation of length L using the elements of an array | Iterative
- Iterative program to generate distinct Permutations of a String
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Count number of permutation of an Array having no SubArray of size two or more from original Array
- Find the count of M character words which have at least one character repeated
- Lexicographically largest permutation of the array such that a[i] = a[i-1] + gcd(a[i-1], a[i-2])
- 3-digit Osiris number
- Count permutation such that sequence is non decreasing
- Find the permutation p from the array q such that q[i] = p[i+1] - p[i]
- Find the permutation of first N natural numbers such that sum of i % P
_{i}is maximum possible - Find permutation with maximum remainder Sum
- Find the possible permutation of the bits of N
- Distinct permutations of a string containing duplicates using HashSet in Java
- Euler zigzag numbers ( Alternating Permutation )

Given an array of non-negative integers arr[], the task is to find a pair (n, r) such that nPr is maximum possible and r ≤… Read More »

Given an integer N, the task is to find whether the bits of N can be arranged in alternating manner i.e. either 0101… or 10101….… Read More »

Given a number N. The task is to find the permutation P of first N natural numbers such that sum of i % Pi is… Read More »

Given a string str that may contain duplicate characters, the task is to print all the distinct permutations of the given string such that no… Read More »

Given an integer N, the task is to find a permutation of the integers from 1 to N such that is maximum. Examples: Input: N… Read More »

Given an array arr[] of integers, the task is to find the count of permutation of the array such that the permutation is in increasing… Read More »

Given an array of distinct integer A, the task is to count the number of possible permutations of the given array A[] such that the… Read More »

Given an array of unique elements, we have to find all the permutation of length L using the elements of the array. Repetition of elements… Read More »

Given a string str, the task is to generate all the distinct permutations of the given string iteratively. Examples: Input: str = “bba” Output: abb… Read More »

Euler Zigzag numbers is a sequence of integers which is a number of arrangements of those numbers so that each entry is alternately greater or… Read More »

Given an array arr[] of size N (N > 2). The task is to find lexicographically largest permutation of the array such that arr[i] =… Read More »

Given two integers N and M, the task is count the total words of M character length formed by the given N distinct characters such… Read More »

Given an array arr[] of size N, the task is to generate and print all permutations of the given array. Examples: Input: arr[] = {1,… Read More »

Given an array Q[] of length N, the task is to find the permutation P[] of integers from the range [1, N + 1] such… Read More »

Given a 3-digit number N, the task is to find if N is an Osiris number or not. Osiris numbers are the numbers that are… Read More »