LCM of an Array with Modulo

Find LCM of N numbers, with modulo M, where for this problem statement M is 1e9 + 7.

Search

LCM of an Array with Modulo

Find LCM of N numbers, with modulo M, where for this problem statement M is 1e9 + 7.

Sorted Permutation Rank with Repeats InterviewBit Solution

Given a string, find the rank of the string amongst its permutations sorted lexicographically.
Note that the characters might be repeated. I

Largest Coprime Divisor InterviewBit Solution

You are given two positive numbers A and B. Find the maximum valued integer X such that: X divides A i.e. A % X = 0 and gcd(X,B) = 1.

Sorted Permutation Rank InterviewBit Solution

Given a string, find the rank of the string amongst its permutations sorted lexicographically.
Assume that no characters are repeated.

Trailing Zeros in Factorial InterviewBit Solution

Given an integer A, return the number of trailing zeroes in A!.

Greatest Common Divisor InterviewBit Solution

Given 2 non-negative integers m and n, find gcd(m, n)
GCD of 2 integers m and n is defined as the greatest integer g such that g is a diviso

Reverse Integer InterviewBit Solution

Reverse digits of an integer.

Palindrome Integer InterviewBit Solution

Determine whether an integer is a palindrome. Do this without extra space.
A palindrome integer is an integer x for which reverse(x) = x whe

Grid Unique Paths InterviewBit Solution

A robot is located at the top-left corner of an A x B grid.
The robot can only move either down or right at any point in time. The robot is

City Tour InterviewBit Solution

There are A cities numbered from 1 to A. You have already visited M cities, the indices of which are given in an array B of M integers.