Filter interviews by
Clear (1)
Top trending discussions
posted on 6 Mar 2024
posted on 11 Jun 2022
I applied via LinkedIn and was interviewed in Dec 2021. There was 1 interview round.
I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.
To connect to the backend, you can use APIs, database connections, or web services.
Use APIs to send and receive data between the frontend and backend
Establish database connections to retrieve and store data
Utilize web services for communication between different systems
2 hours of duration and medium level leetcode questions
OS stands for Operating System. It is a software that manages computer hardware and provides services for computer programs.
OS is the software that acts as an intermediary between computer hardware and user applications.
It manages computer resources such as memory, processors, devices, and file systems.
Examples of popular operating systems include Windows, macOS, Linux, and Android.
Deadlock can be avoided by implementing proper resource allocation strategies and using techniques like deadlock prevention, avoidance, detection, and recovery.
Implement proper resource allocation strategies such as resource ordering, wait-die, wound-wait, etc.
Use techniques like deadlock prevention by ensuring that the system never enters a deadlock state, avoidance by ensuring that the system does not enter an unsafe...
I applied via Referral and was interviewed before Sep 2022. There were 4 interview rounds.
Aptitude Java CI/CD DevOps Unit testing HTML CSS
I applied via Campus Placement and was interviewed in Oct 2023. There were 4 interview rounds.
Topics: maps, sorting and simple DSA question
A linked list is a data structure where each element points to the next element in the sequence.
Linked list is stored in memory as nodes, where each node contains data and a reference to the next node.
Examples of linked-list include a singly linked list, doubly linked list, and circular linked list.
In a singly linked list, each node points to the next node. In a doubly linked list, each node points to both the next and
ML models are built by collecting and preparing data, selecting a model, training the model on the data, and evaluating its performance.
Collect and prepare data by cleaning, transforming, and encoding it
Select a model based on the problem at hand (e.g. regression, classification, clustering)
Train the model using algorithms like linear regression, decision trees, or neural networks
Evaluate the model's performance using ...
Arrays store elements in contiguous memory locations, while linked lists store elements in nodes with pointers to the next node.
Arrays have fixed size, while linked lists can dynamically grow or shrink.
Accessing elements in arrays is faster (O(1)), while accessing elements in linked lists is slower (O(n)).
Inserting or deleting elements in arrays can be inefficient, as it may require shifting elements, while in linked l...
Return a string containing the first occurrence of characters in the input string.
Create an empty string to store the result.
Iterate through each character in the input string.
If the character is not already in the result string, add it to the result string.
Return the result string.
One of the hardest DSA questions I have done involved implementing a complex graph traversal algorithm.
The question required understanding of graph data structures and algorithms.
I had to implement a depth-first search or breadth-first search algorithm.
The question may have involved finding the shortest path in a weighted graph.
I had to consider edge cases and optimize the algorithm for efficiency.
Polymorphism is the ability of a single function or method to operate on different types of data.
Polymorphism allows objects of different classes to be treated as objects of a common superclass.
There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).
Example: Inheritance in object-oriented programming languages like Java allows for polymorphism.
Memory management is the process of controlling and coordinating computer memory, assigning portions called blocks to various programs.
Memory management involves allocation, deallocation, and organization of memory blocks.
It ensures that each process gets the memory it needs and that memory is used efficiently.
Examples include dynamic memory allocation in C/C++, garbage collection in Java, and virtual memory management
Team work vs individual
LcS problem, timing 45 min
Senior Member of Technical Staff
70
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Member Technical Staff
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Consulting Staff
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Member Technical Staff
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Cadence Design Systems
Synopsys
Ansys Software Private Limited
Autodesk