I appeared for the Hased interview, and the process consisted of three rounds:
1️⃣ Round 1 – DSA Round:
This round focused on Data Structures and Algorithms. Two main problems were asked:
Remove All Adjacent Duplicates in String (LeetCode 1047): Remove adjacent duplicates repeatedly until no duplicates remain.
Example: "abbcca" → "", "abbbccabc" → "bc".
Concepts tested: Stack usage, string manipulation, handling edge cases.
Climbing Stairs / Monkey Jump Problem (LeetCode 70): Count the number of ways to reach the top if a monkey can jump k steps at a time.
Concepts tested: Recursion, dynamic programming, combinatorial problem solving.
2️⃣ Round 2 – System Design Round:
This round evaluated my understanding of designing scalable systems, handling trade-offs, and architectural decision-making. Focus was on discussing real-world scenarios and high-level design solutions.
3️⃣ Round 3 – Company Fitment Round:
This round was more behavioral and assessed cultural fit, communication skills, and alignment with Hased’s values. Questions revolved around teamwork, past experiences, and problem-solving approach.
