I applied through college or university. I interviewed at NetAppl (Bengaluru) in Mar 2026
Interview
The process included an online assessment consisting of aptitude, basic mathematics, and networking fundamentals, along with three coding questions. The questions were straightforward and not very difficult. However the coding platform had issues with input parsing, which made it difficult to properly test and submit solutions. I was not shortlisted after this round.
Interview questions [1]
Question 1
Problem: Longest Increasing Subsequence (LIS)
You are given a sequence of integers representing sacred numbers from an ancient manuscript.
Your task is to determine the length of the longest strictly increasing subsequence in the sequence.
A subsequence is formed by deleting zero or more elements without changing the order of the remaining elements.