Mock Interview
The problem is shown without its category. You commit to a pattern, a target complexity and a data structure, then explain your approach in your own words. The evaluation scores how you got there, not just the answer.
Minimum Size Subarray Sum
Not attempted
Two Sum
Not attempted
Longest Substring Without Repeating Characters
Not attempted
Kth Largest Element in an Array
Not attempted
Daily Temperatures
Not attempted
Course Schedule
Not attempted
Network Delay Time
Not attempted
Number of Islands
Not attempted
Coin Change
Not attempted
Search in Rotated Sorted Array
Not attempted
Merge Intervals
Not attempted
Word Search
Not attempted
Subarray Sum Equals K
Not attempted
Top K Frequent Elements
Not attempted
Implement Trie (Prefix Tree)
Not attempted