Hash Function
Hash Function¶
- 3327. Check if DFS Strings Are Palindromes
- 3292. Minimum Number of Valid Strings to Form Target II
- 3291. Minimum Number of Valid Strings to Form Target I
- 3135. Equalize Strings by Adding or Removing Characters at Ends
- 3045. Count Prefix and Suffix Pairs II
- 3042. Count Prefix and Suffix Pairs I
- 3037. Find Pattern in Infinite Stream II
- 3036. Number of Subarrays That Match a Pattern II
- 3034. Number of Subarrays That Match a Pattern I
- 3031. Minimum Time to Revert Word to Initial State II
- 3029. Minimum Time to Revert Word to Initial State I
- 3023. Find Pattern in Infinite Stream I
- 3008. Find Beautiful Indices in the Given Array II
- 3006. Find Beautiful Indices in the Given Array I
- 2430. Maximum Deletions on a String
- 2261. K Divisible Elements Subarrays
- 2223. Sum of Scores of Built Strings
- 2168. Unique Substrings With Equal Digit Frequency
- 2156. Find Substring With Given Hash Value
- 1960. Maximum Product of the Length of Two Palindromic Substrings
- 1948. Delete Duplicate Folders in System
- 1923. Longest Common Subpath
- 1698. Number of Distinct Substrings in a String
- 1554. Strings Differ by One Character
- 1461. Check If a String Contains All Binary Codes of Size K
- 1392. Longest Happy Prefix
- 1316. Distinct Echo Substrings
- 1147. Longest Chunked Palindrome Decomposition
- 1062. Longest Repeating Substring
- 1044. Longest Duplicate Substring
- 718. Maximum Length of Repeated Subarray
- 711. Number of Distinct Islands II
- 706. Design HashMap
- 705. Design HashSet
- 694. Number of Distinct Islands
- 572. Subtree of Another Tree
- 535. Encode and Decode TinyURL
- 214. Shortest Palindrome
- 187. Repeated DNA Sequences