i
Pathlock
Filter interviews by
I applied via Recruitment Consultant and was interviewed in Sep 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed in Sep 2024. There were 5 interview rounds.
Two DSA questions linked list and graph
LRU cache is a data structure that maintains a fixed-size cache, evicting the least recently used item when full.
Use a doubly linked list to maintain the order of items based on their usage frequency
Use a hash map to quickly access items in the cache
When an item is accessed, move it to the front of the linked list to mark it as the most recently used
When adding a new item and the cache is full, remove the least recentl
Find the maximum product of sum of subarrays in an array.
Calculate the sum of all subarrays using prefix sum technique.
Calculate the product of all sums and return the maximum value.
The diameter of a graph in DSA is the longest shortest path between any two vertices in the graph.
The diameter of a graph can be calculated by running the Floyd-Warshall algorithm or using Breadth-First Search (BFS).
For example, in a graph with vertices A, B, C, D and edges (A, B), (B, C), (C, D), the diameter would be the distance between A and D.
The diameter of a graph can help in understanding the overall connectivi
Pathlock interview questions for popular designations
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 was interviewed before May 2016.
posted on 7 May 2017
I was interviewed in Feb 2017.
I applied via Referral and was interviewed before Apr 2021. There was 1 interview round.
posted on 13 Jun 2024
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
The task was a Codility type
based on 6 interviews
Interview experience
based on 68 reviews
Rating in categories
QA Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Project Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Securonix
Gen
CyberArk
Palo Alto Networks