Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Pathlock Team. If you also belong to the team, you can get access from here

Pathlock Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Pathlock Senior Software Engineer Interview Questions and Answers

Updated 10 Oct 2024

Pathlock Senior Software Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Sep 2024. There were 5 interview rounds.

Round 1 - Coding Test 

Two DSA questions linked list and graph

Round 2 - Technical 

(3 Questions)

  • Q1. Draw.Io architecture of current project and questions around it
  • 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
  • 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
Round 3 - Technical 

(4 Questions)

  • 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
  • Q2. Advance SQl queries
  • Q3. Database partitions
  • Q4. String Interning
Round 4 - Behavioral 

(2 Questions)

  • Q1. Scalability related wuestions of applications
  • Q2. Company policies and behaviour questions
Round 5 - HR 

(2 Questions)

  • Q1. Salary Negotiations
  • Q2. Other behavioural questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare through pretty tough process for Software developers

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Not Selected

I was interviewed in Jan 2025.

Round 1 - Coding Test 

Online test was hackerrank was was og avg difficulty

Round 2 - Technical 

(1 Question)

  • Q1. Second round was of 1 hr of which 30 mins divided into understanding my current project architecture. And second half was on what i worked and how I worked and what skills I have
Round 3 - Assignment 

Assignment was straightforward which could be done using trie. Did it in 1/6th throughout time for given queries then mentioned allowed still no reply. Keep on asking engineering manager and hr to which they replied not upto the mark.

Interview Preparation Tips

Interview preparation tips for other job seekers - Don't apply for this company. Main reason is strictly 5 days work from office. Hr are so much incompetent in terms of explaining the process as well as job role. Delayed response and rude behavior.bo feedback and not even shared the outcome of interview. Has to ask multiple times to receive response. Seems engineering department isn't capable enough to decide what they actually want from candidate and what should be the outcome of questions asked.

I was interviewed before Mar 2021.

Round 1 - Technical 

(3 Questions)

  • Q1. How to check a number is power of 2
  • Ans. 

    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.

  • Answered by AI
  • Q2. Sort a stack without using another data structure
  • Ans. 

    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

  • Answered by AI
  • Q3. Check weather array have continuous increasing than decreasing value
  • Ans. 

    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

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. Design a cricinfo (LLD)
  • Ans. 

    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

  • Answered by AI
Round 3 - HR 

(3 Questions)

  • Q1. Share details of your previous job.
  • Q2. Why should we hire you?
  • Q3. What are your strengths and weaknesses?

Interview Preparation Tips

Interview preparation tips for other job seekers - Do study basic Data Structure questions and also prepare for Low level design.
Do work on behavioral questions too.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. System design - 1500 max inserting request to db a day max latency 60 se
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was more into problem solving using python

I applied via Referral and was interviewed in Jul 2022. There were 4 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. L2/L3 layer questions
Round 2 - Technical 

(2 Questions)

  • Q1. Questions related to python coding .
  • Q2. Questions related to work u have done . And coding
Round 3 - Technical 

(1 Question)

  • Q1. Questions about networking , security profile
Round 4 - Technical 

(1 Question)

  • Q1. About networking protocols and coding rounds

Interview Preparation Tips

Interview preparation tips for other job seekers - Have u basics clear and have confidence on your work whatever u have done
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Jul 2023. There were 2 interview rounds.

Round 1 - Technical 

(5 Questions)

  • Q1. Windows internals
  • Q2. Windows apis like loaddll dynamically
  • Q3. IPC mechanism in windows
  • Ans. 

    IPC mechanism in Windows allows communication between processes through shared memory, message passing, and synchronization.

    • IPC mechanisms in Windows include named pipes, mailslots, shared memory, and sockets.

    • Named pipes allow communication between processes on the same machine or over a network.

    • Mailslots are used for one-way interprocess communication.

    • Shared memory allows processes to share data by mapping a region of...

  • Answered by AI
  • Q4. Multi-threading in windows
  • Ans. 

    Multi-threading in Windows allows multiple threads to run concurrently within a single process.

    • Windows provides APIs like CreateThread and CreateProcess to create and manage threads.

    • Threads share the same memory space within a process, allowing for efficient communication and resource sharing.

    • Windows supports both user-mode and kernel-mode threads, with user-mode threads being more lightweight.

    • Synchronization mechanism...

  • Answered by AI
  • Q5. C++ general questions
Round 2 - Technical 

(4 Questions)

  • Q1. Memory management
  • Q2. Memory mapping in windows, file mapping
  • Ans. 

    Memory mapping in Windows allows files to be mapped directly into memory for faster access and manipulation.

    • Memory mapping allows files to be accessed as if they were in memory

    • File mapping can be used for sharing data between processes

    • Improves performance by reducing disk I/O operations

    • Examples: CreateFileMapping, MapViewOfFile, UnmapViewOfFile

  • Answered by AI
  • Q3. Windows internal
  • Q4. Critical section in windows
  • Ans. 

    Critical section in Windows is a synchronization mechanism used to protect shared resources from concurrent access.

    • Critical sections are used to ensure mutual exclusion between threads accessing shared resources.

    • They are implemented using the Windows API functions InitializeCriticalSection, EnterCriticalSection, and LeaveCriticalSection.

    • Critical sections are more efficient than mutexes for synchronization within a sing...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Go through c++ apis specifically for windows.

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jan 2016. There were 3 interview rounds.

Interview Questionnaire 

5 Questions

  • Q1. Questions on linked list
  • Q2. Questions on resume
  • Q3. About my interests
  • Q4. My interest in symantec
  • Q5. Place to work

Interview Preparation Tips

College Name: IIT Madras

I applied via Campus Placement and was interviewed in Dec 2016. There were 5 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. How you find loop in a linked list
  • Ans. 

    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.

  • Answered by AI
  • Q2. What is LRU, MRU and LFU
  • Ans. 

    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...

  • Answered by AI
  • Q3. Camel banana problem

Interview Preparation Tips

Round: Test
Experience: coding test in hacker rank. can code in any language except in C and C++.
Duration: 1 hour
Total Questions: 2

Round: Technical Interview
Experience: In technical round the questions are on OS, basics of C(mainly in linked lists) and maths puzzle

They mostly see how you are approaching towards a problem.
It is first time that I heard the camel banana problem. So I struggled for some time and came up with a solution. He said he liked the approach but it can be optimized.

Round: HR Interview
Experience: It started with explain about yourselves. and then he asked to explain about one project with technical details. Later he asked me to explain binary search for a guy who don't know much of technical knowledge. He continued with why we only do 2 partitions why can we make it up to 3. Later he asked me what I liked most in my mobile phone. I said chatting apps. So he asked me that if I was hired as a developer to make a chatting app how will I do it.
Tips: way of thinking and way of approaching towards a problem.

Round: HR Interview
Experience: This round was focused mainly on whether I like to work in Bangalore or not. How I first heard about Symantec. how I will suit for the company. what are my future plans.

Skills: C, OS, Math Puzzles
College Name: IIT Madras

Skills evaluated in this interview

I was interviewed in Feb 2017.

Interview Preparation Tips

Round: Test
Experience: Very first, the interviewers and their employees gave presentation about their products and company. They were very cool and very positive to motivate candidates. After that they started Round 1 that is test based on aptitude and logical problem, also containing c programmin and operating system problems.
Tips: If you have studied basics very well, you will clear the round 1 very easily. Study C programming and Linux Operating System concepts.
Duration: 1 hour 30 minutes
Total Questions: 60

Round: Technical Interview
Experience: I am not specifying any question above because 2nd round i.e Technical Round 1 was continued to abt 1 and hour hours taken by 1 interviewer. If you give all answers confindently, obviously they all must be correct, you will be qualified to next techincal round.
Tips: Same as mentioned in round 1.
Study C programming & Operating System.

Round: Technical Interview
Experience: This was Technical Round 2. It was taken by 3 interviewers asking questions randomly from random subject. Also, one took rapid fire round for 20-25 questions. If you qualified this round, then you can assume that you are selected. This round was also continued more than 1 hour.
Tips: Study Networking concepts

Round: HR Interview
Experience: If you are called for HR interview, then you can assume that you already selected as employee for company. This is round is just for formality to tell you CTC and location and joining, etc.
One thing I would like to mention that in each round they will ask you to tell about yourself. So prepare that too. In HR round, they asked me some tricky puzzles to solve since I mentioned that I am very good in maths so.

College Name: Datta Meghe College of Engineering

Pathlock Interview FAQs

How many rounds are there in Pathlock Senior Software Engineer interview?
Pathlock interview process usually has 5 rounds. The most common rounds in the Pathlock interview process are Technical, Coding Test and Behavioral.
What are the top questions asked in Pathlock Senior Software Engineer interview?

Some of the top questions asked at the Pathlock Senior Software Engineer interview -

  1. Solid Principles low level design of LRU ca...read more
  2. DSA maximum product of sum ar...read more
  3. Diameter of graph ...read more

Tell us how to improve this page.

Pathlock Senior Software Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Pathlock Senior Software Engineer Salary
based on 14 salaries
₹11.5 L/yr - ₹33.3 L/yr
48% more than the average Senior Software Engineer Salary in India
View more details

Pathlock Senior Software Engineer Reviews and Ratings

based on 5 reviews

3.6/5

Rating in categories

2.5

Skill development

4.1

Work-life balance

4.9

Salary

3.8

Job security

4.3

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 5 Reviews and Ratings
QA Engineer
19 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Project Manager
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Pathlock with

Securonix

2.9
Compare

Gen

4.0
Compare

CyberArk

3.8
Compare

Palo Alto Networks

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview