Implement a Set Data Structure with a Resizable Array, Then Improve It with Hashing
Company: Disney
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: medium
Interview Round: Technical Screen
Overview: Coding question that asks you to implement a set without built-in set or map types, first on a resizable array and then with hashing into array indices. It tests duplicate handling, grow and shrink policies with amortized analysis, collision resolution, deletion, rehashing, and expected versus worst-case complexity.
Read the full Disney Software Engineer interview experience this question came from