Upload Button Icon Add office photos

Zscaler Softech

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Zscaler Softech Intern Interview Questions and Answers

Updated 5 Oct 2024

Zscaler Softech Intern Interview Experiences

2 interviews found

Intern Interview Questions & Answers

user image Anonymous

posted on 5 Oct 2024

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

1hr hard questions DSA

Round 2 - Technical 

(2 Questions)

  • Q1. Leetcode medium question
  • Q2. Leetcode easy question

Intern Interview Questions & Answers

user image Anonymous

posted on 2 Feb 2024

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Feb 2023. There were 4 interview rounds.

Round 1 - Coding Test 

60 Minutes, Backend Developer, Hackerrank, API Creation

Round 2 - Technical 

(1 Question)

  • Q1. Design a login page/form
  • Ans. 

    A modern and user-friendly login page with email and password fields

    • Include a clean and simple design with a logo and branding

    • Add input fields for email and password with proper validation

    • Include a 'Forgot Password' link for password recovery

    • Add a 'Remember Me' checkbox for convenience

    • Include a 'Sign In' button for submitting the form

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Project discussion, resume based
Round 4 - HR 

(1 Question)

  • Q1. HR questions about myself

Skills evaluated in this interview

Intern Interview Questions Asked at Other Companies

asked in Accenture
Q1. Case. There is a housing society “The wasteful society”, you coll ... read more
Q2. Which programming language you are comfortable with?
asked in Deloitte
Q3. Case : I am a US based company and I sell 3 products A, B, C (I d ... read more
Q4. Huffman Coding Challenge Given an array ARR of integers containin ... read more
asked in Accenture
Q5. A marketing strategy case. Client is a perfume seller in Jaipur. ... read more

Interview questions from similar companies

Intern Interview Questions & Answers

FireEye user image Siriguppa Aditya

posted on 15 May 2017

I was interviewed before May 2016.

Interview Preparation Tips

Round: Test
Experience: Test had all kinds of questions apti+c-apti+cse concepts+coding.
It covered all the things related to computer science.There were 3 coding questions among 39
Duration: 1 hour
Total Questions: 39

Round: Technical Interview
Experience: Resume Related

Round: Technical Interview
Experience: Resume related and tested my knowledge on networking

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Learning 

(1 Question)

  • Q1. There are lot of questions regarding networking

Interview Preparation Tips

Interview preparation tips for other job seekers - It is a virtual internship offered by the Eduskills platform.

Intern Interview Questions & Answers

AVASOFT user image MUDUCHURU JASWANTH

posted on 3 Oct 2024

Interview experience
2
Poor
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Walk-in

Round 1 - Aptitude Test 

Mcq based py ,sql,ai

Round 2 - Technical 

(2 Questions)

  • Q1. Python basics and codes
  • Q2. Sql basics and queries
Round 3 - One-on-one 

(1 Question)

  • Q1. Worst experience by the interviewer she is not at all interested, she is using WhatsApp app to chat and asking questions ,totally i am disturbed,but good questions .
Round 4 - HR 

(1 Question)

  • Q1. As usual, like hr round asked some scenario-based , policies

Interview Preparation Tips

Interview preparation tips for other job seekers - its not good for freshers no workk balance no security 10k per month for 6 months
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Group Discussion 

First round is general topic in gd

Round 2 - HR 

(2 Questions)

  • Q1. What is dynamically types language
  • Ans. 

    Dynamically typed languages do not require variable types to be declared explicitly.

    • Variables do not have a fixed data type

    • Data types are determined at runtime

    • Examples include Python, JavaScript, and Ruby

  • Answered by AI
  • Q2. Explain oops concept
  • Ans. 

    OOPs (Object-Oriented Programming) is a programming paradigm based on the concept of objects, which can contain data and code.

    • OOPs focuses on creating objects that interact with each other to solve a problem.

    • Encapsulation: Bundling data and methods that operate on the data into a single unit (object).

    • Inheritance: Allows a class (subclass) to inherit properties and behavior from another class (superclass).

    • Polymorphism: ...

  • Answered by AI

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

I applied via Company Website and was interviewed in May 2022. There were 2 interview rounds.

Round 1 - Aptitude Test 

Logical reasoning And aptitude test

Round 2 - Coding Test 

C++, python and Java programming

Interview Preparation Tips

Topics to prepare for Gen Software Engineer interview:
  • C++
  • Python
Interview preparation tips for other job seekers - I am interested for this company opportunity for giving me and I am so happy and giving me for work from home job
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. Threading: Write and use a mutex?
  • Ans. 

    A mutex is a synchronization primitive that ensures only one thread can access a resource at a time.

    • Create a mutex object using the appropriate library or language-specific function.

    • Lock the mutex before accessing the shared resource to prevent other threads from accessing it.

    • Unlock the mutex after finishing the operation on the shared resource to allow other threads to access it.

    • Example: pthread_mutex_t mutex; pthread...

  • Answered by AI
  • Q2. Find the memory leak in a given set of code.
  • Ans. 

    Identify memory leak in code

    • Check for any dynamically allocated memory that is not being freed

    • Look for any infinite loops or recursive functions that consume memory

    • Use memory profiling tools like Valgrind to detect leaks

    • Check for any global variables that are not properly managed

  • Answered by AI

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.

Interview Questionnaire 

6 Questions

  • Q1. Data structure and C++
  • Q2. Reverse Linked list
  • Q3. Multi threaded queue
  • Q4. Design pattern
  • Q5. Basic C++ concepts
  • Q6. Puzzles

Interview Preparation Tips

Interview preparation tips for other job seekers - Solve data structure problems
Contribute & help others!
anonymous
You can choose to be anonymous

Zscaler Softech Interview FAQs

How many rounds are there in Zscaler Softech Intern interview?
Zscaler Softech interview process usually has 3 rounds. The most common rounds in the Zscaler Softech interview process are Coding Test, Technical and One-on-one Round.
How to prepare for Zscaler Softech Intern 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 Excel, MS Office, Accounting, Interpersonal Skills and Communication Skills.
What are the top questions asked in Zscaler Softech Intern interview?

Some of the top questions asked at the Zscaler Softech Intern interview -

  1. Design a login page/f...read more
  2. Leetcode medium quest...read more
  3. Leetcode easy quest...read more

Recently Viewed

INTERVIEWS

Flexera Software

No Interviews

DESIGNATION

INTERVIEWS

Zscaler Softech

No Interviews

JOBS

Zscaler Softech

No Jobs

DESIGNATION

SALARIES

Flexera Software

SALARIES

Dish Network

INTERVIEWS

Pattern Technologies

No Interviews

INTERVIEWS

Dish Network

No Interviews

SALARIES

Zscaler Softech

Tell us how to improve this page.

Zscaler Softech Intern Interview Process

based on 2 interviews

Interview experience

4.5
  
Good
View more

Intern Interview Questions from Similar Companies

PTC Intern Interview Questions
4.2
 • 7 Interviews
AVASOFT Intern Interview Questions
3.6
 • 2 Interviews
Cvent Intern Interview Questions
3.5
 • 2 Interviews
UKG Intern Interview Questions
3.1
 • 1 Interview
View all
Zscaler Softech Intern Salary
based on 5 salaries
₹1 L/yr - ₹6 L/yr
21% more than the average Intern Salary in India
View more details

Zscaler Softech Intern Reviews and Ratings

based on 4 reviews

3.8/5

Rating in categories

4.5

Skill development

5.0

Work-life balance

4.8

Salary

4.5

Job security

4.5

Company culture

4.5

Promotions

4.5

Work satisfaction

Explore 4 Reviews and Ratings
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