i
PromptCloud
Filter interviews by
Moderate Coding question
20 mcq questions and 3 programming questions
Linked list programs involve creating, traversing, inserting, and deleting nodes in a linked list data structure.
Create a linked list by defining a node struct and using pointers to link them together
Traverse the linked list using a while loop and a pointer to the current node
Insert a node by creating a new node, updating pointers, and handling edge cases
Delete a node by updating pointers and freeing memory
Examples: re...
Top trending discussions
It was a leetcode medium
It was a leetcode medium
I applied via Shine and was interviewed in Jan 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed in Jan 2024. There was 1 interview round.
DSA questions asked in an interview
posted on 5 Jul 2024
I applied via LinkedIn and was interviewed in Jan 2024. There were 2 interview rounds.
React without react dom involves using React's server-side rendering capabilities to render components without the need for a DOM.
Use ReactDOMServer.renderToString() to render React components on the server side
This can be useful for server-side rendering of React components for SEO purposes
Example: ReactDOMServer.renderToString(
I applied via Indeed and was interviewed before Aug 2023. There were 3 interview rounds.
Core HTML, CSS and JS
JS deep dive and react
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
Python dictionary is implemented using hash tables.
Python dictionary is a collection of key-value pairs.
The keys in a dictionary must be unique and immutable.
The values in a dictionary can be of any data type.
Python dictionary is implemented using hash tables.
Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.
The hash function used in Python dictionary is based on the key's h...
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a time complexity of O(n log n) and is not stable.
Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
Software Engineer
32
salaries
| ₹5 L/yr - ₹8 L/yr |
Data Engineer
10
salaries
| ₹4 L/yr - ₹8 L/yr |
Devops Engineer
9
salaries
| ₹6.5 L/yr - ₹10.6 L/yr |
Data Quality Analyst
7
salaries
| ₹2 L/yr - ₹5 L/yr |
Technical Program Manager
6
salaries
| ₹6.5 L/yr - ₹10 L/yr |
InsanelyGood
Mogli labs
Shine
Vegrow