Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Zscaler interview experience Real time questions & tips from candidates to crack your interview

Zscaler

3 rounds | 8 Coding
problems

Journey

In my second year, I did the course of competitive programming from Coding Ninjas which helped me to deep dive into DSA and then I start practicing problem on Codeforces, Codechef and leetcode

Application story

The company visited campus for recruitment for the posts of Associate Software Engineer(Dev Test (C, C++, Java, Python) and Associate Software Engineer ( Developer - C Programming) There were three rounds, Coding round, Technical Interview, and Managerial cum HR round.

Why selected/rejected for the role?

I rejected in technical interview round 2 because I do not know networking in deep. For this role you should know theory concept in deep

Preparation

Duration: 3 months

Topics: Dynamic programming, Graph, DSA, OS, Networking

Tip

Tip 1 : DSA

Tip 2 : CS fundamental (mainly Networking)

Application process

Where: Campus

Eligibility: 60% throughout.

Resume tip

Tip 1 : Good Projects

Tip 2 : Do not put false things on resume.

01

Round

Hard

Online Coding Test

Duration90 minutes

Interview date20 Jan 2023

Coding problem3

It consist of 3 coding question in C language and 1 question is easy and other 2 are medium to hard level.

```
Nodes are numbered from 0 to N - 1.
The graph given is connected.
Print the vertices in sorted order.
```

```
The following is an example of DAG i.e a directed graph with no cycles in it.
```

Problem approach

Intution to this problem is you have to choose least adjacent such that you will light up all the nodes.

i.e.you have to choose minimum adjacent nodes.

so we have two choices either we take or notTake current node say inclusive and exclusive.

recursivelty we can find maximum non adjacent nodes that can be selected by considering all node have same price 1.

if will subtract this max caluefrom total value, we will get our answer.

1) Suppose a data structure as Pair which will store both inc and exc cost.

2) recursively calculate pair value for each nodes.

3) finalize the answer by n-maxAdj

```
Down: (row+1,col)
Right: (row, col+1)
Down right diagonal: (row+1, col+1)
```

Problem approach

Dijkstra's algorithm.

```
Consider 0-based indexing.
```

```
Consider the array 1, 2, 3, 4, 5, 6
We can Jump from index 0 to index 1
Then we jump from index 1 to index 2
Then finally make a jump of 3 to reach index N-1
There is also another path where
We can Jump from index 0 to index 1
Then we jump from index 1 to index 3
Then finally make a jump of 2 to reach index N-1
So multiple paths may exist but we need to return the minimum number of jumps in a path to end which here is 3.
```

02

Round

Medium

Video Call

Duration60 minutes

Interview date24 Jan 2023

Coding problem3

It is first Technical Interview round. It was focused on DSA and CS fundamentals.

```
Let arr=[-1,-1,-2,4,3]
We can take the subset {-1,-2,4,3} which will have the product as 24. We can verify that this is the largest product possible. Hence we return 24.
```

Problem approach

Create 5 variables to maintain the largest, second-largest, third-largest, smallest, and second smallest. The combination of three would be the maximum product.

1. What is Multithreading?

2. What is semaphore, mutex?

3. What is critical section?

Define TCP model and/or OSI model.

The flow of data when a link is clicked.

03

Round

Medium

Face to Face

Duration60 minutes

Interview date24 Feb 2023

Coding problem2

```
1) The first function is â€˜addInteger(int val)â€™, which takes an integer â€˜valâ€™ as an argument and adds it to the stream.
2) The second function is â€˜getDisjointIntervals()â€™, which returns a summary of the integers in the stream currently as a list of disjoint intervals.
```

```
Input: 'n' = 5 , stream = [
[1, 1],
[1, 3],
[2],
[1, 2],
[2],
]
Output: [
[ [1, 1], [3, 3] ],
[ [1,3] ]
]
Explanation: First of all, 1 is added to the stream, and the disjoint interval will be {1, 1}. When 3 will be added to the stream, then the disjoint intervals will be {1, 1}, {3, 3}. But when 2 is added to the stream then the disjoint interval will be {1, 3} as 2 lies between these two sets of disjoint intervals, and both the intervals {1, 1} and {3, 3} merge.
```

1. What is DHCP?

2. What is IP?

3. What is the difference between IPV4 and IPV6?

4. Explain Data Link layer.

5. Explain DNS.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Which is a DDL command in SQL?

Choose another skill to practice

Similar interview experiences

Product Intern

6 rounds | 9 problems

Interviewed by Squadstack

0 views

0 comments

0 upvotes

Business Technology Analyst

4 rounds | 5 problems

Interviewed by Squadstack

2344 views

0 comments

0 upvotes

SDE - 1

3 rounds | 5 problems

Interviewed by Zscaler

2349 views

0 comments

0 upvotes

Product Engineer

3 rounds | 5 problems

Interviewed by Squadstack

1472 views

0 comments

0 upvotes

Companies with similar interview experiences

Associate Software Engineer

3 rounds | 10 problems

Interviewed by Amdocs

1826 views

0 comments

0 upvotes

Associate Software Engineer

3 rounds | 4 problems

Interviewed by Amdocs

1317 views

0 comments

0 upvotes

Associate Software Engineer

3 rounds | 5 problems

Interviewed by Optum

1277 views

0 comments

0 upvotes

What were the total number of Technical Interview Rounds? Considering those who were selected, how many Technical Interview rounds did they have to go through?