## Range Queries for number of Armstrong numbers in an array with updates

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of Armstrong numbers in… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- Minimize the maximum difference between adjacent elements in an array
- 7 Best Coding Challenge Websites in 2020
- 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
- Basic Algorithm Techniques Not Taught in Academics
- Logarithm tricks for Competitive Programming
- Writing code faster during Competitive Programming in C++
- Count of subarrays of an Array having all unique digits
- Print all possible combinations of the string by replacing '$' with any other digit from the string
- 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
- How To Approach A Coding Problem ?
- Count the number of ways to construct the target string
- 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
- Submatrix of given size with maximum 1's
- Find distance between two nodes in the given Binary tree for Q queries
- Longest Mountain Subarray

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of Armstrong numbers in… Read More »

Given two integers N and K, the task is to represent N as sum of K odd numbers. If it is not possible to create… Read More »

Given an array arr[] with N elements, the task is to find out the longest sub-array which has the shape of a mountain. A mountain… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: maximum(start, end): Print the maximum Armstrong number of elements… Read More »

Given an array arr consisting of N elements and Q queries of the following two types: 1 K: For this type of query, the array… Read More »

Given a complete binary tree with N levels numbered [0, (N – 1 )] from root to the lowest level in decreasing order and having… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(start, end): Print the number of perfect square numbers… Read More »

We generally study most of the algorithmic techniques in academics like Searching, Sorting, Dynamic Programming, Greedy Algorithms, Divide and Conquer, Backtracking, etc. But below techniques… Read More »

Given two numbers N and K, the task is to split this number into K positive integers such that their sum is equal to N… Read More »

Given an integer N, the task is to find the number of perfect squares of length N. Examples: Input: N = 1 Output: 3 Explanation:… Read More »

Given a binary string str, the task is to calculate the maximum possible splits possible to make each substring divisible by a given odd number… Read More »

Given two integers N and K, the task is to represent N as sum of K even number. If it is not possible to represent… Read More »

Given an array arr[] and an integer K, the task is to find the maximum for each and every contiguous subarray of size K. Examples:… Read More »

Given a Binary Tree, the task is to find the maximum of all the XOR value of all the nodes in the path from the… Read More »

Given an array arr[] of N integers, the task is to perform the following two queries: query(L, R): Print the number of Even Parity numbers… Read More »