線上評估概述
基於特徵的評估: 定時問卷，評估您的工作方式偏好，從兩項聲明中選擇「最像您」的一項。
編碼評估: 定時編碼介面，讓您解決編程挑戰，展現您的演算法與執行技巧。
1. Question 1
Given two integer arrays a and b of length n. You want to form as many pairs (i,j) as possible such that a[i] > b[j], and each element can be used at most once. Return the maximum number of pairs.
Example:
n = 3
a = [1, 2, 3]
b = [1, 2, 1]
Output: 2
Explanation: You can pair (2,1) and (3,1).Constraints: 1 ≤ n ≤ 10⁵, 1 ≤ a[i], b[i] ≤ 10⁹.
2. Question 2
Given a string num of digits, you may swap any two adjacent digits if they share the same parity (both even or both odd), as many times as you like. Return the lexicographicallylargest string you can form.
Example:
Input: "7596801"
Output: "9758601"
Explanation:
- swap 5↔9 → "7956801"
- swap 7↔9 → "9756801"
- swap 6↔8 → "9758601"
Constraint: length of num up to 10⁵.
我們提供實操性 OA 寫作指導、Hackerrank 模擬面試服務以及面試輔導，助您輕鬆通過評估。 聯絡我們 ！
END
