Zscaler Softech Software Developer Intern Interview Questions and Answers

Time based test with basic questions

Basic level coding round in preferred language

Q1. About projects done in college
Add your answer
Q2. Coding round
Add your answer

Written test coding and with aptitude questions are asked

Q1. Asking about OOPS and C++ basics concepts
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

Q1. Deletion in Circular Linked List
You are given a Circular Linked List of integers, and an integer, 'key'.
You have to write a function that finds the given key in the list and deletes it. If no s...read more
Ans. Recursion
The idea is to use a recursive approach to find the given key and then remove that node. The recursive idea is very clear that we will traverse through the circular linked list, and we will check if the value of the node is equal to the given key. 
 
We will define a function deleteNodeHelper(root, key, head) to remove the key in which the head is the starting node of the linked list, and we will send ...read more
Answered by CodingNinjas
View 1 more answer
Q2. Move All Negative Numbers To Beginning And Positive To End
You are given an array 'ARR' consisting of 'N' integers. You need to rearrange the array elements such that all negative numbers a...read more
Ans. Using Sorting
Approach: A brute force approach could be to just sort the given array in ascending order. This will result in all negative numbers to appear at the beginning and positive number at the end.
Space Complexity: O(1)Explanation:
O(1)
 
Because no extra space is required.
Time Complexity: O(nlogn)Explanation:
O(N*logN), where N is the number of elements in the array.
 
In the worst case, sorting requires O...read more
Answered by CodingNinjas
View 2 more answers

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts

Q1. Basic Interview Questions
They given me 2 table containing names of different cities and told me to apply left join on them.
1) Asked me about the Languages known. 
2) OOPS concepts. 
3) SQL concepts...read more
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was scheduled for 9am in the morning. The test environment was pretty good . I didn't face any issues on the HireVeu platform. The first test was of Aptitude and then in next section it was Technical MCQ's. The level of questions were mid to high level of difficulty.

Q1. DBMS Questions
What is DML and DDL?
Write an SQL query to print the FIRST_NAME from Worker table after replacing ‘a’ with ‘A’.
Write an SQL query to print details of the Workers whose FIRST_NAME contains ‘a’.
...read more
Ans. 
Tip 1: Do practice SQL Queries
Tip 2: Read Database Normalisation and Transaction.
Tip 3: Read Raghu Ram Krishnan thoroughly
Answered by CodingNinjas
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The exam was on the same Platform. The first question was about the most difficult Project I've worked on. I have to record a video in that particular platform and then move to the next questions. There was option for a demo video of 1 minute in which you can practice your answers and then can record your answer in the next video of max 5 minutes. The next 2 question were Coding Problems of moderate difficulty and you've to record your approach and then proceed towards solving the code and then record a video stating if you succeed or not and what better could you've done to make it work.

Q1. Sum Of N Digit Palindromes
You are given an integer 'N'. Your task is to return the sum of all N-digit numbers which are palindrome. A number is said to be palindrome if the number formed by reve...read more
Ans. 
Run a loop from 10^(n-1) to 10^(n) – 1 and check when the current number is palindrome or not. If it is, adds its value to answer.
Answered by CodingNinjas
View 2 more answers

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled for 3pm. The interviewer was quite friendly. He asked about me and told me to relax and then answer. He started with asking questions from my Project and how the ideas behind the Project. My Project was related to Deadlock So he asked whether I can implement my Project on any environment. I answered . Then one of my internship Project was related to Web development so He asked me about the backend of the Project. He gave me a few SQL queries and some general DBMS concepts based on the response about using Mysql in the Project. He asked me a few things about AWS and Cloud Computing which I answered. At last he asked some LINUX commands and corrected me once and was satisfied with my answers.

Q1. OS Questions
1) What is Kernel?
2) What is Deadlock?
3) Why you use Binary semaphores instead of Counting Semaphores?
4) What is threads? What is hardware thread?
5) What is TLB?
Ans. 
Tip 1 : Read Galvin for OS thoroughly
Tip 2 : Practice MCQ's from GFG OS QUIZ Section
Answered by CodingNinjas
Add your answer
Q2. DBMS & Trees Questions
1) Explain DDL VS DML.
2) Explain Normalization
3) B+ Trees and it's working.
Ans. 
Tip 1 : Do practice SQL queries
Tip 2 : Give answers to Normalisation questions with examples for each
Tip 3 : Keep a paper with you while giving interview from home. Comes handy when I tried explaining B+ trees to him.
Answered by CodingNinjas
Add your answer