## Find all N-digit binary numbers with equal sum of bits in its two halves

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.

Coding made easy

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. For example, consider below lexicographically sorted permutations

The 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.

Find 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.

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.

In this post, we will see how to reverse a string in Java in 10 different ways. For example, reverse of “Techie Delight” is “thgileD eihceT”.