Dig into custom data structures for efficient, scalable solutions in complex coding challenges.
Introduction to Custom Data Structures Snapshot Array Time Based Key-Value Store LRU Cache Insert Delete GetRandom O(1) Min Stack Range Module Shortest Word Distance II Design HashSet Max Stack Moving Average from Data Stream Two Sum III - Data structure design Range Sum Query - Immutable LFU Cache
Knowing What to Track
Examine efficient data tracking patterns and solutions for frequency-related problems.
Introduction to Knowing What to Track Palindrome Permutation Valid Anagram Design Tic-Tac-Toe Group Anagrams Maximum Frequency Stack First Unique Character in a String Find All Anagrams in a String Longest Palindrome by Concatenating Two-Letter Words Rank Teams by Votes Pairs of Songs With Total Durations Divisible by 60 Minimum Number of Pushes to Type Word II Task Scheduler Count Anagrams Divide Array Into Increasing Sequences Ransom Note