Tag: hash-table
- Add Edges to Make Degrees of All Nodes Even
- All Nodes Distance K in Binary Tree
- All O`one Data Structure
- Alphabet Board Path
- Amount of Time for Binary Tree to Be Infected
- Basic Calculator IV
- Buddy Strings
- Bulls and Cows
- Can Convert String in K Moves
- Change Minimum Characters to Satisfy One of Three Conditions
- Check If a String Contains All Binary Codes of Size K
- Check if All Characters Have Equal Number of Occurrences
- Check if Number Has Equal Digit Count and Digit Value
- Check if One String Swap Can Make Strings Equal
- Check if Strings Can be Made Equal With Operations II
- Check if The Number is Fascinating
- Check if the Sentence Is Pangram
- Check Whether Two Strings are Almost Equivalent
- Clone Graph
- Construct K Palindrome Strings
- Construct String With Repeat Limit
- Copy List with Random Pointer
- Count Anagrams
- Count Beautiful Substrings I
- Count Beautiful Substrings II
- Count Complete Substrings
- Count K-Subsequences of a String With Maximum Beauty
- Count Largest Group
- Count Number of Texts
- Count of Substrings Containing Every Vowel and K Consonants I
- Count of Substrings Containing Every Vowel and K Consonants II
- Count Substrings That Can Be Rearranged to Contain a String I
- Count Substrings That Can Be Rearranged to Contain a String II
- Count Substrings That Differ by One Character
- Count Substrings With K-Frequency Characters I
- Count the Number of Special Characters I
- Count the Number of Special Characters II
- Count Unique Characters of All Substrings of a Given String
- Count Vowel Substrings of a String
- Cousins in Binary Tree II
- Custom Sort String
- Decode the Message
- Design a Number Container System
- Design Authentication Manager
- Design Task Manager
- Design Twitter
- Design Underground System
- Determine if Two Strings Are Close
- Dinner Plate Stacks
- Encode and Decode TinyURL
- Existence of a Substring in a String and Its Reverse
- Find All Anagrams in a String
- Find Consecutive Integers from a Data Stream
- Find Duplicate Subtrees
- Find Elements in a Contaminated Binary Tree
- Find Longest Awesome Substring
- Find Longest Special Substring That Occurs Thrice I
- Find Longest Special Substring That Occurs Thrice II
- Find Mirror Score of a String
- Find the Count of Good Integers
- Find the Difference
- Find the Longest Substring Containing Vowels in Even Counts
- Find Valid Pair of Adjacent Digits in String
- First Letter to Appear Twice
- First Unique Character in a String
- Fraction to Recurring Decimal
- Frequency Tracker
- Greatest English Letter in Upper and Lower Case
- Happy Number
- HTML Entity Parser
- Implement Magic Dictionary
- Implement Trie (Prefix Tree)
- Increasing Decreasing String
- Integer to Roman
- Intersection of Two Linked Lists
- Isomorphic Strings
- Largest Color Value in a Directed Graph
- Largest Palindromic Number
- Largest Substring Between Two Equal Characters
- Letter Combinations of a Phone Number
- Letter Tile Possibilities
- Lexicographically Minimum String After Removing Stars
- LFU Cache
- Linked List Cycle II
- Linked List Cycle
- Longest Ideal Subsequence
- Longest Nice Substring
- Longest Palindrome
- Longest Repeating Character Replacement
- Longest Substring with At Least K Repeating Characters
- Longest Substring Without Repeating Characters
- Lowest Common Ancestor of Deepest Leaves
- LRU Cache
- Make Number of Distinct Characters Equal
- Map Sum Pairs
- Maximum Difference Between Even and Odd Frequency I
- Maximum Frequency Stack
- Maximum Length Substring With Two Occurrences
- Maximum Manhattan Distance After K Changes
- Maximum Number of Balloons
- Maximum Number of Balls in a Box
- Maximum Number of Occurrences of a Substring
- Maximum Number of Words You Can Type
- Merge BSTs to Create Single BST
- Minimize String Length
- Minimum Deletions to Make Character Frequencies Unique
- Minimum Deletions to Make String K-Special
- Minimum Genetic Mutation
- Minimum Length of Anagram Concatenation
- Minimum Length of String After Operations
- Minimum Number of Operations to Make Word K-Periodic
- Minimum Number of Pushes to Type Word II
- Minimum Number of Steps to Make Two Strings Anagram II
- Minimum Number of Steps to Make Two Strings Anagram
- Minimum Operations to Make Character Frequencies Equal
- Minimum Substring Partition of Equal Character Frequency
- Minimum Time to Collect All Apples in a Tree
- Minimum Window Substring
- Most Frequent Subtree Sum
- Most Stones Removed with Same Row or Column
- Next Greater Numerically Balanced Number
- Node With Highest Edge Score
- Number of Atoms
- Number of Different Integers in a String
- Number of Good Ways to Split a String
- Number of Nodes in the Sub-Tree With the Same Label
- Number of Substrings Containing All Three Characters
- Number of Wonderful Substrings
- Optimal Partition of String
- Palindrome Rearrangement Queries
- Parse Lisp Expression
- Partition Labels
- Partition String Into Minimum Beautiful Substrings
- Path Crossing
- Permutation Difference between Two Strings
- Permutation in String
- Powerful Integers
- Random Flip Matrix
- Random Pick Index
- Ransom Note
- Rearrange Characters to Make Target String
- Rearrange K Substrings to Form Target String
- Reconstruct Original Digits from English
- Redistribute Characters to Make All Strings Equal
- Remove Letter To Equalize Frequency
- Remove Zero Sum Consecutive Nodes from Linked List
- Reordered Power of 2
- Reorganize String
- Repeated DNA Sequences
- Replace Question Marks in String to Minimize Its Value
- Rings and Rods
- Roman to Integer
- Second Largest Digit in a String
- Select K Disjoint Special Substrings
- Smallest Integer Divisible by K
- Smallest Number in Infinite Set
- Smallest Subtree with all the Deepest Nodes
- Sort Characters By Frequency
- Split a String Into the Max Number of Unique Substrings
- Stock Price Fluctuation
- Substring with Concatenation of All Words
- Substrings of Size Three with Distinct Characters
- Sum of Beauty of All Substrings
- Swap For Longest Repeated Character Substring
- Take K of Each Character From Left and Right
- Throne Inheritance
- Time Based Key-Value Store
- Total Appeal of A String
- Total Characters in String After Transformations I
- Total Characters in String After Transformations II
- Tweet Counts Per Frequency
- Two Sum IV - Input is a BST
- Ugly Number II
- Uncommon Words from Two Sentences
- Unique Length-3 Palindromic Subsequences
- Using a Robot to Print the Lexicographically Smallest String
- Valid Anagram
- Vertical Order Traversal of a Binary Tree
- Word Ladder II
- Word Ladder
- Word Pattern