Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Mar 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Mar 2024. There were 4 interview rounds.
I applied via Referral and was interviewed before Feb 2023. There was 1 interview round.
Top trending discussions
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
I appeared for an interview in Jan 2022.
Round duration - 90 minutes
Round difficulty - Medium
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next
points back to a previous node in the ...
The task is to determine if a given singly linked list forms a cycle or not.
A cycle occurs when a node's next points back to a previous node in the list.
To solve this problem, we can use the Floyd's Cycle-Finding Algorithm.
The algorithm uses two pointers, one moving at a normal pace and the other moving twice as fast.
If there is a cycle, the fast pointer will eventually catch up to the slow pointer.
If the fast pointer ...
Round duration - 60 minutes
Round difficulty - Medium
Determine the minimum depth of an integer-based binary tree. The minimum depth is defined as the number of nodes present along the shortest path from the root node down to t...
The minimum depth of a binary tree is the number of nodes along the shortest path from the root node down to the nearest leaf node.
The minimum depth can be found by performing a breadth-first search (BFS) traversal of the binary tree
During the BFS traversal, keep track of the current level and increment the depth by 1 for each level
Stop the BFS traversal when a leaf node is encountered and return the depth as the minim
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem is to find the intersection of two sorted arrays.
Use two pointers to iterate through the arrays.
Compare the elements at the current pointers and move the pointers accordingly.
If the elements are equal, add it to the intersection array and move both pointers.
If the element in the first array is smaller, move the first pointer.
If the element in the second array is smaller, move the second pointer.
Repeat until...
A mutex is a binary semaphore used for mutual exclusion, while a semaphore is a generalized synchronization primitive.
Mutex is used to protect a critical section of code, allowing only one thread to access it at a time.
Semaphore is used to control access to a shared resource, allowing multiple threads to access it simultaneously.
Mutex has ownership, meaning the thread that locks it must unlock it.
Semaphore does not hav...
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 25 minutes
Round difficulty - Easy
Tip 1 : Practice a lot of DSA questions on various online platforms.
Tip 2 : Regularly go back to some of the typical DSA questions.
Tip 3 : Give equal importance to OS, OOPS, and CN subjects.
Tip 1 : Be thorough with your resume to answer anything and everything from your resume.
Tip 2 : Do not put false information on your resume.
posted on 18 Mar 2024
I applied via Company Website and was interviewed in Feb 2024. There were 3 interview rounds.
I applied via Referral and was interviewed before Nov 2022. There were 6 interview rounds.
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
The project involved designing and implementing a new network infrastructure for a large corporation.
Conducted a thorough analysis of the existing network infrastructure
Designed a new network architecture that met the company's needs
Implemented the new network infrastructure with minimal disruption to business operations
Tested and optimized the new network to ensure optimal performance
Provided ongoing support and maint
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Easy
This was MCQ+Coding round.
Check if two strings are anagrams by comparing the sorted versions of the strings.
Sort both strings and compare if they are equal.
Use a hashmap to store the frequency of characters in each string and compare the maps.
Ignore spaces and punctuation when comparing the strings.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Round duration - 90 minutes
Round difficulty - Easy
This was face to face interview round.
Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Add projects and Internships if you have done any and add only those things which you really know.
Final outcome of the interviewSelectedbased on 3 interviews
Interview experience
based on 1 review
Rating in categories
Technical Support Engineer
22
salaries
| ₹7.5 L/yr - ₹18 L/yr |
Escalation Engineer
12
salaries
| ₹12 L/yr - ₹18 L/yr |
Automation Developer
10
salaries
| ₹18.5 L/yr - ₹26 L/yr |
Professional Service Engineer
7
salaries
| ₹14 L/yr - ₹19 L/yr |
Resident Engineer
4
salaries
| ₹15 L/yr - ₹32 L/yr |
Tufin
Skybox Security Inc.
Palo Alto Networks
Check Point Software Technologies