## Find all N-digit numbers with given sum of digits

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)

Read More Find all N-digit numbers with given sum of digitsCoding made easy

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)

Read More Find all N-digit numbers with given sum of digitsImplement your own diff utility. i.e given two similar strings, efficiently list out all differences between them.

Read More Implement Diff UtilityGiven a string, calculate its rank among all its lexicographically sorted permutations. For example, consider below lexicographically sorted permutations

Read More Calculate rank of given string among all its lexicographically sorted permutationsThe 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.

Read More Longest Common Subsequence of K-sequencesFind 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.

Read More Find all N-digit strictly increasing numbers (Bottom-Up and Top-Down Approach)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.

Read More Wildcard Pattern MatchingGiven 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..

Read More Combinations of words formed by replacing given numbers with corresponding alphabetsGiven a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.

Read More Word Break ProblemGiven a pattern, count number of times the pattern appears in the given string as a subsequence.

Read More Count number of times a pattern appears in given string as a subsequenceEdit 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.

Read More The Levenshtein distance (Edit distance) problemThe shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.

Read More Shortest Common Supersequence using LCSThe shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.

Read More Shortest Common Supersequence | Finding all SCSThe shortest common supersequence (SCS) is the problem of finding the shortest supersequence Z of given sequences X and Y such that both X and Y are subsequences of Z.

Read More Shortest Common Supersequence | Introduction & SCS LengthThe longest repeated subsequence (LRS) problem is the problem of finding the longest subsequences of a string that occurs at least twice.

Read More Longest Repeated Subsequence problem