Online Assessment Overview
Trait-Based Assessment: Timed questionnaire that evaluates your work-style preferences by choosing which of two statements is “most like you.”
Coding Assessment: Timed coding interface where you solve programming challenges to demonstrate your algorithm and implementation skills.
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⁵.
We offer hands-on OA writing, Hackerrank proxy interviews, and interview coaching to ensure you ace your assessment. Contact us now!
