Round 1: Coding interview
- You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right.
You can only see the k numbers in the window. Each time the sliding window moves right by one position.
Return the max sliding window.
Example 1:
Input: nums = [1,3,-1,-3,5,3,6,7], k = 3
Output: [3,3,5,5,6,7]
Explanation:
Window position Max
--------------- -----
[1 3 -1] -3 5 3 6 7 3 [-1, 1, 3]
1 [3 -1 -3] 5 3 6 7 3 [-3, -1, 3]
1 3 [-1 -3 5] 3 6 7 5 [5]
1 3 -1 [-3 5 3] 6 7 5 [3,5]
1 3 -1 -3 [5 3 6] 7 6 []
1 3 -1 -3 5 [3 6 7] 7
Example 2:
Input: nums = [1], k = 1
Output: [1]
- Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
An input string is valid if:
Open brackets must be closed by the same type of brackets.
Open brackets must be closed in the correct order.
Example 1:
Input: s = "()"
Output: true
Example 2:
Input: s = "()[]{}"
Output: true
Example 3:
Input: s = "(]"
Output: false
Input: s = "[{()}]"
Output: false
Round 2: Projects explanation
- Explain the current project architecture
- Distributed transaction management in orchestration design pattern
- How to handle distributed transactions when the orchestrator died during the processing. So if it includes 3 operations and the system gets down after 2.
