Status: 2.10 YOE
Position: G6
Location: Bangalore
Round 1: Problem Solving
- Question: File read/write operations using an offset. Follow-up was based on multithreading on this.
Round 2: Concurrent Data Structure Design
- Question: Design a data structure that supports search, insert, and delete operations with strict concurrency constraints.
- Multiple
searchoperations can work concurrently. - Only one
insertat a time (searches are still allowed). - Only one
deleteat a time, which strictly stops both inserts and searches. - Hint: Requires deep knowledge of Read-Write locks and thread synchronization.
Verdict: Rejected. I struggled with the concurrency implementation in the second question and couldn't fully solve it.
Comments (2)


