## Find the GCD of N Fibonacci Numbers with given Indices

Given indices of N Fibonacci numbers. The task is to find the GCD of the Fibonacci numbers present at the given indices. The first few… Read More »

- How can one become good at Data structures and Algorithms easily?
- Make all numbers of an array equal
- Reach the numbers by making jumps of two given lengths
- Some useful C++ tricks for beginners in Competitive Programming
- Check if a number is perfect square without finding square root
- Sum of XOR of all subarrays
- Sort the array of strings according to alphabetical order defined by another string
- Make Binary Search Tree
- Sum of similarities of string with all of its suffixes
- Check if it is possible to reach a number by making jumps of two given length
- Smallest Pair Sum in an array
- Find the number in a range having maximum product of the digits
- Maximum of all Subarrays of size k using set in C++ STL
- Print matrix in snake pattern from the last column
- Count distinct substrings that contain some characters at most k times
- Number of array elements derivable from D after performing certain operations
- Operations required to make the string empty
- Program to find the kth character after decrypting a string
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of sets with numbers less than Y
- Find two numbers whose divisors are given in a random order
- Count common characters in two strings
- Sum of the multiples of two numbers below N
- Number of subarrays have bitwise OR >= K
- Given two arrays count all pairs whose sum is an odd number
- Sum of bitwise AND of all subarrays
- Use of FLAG in programming
- Maximum length substring with highest frequency in a string
- Interactive Problems in Competitive Programming
- Shortest Path using Meet In The Middle

Given indices of N Fibonacci numbers. The task is to find the GCD of the Fibonacci numbers present at the given indices. The first few… Read More »

Given an array of positive integers of size n. Find the count of the triplets whose AND is maximum and also find that maximum given… Read More »

Given an array of integers of size N, you have to divide it into the minimum number of “strictly increasing subsequences” For example: let the… Read More »

Given an sorted array of positive numbers our tasks is to find the kth smallest sum of continuous subarray. Examples: Input : a[] = {1,… Read More »

Given a square of size n . There are n2 small squares inside the square n of size 1 unit each, in which any one… Read More »

Given an array arr[] of N elements. The task is to find the maximum number of the contiguous even numbers in the given array. Examples:… Read More »

Given an array ‘arr’ of length ‘n’. The task is to find the largest contiguous sub-array having the count of prime numbers strictly greater than… Read More »

Given an array of n size contains the cost of sweets in such a way that that sweet[i] is the cost of i sweets. The… Read More »

Given a binary string str, the task is to print the numbers of steps required to convert it to one by the following operations: If… Read More »

Given an array of numbers. The task is to check if it is possible to arrange all the numbers in a circle so that any… Read More »

Given an equation of the form: a + b = c Out of which any one of the terms , or is missing. The task… Read More »

Given an integer N. The task is to find all factors of N and print the product of four factors of N such that: Sum… Read More »

Given the coordinates of 5 2-dimensional points, check if they form a closed T shape. Print ‘Yes’ if they form T shape and ‘No’ otherwise.… Read More »

Given two arrays and with n elements each. The task is to make these two arrays identical i:e, for each , we want to make… Read More »

Given an integer N, the task is to find the maximum product of A, B, C, D such that below conditions satisfy: N%A ==0 &&… Read More »