## Find two co-prime integers such that the first divides A and the second divides B

Given two integers A and B, the task is to find two co-prime numbers C1 and C2 such that C1 divides A and C2 divides… Read More »

- What is Competitive Programming and How to Prepare for It?
- Check which player visits more number of Nodes
- Make the list non-decreasing by changing only one digit of the elements
- Nth XOR Fibonacci number
- Write a function to get the intersection point of two Linked Lists | Set 2
- Number of substrings that start with "geeks" and end with "for"
- Find a pair (n,r) in an integer array such that value of nPr is maximum
- Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Reversing a Queue using another Queue
- Minimum increment or decrement operations required to make the array sorted
- Check if the rows of a binary matrix can be made unique by removing a single column
- Number of Subarrays with positive product
- Queries for the minimum element in an array excluding the given index range
- Longest Increasing Subsequence using Longest Common Subsequence Algorithm
- Color all boxes in line such that every M consecutive boxes are unique
- Print nodes having maximum and minimum degrees
- Minimize the sum of the array according the given condition
- Count of triples (A, B, C) where A*C is greater than B*B
- Find two co-prime integers such that the first divides A and the second divides B
- Sum of all natural numbers from L to R ( for large values of L and R )
- Largest sub-matrix with all equal elements
- Minimize the cost of partitioning an array into K groups
- Maximum length sub-array which satisfies the given conditions
- Find out the prime numbers in the form of A+nB or B+nA
- Check if the Matrix satisfies the given conditions
- Find a pair (n,r) in an integer array such that value of nCr is maximum
- Java | Handling TLE While Using Arrays.sort() Function
- Count of Multiples of A ,B or C less than or equal to N
- Sort elements by modulo with K

Given two integers A and B, the task is to find two co-prime numbers C1 and C2 such that C1 divides A and C2 divides… Read More »

Given two very large numbers L and R where L ≤ R, the task is to compute the sum of all the natural numbers from… Read More »

Introduction to interactive problems in competitive programming is already discussed in the previous article. In this article, another problem based on the same concept is… Read More »

Given an array Arr of N integers representing the nodes of a graph. The edges are defined between those pair whose bitwise AND is not… Read More »

Given a queue. The task is to reverse the queue using another another empty queue. Examples: Input: queue[] = {1, 2, 3, 4, 5} Output:… Read More »

Given a string str consisting of lowercase English alphabets, the task is to find the count of substrings that start with “geeks” and end with… Read More »

Given an array of integers A. The task is to minimise the sum of the elements of the array using the following rule: Choose two… Read More »

Given three integers a, b and N where a and b are the first two terms of the XOR Fibonacci series and the task is… Read More »

In programming it is quite usual for a Java programmer to face time limit exceeded or TLE if they do not use Arrays.sort() function carefully.… Read More »

Given a tree with N nodes. Two players A and B start from node 1 and node N respectively. A can visit all the adjacent… Read More »

Before we discuss this topic in detail we would like to know why you are reading this article. There might be a few reasons and… Read More »

Given a range [L, R], the task is to count the numbers which have even number of odd digits and odd number of even digits.… Read More »

Given an array of unique elements, we have to find all the permutation of length L using the elements of the array. Repetition of elements… Read More »

Given an unbalanced bracket sequence of ‘(‘ and ‘)’, convert it into a balanced sequence by adding the minimum number of ‘(‘ at the beginning… Read More »

Given a tree of distinct nodes N with N-1 edges and a pair of nodes P. The task is to find and print the path… Read More »