## Print all shortest paths between given source and destination in an undirected graph

Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- Which Java libraries are useful for competitive programming?
- Minimize the maximum difference between adjacent elements in an array
- 7 Best Coding Challenge Websites in 2020
- Which Python Modules are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Basic Algorithm Techniques Not Taught in Academics
- Setting up a C++ Competitive Programming Environment
- Writing code faster during Competitive Programming in C++
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Count of subarrays of an Array having all unique digits
- Logarithm tricks for Competitive Programming
- Default values in a Map in C++ STL
- Move all zeroes to end of array using Two-Pointers
- Sum of GCD of all possible sequences
- How To Approach A Coding Problem ?
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Submatrix of given size with maximum 1's
- Kth most frequent Character in a given String
- Length of the smallest substring which contains all vowels
- Longest Mountain Subarray
- Find distance between two nodes in the given Binary tree for Q queries
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Count of substrings of length K with exactly K distinct characters

Given an undirected and unweighted graph and two nodes as source and destination, the task is to print all the paths of the shortest length… Read More »

Given a large number in form of string str of size N, the task is to count the subsequence of length 4 whose digit are… Read More »

Given two strings S and T and a number K, the task is to count the number of ways to convert string S to string… Read More »

Given an unsorted array arr[] of N integers that are in Arithmetic Progression, the task is to print the missing element from the given series.… Read More »

Given an array arr[] of N integers of value from 0 to N, the task is to count the number of components in Index Array.… Read More »

Given Bitwise AND, OR, and XOR of N elements of an array denoted by a, b, c. The task is to find the elements of… Read More »

Given a permutation P of size N, having values from 1 to N. the task is to find the minimum number of adjacent swaps required… Read More »

Given a positive number N, the task is to find out all the perfect powers of two which are less than or equal to the… Read More »

Given a constant array of N elements which contain elements from 1 to N – 1, with any of these numbers appearing any number of… Read More »

Given an N-Ary tree containing N nodes and an array weight [ ] that denotes the weight of the nodes which can be positive or… Read More »

Given a tree consisting of N nodes numbered from [1, N] and is coloured either black(denoted by 1) or green(denoted by 0), the task is… Read More »

Given an arr[] of length N, the task is to find the length of longest Reverse Bitonic Subsequence. A subsequence is called Reverse Bitonic if… Read More »

Given a string str, the task is to check if it is possible to split the given string into even length palindromic substrings. Examples: Input:… Read More »

Given a string str of length N, the task is to obtain the lexicographically largest string by at most one swap. Note: The swapping characters… Read More »

Given an array arr[] of length N with unique elements, the task is to find the length of the longest increasing subsequence that can be… Read More »