Filter interviews by
I applied via Naukri.com and was interviewed before Jan 2021. There were 3 interview rounds.
Top trending discussions
I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.
To find a loop in a linked list, we use Floyd's cycle-finding algorithm.
Floyd's cycle-finding algorithm uses two pointers, one moving at twice the speed of the other.
If there is a loop in the linked list, the two pointers will eventually meet.
To detect the meeting point, we reset one of the pointers to the head of the linked list and move both pointers at the same speed.
The meeting point is the start of the loop.
LRU, MRU and LFU are caching algorithms used to manage memory in computer systems.
LRU stands for Least Recently Used and removes the least recently used items from the cache when the cache is full.
MRU stands for Most Recently Used and removes the most recently used items from the cache when the cache is full.
LFU stands for Least Frequently Used and removes the least frequently used items from the cache when the cache i...
I appeared for an interview before May 2016.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
I applied via Company Website and was interviewed in Jun 2020. There were 6 interview rounds.
I applied via Referral and was interviewed in Jul 2021. There were 4 interview rounds.
Meta classes are classes that define the behavior of other classes.
Meta classes are used to customize the behavior of classes.
They can be used to add or modify attributes and methods of classes.
They can also be used to enforce certain rules or restrictions on classes.
In Python, the default meta class is 'type'.
Example: class MyMeta(type): pass
I applied via Campus Placement and was interviewed before Aug 2021. There were 3 interview rounds.
2 coding questions and a set of mcq questions based on oops, dbms, networking and os
Reverse a linked list
Iteratively swap the next and previous pointers of each node
Use three pointers to keep track of the current, previous, and next nodes
Update the head pointer to the last node after reversing
BST is a data structure used for efficient searching, insertion and deletion of elements in a sorted manner.
BST stands for Binary Search Tree.
It has a root node and every node has at most two children.
The left subtree of a node contains only nodes with keys lesser than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
BST allows for efficient searching, insertion and d...
I applied via Naukri.com and was interviewed in Mar 2021. There were 4 interview rounds.
based on 22 reviews
Rating in categories
Security Analyst
19
salaries
| ₹5 L/yr - ₹14.5 L/yr |
Security Engineer
16
salaries
| ₹11 L/yr - ₹21.1 L/yr |
Network Security Engineer
13
salaries
| ₹12 L/yr - ₹18.8 L/yr |
Senior Security Analyst
12
salaries
| ₹7.1 L/yr - ₹21 L/yr |
Senior Security Engineer
7
salaries
| ₹9.5 L/yr - ₹24.5 L/yr |
Gen
Trend Micro
Palo Alto Networks
Check Point Software Technologies