Filter interviews by
I applied via Approached by Company and was interviewed before Aug 2022. There were 3 interview rounds.
Medium level questions on DSA to test problem solving capabilities
I was interviewed in May 2022.
Speed distance, relations, coding decoding, work time
Strings, LinkedList
Basic bath included and Strings sorting, leetcode medium basic SQL and some basic web related things
posted on 1 Nov 2023
I applied via Approached by Company and was interviewed before Nov 2022. There were 4 interview rounds.
Designing a low level architecture for a quiz portal application
Use a microservices architecture for scalability and flexibility
Implement a database schema to store quiz questions, answers, and user responses
Utilize caching mechanisms to improve performance
Design an authentication system to ensure secure access to quizzes
Include features for creating, editing, and taking quizzes
I applied via LinkedIn and was interviewed before Sep 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Jun 2022. There were 3 interview rounds.
Coding round with 3 problem statements
Common Aptitude along with HTML5, CSS
I applied via Naukri.com and was interviewed in Mar 2023. There were 2 interview rounds.
Write the program to swipe number
I was interviewed before May 2021.
Round duration - 60 Minutes
Round difficulty - Easy
It was an coding round
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
Iterate through the buildings and create a list of critical points (x, y) where the height changes.
Sort the critical points based on x-coordinate and process them to form the skyline.
Merge consecutive horizontal segments of equal height into one to ensure no duplicates.
Return the fin...
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.
Return a list of strings representing valid paths sorted in alphabetical order.
Round duration - 30 Minutes
Round difficulty - Easy
It was an HR round with some general questions. it was just for formality.
Tip 1 : Stay focused
Tip 2 : Practice coding questions.
Tip 3 : View previous interviews of the companies
Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Data Science Intern
167
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
64
salaries
| ₹0 L/yr - ₹0 L/yr |
Intern
61
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist Intern
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst Intern
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Simplilearn
Great Learning
upGrad
Jigsaw Academy