1. How would you design a Chrome update deployment strategy?

2. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order.

3. Majority Element - II Problem Statement Given an array/list ARR of integers with length 'N', identify all elements that appear more than floor(N/3) times within the array/list. Input: T (number of test cases)For each test case:- N (number of elements in the array)- A sequence of N space-separated integers representing the array elements Output: For each test case, output the majority elements, each separated by a space. Output the result for each test case on a new line. The order of majority elements does not need to be maintained. Example: Input: 273 2 3 1 4 3 361 1 2 2 3 3 Output: 31 2 3 Constraints: 1 <= T <= 100 3 <= N <= 5000 1 <= ARR[i] <= 10^5 Time Limit: 1 sec Note: You don’t need to print anything; it's already handled. Implement the given function to solve the problem.

4. Highlight your relevant skills and experiences.

5. How would you efficiently implement three stacks using a single array?