Replace every array element with the least greater element on its right
Write an efficient algorithm to replace every element of a given array with the least greater element on its right or with -1 if there are no greater elements.
Tag: Medium
Longest Common Subsequence of k–sequences
The Longest Common Subsequence (LCS) problem is finding the longest subsequence present in given two sequences in the same order, i.e., find the 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 (Bottom-up and Top-down approach)
Find all n–digit strictly increasing numbers where n varies from 1 to 9. If we process the number from left to right and every digit is greater than the preceding digit, we can say that the number is strictly increasing.
Check if a binary tree is height-balanced or not
Given a binary tree, write an efficient algorithm to check if a tree is height-balanced or not. In a height-balanced tree, the absolute difference between the height of the left and right subtree for every node is 0 or 1.
Print continuous subarray with maximum sum
Given an integer array, find and print a contiguous subarray with the maximum sum in it.
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.
Longest Common Prefix in a given set of strings (Using Trie)
Find the longest common prefix (LCP) in a given set of strings.
Lexicographic sorting of a given set of keys
Lexicographic sorting: Given a set of strings, print them in lexicographic order (dictionary/alphabetical order).
Find first `k` maximum occurring words in a given set of strings
Given a huge set of words with duplicates present and a positive integer k, find the first k–maximum occurring words in it.
Find duplicate rows in a binary matrix
Find duplicate rows present in a given binary matrix by traversing the matrix only once.
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.
Check if a subarray with 0 sum exists or not
Given an integer array, check if it contains a subarray having zero-sum.