Q1. Team Formation (Medium)
Problem
Given n developers, each developer i has:
- lowerSkill[i]: max number of team members with skill less than theirs
- higherSkill[i]: max number of team members with skill greater than theirs
Form the largest team such that every developer is okay with their relative skill positions.
Example
lowerSkill = [1, 3, 2, 2, 2]
higherSkill = [2, 2, 1, 1, 3]
Output: 3
Q2. Two-Core Process Assignment (Medium)
Problem
You are given an array time representing the time each process takes. Distribute processes across 2 cores such that the maximum total time on any core is minimized. Return the total time for both cores as an array: [sum_core1, sum_core2].
Example
time = [10, 21, 10, 21, 10]
Output: [41, 31]
What approach would work best for this problem?
Q3. Unique Digits in Range (Easy)
Problem
Given a range [a, b], count how many numbers in that range have all unique digits.
Example
a = 5, b = 11
Output: 6
我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。
We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.
