Filter interviews by
Clear (1)
I was interviewed in Sep 2021.
Round duration - 20 Minutes
Round difficulty - Easy
It was sort of a telephonic round except the questions were pre recorded and i had to rexord my answers and send those in video. I got 2 minutes to answer each question.
Round duration - 1 week
Round difficulty - Medium
Various MongoDB queries were asked based on the scraped data.
Filtering documents based on specific criteria
Sorting documents in ascending or descending order
Performing aggregation operations like grouping and counting
You are provided with a singly linked list and an integer K
. The objective is to make the Kth
node from the end of the linked list the starting node of the linked list.
Modify a singly linked list to make the Kth node from the end the starting node.
Traverse the linked list to find the length and the Kth node from the end
Update the pointers to make the Kth node the new head of the linked list
Adjust the pointers to maintain the integrity of the linked list
Round duration - 30 Minutes
Round difficulty - Medium
Based on the assignment given in earlier round and discussion on morr optimized approaches to solve it.
I was asked to solve MongoDB queries and determine the best way to execute them.
I was asked to write queries to retrieve specific data from MongoDB collections.
I used aggregation pipelines to perform complex queries involving multiple stages.
I optimized queries by creating indexes on frequently accessed fields.
I utilized MongoDB's query optimizer to analyze and improve query performance.
I used explain() method to under...
Tip 1 : do atleast 2 to 3 projects
Tip 2 : follow official documentation at the time of assignment
Tip 1 : clean and one page resume
Tip 2 : Don't copy projects
Top trending discussions
I applied via Naukri.com and was interviewed in Oct 2024. There were 4 interview rounds.
Easy level to Medium level
2 Easy questions of DSA
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
Iterative solution using a stack to perform postorder traversal.
Use a stack to simulate the recursive call stack.
Push nodes in the order of right, left, root.
Pop nodes from stack and add to result array.
Repeat until stack is empty.
Design a messaging app like WhatsApp with one-to-one, group messaging, and read receipts functionalities.
Use a relational database to store user information, messages, and group memberships.
Create tables for users, messages, groups, and group memberships.
Include columns for message content, sender, receiver, timestamp, and read status.
Implement a feature to mark messages as read with read receipts.
Use indexes for effic
I applied via Referral and was interviewed in Aug 2024. There were 2 interview rounds.
Binary search to find the closest element in a sorted array
Implement binary search to find the target element in the array
Keep track of the closest element found so far while searching
Update the closest element if a closer one is found during the search
Low level design for an online e-commerce website involves designing the architecture and components of the website.
Identify the main components such as user interface, database, payment gateway, product catalog, etc.
Design the database schema to store user information, product details, orders, etc.
Implement user authentication and authorization mechanisms for secure access.
Integrate payment gateway for processing tran...
Majorily on SQL and Databases
Use CSS to align two images with same width and height on a page
Set both images to have the same width and height using CSS
Use flexbox or grid layout to align the images horizontally or vertically
Adjust margins or padding to fine-tune the alignment
I applied via Campus Placement
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Basic React JS clock/ stopwatch
I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.
2 coding question one on maximum sum problem and other on tree traversal
3D DP, DP ON BST, Focus on highlevel dp and system design
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
Implement using a doubly linked list and a hashmap for efficient operations
When an item is accessed, move it to the front of the list
When the cache is full, remove the least recently used item from the end of the list
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Designer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Udaan
Swiggy
CARS24
BlackBuck