Given an array or a string, print all the permutations of it. A permutation of a string, is a rearrangement of the elements of the

# Category: Strings

## K – Palindromic String (DP-19)

You are given a string and a positive integer K. You need to determine if the string is K palindrome or not. A string is

## Minimum edit distance (DP-11)

The levenshtein distance or Edit distance between two strings is the minimum number of single-character edits (Insertions, deletions and replacements) required to change on word

## Longest Palindromic Subsequence (DP-05)

You are given a string X of length m. You need to find the length of the longest subsequence of X which is palindrome.A subsequence

## Longest common Subsequence (DP-04)

You are given two strings X and Y of lengths m and n. You need to find the length of the longest common subsequence. A

## Longest common substring (DP-03)

You are given two strings X and Y with lengths m and n. You need to find the length of the longest common substring. Sample