Given two strings, determine if the first string can be transformed into the second string with single an edit operation. An edit operation can be one of insert, remove, or replace a character in the first string.
Given a string and a pattern containing wildcard characters, write an efficient algorithm to check if the input string matches with the wildcard pattern or not.
In this post, we will see how to find all lexicographic permutations of a string where repetition of characters is allowed.
Find all N-digit binary numbers with equal sum of left and right half. N varies from [1-9] and binary number should not start with 0.
Given a string, find minimum cuts needed to partition it such that each partition is a palindrome.
Given a positive integer N, find all N-digit binary numbers having more 1’s than 0’s for any prefix of the number.
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 three strings, return true if third string is interleaving of first and second string. i.e., it is formed from all characters of first and second string and order of characters is preserved.
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).
Implement your own diff utility. i.e given two similar strings, efficiently list out all differences between them.
Given a string, calculate its rank among all its lexicographically sorted permutations.
Given a dictionary of words where each word follows a CamelCase notation, find all words in the dictionary which matches with the given pattern consisting of all uppercase characters.