i
Bare International
Filter interviews by
Top trending discussions
Low profits in Big Bazaar store for last two months.
Check if there is a decrease in footfall or sales.
Analyze the competition in the area.
Check if there are any supply chain issues.
Evaluate the marketing strategies and promotions.
Assess the economic conditions of the area.
Consider the impact of COVID-19 on consumer behavior.
Review the store's inventory management and pricing strategies.
I would pick the brand that has a higher quality and better taste.
Check the quality and taste of both brands
Consider the price of each brand
Look at the expiration date of both brands
Consider the popularity of each brand among customers
I am passionate about data-driven insights and Dunnhumby's reputation as a leader in customer data science.
I am impressed by Dunnhumby's innovative approach to customer data science
I am excited about the opportunity to work with a talented team of data analysts
I am drawn to Dunnhumby's reputation for delivering actionable insights to clients
I believe that Dunnhumby's focus on customer-centricity aligns with my own valu...
I interned at a marketing firm where I worked on social media campaigns and market research.
Assisted in creating social media content for clients
Conducted market research on target demographics
Analyzed data to improve campaign performance
Attended client meetings and presented findings
Learned about marketing strategies and industry trends
I applied via Naukri.com and was interviewed in Oct 2020. There was 1 interview round.
I applied via Recruitment Consultant and was interviewed in Oct 2020. There was 1 interview round.
posted on 1 Nov 2023
1 coding question, and basic MCQ
1st round was DSA round. Pretty easy
First round was aptitude with coding round it was easy
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
based on 1 interview
Interview experience
Project Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Resource Executive
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Key Account Manager
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Editor
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Operations Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Markelytics Solutions
Savista Global Solutions
Jasper Colin
GfK MODE