i
Licious
Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in Jun 2024. There were 3 interview rounds.
I applied via LinkedIn and was interviewed before Oct 2022. There were 5 interview rounds.
Design a recommendation engine for personalized suggestions based on user preferences and behavior.
Collect user data such as browsing history, purchase history, ratings, and interactions.
Use collaborative filtering, content-based filtering, or hybrid approaches to generate recommendations.
Implement algorithms like matrix factorization, k-nearest neighbors, or neural networks for personalized suggestions.
Regularly updat...
Design a load balancer to evenly distribute incoming network traffic across multiple servers.
Implement a round-robin algorithm to distribute requests evenly among servers.
Monitor server health and adjust traffic distribution accordingly.
Use a combination of hardware and software load balancers for optimal performance.
Consider factors like server capacity, latency, and geographic location when routing traffic.
Implement ...
Top trending discussions
I was interviewed before Dec 2020.
Round duration - 60 Minutes
Round difficulty - Medium
This round was purely based on Data Structures and Algorithms . One has to be fairly comfortable in solving Algorithmic problems to pass this round . Both the questions asked were quite common and luckily I had already prepared them from CodeStudio and LeetCode.
Given a Binary Tree with 'N' nodes, where each node holds an integer value, your task is to compute the In-Order, Pre-Order, and Post-Order traversals of the binar...
Compute the In-Order, Pre-Order, and Post-Order traversals of a Binary Tree given in level-order format.
Implement functions to perform In-Order, Pre-Order, and Post-Order traversals of a Binary Tree.
Use level-order input to construct the Binary Tree.
Traverse the Binary Tree recursively to generate the required traversals.
Ensure proper handling of null nodes represented by -1 in the input.
Return the three traversals as
Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.
The first line of input is an intege...
Reverse a singly linked list by altering the links between nodes.
Iterate through the linked list and reverse the links between nodes
Use three pointers to keep track of the current, previous, and next nodes
Update the links between nodes to reverse the list
Return the head of the reversed linked list
Round duration - 45 Minutes
Round difficulty - Medium
This round basically tested some concepts from Data Structures and File Manipulation .
Given two arrays A
and B
with sizes N
and M
respectively, both sorted in non-decreasing order, determine their intersection.
The intersection of two arrays in...
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal and update the intersection array.
Return the intersection array as the result.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
Frontend assement on react js functionality problems
I applied via LinkedIn and was interviewed before Oct 2023. There was 1 interview round.
Basics of Frontend development and project discussion
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
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
3D DP, DP ON BST, Focus on highlevel dp and system design
I was interviewed in Mar 2022.
Round duration - 120 Minutes
Round difficulty - Medium
Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach
Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question
Round duration - 60 Minutes
Round difficulty - Medium
2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE
Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...
The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.
Use dynamic programming to solve the problem efficiently.
The number of structurally unique BSTs can be calculated using Catalan numbers.
For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.
Example: For N=3, the number of structurally unique BSTs is 5.
You are provided with a string 'STR'
that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...
Generate all possible subsequences of a given string.
Use recursion to generate all possible subsequences by including or excluding each character in the string.
Maintain a current index to keep track of the characters being considered.
Append the current character to each subsequence generated so far.
Recursively call the function with the next index to include or exclude the next character.
Base case: When the current ind...
Round duration - 60 Minutes
Round difficulty - Easy
HIRING MANAGER ROUND
Discussion about the organisation now questions
Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly
Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
HUB Manager
109
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
101
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Executive
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Executive Production
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Territory Sales Manager
32
salaries
| ₹0 L/yr - ₹0 L/yr |
BigBasket
FreshToHome
ZappFresh.com
Blinkit