## Multistage Graph (Shortest Path)

A Multistage graph is a directed graph in which the nodes can be divided into a set of stages such that all edges are from… Read More »

- Practice for cracking any coding interview
- How to get rid of Java TLE problem
- How can one become good at Data structures and Algorithms easily?
- Burst Balloon to maximize coins
- Understanding The Coin Change Problem With Dynamic Programming
- Subset array sum by generating all the subsets
- Reach the numbers by making jumps of two given lengths
- Make all numbers of an array equal
- Sum of similarities of string with all of its suffixes
- Some useful C++ tricks for beginners in Competitive Programming
- Maximize the total profit of all the persons
- Find triplets in an array whose AND is maximum
- Check if a number is perfect square without finding square root
- Length of the longest Subarray with only Even Elements
- Sort the array of strings according to alphabetical order defined by another string
- Python in Competitive Programming
- Print matrix in snake pattern from the last column
- Sum of the first N Prime numbers
- How to read Competitive Programming Questions?
- How can competitive programming help you get a job?
- Check if it is possible to reach a number by making jumps of two given length
- C++: Methods of code shortening in competitive programming
- Minimum changes required to make two arrays identical
- Number of array elements derivable from D after performing certain operations
- Sum of the multiples of two numbers below N
- Number of quadrilaterals possible from the given points
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of increasing subsequences
- Find two numbers whose divisors are given in a random order
- Minimum number of sets with numbers less than Y

A Multistage graph is a directed graph in which the nodes can be divided into a set of stages such that all edges are from… Read More »

Given a number n, the task is to find the largest perfect cube that can be formed by deleting minimum digits(possibly 0) from the number.… Read More »

Given a string of brackets, task is to find the number of pairs of brackets involved in a balanced sequence in a given range. Examples… Read More »

Given a integer n, we need to find how many digits remove from the number to make it a perfect square. Examples : Input :… Read More »

Prerequisites: Disjoint Set Data Structure Set Unordered_Map Disjoint Set data structure is used to keeps track of a set of elements partitioned into a number… Read More »

Sum Rule – If a task can be done in one of ways or one of ways, where none of the set of ways is… Read More »

Given an array where each element denotes the number of chocolates corresponding to each station and to move from station i to station i+1, we… Read More »

Given three different types of cups (a[]) and saucers (b[]), and n number of shelves, find if neat arrangement of cups and shelves can be… Read More »

Given a one/two digit timing, calculate the possibilities of occurrence of other timings(including the glowing one) with relevant to glowing segments, assuming some segments may… Read More »

Given a room with square grids having ‘*’ and ‘.’ representing untidy and normal cells respectively. You need to find whether room can be cleaned… Read More »

Every house in the colony has at most one pipe going into it and at most one pipe going out of it. Tanks and taps… Read More »

A geometric progression is a sequence of integers b1, b2, b3, …, where for each i > 1, the respective term satisfies the condition bi… Read More »

Given two strings contains three characters i.e ‘A’, ‘B ‘and ‘#’ only. Check is it possible to convert first string into another string by performing… Read More »

Find the smallest number such that the sum of its digits is N and it is divisible by . Examples : Input : N =… Read More »

Given an array of n integers, find the sum of f(a[i], a[j]) of all pairs (i, j) such that (1 <= i < j <=… Read More »