1.Search Word in a 2D Array
2.Design APIs for a system
3.Implement K-means from scratch
4.CPU Scheduling Optimization Problem
5.Pick Elements Randomly with Weight
6.Find the Missing Number
7.Maximize Number of Positive Prefix Sums
8.Closest Numbers
9.Music Pairs
10.Unique Character
11.Minimum Absolute Difference
12.First Unique Character
13.Prefix Sum with Overflow Consideration
14.Minimum Absolute Difference
15.Positive Prefixes
16.Closest Numbers
17.First Unique Character in a String
18.Max Pos Prefix Sum
19.Vowels Substring Count
20.Closest Number
21.First Unique Character
22.First Unique Character
23.Positive Prefixes
24.Maximize the Number of Positive Prefix Sums
25.Find Pairs with the Minimum Absolute Difference
26.Maximize the Number of Positive Prefix Sums
27.Implement a Card UI on Xcode
28.Two Sum Variants Combined with String Manipulation
29.SwiftUI Debug
30.First Unique Character Problem
31.Vowels Problem
32.Closest Numbers
33.Positive Prefixes
34.Closest Numbers
35.Positive Prefixes
36.Merge K Sorted Arrays
37.Remove Duplicates from Sorted Array
38.First Unique Character
39.1010 Two Sum Variant
40.Positive Prefixes
41.Knowledge of Restful API
42.Understanding of HTTP Methods
43.List and Set Implementations in Java
44.Set vs List
45.Java Collections
46.Java Features
47.Familiarity with Java
48.Pairs of Songs With Total Durations Divisible by 60
49.Positive Prefixes
50.Whole Minute Dilemma
51.Robot Grid Pathfinding with Landmines
52.URI Design
53.Contiguous Substring Problem
54.LRU Cache Implementation
55.Object-Oriented Design Problem
56.Design a Ticket Reservation System
57.System Design for a Product Rating Feature
58.Top K Elements in a Data Stream
59.Identify Unsafe Speeds in Journeys
60.Count Complete Journeys in a LogFile
61.Fix the Bug in LogEntry Class
62.Distinct Character Count and Frequency Analysis
63.Design a Stock Trading System
64.Implement Top N Bought Items API
1. Search Word in a 2D Array
The second part of the interview is coding, where the task is to search for a word in a 2D array using depth-first search (DFS). The overall difficulty is considered easy.
2. Design APIs for a system
The interview consists of two parts. The first part, lasting 30 minutes, focuses on system design, primarily concerning API design.
3. Implement K-means from scratch
You are given a basic framework and asked to implement the K-means clustering algorithm from scratch. Please discuss how you would approach this task, considering object-oriented programming principles.
4. CPU Scheduling Optimization Problem
Regarding CPU scheduling, you are given the following scenario: Each second, you select a processor to schedule a process. After each scheduling, the processor's ability is reduced to the floor(ability/2). The task is to determine the minimum amount of time required to schedule all processes to completion. The solution can be approached using a max heap and a greedy algorithm.
5. Pick Elements Randomly with Weight
Design an algorithm to pick elements randomly from a list, where each element has a certain weight that determines its probability of being picked.
解锁更多真题，请点此 登录 篱笆帮
高频题（0）
