## SHA-224 Hash In Java

The SHA-2 family of cryptographic hash functions consists of six hash functions. These are: SHA-224, with 224 bit hash values SHA-256, with 256 bit hash… Read More »

- Load Factor and Rehashing
- For each element in 1st array count elements less than or equal to it in 2nd array | Set 2
- SHA-1 Hash
- SHA-256 Hash in Java
- SHA-512 Hash In Java
- Count pairs in array whose sum is divisible by K
- Count pairs in an array that hold i+j= arr[i]+arr[j]
- Introduction to Merkle Tree
- Longest Subsequence with at least one common digit in every element
- Sum of elements whose square root is present in the array
- Count pairs of parentheses sequences such that parantheses are balanced
- Count sub-arrays whose product is divisible by k
- Count all elements in the array which appears at least K times after their first occurrence
- Maximize the number of sum pairs which are divisible by K
- SHA-384 Hash In Java
- Check if a String can be converted to Pangram in K changes
- Number of pairs from the first N natural numbers whose sum is divisible by K
- Minimum deletions from string to reduce it to string with at most 2 unique characters
- Count occurrences of the average of array elements with a given number
- Find all good indices in the given Array
- PHP | hash_algos() Function
- MD2 Hash In Java
- Minimum array elements to be changed to make it a Lucas Sequence
- Total character pairs from two strings, with equal number of set bits in their ascii value
- Maximum count of pairs which generate the same sum
- SHA-224 Hash In Java
- Total distinct pairs of ugly numbers from two arrays
- Count elements that are divisible by at-least one element in another array
- Print all the sum pairs which occur maximum number of times
- Find four factors of N with maximum product and sum equal to N | Set-2

The SHA-2 family of cryptographic hash functions consists of six hash functions. These are: SHA-224, with 224 bit hash values SHA-256, with 256 bit hash… Read More »

SHA-1 or Secure Hash Algorithm 1 is a cryptographic hash function which takes an input and produces a 160-bit (20-byte) hash value. This hash value… Read More »

The MD2 is a Message-Digest Algorithm. It is a cryptographic hash function developed by Ronald Rivest in 1989. It is optimized for 8-bit computers. The… Read More »

Prerequisites: Hashing Introduction and Collision handling by separate chaining How hashing works: For insertion of a key(K) – value(V) pair into a hash map, 2… Read More »

Definition: In Cryptography, SHA is cryptographic hash function which takes input as 20 Bytes and rendered the hash value in hexadecimal number, 40 digits long… Read More »

Given an array of positive integers (may contain duplicates), the task is to find the number of triplets whose product is equal to a given… Read More »

Given a number N, the task is to check whether it is fascinating or not. Fascinating Number: When a number( 3 digits or more )… Read More »

Given an array of integers arr[] representing digits of a number. The task is to write a program to generate the largest number possible using… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Given a list of sentences and a list of phrases. The task is to find which sentence(s) contain all the words in a phrase and… Read More »

Given a string containing only two characters i.e. R and K (like RRKRRKKKKK). The task is to find the maximum value of N for a… Read More »

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 »