Lowest Common Multiple (LCM) and the Highest Common Factor (HCF), are closely connected. They play a key role in simplifying mathematical statements, prime factorization, and finding relationships between numbers, especially when dealing with fractions. To understand the relationship between the HCF and LCM of two or more numbers, one must grasp the concepts of LCM and HCF and know how to apply the relevant formulas....
Subtraction of decimals is finding the difference between two or more decimal numbers and other numbers like whole, decimal, or natural numbers. The subtraction of decimals is similar to the subtraction of whole numbers....
Given two integers N and M (1 ≤ N, M ≤ 100) denoting the total number of 1s and 0s respectively. The task is to count the number of possible arrangements of these 0s and 1s such that any arrangement has at most X consecutive 1s and Y consecutive 0s (1 ≤ X, Y ≤ 10). As the number of arrangements can be very large, compute the answer with MODULO 109+7....
Given a positive integer H, the task is to find the number of possible Binary Search Trees of height H consisting of the first (H + 1) natural numbers as the node values. Since the count can be very large, print it to modulo 109 + 7....
Given two arrays A[] and B[] consisting of N integers, the task is to minimize the total cost of incrementing or decrementing array elements by 1 such that for every ith element, either A[i] is a multiple of B[i] or vice-versa....
MakeMyTrip recently visited our campus. There were 4 rounds....
Given multiple numbers and a number n, the task is to print the remainder after multiply all the number divide by n....
Given an integer N, the task is to find the minimum and the maximum number of terms required to divide N as the sum of 4 or 6....
Given two numbers represented by linked lists, write a function that returns the multiplication of these two linked lists....
Given an integer . The task is to write a program to find the N-th term of the given series:...
Given two integers x and n, write a function to compute xn. We may assume that x and n are small and overflow doesn’t happen....
Given n and a number, the task is to find the sum of n digit numbers that are divisible by given number.Examples:...
