MetaIts forward-looking vision and global impact-along with the rigorous Meta OA process-attract top talent worldwide. Its forward-looking vision and global impact-along with the rigorous Meta OA process-attract top talent worldwide.
However, the path to Meta is not easy, especially the notorious Online Assessment (OA) round. We've compiled real OA questions with in- depth explanations and smart strategies to sharpen your skills and accelerate your progress. depth explanations and smart strategies to sharpen your skills and accelerate your progress.
1. Array Query & Combination Optimization
Problem. Given an integer array arr and a target z, determine for each query if there exist non-negative integers a, b and indices i, j such that.
a × arr[i] + b × arr[j] = z
- You may reuse the same element (
i == jallowed). - Minimize
a + b. - If the minimum
a + bexceeds a given limitk, return-1.
Approach.
- Enumerate all pairs
(i,j)inarr. - For each pair and each query, solve for the smallest non-negative
a, bsatisfying the equation. - Track the minimal
a + b; if >kor none found, return-1.
2. Character Shift Decryption
Problem. You have a circular alphabet wheel of uppercase letters A-Z. An encrypted string is formed by shifting each character k Decrypt by reversing this shift.
Example. Shifting "Z" by 1 step counterclockwise yields "A".
Approach. For each character C in the encrypted string.
- Compute its zero-based index
I
