Zscaler Developer C Intern Interview Questions
Summary
I recently interviewed for a Developer C Intern position at Zscaler through an on-campus drive. The process involved an online assessment and three rounds of technical interviews, covering various aspects of programming, data structures, algorithms, and core computer science concepts.
Full Experience
My Interview Experience at Zscaler
My interview journey for the Developer C Intern role at Zscaler began with an on-campus opportunity. Here's a breakdown of the rounds I went through:
ROUND 1 - Online Assessment
The online assessment primarily focused on implementation-based questions. I encountered problems that required proficient use of HashMaps, demonstrated knowledge of Trie data structures, involved Greedy algorithms often paired with Heaps, and dynamic programming questions, particularly those based on Longest Increasing Subsequence (LIS) concepts.
ROUND 2 - Interview 1
The first interview delved into my C language proficiency, with a significant emphasis on pointers. I was also asked to solve specific coding challenges. The interviewer provided me with the following problems:
- Find the element in an array that appears an odd number of times.
- Find the sum of all divisors of the Greatest Common Divisor (GCD) of all elements in an array.
- Merge all overlapping intervals from a given collection.
ROUND 3 - Interview 2
This round was a comprehensive test of my theoretical knowledge. I faced around 10-15 questions each on Operating Systems, Computer Networks, and C Programming Language. In addition to these conceptual questions, I was given a coding problem:
- Find the Longest Common Subsequence of two given strings.
ROUND 4 - Interview 3
The final technical interview focused on a specific implementation task. I was challenged to implement Run Length Encoding, with the strict requirement that it had to be done in C language.
Interview Questions (5)
Find the element in an array that appears an odd number of times.
Given an array of integers, find the sum of all divisors of the Greatest Common Divisor (GCD) of all elements in the array.
Given a collection of intervals, merge all overlapping intervals.
Given two strings, find the length of their longest common subsequence.
Implement Run Length Encoding for a string, strictly in C language.