Skip to content

Tag Archives: Numbers

Given a large integer N, the task is to find all the possible remainders when N is divided by all the positive integers from 1… Read More
Given a number n, the task is to determine whether n can be a factorial of some number xExamples:   Input: N = 24 Output: Yes… Read More
Given the pointers to the head nodes of two linked lists. The task is to compare the numbers represented by the linked lists. The numbers… Read More
Given a string S consisting of a large hexadecimal number, the task is to check its divisibility by a given decimal number M. If divisible… Read More
Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 0, then set it to… Read More
Given a number N, the task is to clear the K-th bit of this number N. If K-th bit is 1, then clear it to… Read More
Given an integer N and an infinite table where ith row and jth column contains the value i *j. The task is to find the… Read More
Given a floating-point number N, the task is to check whether it is palindrome or not.  Input: N = 123.321 Output: YesInput: N = 122.1 Output: No  … Read More
Given four integers a, b, c and d. The task is to check whether it is possible to pair them up such that they are… Read More
Given a Fibonacci number N, the task is to find the previous Fibonacci number.Examples:   Input: N = 8 Output: 5 5 is the previous fibonacci number before… Read More
Given an integer N, the task is to represent N as the sum of two composite integers. There can be multiple ways possible, print any… Read More
Given an integer N, the task is to find the count of N-bit binary numbers without leading zeros.Examples:   Input: N = 2 Output: 2 10 and 11… Read More
Given a level L. The task is to find the sum of all the integers present at the given level in Pascal’s triangle .A Pascal… Read More
Given an integer N. The task is to find the Nth odd Fibonacci number.The odd number fibonacci series is as:   1, 1, 3, 5, 13,… Read More
Given two integers M and N, the task is to create a list of M non-negative integers whose sum is N. In case when more… Read More

Start Your Coding Journey Now!