## In-place remove all adjacent duplicates from the given string

Given a string, in-place remove all adjacent duplicates from it. The algorithm should continue removing adjacent duplicates from the string till no duplicate is present in the result.

Coding made easy

Given a string, in-place remove all adjacent duplicates from it. The algorithm should continue removing adjacent duplicates from the string till no duplicate is present in the result.

Given a binary tree, write an efficient algorithm to find all nodes present at given distance from any leaf node. We need to find only those nodes that are present in root-to-leaf path for that leaf.

Given an expression consisting of opening brace ‘{‘ and a closing brace ‘}’, find the minimum number of inversions needed to make the expression balanced.

Given a positive integer n, print all combination of numbers from 1 to n having sum n.

Given a weighted graph, find the maximum cost path from given source to destination that isĀ greater than a given integer x. The path should not contain any cycles.

Given an array of distinct integers, replace each element of the array by its corresponding rank in the array.

Given a M x N matrix, find all common elements present in every row.

Given a positive integer n and k, perform circular shift on binary representation of it by k positions.

Given an unsorted array of integers, print all triplets in it with sum less than or equal to given number.

Given a C-style string and a pattern, in-place replace all non-overlapping occurrences of the pattern in the string by a specified character.

Given an unsorted array of integers containing many duplicates elements, rearrange the given array such that same element appears together and relative order of first occurrence of each element remains unchanged.

In this post we will discuss few related problems that can be solved without using multiplication and division operators.