## Euler tour of Binary Tree

Given a binary tree where each node can have at most two child nodes, the task is to find the Euler tour of the binary… Read More »

- Practice for cracking any coding interview
- How to get rid of Java TLE problem
- Burst Balloon to maximize coins
- Subset array sum by generating all the subsets
- Understanding The Coin Change Problem With Dynamic Programming
- Length of the longest Subarray with only Even Elements
- Maximize the total profit of all the persons
- Largest connected component on a grid
- Number of quadrilaterals possible from the given points
- Minimum number of increasing subsequences
- Find triplets in an array whose AND is maximum
- Minimum cost to buy N kilograms of sweet for M persons
- Check if any permutation of a large number is divisible by 8
- Kth Smallest sum of continuous subarrays of positive numbers
- Introduction to Programming Languages
- Find three integers less than or equal to N such that their LCM is maximum
- Sum of similarities of string with all of its suffixes
- Number of values of b such that a = b + (a^b)
- Minimum increment operations to make the array in increasing order
- Minimum cost path from source node to destination node via an intermediate node
- Length of largest sub-array having primes strictly greater than non-primes
- Number of distinct prime factors of first n natural numbers
- Nth non-Square number
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Check if it is possible to move from (0, 0) to (x, y) in N steps
- Check if it is possible to sort the array after rotating it
- Largest factor of a given number which is a perfect square
- Minimum changes required to make two arrays identical
- Number of special pairs possible from the given two numbers
- Minimum sum of the elements of an array after subtracting smaller elements from larger

Given a binary tree where each node can have at most two child nodes, the task is to find the Euler tour of the binary… Read More »

Prerequisite: Time Complexity Analysis Generally, while doing competitive programming problems on various sites, the most difficult task faced is writing the code under desired complexity… Read More »

Prerequisite: Merge Sort for Linked Lists Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes… Read More »

Given a 3 x n board, find the number of ways to fill it with 2 x 1 dominoes. Example 1 Following are all the… Read More »

Consider a tree with n nodes and root. You can jump from one node to any other node on the same height a maximum of… Read More »

Given an unsigned number, find the minimum number that could be formed by using the bits of the given unsigned number. Examples: Input : 6… Read More »

Given integers x1, x2, x3……xn, b and m, we are supposed to find the result of ((x1*x2….xn)/b)mod(m). Example 1 : Suppose that we are required… Read More »

Find the number of digits in the nth number constructed by using 6, 1, 4 and 9 as the only digits in the ascending order.… Read More »

Given an array of n positive integers, write a program to find the maximum sum of increasing subsequence from prefix till i-th index and also… Read More »

Prerequisite :Basic knowledge of STL and Sets Data structure. About ordered set Ordered set is a policy based data structure in g++ that keeps the… Read More »

Given a string s we have to find the length of the longest substring of s which contain exactly K distinct vowels. Examples: Input :… Read More »

Given two arrays of same size, we need to convert the first array into another with minimum operations. In an operation, we can either increment… Read More »

Given an array of even number of elements, form groups of 2 using these array elements such that the difference between the group with highest… Read More »

Given an array and a value k. We have to find the maximum number of equal elements possible for the array so that we can… Read More »