Filter interviews by
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
It occurred on HackerRank.
I aspire to be an SDE to innovate, solve complex problems, and contribute to impactful software solutions that enhance user experiences.
Passion for technology: I enjoy coding and building applications that solve real-world problems, like developing a budgeting app to help users manage finances.
Desire for continuous learning: The tech field is ever-evolving, and I am excited about the opportunity to learn new languages ...
I applied via Approached by Company and was interviewed before Oct 2023. There was 1 interview round.
1 phone screening
4 DSA interviews
I applied via Campus Placement
Only based on approach, learn DSA
Duration 60min, platform - hackerrank.
I applied via Referral
Very easy no need to worry
I applied via Campus Placement and was interviewed before Jan 2022. There were 3 interview rounds.
3 DSA on hackerearth 2 hrs + resume screening
Graphs and trees are fundamental data structures used to represent relationships and hierarchies in various applications.
Graphs consist of vertices (nodes) and edges (connections), used in social networks, transportation, etc.
Trees are a special type of graph with a hierarchical structure, commonly used in file systems and databases.
Depth-First Search (DFS) and Breadth-First Search (BFS) are key algorithms for traversi...
I applied via Company Website and was interviewed in Jul 2021. There were 4 interview rounds.
Top trending discussions
I appeared for an interview before Feb 2016.
The question asks to determine the similarity between two words.
Use a similarity metric like Levenshtein distance or cosine similarity
Normalize the words by converting them to lowercase and removing punctuation
Consider using a pre-trained word embedding model for semantic similarity
Implement a function that calculates the similarity score between two words
Easy test 2 questions
The maximum element in a heap can be found at the root node.
The maximum element in a max heap is always at the root node.
To find the maximum element, simply return the value at the root node.
In a min heap, the maximum element can be found by recursively checking the left and right child nodes.
based on 4 interview experiences
Difficulty level
Duration
based on 14 reviews
Rating in categories
Software Engineer
3k
salaries
| ₹32.5 L/yr - ₹65 L/yr |
Software Developer
2.1k
salaries
| ₹33 L/yr - ₹60.3 L/yr |
Senior Software Engineer
1.2k
salaries
| ₹38.6 L/yr - ₹72.2 L/yr |
Data Analyst
371
salaries
| ₹15.9 L/yr - ₹35 L/yr |
Sde1
367
salaries
| ₹31.3 L/yr - ₹58.4 L/yr |
Yahoo
Amazon
Microsoft Corporation