Round 1: Online Test
Questions:
- The online test consisted of 3 coding questions with a total duration of 2 hours:
- 2 medium-level questions
- 1 hard-level question
- Specific questions included:
- In-depth questions about Indexing and Clustering
- DSA questions:
- Right Side View of Binary Tree
- Modified Version of House Robber
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Interview
Questions:
-
You are given an array of task_types and the respective memory required by each task for successful execution. Each task takes 1 unit of time, and at most two tasks of the same type can be parallelized if the sum of their memory requirements does not exceed the maximum memory M.
-
Evaluate the minimum unit of time required to execute all the tasks.
Input:
- Tasktype: [1, 2, 1, 2, 2, 3]
- Memory: [4, 4, 3, 7, 10, 3]
- M = 10
Output: 5
Candidate's Approach
The candidate solved the problem using HashMap, Lists, Sorting, and two pointers.
Interviewer's Feedback
No feedback provided.
Verdict: REJECTED