Netapp

Role: 6-months Internship

College: Not Specified

Interview Date: 2020 (Virtual)

Interview Type: On-Campus

Result: Selected

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: Coding (Binary, Palindromes), Data Structures (Arrays, Stack), Algorithms (k-th smallest element), Projects, System Design (URL Shortener), Behavioral

Experience:

This experience is for a 6-month internship through a virtual campus placement drive in 2020.

Round 1 (Online Assessment): This round lasted 90 minutes and included three coding questions and multiple-choice questions (MCQs). The coding questions were from a pool, so each candidate received a different set. One specific question mentioned was: "Given a number represented in binary as a string (length up to 10^5), find the smallest number greater than it which is a palindrome."

Round 2 (Technical Interview 1): This 45-minute round involved a discussion on the candidate's projects. DSA questions included finding the k-th smallest element in a given array and designing a stack that supports `getMin()` operation in O(1) time complexity.

Round 3 (Technical Interview 2): Also a 45-minute round, this focused on system design, with a question to design a URL shortener. Behavioral questions were also part of this round.

The candidate was selected, and the overall difficulty was rated as Medium.