## Queries for the count of even digit sum elements in the given range using Segment Tree.

Given an array arr[] of N elements, the task is to answer Q queries each having two integers L and R. For each query, the… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- 7 Best Coding Challenge Websites in 2020
- Minimize the maximum difference between adjacent elements in an array
- Which Java libraries are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Which Python Modules are useful for competitive programming?
- Setting up a C++ Competitive Programming Environment
- Logarithm tricks for Competitive Programming
- Basic Algorithm Techniques Not Taught in Academics
- Writing code faster during Competitive Programming in C++
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- Count of subarrays of an Array having all unique digits
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Default values in a Map in C++ STL
- Move all zeroes to end of array using Two-Pointers
- Count the number of ways to construct the target string
- How To Approach A Coding Problem ?
- Sum of GCD of all possible sequences
- Minimize the maximum difference of adjacent elements after at most K insertions
- Kth most frequent Character in a given String
- Count of substrings of length K with exactly K distinct characters
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Minimum cost of reducing Array by merging any adjacent elements repetitively
- Finding Median of unsorted Array in linear time using C++ STL
- Important functions of STL Components in C++
- Competitive Programming vs Software Development - Where Should I Invest My Time?
- Shortest path in a directed graph by Dijkstra’s algorithm

Given an array arr[] of N elements, the task is to answer Q queries each having two integers L and R. For each query, the… Read More »

Given an array A, consisting of N non-negative integers, find the sum of xor of all unordered triplets of the array. For unordered triplets, the… Read More »

Given an array of random numbers, Push all the zero’s of the given array to the end of the array. For example, if the given… Read More »

Given three integers the lower range L ,the upper range U and a digit M. The task is to count all the numbers between L… Read More »

Given an array of Number and two values A and B, The task is to check the following Conditions: If two numbers are present in… Read More »

Given a Number N. The task is to unset the rightmost set bit of N. Examples: Input: N = 5 Output: 4 Explanation: 101(5) ->… Read More »

Given a string of digits S. The task is to insert a minimum number of opening and closing parentheses into the string S such that… Read More »

Given segments and some points, for each point find the number of segments covering that point. A segment (l, r) covers a point x if… Read More »

Given an array Arr of N integers and Q queries, each query having a range from L to R. Find the element having maximum digit… Read More »

Given a binary array arr[] of size N. The task is to answer Q queries which can be of any one type from below: Type… Read More »

Given an array of integers Arr. The task is to count the number of triplets (i, j, k) such that Ai ^ Ai+1 ^ Ai+2… Read More »

Given an array A containing N integers. Find the maximum sum possible such that exactly floor(N/2) elements are selected and no two selected elements are… Read More »

Given is an array Arr of integers. The task is to determine if the array has any subsequence of at least length 3 that is… Read More »

A Geometric series is a series with a constant ratio between successive terms. The first term of the series is denoted by a and the… Read More »

Given an array arr[] of N elements and two integers A to B, the task is to answer Q queries each having two integers L… Read More »