Round 1
Questions:
- Find all triplets in array with i < j < k <= n, where sum of these triplets is divisible by a number d.
- Given a binary string like 1010, and another string which has 0 and 1 and some question mark like 10?1, the question mark is a placeholder that can be replaced by either 0 or 1. You have to check if we can form the question mark string (you can replace the question mark with either 0 or 1) from the original binary string by sorting a part of the binary string or the full string any number of times.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.