i
Pathlock
Filter interviews by
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
Top trending discussions
I applied via Walk-in and was interviewed before Oct 2021. There were 2 interview rounds.
Good technical round, you can manage, mainly Java questions used to come
Find duplicate elements in array
Iterate through array and compare each element with all other elements
Use a hash table to keep track of seen elements
Sort the array and compare adjacent elements
Remove duplicate elements in array
Use a hash table to keep track of elements already seen
Sort the array and remove adjacent duplicates
Use a Set to store unique elements
I appeared for an interview before Mar 2024.
SQL code development
posted on 29 Feb 2024
I applied via Company Website and was interviewed before Feb 2023. There were 3 interview rounds.
Discussion about OOPS concepts and String related program
Program on Recursion and Array
I applied via Campus Placement and was interviewed before May 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Jun 2020. There were 4 interview rounds.
I appeared for an interview before Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
The task is to determine if a given string of parentheses is balanced or not.
Iterate through the characters of the string and use a stack to keep track of opening parentheses.
When encountering an opening parenthesis, push it onto the stack. When encountering a closing parenthesis, check if it matches the top of the stack.
If the stack is empty at the end or there are unmatched parentheses, the string is not balanced.
Exa...
Determine if a given singly linked list of integers is a palindrome. Return true
if it is a palindrome, otherwise return false
.
1 -> 2 -> ...
Check if a given singly linked list of integers is a palindrome.
Use two pointers to find the middle of the linked list.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it is a palindrome.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical and managerial round. The interviewer gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
A virtual function is a function in a base class that is declared using the keyword 'virtual' and can be overridden by a function with the same signature in a derived class.
Virtual functions allow for dynamic polymorphism in object-oriented programming.
They are used to achieve runtime polymorphism by enabling late binding.
Virtual functions are declared in a base class and can be overridden in derived classes.
Example: v...
Level order traversal of a binary tree in spiral form involves alternating between left and right while traversing each level.
Start by pushing the root node into a queue.
While the queue is not empty, pop a node, print its value, and push its children into the queue.
For each level, alternate between popping nodes from the queue and printing their values from left to right or right to left.
Continue this process until all
Abstract classes in C++ are classes that cannot be instantiated and are designed to be base classes for other classes.
Abstract classes may contain pure virtual functions, making them incomplete and unable to be instantiated.
Derived classes must implement all pure virtual functions from the abstract class in order to be concrete classes.
Abstract classes can have non-virtual functions and member variables like regular cl...
Round duration - 60 minutes
Round difficulty - Easy
This was also a technical round. He asked to optimize the code I wrote in coding round. Then he asked me a few puzzles and questions on OOPS, OS and DBMS.
ACID properties are a set of properties that guarantee the reliability of transactions in database management systems.
ACID stands for Atomicity, Consistency, Isolation, and Durability.
Atomicity ensures that either all operations in a transaction are completed successfully or none of them are.
Consistency ensures that the database remains in a consistent state before and after the transaction.
Isolation ensures that the e...
Paging and segmentation are memory management techniques in operating systems.
Paging divides physical memory into fixed-size blocks called pages, while segmentation divides logical memory into variable-size segments.
Paging allows for efficient memory allocation and management, while segmentation provides protection and sharing of memory.
Paging is simpler to implement but can lead to internal fragmentation, while segmen...
Concurrency control is a technique used in databases to manage simultaneous access and modification of data by multiple users or processes.
Concurrency control ensures that transactions are executed in a way that maintains data consistency and integrity.
Techniques like locking, timestamp ordering, and optimistic concurrency control are used to implement concurrency control.
For example, in a banking system, concurrency c...
String Buffer is synchronized and thread-safe, while String Builder is not synchronized and faster.
String Buffer is synchronized, making it thread-safe for use in multi-threaded environments.
String Builder is not synchronized, resulting in faster performance but not thread-safe.
String Builder is preferred for single-threaded operations, while String Buffer is preferred for multi-threaded operations.
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
Mutex is used for exclusive access to a resource, while semaphore is used for controlling access to a resource by multiple threads.
Mutex is binary and allows only one thread to access the resource at a time.
Semaphore can have a count greater than one, allowing multiple threads to access the resource simultaneously.
Mutex is typically used for protecting critical sections of code, while semaphore is used for synchronizat...
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
QA Engineer
19
salaries
| ₹6 L/yr - ₹13 L/yr |
Senior Software Engineer
14
salaries
| ₹11.5 L/yr - ₹33.3 L/yr |
Software Engineer
11
salaries
| ₹4.5 L/yr - ₹10.2 L/yr |
Software Developer
11
salaries
| ₹3 L/yr - ₹10.9 L/yr |
Project Manager
9
salaries
| ₹25 L/yr - ₹32 L/yr |
Aurigo
Prime Focus Technologies
Yodlee
Algonomy