i
Park Plus
Filter interviews by
Clear (1)
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 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 was interviewed before Sep 2023.
I was interviewed in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was late evening . Platform was good.
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr
of 'N' integers where arr[i]
denotes the cell number that can be reached from the 'i'...
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Keep track of visited cells to avoid infinite loops.
Return the length of the largest cycle found or -1 if no cycles exist.
Tip 1 : Do some projects
Tip 2 : Be good in data structure
Tip 1 : Keep it short
Tip 2 : Don't try to add false things.
I was interviewed in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture.
Tip 3 : Project matters
Tip 1 : Have web development project
Tip 2 : learn purescript and node.js
3 Graph Questions Were asked of difficulty medium to hard.
Hackathon round which revolved around multithreading
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Hard questions of graph and dp.
It was good and tough
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
They have their own coding platform. The questions are basically from tree.
Tree of space question
I applied via Company Website and was interviewed before Oct 2023. There was 1 interview round.
Increasing triple subsequence, rest is easy hashmap
based on 1 review
Rating in categories
Sales Manager
63
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager
26
salaries
| ₹0 L/yr - ₹0 L/yr |
Zonal Manager
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Secure Parking Solutions
Get my Parking
Parkwheels
ParkMate