Longest Palindromic Subsequence using Dynamic Programming
The Longest Palindromic Subsequence (LPS) problem is finding the longest subsequences of a string that is also a palindrome.
Category: String
Longest Common Substring Problem
The longest common substring problem is the problem of finding the longest string (or strings) that is a substring (or are substrings) of two strings.
Longest Common Subsequence | Finding all LCS
Given two sequences, print all the possible longest common subsequences present in them.
Longest Common Subsequence (LCS) | Space optimized version
This post covers a space-optimized function to find the length of the Longest Common Subsequence (LCS) problem.
Longest Common Subsequence Problem
The Longest Common Subsequence (LCS) problem is finding the longest subsequence present in given two sequences in the same order, i.e., find the 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.
Find all combinations of non-overlapping substrings of a string
Given a string, find all combinations of non-overlapping substrings of it. The solution should use parenthesis to split the string into non-overlapping substrings.
Generate binary numbers between 1 to `n` using a queue
Given a positive number n, efficiently generate binary numbers between 1 and n using the queue data structure in linear time.
Find all n-digit binary numbers with k-bits set where `k` ranges from 1 to `n`
Write a program to print all n–digit binary numbers with k–bits set where k ranges from 1 to n. The numbers with the same number of bits set should be printed together in ascending order.
Find all strings of a given length containing balanced parentheses
Given a positive number n, find all strings of length n containing balanced parentheses.
Lexicographically Minimal String Rotation
The lexicographically minimal string rotation (or lexicographically least circular substring) is the problem of finding a string’s rotation possessing the lowest lexicographical order among all possible rotations.
Find all lexicographically next permutations of a string
Given a string sorted in ascending order, find all lexicographically next permutations of it. The words are arranged in the same order in the lexicographic order as they are presumed to appear in a dictionary.
Find all permutations of a string in C++ (Using Backtracking and STL)
This post will find all permutations of a string containing all distinct characters in C++. For example, the string ABC has 6 permutations, i.e., ABC, ACB, BAC, BCA, CBA, CAB.