Word Break Problem – Using Trie Data Structure
Given a dictionary of words, determine if a given string can be segmented into a space-separated sequence of one or more dictionary words.
Tag: Recursive
Find all words matching a pattern in the given dictionary
Given a dictionary of words where each word follows a CamelCase notation, find all words in it that matches a given pattern of all uppercase characters.
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.
How to Boost QuickSort Performance?
Quicksort performance can be boosted in several ways. In this post, we will cover a few of them.
Treap Data Structure
A Treap data structure is basically a combination of a binary search tree and a heap.
Wildcard Pattern Matching
Given a string and a pattern containing wildcard characters, i.e., * and ?’, where ? can match to any single character in the 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 string or not.
Longest Increasing Subsequence using LCS
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence’s elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. This subsequence is not necessarily contiguous or unique.
Print binary tree structure with its contents
Write an efficient algorithm to print a binary tree structure in standard output.
Generate all permutations of a string in Java – Recursive and Iterative
Generate all permutations of a string in Java.
Find the maximum sum of a subsequence with no adjacent elements
Given an integer array, find the maximum sum of subsequence where the subsequence contains no adjacent elements.
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.