Ace your Coding Interview
Get hired by top tech companies with our comprehensive interview preparation.
Get StartedWrite 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.
Given a positive number n, find all strings of length n containing balanced parentheses.
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.
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.
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.
Given a string, find the longest substring containing distinct characters using sliding window technique in linear time.
Find all substrings of a string that contains all characters of another string. In other words, find all substrings of the first string that are anagrams of the second string.
Given a string, find all palindromic permutations of it… We know that the left and right half of a palindrome contains the same set of characters, so any palindromic permutations of a string are only possible if each character’s frequency in the string is even.
Given a string and a positive number k, find the longest substring of the string containing k distinct characters. If k is more than the total number of distinct characters in the string, return the whole string.
Run–length encoding (RLE) is a simple form of lossless data compression that runs on sequences with the same value occurring many consecutive times. It encodes the sequence to store only a single value and its count.
Given a line of text, reverse the text without reversing the individual words.
Given a string and an integer k, print the string in k rows in the zigzag form.