Filter interviews by
Clear (1)
I applied via Naukri.com and was interviewed in Oct 2024. There were 2 interview rounds.
Online test on hacker rank . difficult level
Assignmemt on sorting array
It was test on hacker rank
Top trending discussions
I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.
Written test on DSA - 3 questions on hackerrank
F2F interview on DSA + automation
I applied via LinkedIn and was interviewed in Aug 2023. There were 2 interview rounds.
DSA Based questions were asked
I applied via Company Website and was interviewed before May 2023. There was 1 interview round.
On leetcode based prblm there are questions asked
Trees are hierarchical data structures with nodes connected by edges. Binary search is a search algorithm that finds the position of a target value within a sorted array.
Trees are made up of nodes connected by edges, with a root node at the top and leaf nodes at the bottom.
Binary search is a divide and conquer algorithm that compares the target value to the middle element of a sorted array.
Binary search is efficient fo...
Graphs are data structures that consist of nodes (vertices) connected by edges (links).
Graphs can be directed or undirected.
Nodes can have attributes or properties.
Edges can have weights or labels.
Examples of graphs include social networks, road networks, and organizational hierarchies.
Projects and dsa based round is this
Find the longest increasing subsequence in an array.
Use dynamic programming to solve this problem.
Iterate through the array and keep track of the longest increasing subsequence ending at each index.
Return the maximum length found.
Detecting a cycle in a graph using depth-first search or Floyd's cycle detection algorithm.
Use depth-first search to detect a cycle in a graph by keeping track of visited nodes and checking for back edges.
Alternatively, use Floyd's cycle detection algorithm for detecting a cycle in a linked list or graph.
Example: For a graph with nodes A, B, C, D and edges (A->B, B->C, C->D, D->A), a cycle is detected when visiting nod...
posted on 5 Oct 2022
A binary tree is a hierarchical data structure in which each node has at most two children.
Consists of nodes connected by edges
Each node can have at most two children, referred to as left child and right child
The left child is smaller than the parent node, while the right child is greater
Used for efficient searching, sorting, and organizing data
To validate an IP address, check if it consists of four numbers separated by periods, each number being between 0 and 255.
Split the IP address string by periods to get an array of four numbers
Check if the array length is 4
Loop through each number in the array and check if it is between 0 and 255
If any number is outside the valid range, the IP address is invalid
I applied via AmbitionBox and was interviewed in Aug 2023. There were 3 interview rounds.
Data structures and algorithms. Leet code hard level
I applied via Indeed and was interviewed before Aug 2022. There were 3 interview rounds.
Program to mirror the pixel in a screen matrix of 24 bit pixels
Create a 2D array to represent the screen matrix of pixels
Iterate through each row and swap the pixels from left to right
Ensure to handle the 24 bit pixels properly for mirroring
Example: [[255, 0, 0], [0, 255, 0], [0, 0, 255]] -> [[0, 0, 255], [0, 255, 0], [255, 0, 0]]
3 rounds of coding problems in c++ from various disciplines some relatively easy and some hard
based on 2 interviews
Interview experience
based on 1 review
Rating in categories
Trust and Safety Specialist
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
65
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Reviewer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Account Director
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Amazon