Remove Duplicate Numbers by using a Hash Map
Given a list of integers nums, remove numbers that appear multiple times in the list, while maintaining order of the appearance in the original list. It should use O(k) …
Category: hash
Rolling Hash Algorithm to Find the Longest Prefix that Is a Suffix
Given a string s, return the longest prefix of s that is not equal to s and exists as a suffix of s. Constraints n ≤ 100,000 where n …
Algorithm to Find the Longest Anagram Subsequence
Given two lowercase alphabet strings a and b, return the length of the longest anagram subsequence. Constraints n ≤ 100,000 where n is the length of a m ≤ …
Hash Algorithm to Check A List Containing Almost Same Strings (Differ By One Character)
You are given a list of lowercase alphabet strings words where each string is of the same length. Return whether there’s two strings that differ only in one index. …
Word Formation Algorithm using Hash Map
Given a list of strings words and a string letters, return the length of longest string in words that can be made from letters in letters. If no word …