Filter interviews by
It was a leetcode medium
It was a leetcode medium
Top trending discussions
I applied via LinkedIn and was interviewed in Jan 2024. There was 1 interview round.
DSA questions asked in an interview
I applied via AngelList and was interviewed before May 2023. There were 3 interview rounds.
Create a analytics webpage
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 in Oct 2023. There were 2 interview rounds.
2 DSA problems were asked
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]
I applied via LinkedIn and was interviewed in Jan 2024. There was 1 interview round.
DSA questions asked in an interview
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Was given two hours to implement an Api
Number of islands in DSA refers to the problem of finding the number of connected groups of 1s in a 2D grid.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the grid and mark visited islands.
Count the number of times DFS/BFS is called to find the total number of islands.
Consider diagonal connections if specified in the problem.
Example: Given grid [['1','1','0','0'],['0','1','0','1'],['1','0','0','
Interview experience
based on 4 reviews
Rating in categories
Software Engineer
9
salaries
| ₹16 L/yr - ₹30 L/yr |
Product Designer
9
salaries
| ₹8.2 L/yr - ₹8.2 L/yr |
Senior Software Engineer
6
salaries
| ₹25 L/yr - ₹67.5 L/yr |
Front end Engineer
5
salaries
| ₹27 L/yr - ₹30 L/yr |
Customer Success Associate
4
salaries
| ₹6 L/yr - ₹8.8 L/yr |
BYJU'S
Unacademy
Toppr
upGrad