## Generate all Permutations of a String in Java | Recursive & Iterative

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

## Implement itoa() function in C

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.

## std::next_permutation | Overview & Implementation in C++

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

## Find shortest route in a device to construct the given string

Given a device having left, right, top and bottom buttons and a OK button to enter a text from a virtual keypad having alphabets from A-Y arranged in a 5×5 grid as shown below. We need to find the shortest route in device to construct the given string if we start from the top-left position …

## Combinations of words formed by replacing given numbers with corresponding alphabets

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 | Dynamic Programming

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.

## Count number of times a pattern appears in given string as a subsequence

Given a pattern, count number of times the pattern appears in the given string as a subsequence.

## The Levenshtein distance (Edit distance) problem

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.

## Shortest Common Supersequence using LCS

The shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X & Y are subsequences of Z.

## Shortest Common Supersequence | Finding all SCS

The shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X & Y are subsequences of Z.

## Shortest Common Supersequence | Introduction & SCS Length

The shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X & Y are subsequences of Z.

## Longest Repeated Subsequence Problem

The longest repeated subsequence (LRS) problem is the problem of finding the longest subsequences of a string that occurs at least twice.