1.Music Pairs
2.Unique Character
3.Minimum Absolute Difference
4.First Unique Character
5.Prefix Sum with Overflow Consideration
6.Minimum Absolute Difference
7.Positive Prefixes
8.Closest Numbers
9.First Unique Character in a String
10.Max Pos Prefix Sum
11.Vowels Substring Count
12.Closest Number
13.First Unique Character
14.First Unique Character
15.Positive Prefixes
16.Maximize the Number of Positive Prefix Sums
17.Find Pairs with the Minimum Absolute Difference
18.Maximize the Number of Positive Prefix Sums
19.Implement a Card UI on Xcode
20.Two Sum Variants Combined with String Manipulation
21.SwiftUI Debug
22.First Unique Character Problem
23.Vowels Problem
24.Closest Numbers
25.Positive Prefixes
26.Closest Numbers
27.Positive Prefixes
28.Merge K Sorted Arrays
29.Remove Duplicates from Sorted Array
30.First Unique Character
31.1010 Two Sum Variant
32.Positive Prefixes
33.Knowledge of Restful API
34.Understanding of HTTP Methods
35.List and Set Implementations in Java
36.Set vs List
37.Java Collections
38.Java Features
39.Familiarity with Java
40.Pairs of Songs With Total Durations Divisible by 60
41.Positive Prefixes
42.Whole Minute Dilemma
43.Robot Grid Pathfinding with Landmines
44.URI Design
45.Contiguous Substring Problem
46.LRU Cache Implementation
47.Object-Oriented Design Problem
48.Design a Ticket Reservation System
49.System Design for a Product Rating Feature
50.Top K Elements in a Data Stream
51.Identify Unsafe Speeds in Journeys
52.Count Complete Journeys in a LogFile
53.Fix the Bug in LogEntry Class
54.Distinct Character Count and Frequency Analysis
55.Design a Stock Trading System
56.Implement Top N Bought Items API
1. Music Pairs
In an array, find the number of pairs (a, b) such that the sum (a + b) is a multiple of 60. Be careful with the numbers 0 and 60 in the map, as this caused a wrong answer in one instance.
2. Unique Character
Return the index of the first unique character in a string.
3. Minimum Absolute Difference
Given an array of distinct integers, return all the pairs [a, b] that have the smallest absolute difference of any two elements in the array.
4. First Unique Character
Find the first non-repeating character in a string and return its index. If it doesn't exist, return -1.
5. Prefix Sum with Overflow Consideration
Implement a solution for a 'Prefix Sum' problem that requires sorting and using prefix sums to determine a result. Additionally, account for potential integer overflow issues in your implementation.
解锁更多真题，请点此 登录 篱笆帮
高频题（0）
