Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed in Nov 2024. There was 1 interview round.
DORA stands for DevOps Research and Assessment, a framework for measuring software delivery performance.
DORA is a research organization that focuses on improving software delivery performance.
They have developed a framework for measuring key metrics in DevOps practices.
DORA metrics include deployment frequency, lead time for changes, mean time to recover, and change failure rate.
DHCP is a network protocol that automatically assigns IP addresses to devices on a network.
DHCP stands for Dynamic Host Configuration Protocol.
It allows devices to obtain IP addresses and other network configuration information from a DHCP server.
DHCP operates on the client-server model, where the client requests an IP address and the server assigns one.
DHCP uses a lease mechanism to control the amount of time a device...
Top trending discussions
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
I applied via Naukri.com
VTable is a table of function pointers used in object-oriented programming to implement polymorphism. VPtr is a pointer to the VTable.
VTable is used to store pointers to virtual functions in a class.
VPtr points to the VTable of an object to enable dynamic dispatch of virtual functions.
VTable and VPtr are used in C++ to implement polymorphism and dynamic binding.
I was interviewed before Mar 2021.
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.
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
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
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
I applied via Company Website and was interviewed in May 2022. There were 2 interview rounds.
Logical reasoning And aptitude test
C++, python and Java programming
I applied via Recruitment Consulltant
A mutex is a synchronization primitive that ensures only one thread can access a resource at a time.
Create a mutex object using the appropriate library or language-specific function.
Lock the mutex before accessing the shared resource to prevent other threads from accessing it.
Unlock the mutex after finishing the operation on the shared resource to allow other threads to access it.
Example: pthread_mutex_t mutex; pthread...
Identify memory leak in code
Check for any dynamically allocated memory that is not being freed
Look for any infinite loops or recursive functions that consume memory
Use memory profiling tools like Valgrind to detect leaks
Check for any global variables that are not properly managed
I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.
Easy problem on java
based on 1 interview
Interview experience
based on 4 reviews
Rating in categories
Technical Account Manager
108
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
86
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
83
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
71
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
46
salaries
| ₹0 L/yr - ₹0 L/yr |
Palo Alto Networks
Gen
FireEye
Check Point Software Technologies