Filter interviews by
A set is implemented as a data structure that stores unique elements with no specific order.
A set does not allow duplicate elements.
Sets are commonly implemented using hash tables or binary search trees.
Examples of set implementations include HashSet in Java and std::set in C++.
Unordered set is typically implemented using hash tables.
Uses hash tables to store elements with unique keys
Provides constant time complexity for insertion, deletion, and lookup operations
Does not maintain any specific order of elements
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
Timing was late evening. Platform was good.
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr
of 'N' integers where arr[i]
denotes the cell number that can be reached from the 'i'...
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
Iterate through each cell and find cycles using DFS or Floyd's Tortoise and Hare algorithm.
Keep track of visited cells and cycle lengths to identify the largest cycle.
If a cell has no exit (-1), mark it as visited to avoid infinite loops.
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from source to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Recursively try moving in all directions (up, down, left, right) until reaching the destination.
Add the path to the result list when the destination is reached.
Sort the result list in alphabetical order before returning.
Tip 1 : Do some projects.
Tip 2 : Practice dynamic programming.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
Top trending discussions
I appeared for an interview before Jun 2016.
I have the ability to handle pressure effectively.
I remain calm and focused in high-pressure situations.
I prioritize tasks and manage my time efficiently.
I seek support and guidance from team members when needed.
I maintain a positive attitude and adapt to changing circumstances.
I have successfully completed projects under tight deadlines.
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Computer Fundamentals
Flatten a binary tree by converting it into a linked list in-place.
Use a recursive approach to flatten the binary tree.
Traverse the tree in a pre-order manner and keep track of the previous node.
Set the left child of each node to null and the right child to the next node in the linked list.
Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Leecode medium level question
Leetcode Hard level Question
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Solving normal Puzzles to test aptitude.
Sample app was asked to create.
I applied via LinkedIn and was interviewed before Jul 2022. There were 4 interview rounds.
Backend spring boot app assignment for hospital management
Array and string based medium complexity questions
I applied via Internshala and was interviewed in Dec 2023. There were 2 interview rounds.
Easy to medium, can solve with leetcode medium
based on 1 interview experience
Softwaretest Engineer
37
salaries
| ₹11.5 L/yr - ₹14 L/yr |
Software Engineer
30
salaries
| ₹10 L/yr - ₹27 L/yr |
Software Developer
24
salaries
| ₹15.9 L/yr - ₹28 L/yr |
Software Development Engineer
18
salaries
| ₹14 L/yr - ₹35 L/yr |
Product Manager
17
salaries
| ₹25 L/yr - ₹40.2 L/yr |
MagicPin
Awign Enterprises
Nestaway
Ketto