Filter interviews by
I applied via Walk-in and was interviewed in Jun 2024. There were 5 interview rounds.
There are some 15 qstions objective types.
Developed a web application for online shopping with features like user authentication, product search, and order tracking.
Used Selenium for automated testing of user authentication process
Implemented RESTful APIs for product search functionality
Utilized JUnit for unit testing of order tracking feature
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
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 the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.
Output the length of the largest cycle found or -1 if no cycles exist.
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
Create a function to traverse the maze using depth-first search or breadth-first search.
Keep track of visited cells to avoid infinite loops.
Return 'True' if destination is reachable, 'False' otherwise.
Tip 1 : Do some projects.
Tip 2 : Practice dynamic programming.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question
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 start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture.
Tip 3 : Project matters
Tip 1 : Have web development project
Tip 2 : learn purescript and node.js
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
They have their own coding platform. The questions are basically from tree.
Tree of space question
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
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 the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Keep track of visited cells to avoid infinite loops.
Return the length of the largest cycle found or -1 if no cycles exist.
Tip 1 : Do some projects
Tip 2 : Be good in data structure
Tip 1 : Keep it short
Tip 2 : Don't try to add false things.
3 Graph Questions Were asked of difficulty medium to hard.
Hackathon round which revolved around multithreading
Leecode medium level question
Leetcode Hard level Question
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
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.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
49
salaries
| ₹6.8 L/yr - ₹24.7 L/yr |
Senior Software Engineer
46
salaries
| ₹15 L/yr - ₹34 L/yr |
Quality Engineer
25
salaries
| ₹8.4 L/yr - ₹13.4 L/yr |
Senior Quality Engineer
10
salaries
| ₹10.8 L/yr - ₹25 L/yr |
Technical Writer
9
salaries
| ₹6.3 L/yr - ₹11.6 L/yr |
MagicPin
Awign Enterprises
Nestaway
Ketto