1.Binary Search Implementation
2.Task Dependency Resolution
3.Coding: Compare Leaf Nodes
4.System Design: Task Scheduler
5.Design a Quota Service with Strong Consistency and High Availability
6.Design a Data Structure to Add and Search Strings
7.Design a Cloud Storage Quota System
8.Find All Direct Reports of a Manager
9.Merge Intervals with Scores
10.Path Permutations
11.Design a Logging Mechanism for a Cloud Service
12.Topological Sorting Algorithm
13.Trie Data Structure Implementation
14.Design a single-node key-value store
15.Design a Data Structure for a Database
16.Design a Minimum Stack
17.Implement Topological Sorting
18.File Storage System
19.Design a System for Collecting and Analyzing Temperature Data from Sensors
20.MapReduce Solution for Large Input Array
21.Coding: Practical Python Question
22.Coding: LeetCode Medium Problem
23.System Design: Task Scheduler
24.Key Value Store with Transactions
25.Design a Size Limiting Service
26.Populate Next Right Pointers in Each Node of a Binary Tree
27.Design a Key-Value Store
28.Minimum Number of Operations to Complete Jobs
29.Count the Number of Nodes in a Tree
30.Airport Limousine Rider Collection
31.Find Maximum Length Subsequence with Constraint
32.Unequal Elements
33.Split Array with Max Subarray Length K
34.Sequential Strings
35.Coloring Houses
36.String Patterns
37.Array Reduction Algorithm
38.Point Inside Triangle Determination
39.Find Maximum Length Subsequence with Unequal Adjacent Elements
40.Implement a Simple Meeting Assistant
41.Calculate Node Count in an N-ary Tree
42.Design a Data Structure to Simulate Chrome's Tab Behavior
43.String Transformation
44.Thread Count Problem
45.Implement a Hash Map
46.Design a Task Scheduler
47.Longest Transmission Path in a Radio Wave Network
48.System Design: File Storage System Without Using Existing DB Solutions
49.Coding Challenge: Implement Functions '久以其' and '以舞舞'
50.Quota Service System Design
51.LRU Cache Variant with Resize Function
52.Access Control System Design
53.String Transformation Based on Constraints
54.Thread Count Problem
55.String Pattern Matching
56.Design a Key-Value Store with Specific Features
57.Design a Key-Value Store
58.Binary Tree Value Update
59.Topological Sorting and Course Schedule
60.Node Class Communication
1. Binary Search Implementation
Write a binary search algorithm. Before coding, a few behavioral questions will be asked. Discuss the difficulty of the code and any issues you might encounter with the resume and behavioral questions.
2. Task Dependency Resolution
Given a task list and their dependency list, output a method to complete the tasks. Initially consider that each task has at most one dependency. As a follow-up, how would you handle the situation if each task could have multiple dependencies?
3. Coding: Compare Leaf Nodes
Given a class Node defined as follows:
class Node {
String val;
List children;
}
Write a function that takes two root nodes and determines if the strings formed by the leaf nodes are the same for both roots.
4. System Design: Task Scheduler
Design a task scheduler with the following requirements: tasks need to be run based on a certain frequency, similar to how tasks are scheduled in a data warehouse like Snowflake. Some tasks may need to wait for the previous task to complete before proceeding. Discuss the high-level design, task storage, scheduling mechanism, and how to handle tasks with dependencies. Additionally, address the scenario where a task needs to run for an extended period.
5. Design a Quota Service with Strong Consistency and High Availability
Design a quota service that allows multiple users to read the quota simultaneously. The service needs to satisfy both strong consistency and high availability. Discuss the implementation of transactions and consider low-level details.
解锁更多真题，请点此 登录 篱笆帮
高频题（0）
