## BCD addition of given Decimal numbers

Given two numnbers A and B, the task is to perform BCD Addition of the given numbers. Examples: Input: A = 12, B = 20… Read More »

- Must do Math for Competitive Programming
- Product of all Subarrays of an Array
- Perfect Sum Problem
- How is the time complexity of Sieve of Eratosthenes is n*log(log(n))?
- Pi(π) in C++ with Examples
- Check whether a number can be represented as difference of two squares
- Modulo Operator (%) in C/C++ with Examples
- Count of subsets with sum equal to X using Recursion
- Maximum number of unique values in the array after performing given operations
- Count of subarrays having exactly K perfect square numbers
- Sum of GCD of all possible sequences
- Find the numbers from 1 to N that contains exactly k non-zero digits
- Logarithm tricks for Competitive Programming
- Program to calculate Electricity Bill
- Longest sub-array with maximum GCD
- Count of subarrays which start and end with the same element
- Puzzle | Dividing a Square into N smaller squares
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum GCD of all subarrays of length at least 2
- Find K distinct positive odd integers with sum N
- Maximum profit by buying and selling a share at most K times | Greedy Approach
- Longest Mountain Subarray
- Expected Number of Trials to get N Consecutive Heads
- Digital Root of a given large integer using Recursion
- Count number of pairs with positive sum in an array
- Program to calculate Percentile of a student based on rank
- Find the minimum number to be added to N to make it a prime number
- Probability of getting K heads in N coin tosses
- Find the K closest points to origin using Priority Queue
- Minimum window size containing atleast P primes in every window of given range

Given two numnbers A and B, the task is to perform BCD Addition of the given numbers. Examples: Input: A = 12, B = 20… Read More »

Given a polynomial string str, the task is to integrate the given string and print the string after integrating it. Note: The input format is… Read More »

Given a polynomial string str, the task is to differentiate the given string and print the string after differentiating it. Note: The input format is… Read More »

Given four integers H, M, L1, and L2, which denotes the time as hour and minutes in a Clock of 12-Hour format and L1 and… 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 two numbers H and M which denotes the length of the hour and minute hand and two time intervals(say T1 & T2) in form… Read More »

Given a number N and an array arr[] consisting of K numbers, the task is to find the count of numbers in the array which… Read More »

Given two numbers A and B where (A > B), the task is to check if B is a suffix of A or not. Print… Read More »

Given a positive integer N, the task is to check whether the count of even divisors and odd divisors of N are equal or not.… Read More »

A cryptographic hash function is a special class of hash function that has certain properties which make it suitable for use in cryptography. It is… Read More »

Given an integer N, the task is to count the number of ways so that N can be written as the sum of a prime… Read More »

Given two numbers N and K, where K represents the starting term of the sequence. The task is to find the Nth term of a… Read More »

Given a matrix grid[][] and two integers M and N, the task is to find the sum of cost of all possible paths from the… Read More »

Given the angle in degree, the task is to convert this into radians. Examples: Input: degree = 45 Output: radian = 0.785398 Input: degree =… Read More »

Given an array arr[] with positive and negative elements, the task is to count all subarrays whose sum is a perfect square. Examples: Input: arr[]… Read More »