Filter interviews by
I applied via LinkedIn and was interviewed in Jun 2022. There were 3 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed in Sep 2024. There were 2 interview rounds.
Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts them, and then merges the sorted halves.
Divide the array into two halves recursively
Sort each half using merge sort recursively
Merge the sorted halves back together
I applied via Naukri.com and was interviewed in Feb 2024. There were 2 interview rounds.
Good and nice and it was well organized.
I have over 5 years of experience in front end development, working on various projects and technologies.
Developed responsive websites using HTML, CSS, and JavaScript
Worked with frameworks like React and Angular to build interactive user interfaces
Optimized website performance and implemented SEO best practices
Collaborated with designers and backend developers to deliver high-quality products
I was interviewed in Aug 2021.
Round duration - 180 Minutes
Round difficulty - Medium
It had some coding questions related to graph.
The question is about finding the shortest path distance from a source node to all vertices in an undirected graph.
The graph is represented by the number of vertices and edges, followed by the edges and their distances.
The task is to find the shortest path distance from the source node (0) to all other nodes.
If a node is disconnected from the source node, print the maximum positive integer value (2147483647).
Implement ...
The task is to check if there exists a path from a given source vertex to a destination vertex in a directed and unweighted graph.
Read the number of test cases.
For each test case, read the number of vertices and edges.
Read the edges of the graph.
Read the source and destination vertices.
Implement a graph traversal algorithm (e.g., BFS or DFS) to check if a path exists from the source to the destination.
Print 'true' if a
Round duration - 180 Minutes
Round difficulty - Hard
The round was really tough only 1 coding question was asked
The task is to encode an N-ary tree into a binary tree and then decode the binary tree back into the original N-ary tree.
Encode the N-ary tree by representing each node as a binary tree node with its first child as the left child and subsequent children as the right child.
To decode the binary tree, traverse the binary tree and for each node, create a new N-ary tree node with its left child as the first child and subseq...
Tip 1 : Do atleast 2 projects
Tip 2 : Complete competitive programming
Tip 3 : Practice more interview Questions particular to the company applying to
Tip 1 : Don't lie on resume
Tip 2 : Try to wrap resume in one page
Software Development Engineer II
19
salaries
| ₹32 L/yr - ₹43 L/yr |
Product Manager
19
salaries
| ₹20 L/yr - ₹46 L/yr |
Software Development Engineer 3
15
salaries
| ₹36 L/yr - ₹52 L/yr |
Senior Product Analyst
15
salaries
| ₹9 L/yr - ₹31.2 L/yr |
Sub Editor
14
salaries
| ₹5.5 L/yr - ₹7.6 L/yr |
InMobi
ShareChat
Dailyhunt
Paytm