Zscaler Softech Software Developer Interview Questions, Process, and Tips

Q1. Find element in a rotated sorted array
Ans. 
Search for an element in a rotated sorted array
• Use binary search to find the pivot point where the array is rotated

• Divide the array into two subarrays and perform binary search on the appropriate subarray

• Handle cases where the target element is on the left or right side of the pivot
Answered by AI
Add your answer
Q2. Explain the internal workings of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to quickly retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.

• If multiple keys hash to the same index, a collision occurs and the key-value pairs are stored in a linked list at that inde...read more
Answered by AI
Add your answer

First round was some aptitude round with a coding question

It was technical round , recruiter asked 2-3 mid-hard leetcode

Hacker Rank test consisted of 3 questions of medium-hard level

Q1. Computer networking questions lke DNS , Deadlock , Virtual Memory
Add your answer

3 hours , 3 coding questions on arrays, and some other DSA

Q1. Core JAVA interview questions
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Interviewer was cool, he started with basics of c and c++ and oops concept and extended to data structures .

Q1. 
Count Subsequences Problem Statement
Given an integer array ARR of size N, your task is to find the total number of subsequences in which all elements are equal.
Explanation:
A subsequence of an array i...read more
Ans. Brute Force
The idea is to generate all the subsequences and check whether the elements present are equal or not.
 
Here is the algorithm :
 
1. Generate all the subsequences of the given array.
2. Maintain a variable ‘COUNT’ which stores the total number of subsequences in which all the elements are equal.
3. Iterate over each of the generated subsequences.
   1. In case all the elements of the current subsequence are equal, we in...read more
Answered Anonymously
Add your answer
Q2. 
Kevin's Stack Problem
Kevin requires assistance in reversing a string using the concept of a stack. Help Kevin by providing a solution that will reverse the string 'S' using a stack. The strings will only...read more
Ans. Using a Stack
The basic idea is to push the whole string into a stack (character by character) and then take off each character from the stack one by one. The steps are as follows:
 
1. Iterate through ‘S’.
   • Push each character into the stack.
2. Keep removing the top character from the stack until the stack becomes empty. Append each drawn character to the new string.
3. Return the new string.
Space Complexity: O(n)Explanation:
O...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was an easy round interviewer basically asked questions about family, goals and education background.