Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in May 2021. There were 3 interview rounds.
Handled a critical situation with a customer
Identified the issue and its impact on the customer
Communicated effectively with the customer to understand their concerns
Collaborated with the team to find a solution
Implemented the solution and ensured customer satisfaction
Followed up with the customer to ensure the issue was resolved
NGFw stands for Next-Generation Firewall and it has advanced features compared to traditional firewalls.
NGFw can identify and block advanced threats like malware, ransomware, and phishing attacks.
It can perform deep packet inspection to analyze network traffic and detect anomalies.
NGFw can also provide application-level visibility and control to manage network traffic based on application usage.
It can integrate with ot...
SSL handshake and IPsec negotiation are both security protocols used to establish secure communication channels.
SSL handshake is used to establish secure communication between a client and a server over the internet.
IPsec negotiation is used to establish secure communication between two network devices.
SSL handshake uses a combination of public and private keys to encrypt and decrypt data.
IPsec negotiation uses a combi...
Top trending discussions
I applied via Referral and was interviewed in Mar 2022. There was 1 interview round.
Good, questions related to regex
General questions about resume and projects
I applied via Approached by Company and was interviewed in Dec 2021. There were 2 interview rounds.
Basics of C, pointer arithmetic, some output prediction mainly focused on pre and post increment operators, write code to print the character with most occurance in a string with count.
2 hours DSA questions
I was interviewed before Mar 2021.
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.
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
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
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
posted on 9 Aug 2023
I applied via Recruitment Consulltant and was interviewed in Jul 2023. There were 5 interview rounds.
Coding string related programming
Hacker rank data structure linked list
Hacker rank data structure trees
posted on 5 Mar 2025
Was asked to understand a project in python and translate it to NodeJS. This had to be done during the interview with you explaining you thought process through every step.
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
One hour Leet code medium question
Senior Staff Engineer
50
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
TAC Engineer
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Engineer
27
salaries
| ₹0 L/yr - ₹0 L/yr |
Check Point Software Technologies
Fortinet
FireEye
Gen