## Equal Sum and XOR of three Numbers

Given an integer N. The task is to count the numbers of pairs of integers A and B such that A + B + N… 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 ?
- Sum of GCD of all possible sequences
- Count the number of ways to construct the target string
- 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 integer N. The task is to count the numbers of pairs of integers A and B such that A + B + N… Read More »

Given a tree of N nodes and an integer K, each node is numbered between 1 and N. The task is to find the number… Read More »

Given a directed graph with N vertices and M edges that may contain cycles, the task is to find the lexicographically smallest topological ordering of… Read More »

Given an array arr[] of N integers and an integer K. The task is to find the maximum xor subset of size K of the… Read More »

Given an array arr[] of N integers, the task is to sort the array without changing the position of negative numbers (if any) i.e. the… Read More »

Given two integers X and Y. The task is to find two vertices of an isosceles triangle ABC(right-angled at B) which has one vertex at… Read More »

Given a binary string S, consisting of 0’s and 1’s. You have to accommodate the 0’s and 1’s into the K buckets in such a… Read More »

Given an undirected unweighted graph with N vertices and M edges. The task is to find two disjoint good sets of vertices. A set X… Read More »

Given an array of size N and an integer K. The array consists of only digits {0, 1, 2, 3, …k-1}. The task is to… Read More »

Given an integer N, the task is to find the Nth Mosaic number. A Mosaic number can be expressed as follows: If N = Aa… Read More »

Given an integer N, the task is to print the first N terms of the Lower Wythoff sequence. Examples: Input: N = 5 Output: 1,… Read More »

Given a array ‘a[]’ of size n and number of queries q. Each query can be represented by a integer m. Your task is to… Read More »

Given an integer N, the task is to count the number of possible Binary Search Trees with N keys. Examples: Input: N = 2 Output:… Read More »

Given an unsorted array arr[] of size n, the task is to find the minimum difference between any pair in the given array. Input: arr[]… Read More »

Given two arrays such that the first array contains multiples of an integer n which are less than or equal to k and similarly, the… Read More »