i
Park Plus
Filter interviews by
A doubly-linked list is a data structure where each node contains a reference to both the previous and next nodes.
Allows traversal in both directions
Used in implementing LRU cache
Used in browser history
Used in undo-redo functionality
Doubly linked list allows traversal in both directions, while singly linked list only allows traversal in one direction.
Doubly linked list allows for efficient deletion of nodes compared to singly linked list.
Doubly linked list can be traversed in both forward and backward directions.
Doubly linked list can be used to implement a stack or queue.
Singly linked list requires less memory than doubly linked list.
Doubly linke...
Graph data structure is used in various applications such as social networks, routing algorithms, and recommendation systems.
Social networks use graphs to represent users and their connections.
Routing algorithms use graphs to find the shortest path between two points.
Recommendation systems use graphs to analyze user behavior and suggest relevant items.
Graphs are also used in computer networks, image processing, and mac...
In-memory DB stores data in RAM for faster access while MySQL stores data on disk.
In-memory DB is faster than MySQL as it eliminates disk I/O operations.
In-memory DB is suitable for real-time applications that require low latency.
MySQL is suitable for applications that require data persistence and durability.
In-memory DB may not be suitable for large datasets as it requires a lot of RAM.
MySQL supports complex queries a...
RDBMS is a structured database that uses SQL while NoSQL is a non-relational database that doesn't use SQL.
RDBMS stores data in tables with predefined schema while NoSQL stores data in documents, key-value pairs, or graphs.
RDBMS is good for complex queries and transactions while NoSQL is good for scalability and handling unstructured data.
Examples of RDBMS include MySQL, Oracle, and SQL Server while examples of NoSQL i
Indexing is the process of organizing data in a database or search engine to improve search efficiency.
Indexing creates a data structure that allows for faster retrieval of information.
It involves creating an index that maps the location of data in a database or search engine.
Indexing can be done on various types of data, such as text, numbers, and dates.
Examples of indexing methods include B-tree, hash, and bitmap ind
The question is unclear and requires clarification.
The question is not specific about what 'above question' it is referring to.
The term 'internal working' is also vague and needs to be defined.
Without more information, it is impossible to provide a meaningful answer.
Print internal nodes of a binary tree (excluding left and right view nodes)
Traverse the tree in post-order and check if the node has both left and right children
If yes, then it is an internal node and print it
If no, then continue traversing the tree
Example: For the tree 1-2-4-5-3, the internal nodes are 2 and 4
Top trending discussions
I applied via Recruitment Consulltant and was interviewed in Sep 2022. There were 3 interview rounds.
Simple Questions based on JS and Nodejs.
System design for Splitwise
Splitwise is a bill splitting app that allows users to split expenses with friends and family
The system should allow users to create groups and add members to the group
Users should be able to add expenses and split them equally or unequally among group members
The system should keep track of each user's balance and settle debts between users
The system should have a user-friendly interface and
I was interviewed in Dec 2024.
I applied via Referral and was interviewed in Apr 2024. There were 5 interview rounds.
2 dsa questions of easy/medium
Two pointer and sliding window
To delete the nth node from the end in a linked list, we can use a two-pointer approach.
Use two pointers, one to traverse the list and another to keep track of the nth node from the end.
Move the second pointer n steps ahead of the first pointer.
When the second pointer reaches the end of the list, the first pointer will be at the nth node from the end.
Adjust the pointers to delete the nth node.
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
Count the number of islands in a grid of '1's and '0's
Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited
Increment the island count for each new island found
Ensure to handle boundary cases and check for visited nodes
Find the first and last index of a specific element in an array of strings.
Iterate through the array and keep track of the index of the first and last occurrence of the element.
Return the first and last index once the iteration is complete.
Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
I applied via campus placement at Manav Rachana International University, Faridabad and was interviewed in Feb 2024. There were 2 interview rounds.
Hard questions of graph and dp.
It was good and tough
based on 1 review
Rating in categories
Sales Manager
63
salaries
| ₹5.5 L/yr - ₹12.3 L/yr |
Assistant Manager
36
salaries
| ₹3.2 L/yr - ₹11.5 L/yr |
Program Manager
26
salaries
| ₹8 L/yr - ₹24.6 L/yr |
Zonal Manager
17
salaries
| ₹13 L/yr - ₹22 L/yr |
City Head
16
salaries
| ₹11 L/yr - ₹20 L/yr |
Secure Parking Solutions
Get my Parking
Parkwheels
ParkMate