Upload Button Icon Add office photos

Zscaler Softech

Compare button icon Compare button icon Compare

Filter interviews by

Zscaler Softech Associate Engineer Interview Questions and Answers

Updated 19 Mar 2024

Zscaler Softech Associate Engineer Interview Experiences

Interview questions from similar companies

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
-

I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Questions were mostly related to Django Rest Framework and internal working of it, apart from that there were questions related to Django ORM.
  • Q2. Given an API request how would to resolve the space issue that is happening with GET
  • Ans. 

    To resolve space issue with GET API request, consider pagination, compression, caching, and optimizing query parameters.

    • Implement pagination to limit the number of results returned in each request.

    • Use compression techniques like Gzip to reduce the size of the response data.

    • Implement caching mechanisms to store frequently accessed data and reduce the number of requests.

    • Optimize query parameters to only request necessary

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. Complete resume based questions
  • Q2. You must me thorough of what you have mentioned in your resume.

Skills evaluated in this interview

I applied via Company Website and was interviewed before Jun 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. If fresher is attending the interview then mostly they'll ask questions from resume What are generics, UML diagram for the proper medicine suggestions based on the patient allergies to a particular drug ...

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well with the contents of resume,
First round: versant test
Second round: Technical Interview 1
Third round: Technical Interview 2

Feedback of best of the 2 technical interviews will be considered.

IF selected will receive a call from HR

I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is your day to day work?
  • Q2. What new you have to offer the organization?
  • Q3. The most recent issues that you faced in the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be true to yourself and the interviewer, he/she doesn't want you to be full of all technical skills. He/she wants you to be atleast good at the things mentioned in your resume. Showcase that you're ready to switch to any language even if it is uncomfortable for you

I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Normal php questions like overriding,overloading,traits,interface,abstarct class nothing else.. It was online but in 2016.
  • Q2. Go though those topic as they are very important and asked in most companies.

Interview Preparation Tips

Interview preparation tips for other job seekers - Read those topics and try to understand with example and doing on your own.Before entering Chetu prepare yourself that you may get fire anytime.Because hiring and firing is lot in Chetu but in terms of salary it is good.

Interview Questionnaire 

1 Question

  • Q1. Oops programming,SQL server Database

I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Sliding window problem in an Array(using 2 pointers) like Pythagorean triplets.
  • Q2. Overlapping circular linked list problem.
  • Ans. 

    Detect if two circular linked lists overlap

    • Traverse both lists and check if they have the same tail node

    • If they have different tail nodes, they do not overlap

    • If they have the same tail node, check if they intersect at any point

    • Use Floyd's cycle-finding algorithm to detect intersection point

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - I had 6 rounds of technical interview . Each round of 1 hr or more. In all the rounds I was asked to write proper programs (Sometimes on HackerRank, sometimes on an IDE, sometimes just on a text editor.) . Questions were designed to test problem solving abilities and proper use to dataStructures and coding basics. Lot of emphasis on writing efficient program with least time complexity possible.

During preparations, its important to understand basics of different dataStructures and how to efficiently use it in your programs . For practicing interview problems, I referred leetcode and geeksforgeeks . Solving different kind of problems from these websites really helped me. Dynamic Programming is also an important area from where lot of problems are asked in interview.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Sep 2021. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. What's is meaning of success?
  • Ans. 

    Success is achieving one's goals and feeling fulfilled in the process.

    • Success is subjective and varies from person to person.

    • It can be achieving a personal or professional goal.

    • Success can also be measured by the impact one has on others.

    • Feeling fulfilled and content is a key component of success.

    • Success is not always about material possessions or wealth.

  • Answered by AI
  • Q2. Why do we work in corporate office?

Interview Preparation Tips

Interview preparation tips for other job seekers - Find all these kind of of questions and their solutions then you cracked any kind of interviews.

Zscaler Softech Interview FAQs

How many rounds are there in Zscaler Softech Associate Engineer interview?
Zscaler Softech interview process usually has 1 rounds. The most common rounds in the Zscaler Softech interview process are Aptitude Test.
How to prepare for Zscaler Softech Associate Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Zscaler Softech. The most common topics and skills that interviewers at Zscaler Softech expect are CMS, Drupal, Linux, MySQL and Unix.

Tell us how to improve this page.

Zscaler Softech Associate Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Globant Interview Questions
3.8
 • 172 Interviews
Chetu Interview Questions
3.3
 • 170 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
AVASOFT Interview Questions
2.9
 • 136 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 108 Interviews
EbixCash Limited Interview Questions
4.0
 • 101 Interviews
SPRINKLR Interview Questions
3.1
 • 100 Interviews
View all
Technical Account Manager
108 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
86 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
71 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
46 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Zscaler Softech with

Palo Alto Networks

3.9
Compare

Gen

4.0
Compare

FireEye

4.3
Compare

Check Point Software Technologies

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview