J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez Netskope en nov. 2021
Entretien
Multiple rounds of coding questions. Mostly leetcode Easy/Medium questions. One of the interviewers feels like he knows all the things and tried to humiliate the work that I have done in my career as if he is doing path-breaking research. Doesn't sound professional as he addressed me as "sir" and tried to mock me during the interview.
The interesting part is they may reject based on the work you have done in your career.
Questions d'entretien [1]
Question 1
Trapping the rainwater
Stocks buy/sell
Stack questions
J'ai postulé en ligne. J'ai passé un entretien chez Netskope (Bengaluru) en déc. 2025
Entretien
Everything depends on the level of prep.
If prep is good then the interviews are easy to crack, if not then it will be the most difficult one.
The number of rounds can increase or decrease based on the requirements. On an average 4-6 deep technical discussions is expected
Questions d'entretien [1]
Question 1
Design the solution the reliable fan-out problem.
Design an NRT for the influx of 15000 events per second and explain how to achieve end to end EOS
J'ai postulé via la recommandation d'un employé. Le processus a pris 2 mois. J'ai passé un entretien chez Netskope (Bengaluru) en févr. 2025
Entretien
- Hiring HR interview for candidate fitment
- Three round of technical interview : DSA, domains, projects, roles and responsibilities
- Hiring manager interview
- Leadership team interview
- Offer discussion from HR hiring team
Questions d'entretien [1]
Question 1
- Explain the one project you liked in your career in detail
J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez Netskope (Bengaluru) en déc. 2024
Entretien
Initial HR screening
Hiring Manager - coding round
Technical round - coding
Director round - coding
Technical round - coding
TA recruiter scheduled all the interviews. Director round, he was so arrogant. Looks like he came out from customer escalation meeting. He looked so tired.
Questions d'entretien [1]
Question 1
Linked List - Split list, reverse, middle
Tree - find level, sum level elements
Packet handling buffer implementation
Time complex, Space complex problems
No design question, No project questions