Filter interviews by
Vehicle liquidation decisions are based on factors like age, condition, market demand, and cost of maintenance.
Consider the age of the vehicle - older vehicles may have higher maintenance costs
Assess the condition of the vehicle - extensive damage or mechanical issues may make it unprofitable to keep
Evaluate market demand - if there is low demand for the vehicle model, it may be better to liquidate
Calculate the cost of...
I applied via Approached by Company and was interviewed in Feb 2024. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
I applied via LinkedIn and was interviewed before Dec 2023. There was 1 interview round.
Construct a binary tree from its preorder and inorder traversal arrays.
Use the first element of preorder array as the root of the tree.
Find the root element in the inorder array to determine left and right subtrees.
Recursively build left and right subtrees using the above steps.
Beepkart interview questions for popular designations
In 5 years, I see myself as a successful sales and marketing professional, leading a team and driving revenue growth for the company.
Continuing to develop my skills and knowledge in sales and marketing
Taking on more responsibilities and leadership roles within the company
Building strong relationships with clients and partners
Contributing to the overall growth and success of the organization
I applied via Recruitment Consulltant and was interviewed in Mar 2023. There were 3 interview rounds.
Excel sumiffs,countifs, related. SQL and Python basic question out of current work and past projects.
The projects I have worked on have had a significant impact on improving business processes and driving growth.
Implemented a new inventory management system that reduced stockouts by 30% and increased overall sales by 15%.
Developed a customer segmentation model that improved targeted marketing campaigns and resulted in a 20% increase in customer acquisition.
Led a project to streamline the order fulfillment process, red...
I am currently working as a Business Analyst and I am looking to move to a new role.
I have gained valuable experience as a Business Analyst and I am ready for new challenges.
I am seeking a role that offers more growth opportunities and allows me to expand my skill set.
I am looking for a company that aligns with my values and offers a positive work culture.
I am excited about the potential to make a greater impact in a n...
I applied via Walk-in and was interviewed before Dec 2022. There were 3 interview rounds.
I appeared for an interview 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.
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
Some of the top questions asked at the Beepkart interview -
based on 10 interviews
Interview experience
based on 28 reviews
Rating in categories
Software Engineer
10
salaries
| ₹12 L/yr - ₹17 L/yr |
Data Analyst
8
salaries
| ₹5.5 L/yr - ₹18.9 L/yr |
Assistant Manager
6
salaries
| ₹7.5 L/yr - ₹9.6 L/yr |
Operations Executive
6
salaries
| ₹4 L/yr - ₹5 L/yr |
Product Manager
6
salaries
| ₹32 L/yr - ₹42 L/yr |
Flipkart
Amazon
Snapdeal
Paytm Mall