Round 1
Questions:
- Basic calculator with only + & *, expectation was to do in O(1) space complexity.
- Given a string str and a characterset set, find a substring in str such that it has all the characters in set.
Example:
Input: str = "aaccbc", set = "abc"
Output: "accb"
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.