Filter interviews by
Be the first one to contribute and help others!
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 applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Walk-in and was interviewed in Mar 2023. There were 3 interview rounds.
GK questions (multiple choice questions)
It had 2 dsa questions on platform
I applied via Company Website and was interviewed in Apr 2024. There were 2 interview rounds.
One questiuon on dp longest increasing sub sequences
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
Conducted on their platform for 120 minutes
To find the diameter of a binary tree, we need to find the longest path between any two nodes in the tree.
Traverse the tree recursively and calculate the height of the left and right subtrees.
Calculate the diameter of the left and right subtrees recursively.
The diameter of the tree is the maximum of the following three values: 1. Diameter of the left subtree 2. Diameter of the right subtree 3. Height of the left sub...
I applied via Campus Placement and was interviewed in Mar 2022. There were 4 interview rounds.
Finding common elements in two sorted linked lists.
Traverse both lists simultaneously using two pointers.
Compare the values of the nodes pointed by the two pointers.
If they are equal, add the value to the result list and move both pointers.
If not, move the pointer pointing to the smaller value.
Repeat until one of the lists is fully traversed.
Finding the Kth element after merging two sorted arrays.
Merge the two sorted arrays into a single array.
Sort the merged array.
Return the Kth element from the merged and sorted array.
OOPS is a programming paradigm based on objects while DBMS is a software system for managing databases.
OOPS focuses on encapsulation, inheritance, and polymorphism
DBMS manages data through CRUD operations and supports ACID properties
Examples of OOPS languages include Java, C++, and Python
Examples of DBMS include MySQL, Oracle, and SQL Server
I applied via LinkedIn and was interviewed in Apr 2022. There were 5 interview rounds.
String manipulation problems from geeks for geeks with some medium and hard problems in DSA from leetcode
Graph implementation involves creating nodes and edges to represent data and relationships.
Nodes represent data points and edges represent relationships between them
Graphs can be directed or undirected
Common graph algorithms include BFS, DFS, and Dijkstra's algorithm
String pool is a cache of string literals stored in memory for efficient reuse.
String pool is a part of Java's memory management system.
It stores a collection of unique string literals to save memory.
When a new string is created, it is first checked in the pool and reused if already present.
String pool can be accessed using the intern() method.
Example: String s1 = "Hello"; String s2 = "Hello"; s1 and s2 will point to t
Strings are immutable in Java to ensure thread safety and prevent unintended changes.
Immutable objects are safer to use in multi-threaded environments
String pool optimization is possible because of immutability
StringBuffer and StringBuilder classes are available for mutable string operations
Computer Operator
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Entry Operator
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Computer Operator/Data Entry Operator
13
salaries
| ₹0 L/yr - ₹0 L/yr |
Computer Teacher
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
IBM
Dell
HP India