## Check if the array has an element which is equal to sum of all the remaining elements

Given an array of N elements, the task is to check if the array has an element which is equal to the sum of all… Read More »

- What is Competitive Programming and How to Prepare for It?
- 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
- Print nodes having maximum and minimum degrees
- Color all boxes in line such that every M consecutive boxes are unique
- 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
- Count of Multiples of A ,B or C less than or equal to N
- Sort elements by modulo with K
- time.h localtime() function in C with Examples
- Interactive Problems in Competitive Programming | Set 2

Given an array of N elements, the task is to check if the array has an element which is equal to the sum of all… Read More »

Given a number N(less than 10^9). The task is to print all the numbers less than N which are having a maximum of 2 unique… Read More »

Given segments as ranges [L, R] where ranges are non-intersecting and non-overlapping. The task is to find all number between 1 to that doesn’t belong… Read More »

Given an integer N, the task is to find two numbers a and b such that a * b = N and a + b… Read More »

Given an array of elements where each element in the array represents the degree ( 0 <= a[i] <= 359 ) at which there is… Read More »

Given a number . Reduce this number to zero by subtracting the number by it’s most significant digit(Left most digit) at every step. The task… Read More »

Given an array of N integers and a number K, the task is to find the length of the smallest subarray in which all the… Read More »

Given a number N, the task is to find the sum of all the multiples of 3 and 7 below N. Note: A number must… Read More »

Given a string str. The task is to count the minimum number of elements to be removed so that pairwise consecutive elements are same Examples:… Read More »

Given a string of length N of lowercase characters containing 0 or more vowels, the task is to find the count of vowels occurred in… Read More »

Given an integer N, below operations can be performed any number of times on N: Multiply N by any positive integer X i.e. N =… Read More »

Given an array arr containing N integer elements, the task is to count the minimum number of elements that need to be changed such that… Read More »

Given a number, N. find the sum of first N odd Fibonacci numbers. Note: The answer can be very large so print the answer modulo… Read More »

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

Given two integers x and n, the task is to search for the first consecutive stream of 1s (in the x’s 32-bit binary representation) which… Read More »