## Find first non-repeating character in a string by doing only one traversal of it

Given a string, find first non-repeating character in it by doing only one traversal of it. Get great deals at Amazon

Coding made easy

Given a string, find first non-repeating character in it by doing only one traversal of it. Get great deals at Amazon

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 an expression consisting of opening brace ‘{‘ and a closing brace ‘}’, find the minimum number of inversions needed to make the expression balanced.

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.

Write a efficient algorithm to construct the longest palindrome by shuffling or deleting characters from a given string.

Given a string and a pattern (having all distinct characters), determine if characters of the string follows specific order as defined by characters of the pattern.

Given N lists of words, print all combinations of phrases that can be formed by picking one word each from each of the given lists.

In this post, we will see how to find all lexicographic permutations of a string where repetition of characters is allowed.

Find all N-digit binary numbers with equal sum of left and right half. N varies from [1-9] and binary number should not start with 0.

Given a string, find minimum cuts needed to partition it such that each partition is a palindrome.

Given a positive integer N, find all N-digit binary numbers having more 1’s than 0’s for any prefix of the number.

Given a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.