Minimum Number of Steps to Make Two Strings Anagram
MEDIUM
100%
Hash TableStringCounting
Insert Delete GetRandom O(1)
MEDIUM
87.5%
ArrayHash TableMathDesignRandomized
Meeting Rooms II
MEDIUM
62.5%
ArrayTwo PointersGreedySortingHeap (Priority Queue)Prefix Sum
LRU Cache
MEDIUM
75%
Hash TableLinked ListDesignDoubly-Linked List
Merge k Sorted Lists
HARD
75%
Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
Palindromic Substrings
MEDIUM
62.5%
Two PointersStringDynamic Programming
Maximum Number of Non-overlapping Palindrome Substrings
HARD
87.5%
Two PointersStringDynamic ProgrammingGreedy
Find the Winner of the Circular Game
MEDIUM
62.5%
ArrayMathRecursionQueueSimulation
Top K Frequent Elements
MEDIUM
75%
ArrayHash TableDivide and ConquerSortingHeap (Priority Queue)Bucket SortCountingQuickselect
Need Help Solving These Problems?
CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.
