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
I applied via Referral and was interviewed before Jun 2023. There were 2 interview rounds.
Coding questions around android
Binary sort is a search algorithm that finds the position of a target value within a sorted array.
Binary sort works by repeatedly dividing the array in half and narrowing down the search range.
It is more efficient than linear search for large arrays.
Example: Sorting an array of strings alphabetically using binary sort.
I applied via LinkedIn and was interviewed before Mar 2023. There were 3 interview rounds.
DSA medium leetcode questions - easy to solve
DSA medium 2 questions and core questions 1.5 hrs
I prioritize tasks, communicate with stakeholders, and adjust resources as needed to meet deadlines.
Prioritize tasks based on importance and urgency
Regularly communicate with stakeholders to provide updates and address any issues that may impact deadlines
Adjust resources or seek help from team members if necessary to meet deadlines
I applied via Company Website and was interviewed before Oct 2023. There was 1 interview round.
Increasing triple subsequence, rest is easy hashmap
Designing Facebook involves creating a social networking platform with features like user profiles, news feed, messaging, and more.
Create a user registration and login system
Develop a news feed algorithm to display relevant content
Implement a messaging system for users to communicate
Design a user profile page with customizable options
Incorporate features like groups, events, and pages
Ensure scalability and security of
Reverse a linked list
Iterative approach using three pointers
Recursive approach with base case and recursive call
In-place reversal using stack
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
I applied via Referral and was interviewed in Apr 2024. There were 5 interview rounds.
2 dsa questions of easy/medium
I applied via Campus Placement and was interviewed in Apr 2024. There were 4 interview rounds.
Round 1 was coding test.
I applied via Referral and was interviewed before Apr 2023. There were 3 interview rounds.
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 |
Software Development Engineer II
17
salaries
| ₹8.1 L/yr - ₹25 L/yr |
Zonal Manager
16
salaries
| ₹13 L/yr - ₹24 L/yr |
Secure Parking Solutions
Get my Parking
Parkwheels
ParkMate