## Find all Lexicographic Permutations of a String

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

Coding made easy

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.

Given three strings, return true if third string is interleaving of first and second string. i.e., it is formed from all characters of first and second string and order of characters is preserved.

Find all N-digit numbers with equal sum. N varies from [1 to 9] and sum < = 81 (Maximum possible sum in a 9-digit number)

Implement your own diff utility. i.e given two similar strings, efficiently list out all differences between them.

Given a string, calculate its rank among all its lexicographically sorted permutations.

In this post, we will implement KMP Algorithm in C, C++ and Java programming language.

The longest common subsequence (LCS) problem is the problem of finding the longest subsequence that is present in given two sequences in the same order. i.e. find a longest sequence which can be obtained from the first original sequence by deleting some items, and from the second original sequence by deleting other items.

In this post, we will discuss how to find permutations of a string using iteration.