Filter interviews by
I applied via Campus Placement and was interviewed before Dec 2023. There were 2 interview rounds.
It was an aptitude test on the portal
Top trending discussions
I applied via Job lever and was interviewed before Sep 2021. There were 2 interview rounds.
Easy leetcode code 2 questions , HTML5 css javascript simple screen design
I was interviewed before Sep 2020.
Round duration - 120 minutes
Round difficulty - Easy
It was a mix of mathematical aptitude, logical ability, and puzzles along with 2 programming questions of easy and medium level. Time was enough and no sectional time was present. 1-2 MCQs on SQL were also present.
This round was immediately followed by an SHL aptitude test which was basically a quick limited time check of your verbal ability and math because many questions were to be done in 1 hour.
Given a 2-dimensional boolean matrix mat
of size N x M, your task is to modify the matrix such that if any element is 1, set its entire row and column to 1. Specifi...
Modify a boolean matrix such that if any element is 1, set its entire row and column to 1.
Iterate through the matrix and mark rows and columns to be modified
Use additional arrays to keep track of rows and columns to be modified
Update the matrix in-place based on the marked rows and columns
Round duration - 60 minutes
Round difficulty - Easy
It was an online video interview round on HackerEarth with simultaneous code option. It was mostly justifying your resume in the first 15 minutes. After that OOPS was majorly asked. Basics of programming including questions on STL were asked. A class which required inheritance was asked by the interviewer to write. I was helped by the interviewer if i got stuck somewhere, Some questions on implementation of hashmaps and priority queues were also asked. A puzzle was asked which luckily struct to me at that moment.
Tip 1 : Never give up
Tip 2 : When u start a topic, don't move on to next topic before you are 100% confident in previous topic
Tip 3 : Try to give maximum time on basics of a topic especially OOPS
Tip 4 - Practice Atleast 250 Questions
Tip 5 - Ex- Do atleast 2 projects
Tip 1 : Write only those things in resume in which you are 100% confident
Tip 2 : Write maximum projects you have and be ready to explain them thoroughly
Tip 3 : Don't make any silly spelling mistakes on resume
Coding test around front end using react
I applied via Job Portal and was interviewed before Nov 2023. There were 3 interview rounds.
Use a user table with a column for user type (free, gold, platinum)
Create a user table with columns for user ID, name, email, user type
Use a separate table for user types with columns for type ID and type name
Establish a one-to-many relationship between user and user type tables
Example: user table - user_id, name, email, type_id; user_type table - type_id, type_name
High-level design for a live rank dashboard for a live test with millions of users.
Use a scalable architecture to handle millions of users concurrently.
Implement real-time data processing to update ranks dynamically.
Utilize caching mechanisms to improve performance and reduce load on the database.
Design a user-friendly interface with intuitive data visualization.
Include features for filtering, sorting, and searching to
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
I applied via Referral and was interviewed before Aug 2022. There were 4 interview rounds.
Event loop is a mechanism that allows for asynchronous programming by handling events and callbacks.
Event loop is responsible for handling and executing events and callbacks in a non-blocking manner.
It continuously checks the event queue and processes events one by one.
Event loop is commonly used in JavaScript for handling asynchronous operations like setTimeout, setInterval, and AJAX requests.
Ask to create a database design and API for a todo list app
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS
Find the longest consecutive subarray.
Iterate through the array and keep track of the current subarray length.
Update the maximum length as you iterate.
Reset the current subarray length when a non-consecutive element is encountered.
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
MST can be found using Prim's algorithm or Kruskal's algorithm.
Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.
Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.
MST has...
I applied via LinkedIn and was interviewed in May 2021. There was 1 interview round.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Content Writer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Developer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Associate
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
21
salaries
| ₹0 L/yr - ₹0 L/yr |
MeritNation
Toppr
BYJU'S
Unacademy