Zscaler Softech Senior Devops Engineer Interview Questions, Process, and Tips

Q1. It was more into problem solving using python
Add your answer

Q1. How to check a number is power of 2
Ans. 
To check if a number is a power of 2, we can use bitwise operations.
• A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.

• If n is a power of 2, then n & (n-1) will be 0.

• For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.
Answered by AI
Add your answer
Q2. Sort a stack without using another data structure
Ans. 
Sort a stack without using another data structure
• Use recursion to pop the top element and insert it at the bottom of the remaining stack

• Repeat until the stack is sorted in ascending order

• Time complexity: O(n^2), space complexity: O(n) due to recursion
Answered by AI
Add your answer
Q3. Check weather array have continuous increasing than decreasing value
Ans. 
Check if array has continuous increasing and decreasing values
• Loop through the array and check if each element is greater than the previous one

• Once you find the maximum element, check if the remaining elements are in decreasing order

• If yes, return true else false
Answered by AI
Add your answer

Q1. Design a cricinfo (LLD)
Ans. 
Design a cricinfo (LLD)
• Identify the entities: players, teams, matches, scorecards, tournaments, etc.

• Define the relationships between entities

• Create a database schema to store the data

• Implement APIs to fetch and update data

• Design a UI to display the information

• Consider scalability and performance

• Ensure data security and privacy
Answered by AI
Add your answer

Q1. Share details of your previous job.
Add your answer
Q2. Why should we hire you?
Add your answer
Q3. What are your strengths and weaknesses?
Add your answer

Q1. L2/L3 layer questions
Add your answer

Q1. Questions related to python coding .
Add your answer
Q2. Questions related to work u have done . And coding
Add your answer

Q1. Questions about networking , security profile
Add your answer

Q1. About networking protocols and coding rounds
Add your answer

Q1. System design - 1500 max inserting request to db a day max latency 60 se
Add your answer

Q1. Regarding js coding
Add your answer

Simple coding test - DSA questions. Questions on JS

Q1. JS Concepts - Closures, Promise
Add your answer

Q1. Minimum number of platforms required for a railway station.
Ans. 
Minimum 2 platforms required for a railway station.
• At least 2 platforms are required for trains to arrive and depart simultaneously.

• Additional platforms may be required based on the frequency of trains and passenger traffic.

• Platforms should be long enough to accommodate the longest trains that will use the station.

• Platforms should also have appropriate facilities for passengers, such as seating, shelter, and signage.
Answered by AI
Add your answer
Q2. Set of numbers from an array that can form nearest sum to the given number
Ans. 
Find set of numbers from an array that can form nearest sum to the given number.
• Sort the array in ascending order

• Use two pointers approach to find the nearest sum

• Return the set of numbers
Answered by AI
Add your answer

Q1. Trapping Rain water problem
Ans. 
Trapping Rain Water Problem
• The problem involves calculating the amount of water trapped between bars in a histogram

• The solution involves finding the maximum height of bars on both sides of each bar and subtracting the height of the bar itself

• This can be done using two arrays to store the maximum height of bars on the left and right side of each bar
Answered by AI
Add your answer
Q2. Least cost to travel from source to destination(DP problem)
Ans. 
The problem is to find the least cost to travel from source to destination using dynamic programming.
• Use dynamic programming to solve the problem

• Create a 2D array to store the minimum cost to reach each cell

• Fill the array using the recurrence relation: minCost[i][j] = cost[i][j] + min(minCost[i-1][j], minCost[i][j-1], minCost[i-1][j-1])

• The final answer will be stored in minCost[m][n], where m and n are the coordinates ...read more
Answered by AI
Add your answer

Q1. Interfaces, diamond problem, abstraction, OOPs concepts, inheritance, abstract classes, Race condition, Normalization
Add your answer
Q2. Arrays coding question and a DP problem in mid to high level of difficulty.
Add your answer
Q3. System design question
Add your answer

Q1. DP problems (mid - high difficulty)
Add your answer

Q1. Level order traversal of Binary tree
Ans. 
Level order traversal of Binary tree
• Use a queue to traverse the tree level by level

• Enqueue the root node and then dequeue it and enqueue its children

• Repeat until the queue is empty
Answered by AI
Add your answer