Netskope

Role: Software Engineer

College: Not Specified (On-Campus)

Interview Date: September 2019

Interview Type: On-Campus

Result: Not Specified

Difficulty: Medium to Hard

Rounds: 4 rounds

Topics Asked: Operating Systems, Computer Networks, DBMS, Data Structures, Algorithms

Experience:

Netskope visited the candidate's college in the first week of September 2019 for hiring.

Round 1 (Campus Test): This was an online Technical MCQ-based test on HackerEarth. Over 200 students appeared. The test had 30 questions to be solved in one hour, covering core computer science subjects: Operating Systems, Computer Networks, DBMS, Data Structures, and Algorithms.

Round 2 (Algorithms Test): Around 110 students were shortlisted. This was an online coding test on HackerEarth with 3 questions and a duration of 1 hour 30 minutes.

• Question 1: Based on the Chinese Remainder Theorem.
• Question 2: Given an array of size N and variable k, perform a right rotation of the array by one element for k times. Construct a square matrix of N x N for every new array formed by the right rotation. Multiply all matrices and return the sum of all elements of the final matrix.
• Question 3: Not remembered by the candidate.

The candidate noted that this round purely focused on efficient algorithmic solutions, as naive approaches did not work.

Round 3 (Technical Interview): Around 15 students were shortlisted. After a casual discussion about the online tests, background, goals, and interests, the interview proceeded with two problem-solving questions.

• Question 1: "How do you find the intersection point of two linked lists?" Approaches discussed included using hashing (create a hash set of the first list's node addresses, then traverse the second list and check for presence) and using the difference of node counts.

Round 4 (Technical Interview): Only a few candidates had this round. It involved problem-solving along with questions on Operating Systems and Computer Networks.