Find all distinct combinations of a given length – II
Given an integer array, find all distinct combinations of a given length k. The program should print only distinct combinations.
Category: Backtracking
Maximum Product Subset Problem
Given an integer array, find a subset in it having the maximum product of its elements.
Determine whether a string matches with a given pattern
Given a string and a pattern, determine if the pattern matches with the string or not. The solution should not use any regex.
Find the minimum number possible by doing at-most `k` swaps
Given a positive integer, find the minimum number possible by doing at-most k swap operations upon its digits.
Generate a list of possible words from a character matrix
Given an M × N boggle board, find a list of all possible words that can be formed by a sequence of adjacent characters on the board.
Find all combinations of elements satisfying given constraints
Given a positive number n, find all combinations of 2×n elements such that every element from 1 to n appears exactly twice and the distance between its two appearances is exactly equal to the value of the element.
Generate all permutations of a string in Java – Recursive and Iterative
Generate all permutations of a string in Java.
Find all distinct combinations of a given length with repetition allowed
Given an integer array, find all distinct combinations of a given length k, where the repetition of elements is allowed.
Find all distinct combinations of a given length – I
Given an integer array, find all distinct combinations of a given length k. The program should print only distinct combinations.
Print all paths from the root to leaf nodes of a binary tree
Given a binary tree, write an efficient algorithm to print all paths from the root node to every leaf node in it.
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.
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.