RepostedZscaler logo

Zscaler · OA → Phone screen → Onsite

In process

Zscaler SDE C++ and OS Rounds: 7 Experiences (Part 2 of 6)

Software engineer · InternshipBachelor's degreeSep 2026
Shared by

Zscaler India campus SDE reports, 2023–2025: mixed Python and C/C++ OAs, then long technicals deep on C, OS and networking, plus values and HR rounds.

At a glance

  • Process: a HackerRank OA (90–120 minutes, three to nine questions, sometimes split by language), then two or three technical interviews of 30–105 minutes, then a values or HR round (03, 04, 07, 08).
  • Asked recently: C/C++ or Java internals in 6 of 7 reports, operating systems and networks in 5, linked lists and arrays in 4, DP in 3. Named coding: Merge Intervals (03, 06), Run-Length Encoding (06), Merging Palindromes (07).
  • Difficulty: coding was mostly medium; the depth on C memory, pointers and networking was where candidates struggled (05, 07, 08).
  • Practise first: Merge Intervals, Longest Common Subsequence and Run-Length Encoding.

Coverage: India campus hiring for SDE intern, Java developer, Dev C, C/C++ intern + FTE and Associate Software Engineer roles, Bengaluru where stated. Seven reports, entries 03–09, from fall 2023 to April 2025.

In this series

  • Part 1: OA formats, the compiled question bank, and entries 01–02.
  • Part 2 (current): entries 03–09, 2023–2025: mixed-language OAs, C/C++ depth and a Java drive.
  • Part 3: entries 10–16: C coding, SRE/DevOps fundamentals, QA and DevTest.
  • Part 4: entries 17–24, 2023: UI, DevTest, C development and ASE drives.
  • Part 5: entries 25–32, 2021–2022: SDE-1, Java API, QA and cloud operations.
  • Part 6: entries 33–36, 2019–2020 campus drives.

What came up

Zscaler campus interviews test fundamentals as hard as they test coding. Several rounds spent most of their time on C memory, pointers, OS and networking before a single coding task.

Topic Reports Last seen
C/C++ or Java language internals 6 of 7 Apr 2025 (report date)
Operating systems and networking 5 of 7 Oct 2024 (report date)
Linked lists and arrays 4 of 7 Apr 2025 (report date)
Dynamic programming 3 of 7 Jun 2024 (report date)
Strings and pattern matching 3 of 7 May 2024
Bit manipulation 1 of 7 Oct 2024 (report date)
SQL 1 of 7 May 2024
Projects, values and HR 2 of 7 Apr 2025 (report date)

A candidate can appear in more than one row.

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Merge Intervals 2 Apr 2025 (report date)
Three Sum to a target 1 Apr 2025 (report date)
Grid shortest path (OA) 1 Apr 2025 (report date)
Odd-even linked list by position 1 Oct 2024 (report date)
Search in a rotated sorted array 1 Oct 2024 (report date)
Sum of positions where two numbers' bits differ 1 Oct 2024 (report date)
Count values in B no greater than each value in A 1 Oct 2024 (report date)
Find the element with odd frequency 1 Jun 2024 (report date)
Sum of divisors of the array GCD 1 Jun 2024 (report date)
Longest Common Subsequence 1 Jun 2024 (report date)
Run-Length Encoding (C only) 1 Jun 2024 (report date)
Balanced Brackets 1 May 2024
Coin Problem variant (recursive DP) 1 May 2024
KMP string matching 1 May 2024
String + graph problem, O(n³) to O(n²) 1 May 2024
C string pattern matching, then Rabin–Karp 1 Nov 2023
Custom malloc and free in C 1 Nov 2023
Merging Palindromes 1 Fall 2023
Asteroid Collision-like stack problem 1 Fall 2023
Count vowel strings under adjacency rules 1 Fall 2023
Check whether a byte is nonzero (pointer arithmetic) 1 Fall 2023

Behavioral (BQ)

Question Reports Last seen
Leadership, teamwork and solving a hard problem 1 Apr 2025 (report date)
What would you change at your college to close the gap with industry? 1 Apr 2025 (report date)
Why a Java role after a data science and AI degree? 1 May 2024

7 detailed candidate timelines, loops, and screens

03: SDE summer intern: mixed-language OA, C++ depth, two values rounds

Report date: Apr 3, 2025 · Role: SDE Summer Intern · Process: On-campus · Result: Not selected

  1. OA (90 min): four DSA problems, two in Python and two in C or C++: a grid shortest path (they used DFS; full rules not given), a greedy array-profit task and a client-server network built with a priority queue. Submitted just in time. Of 350–400 students, 16 advanced.
  2. Technical (about 60 min, CodePair plus video): OOP's four ideas; runtime polymorphism in C++, run and accepted; vtables, memory management and virtual destructors (they blanked on the last). Then Merge Intervals in O(n log n) with O(1) extra space, which ran. Three Sum by two pointers was explained but not coded; the interviewer accepted it.
  3. Values round (about 30 min): introduction and college journey, projects (problem, approach, own role), and examples of leadership, teamwork and solving a hard problem.
  4. HR / campus (about 25 min): background, what they would change at their institute to close the gap with industry, and industry trends. Three reached the end; one was selected.

05: Dev C: a disguised binary search and a failed bit optimization

Report date: Oct 2024 · Role: Dev C Intern + FTE · Process: On-campus · Result: Rejected

  1. Chose Dev C over Dev Java and Dev Python. OA: three HackerRank questions in about 120 minutes; results took 10–12 days, with a shortlist per role.
  2. Technical 1 (online IDE with tests): reorder a linked list so even positions come before odd ones (they confirmed position, not value, and asked about empty and one-node lists); search a rotated sorted array without being told so. Then destructors, operator overloading, constructor and destructor order for a derived object, deadlock, races, process vs thread, OSI and virtual functions.
  3. Technical 2: for 4 (0100) and 3 (0011), sum the bit positions where they differ (0 + 1 + 2 = 3); XOR brute force passed two tests. For each value in A, count values in B that are ≤ it; approach only, sort plus binary search after 10–15 minutes. Then TCP, UDP and DNS.
  4. Rejected; hiring stopped soon after.

06: Developer C intern: four OA topics, three interviews, an offer

Report date: Jun 2024 · Role: Developer C Intern · Process: On-campus · Result: Selected

  1. OA topics: a HashMap implementation task, a Trie, greedy with a heap, and LIS-based DP.
  2. Interview 1: C pointers; find the element with odd frequency; sum all divisors of the array's GCD; Merge Intervals.
  3. Interview 2: 10–15 questions each on OS, networks and C, then Longest Common Subsequence.
  4. Interview 3: Run-Length Encoding, in C only.

09: Associate Software Engineer: runnable live code

Interview date: Jun 2024 · Role: Associate Software Engineer · Location: Bengaluru · Process: Campus placement · Result: Accepted offer

  1. HackerRank: one tree problem and one 2D matrix problem, the second similar to a past competitive-programming task.
  2. Interviews on DSA, networks and OS, with code that had to compile and run.

04: Java intern: a nine-question OA and three Java-heavy rounds

Interview date: May 2024 · Role: Java Developer Intern · Process: On-campus · Result: Drive cancelled

  1. OA (120 min): a medium greedy problem in Java, a Java task implementing given interfaces, two medium SQL tasks (joins, sorting, grouping, limits) and five aptitude, OOP and DBMS questions. Twelve shortlisted.
  2. Technical 1 (30 min, Java): Balanced Brackets, a string task and a SQL join-and-group query, which was hardest. Passed ten days later.
  3. Technical 2 (45 min, Java): an easy greedy problem in two minutes, a Coin Problem variant via recursive DP with a drawn recursion tree, KMP in about ten minutes, and a range DP explained but not coded. Then 15 minutes of rapid-fire Java: interfaces vs abstract classes, overload vs override, the diamond problem, threads, synchronized, semaphores, Singleton variants and exceptions. The interviewer let them restart a shaky introduction.
  4. Managerial / technical (45 min): a medium string + graph problem, improved from O(n³) to O(n²) in C++, and why a data science and AI student wanted a Java role. Three of twelve reached this round; the drive was then cancelled.

08: C/C++ intern + FTE: deep C internals and a custom malloc

Report date: Nov 16, 2023 (offer) · Role: Software Developer C/C++, six-month internship + FTE · Location: Bengaluru · Process: On-campus · Result: Accepted offer

  1. OA (90 min): BFS plus binary search, tree DP (they used the centroid) and segment tree plus binary search. Two solved; the shortlist took 40–50 days.
  2. Technical 1 (about 80 min): rate your C and C++; auto, extern, static and register; stack vs heap; how realloc may move a block; struct vs union and the sizes and padding of two structs; dangling, void and volatile pointers; races, semaphores, paging and thrashing; SSL, TCP flags and DNS. Coding: a C string matcher in O(n²), then Rabin–Karp explained.
  3. Technical 2 (about 75 min): arrays vs linked lists; prove binary search's complexity and Floyd's cycle detection; unordered_map hashing and rehashing, then O(log n) operations with few buckets and no rehash (they reached BSTs per bucket; the target was ordered maps and red-black trees); gateways, routing, MAC, ARP, subnets and CIDR. Then a custom malloc and free in C, new to them, done in O(1) with one or two hints and accepted.

07: Intern + FTE: three long rounds across networks, OOP and code

Interview date: Fall 2023 · Report date: Sep 2024 · Role: Intern + FTE · Process: On-campus · Result: Selected

  1. OA (2 hours): four HackerRank DSA questions.
  2. Interview 1 (1 h 10 min): personal vs enterprise VPNs, IPv4 vs IPv6, OSI, DNS, DHCP, denial of service, asymmetric encryption and smart pointers. Coding: build palindromes from two strings, combine them and return the longest, ties by lexicographic order. Misreading it used up the time planned for a second question.
  3. Interview 2 (1 h 45 min): no response from a server: is the machine down or just the port? (They suggested proxy tracking; the interviewer wanted traceroute.) Check whether a byte is nonzero with pointer arithmetic (the hint was a byte-sized type like uint8_t). ARP, the TCP handshake into TLS, TCP vs UDP, and changing OOP scenarios. Coding: an Asteroid Collision-like problem and counting vowel strings under adjacency rules (such as a only after e).
  4. Interview 3 (1 h 30 min): HTTP vs HTTPS and TLS, who calls main and the build pipeline, processes vs threads and scheduling, process memory layout, OOP vs procedural, plus a queue and log task and a string-subsequence discussion.

Patterns across the reports

  1. Fundamentals first, coding second. In 07 and 08, most of each long round went to C, OS and networking, with 15–20 minutes of code (08).
  2. Language-restricted coding. Python and C/C++ halves in the OA (03), Java only (04), C only (06).
  3. Merge Intervals twice. Asked in a 2025 SDE loop (03) and a 2024 Developer C loop (06).

Common questions

What is the Zscaler campus OA like?

HackerRank, 90–120 minutes, with three to four DSA questions or a nine-question mix of DSA, SQL and MCQs (03, 04, 05, 07, 08).

What does Zscaler ask in technical interviews?

C/C++ internals (pointers, memory, realloc, padding), OS and networking (TCP, TLS, DNS, ARP), then one or two coding tasks (05, 07, 08).

How many rounds does Zscaler campus hiring have?

Two to three technical rounds, often followed by a values or HR round (03, 04, 06, 07).

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.