# Tag Archives: large-numbers

Given an array arr[] of strings representing large numbers and an integer K, the task is to find Kth largest integer in given array. Examples: Attention… Read More
Given two numeric strings A and B, the task is to find the product of the two numeric strings efficiently. Example:Attention reader! Don’t stop learning… Read More
Given two large integers in form of strings A and B and their product also in form of string C such that one digit of… Read More
Given a positive integer N, the task is to determine the maximum possible integer that can be formed by performing the following operations on the… Read More
In this article, we will discuss the unsigned long long int data type in C++. It is the largest (64 bit) integer data type in… Read More
Given a numeric string S, the task is to find the maximum length of a subsequence having its left rotation equal to its right rotation.… Read More
Given an integer N in form of string str consisting of more than 100 digits, the task is to store the value for performing an… Read More
Given a large number in the form of a string str and a number K, the task is to check if the number formed by… Read More
The security of the RSA algorithm is based on the difficulty of factorizing very large numbers. The setup of an RSA cryptosystem involves the generation… Read More
Given a very large number N in the form of a string and a number K, the task is to print all the K-digit repeating… Read More
Given a very large number N, the task is to find the factorial of the number using Log. Factorial of a non-negative integer is the… Read More
Given a large number in the form of a string N, the task is to check whether the number is divisible by 53 or not.… Read More
Given a large number N, the task is to divide this number into a product of two factors, using Fermat’s Factorisation method. ExamplesAttention reader! Don’t… Read More
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then… Read More
Given a number K of length N, the task is to find the smallest possible number that can be formed from K of N digits… Read More