Pathlock Interview Questions and Answers

Two DSA questions linked list and graph

Q1. Draw.Io architecture of current project and questions around it
Add your answer
Q2. Solid Principles low level design of LRU cache
Ans. 
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
Answered by AI
Add your answer
Q3. DSA maximum product of sum array
Ans. 
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.
Answered by AI
Add your answer

Q1. Diameter of graph DSA
Ans. 
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
Answered by AI
Add your answer
Q2. Advance SQl queries
Add your answer
Q3. Database partitions
Add your answer
Q4. String Interning
Add your answer

Q1. Scalability related wuestions of applications
Add your answer
Q2. Company policies and behaviour questions
Add your answer

Q1. Salary Negotiations
Add your answer
Q2. Other behavioural questions
Add your answer

Q1. It was mostly resume based round
Add your answer

Q1. It was also resume based round
Add your answer

Q1. What are your strength and weaknesses?
Add your answer

Q1. About your self
Add your answer