## Iterative Approach to Find Permutations of a String in C++ and Java

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

Coding made easy

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

Find all N-digit strictly increasing numbers where N varies from [1 to 9]. If we process the number from left to right and for every pair of adjacent digits, if every digit is greater than the preceding digit, we can say that the digits are strictly increasing.

Given a string and a pattern containing wildcard characters i.e. ‘*’ and ‘?’, where ‘?’ can match to any single character in input string and ‘*’ can match to any number of characters including zero characters, design an efficient algorithm to find if the pattern matches with the complete input string or not.

In this post, we will see how to reverse a string in Java in 10 different ways. For example, reverse of “Techie Delight” is “thgileD eihceT”.

In this post, we will discuss about std::prev_permutation which can be used to find the lexicographically smaller permutations of a string.

Write a Java program to generate all permutations of a string.

Write an efficient function to implement itoa function in C. Standard itoa() function convert input number to its corresponding C-string using the specified base.

In this post, we will discuss about std::next_permutation which can be used to find the lexicographically greater permutations of a string.

Given a set of positive numbers, find all possible combinations of words formed by replacing the continuous digits with corresponding character of English alphabet. i.e. subset {1} can be replaced by A, {2} can be replaced by B, {1, 0} can be replaced J, {2, 1} can be replaced U, etc..

Word Break Problem: 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 a pattern, count number of times the pattern appears in the given string as a subsequence.

Edit distance is a way of quantifying how dissimilar two strings are to one another by counting the minimum number of operations required to transform one string into the other.