Z

Zscaler

Software Development Engineer (SDE) Summer Intern

Interview Date

Not Specified (circa late 2024/early 2025)

Result

Selected (implied)

Difficulty

Easy to Medium

Rounds

4 rounds

Drive Type

On-Campus/Internship

Topics asked

Data StructuresAlgorithms (graphsarraysgreedypriority queue)CprogrammingObject-Oriented Programming (OOP) concepts.

Detailed experience

Role: Software Development Engineer (SDE) Summer Intern

College: Tier 1.5 Technical Institute (On-Campus Recruitment)

Interview Date: Not Specified (circa late 2024/early 2025)

Interview Type: On-Campus/Internship

Result: Selected (implied)

Difficulty: Easy to Medium

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms (graphs, arrays, greedy, priority queue), C++ programming, Object-Oriented Programming (OOP) concepts.

Experience:

The candidate received the interview opportunity through on-campus recruitment. The hiring process was structured to assess both technical skills and cultural fit.

Round 1: Initial Screening (Online Assessment)

This round was held online and lasted 90 minutes. It consisted of four Data Structures and Algorithms (DSA) questions, with a focus on graphs and arrays. Candidates could code two problems in Python and the remaining two in C++ or C.

  • Problems: Finding the shortest path in a grid using DFS, Using a greedy approach in arrays to maximize profit, Setting up an efficient network in a client-server environment using a priority queue.
  • Difficulty: Easy to Medium.
  • Outcome: The candidate completed and submitted solutions just in time. Out of 350-400 candidates, only 16 were shortlisted.

Round 2: Technical Interview

This round was approximately 60 minutes, conducted online via HackerRank CodePair and a video call. The interviewer started with introductions.

  • Questions: Technical questions focused on C++ programming, Object-Oriented Programming (OOP) concepts, and DSA.
  • Coding Problem 1: "Given an array of integers, find the maximum possible sum of a contiguous subarray." The candidate implemented Kadane's algorithm with O(N) time complexity and O(1) space complexity, satisfying the interviewer.
  • Coding Problem 2: "Given an array of integers and a target sum, find if there is a pair in the array with the given sum." The candidate explained a two-pointer approach, which the interviewer found correct, but due to time constraints, the solution couldn't be coded.

Round 3: HR Interview 1 (Zscaler Values Round)

This round emphasized cultural fit, focusing on Zscaler's values like collaboration, innovation, and adaptability.

Round 4: HR Interview 2

Details not specified, typically covers general HR aspects, relocation, and offer discussions.

Posted on - 13 Nov 2025