## Longest common anagram subsequence from N strings

Given N strings. Find the longest possible subsequence from each of these N strings such that they are anagram to each other. The task is… Read More »

- Load Factor and Rehashing
- Print nodes in top view of Binary Tree | Set 2
- Sentence that contains all the given phrases
- For each element in 1st array count elements less than or equal to it in 2nd array | Set 2
- Count number of triplets with product equal to given number with duplicates allowed
- Maximum occurring character in an input string | Set-2
- Find the largest number that can be formed with the given digits
- Count pairs in an array that hold i+j= arr[i]+arr[j]
- SHA-1 Hash
- SHA-512 Hash In Java
- Introduction to Merkle Tree
- Sum of elements whose square root is present in the array
- Longest common anagram subsequence from N strings
- Longest Subsequence with at least one common digit in every element
- Hashing in Distributed Systems
- SHA-256 Hash in Java
- Number of Counterclockwise shifts to make a string palindrome
- SHA-384 Hash In Java
- Fascinating Number
- Count pairs of parentheses sequences such that parantheses are balanced
- Count of strings that can be formed from another string using each character at-most once
- Check if a String can be converted to Pangram in K changes
- Print all the pairs that contains the positive and negative values of an element
- Method Class | hashCode() Method in Java
- PHP | hash_algos() Function
- Minimum deletions from string to reduce it to string with at most 2 unique characters
- Find all good indices in the given Array
- Maximum sub-matrix area having count of 1's one more than count of 0's
- Count occurrences of the average of array elements with a given number
- Minimum array elements to be changed to make it a Lucas Sequence

Given N strings. Find the longest possible subsequence from each of these N strings such that they are anagram to each other. The task is… Read More »

The java.lang.reflect.Method.hashCode() method returns the hash code for the Method class object. The hashcode returned is computed by exclusive-or operation on the hashcodes for the… Read More »

Given an array of distinct integers, print all the pairs having a positive value and negative value of a number that exists in the array.… Read More »

Given two strings str1 and str2, the task is to print the number of times str2 can be formed using characters of str1. However, a… Read More »

Prerequisite – Hashing A distributed system is a network that consists of autonomous computers that are connected using a distribution middleware. They help in sharing… Read More »

Given a binary search tree of n nodes with distinct values. Also given are Q queries. Each query consists of a node value that has… Read More »

Given a string containing lowercase characters. The task is to print the maximum occurring character in the input string. If 2 or more characters appear… Read More »

Given a N x N binary matrix. The problem is finding the maximum area sub-matrix having a count of 1’s one more than count of… Read More »

Given a string of lowercase English alphabets, find the number of counterclockwise shifts of characters required to make the string palindrome. It is given that… Read More »

Given N rows with M elements each and an array arr[] of L numbers, the task is to print the count of elements of that… Read More »

Mid-Square hashing is a hashing technique in which unique keys are generated. In this technique, a seed value is taken and it is squared. Then,… Read More »

Given a string str, the task is to print the maximum count of characters which are greater than both its left and right character in… Read More »

Given the following input (4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199) and the hash function x mod 10, which of the following statements are… Read More »

Consider a hash table of size seven, with starting index zero, and a hash function (3x + 4)mod7. Assuming the hash table is initially empty,… Read More »

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing… Read More »