Walmart Labs Interview Questions

Review this list of 51 Walmart Labs interview questions and answers verified by hiring managers and candidates.
  • "Engineering Managers (EMs) juggle multiple responsibilities, which can vary significantly depending on the company, team, and organizational needs. One of the most critical skills for an EM is strategic thinking. This includes setting a clear vision for the team, participating in roadmap planning meetings, and crafting actionable roadmaps to guide the team toward its goals. In addition to strategic thinking, an EM must excel in three key areas: People Management: This involves ensuring te"

    Pramod S. - "Engineering Managers (EMs) juggle multiple responsibilities, which can vary significantly depending on the company, team, and organizational needs. One of the most critical skills for an EM is strategic thinking. This includes setting a clear vision for the team, participating in roadmap planning meetings, and crafting actionable roadmaps to guide the team toward its goals. In addition to strategic thinking, an EM must excel in three key areas: People Management: This involves ensuring te"See full answer

    Engineering Manager
    Behavioral
  • Walmart Labs logoAsked at Walmart Labs 

    "My style of inspiring / discovery sessions / brainstorming / execution guidance / upskiling the team has always been Outcome driven. Outcomes always took the central focus of our efforts, and hence easier prioritisation and a clarity on why a decision failed or succeeded. I take personal responsibility to help the teams to define outcomes if it is a complicated charter and for most help them fine tune the outcomes to keep them simple, progressive and aspirational."

    RestlessMonk - "My style of inspiring / discovery sessions / brainstorming / execution guidance / upskiling the team has always been Outcome driven. Outcomes always took the central focus of our efforts, and hence easier prioritisation and a clarity on why a decision failed or succeeded. I take personal responsibility to help the teams to define outcomes if it is a complicated charter and for most help them fine tune the outcomes to keep them simple, progressive and aspirational."See full answer

    Engineering Manager
    Behavioral
    +2 more
  • Walmart Labs logoAsked at Walmart Labs 
    Video answer for 'Find a triplet in an array with a given sum.'
    +5

    "from typing import List def three_sum(nums: List[int]) -> List[List[int]]: nums.sort() triplets = set() for i in range(len(nums) - 2): firstNum = nums[i] l = i + 1 r = len(nums) - 1 while l 0: r -= 1 elif potentialSum < 0: l += 1 "

    Anonymous Roadrunner - "from typing import List def three_sum(nums: List[int]) -> List[List[int]]: nums.sort() triplets = set() for i in range(len(nums) - 2): firstNum = nums[i] l = i + 1 r = len(nums) - 1 while l 0: r -= 1 elif potentialSum < 0: l += 1 "See full answer

    Software Engineer
    Data Structures & Algorithms
    +3 more
  • Walmart Labs logoAsked at Walmart Labs 
    Video answer for 'Given stock prices for the next n days, how can you maximize your profit by buying or selling one share per day?'
    +9

    "from typing import List def maxprofitgreedy(stock_prices: List[int]) -> int: l=0 # buying r=1 # selling max_profit=0 while rstock_prices[l]: profit=stockprices[r]-stockprices[l] maxprofit=max(maxprofit,profit) else: l=r r+=1 return max_profit debug your code below print(maxprofitgreedy([7, 1, 5, 3, 6, 4])) `"

    Prajwal M. - "from typing import List def maxprofitgreedy(stock_prices: List[int]) -> int: l=0 # buying r=1 # selling max_profit=0 while rstock_prices[l]: profit=stockprices[r]-stockprices[l] maxprofit=max(maxprofit,profit) else: l=r r+=1 return max_profit debug your code below print(maxprofitgreedy([7, 1, 5, 3, 6, 4])) `"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Walmart Labs logoAsked at Walmart Labs 
    Video answer for 'Generate Parentheses'
    +5

    "function generateParentheses(n) { if (n < 1) { return []; } if (n === 1) { return ["()"]; } const combinations = new Set(); let previousCombinations = generateParentheses(n-1); for (let prev of previousCombinations) { for (let i=0; i < prev.length; i++) { combinations.add(prev.slice(0, i+1) + "()" + prev.slice(i+1)); } } return [...combinations]; } `"

    Tiago R. - "function generateParentheses(n) { if (n < 1) { return []; } if (n === 1) { return ["()"]; } const combinations = new Set(); let previousCombinations = generateParentheses(n-1); for (let prev of previousCombinations) { for (let i=0; i < prev.length; i++) { combinations.add(prev.slice(0, i+1) + "()" + prev.slice(i+1)); } } return [...combinations]; } `"See full answer

    Software Engineer
    Data Structures & Algorithms
    +3 more
  • 🧠 Want an expert answer to a question? Saving questions lets us know what content to make next.

  • Walmart Labs logoAsked at Walmart Labs 
    +37

    "#include // Naive method to find a pair in an array with a given sum void findPair(int nums[], int n, int target) { // consider each element except the last for (int i = 0; i < n - 1; i++) { // start from the i'th element until the last element for (int j = i + 1; j < n; j++) { // if the desired sum is found, print it if (nums[i] + nums[j] == target) { printf("Pair found (%d, %d)\n", nums[i], nums[j]); return; } } } // we reach here if the pair is not found printf("Pair not found"); } "

    Gundala tarun,cse2020 V. - "#include // Naive method to find a pair in an array with a given sum void findPair(int nums[], int n, int target) { // consider each element except the last for (int i = 0; i < n - 1; i++) { // start from the i'th element until the last element for (int j = i + 1; j < n; j++) { // if the desired sum is found, print it if (nums[i] + nums[j] == target) { printf("Pair found (%d, %d)\n", nums[i], nums[j]); return; } } } // we reach here if the pair is not found printf("Pair not found"); } "See full answer

    Software Engineer
    Data Structures & Algorithms
    +5 more
  • "Started at 10.55 Clarifying questions: This is what I understand from a telemedicine platform -> A platform where users can get advice on medication over the telephone, is this correct? Does the retail company also sell medicines? Is the user aware that the telemedicine platform and the retail company are connected, and can either of the platforms use his data? Is the user engaging with the platform directly, or is there an agent to who he is speaking to via call/text? Does the"

    Anubhav A. - "Started at 10.55 Clarifying questions: This is what I understand from a telemedicine platform -> A platform where users can get advice on medication over the telephone, is this correct? Does the retail company also sell medicines? Is the user aware that the telemedicine platform and the retail company are connected, and can either of the platforms use his data? Is the user engaging with the platform directly, or is there an agent to who he is speaking to via call/text? Does the"See full answer

    Product Manager
    Product Strategy
    +2 more
  • "Total volume of the swimming pool, let's say it's a standard 50m x 25 m x 2m =2500 m3 = 2.5 million litter standard water horse water flow rate is 17 liter per min. So, 2.5 m / 17 =147,059 min"

    onering2ruleall - "Total volume of the swimming pool, let's say it's a standard 50m x 25 m x 2m =2500 m3 = 2.5 million litter standard water horse water flow rate is 17 liter per min. So, 2.5 m / 17 =147,059 min"See full answer

    Product Manager
    Estimation
  • Walmart Labs logoAsked at Walmart Labs 
    Product Manager
    Behavioral
    +5 more
  • Walmart Labs logoAsked at Walmart Labs 
    Video answer for 'Merge k sorted linked lists.'
    +6

    "A much better solution than the one in the article, below: It looks like the ones writing articles here in Javascript do not understand the time/space complexity of javascript methods. shift, splice, sort, etc... In the solution article you have a shift and a sort being done inside a while, that is, the multiplication of Ns. My solution, below, iterates through the list once and then sorts it, separately. It´s O(N+Log(N)) class ListNode { constructor(val = 0, next = null) { th"

    Guilherme F. - "A much better solution than the one in the article, below: It looks like the ones writing articles here in Javascript do not understand the time/space complexity of javascript methods. shift, splice, sort, etc... In the solution article you have a shift and a sort being done inside a while, that is, the multiplication of Ns. My solution, below, iterates through the list once and then sorts it, separately. It´s O(N+Log(N)) class ListNode { constructor(val = 0, next = null) { th"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Walmart Labs logoAsked at Walmart Labs 
    Software Engineer
    Data Structures & Algorithms
    +4 more
  • Walmart Labs logoAsked at Walmart Labs 
    +1

    "How do you define Retention? Let’s assume a user comes back tomorrow and scroll for a 10s or so Do we mean to improve the daily retention or weekly/monthly retention? Take a call I think we should look at the weekly retention as checking LinkedIn daily could be a cumbersome task for some and daily retention data may have frequent fluctuations due to several reasons such as professionals are too busy to check LinkedIn on a daily basis Has retention dropped recently, or do we just need to"

    Shashi R. - "How do you define Retention? Let’s assume a user comes back tomorrow and scroll for a 10s or so Do we mean to improve the daily retention or weekly/monthly retention? Take a call I think we should look at the weekly retention as checking LinkedIn daily could be a cumbersome task for some and daily retention data may have frequent fluctuations due to several reasons such as professionals are too busy to check LinkedIn on a daily basis Has retention dropped recently, or do we just need to"See full answer

    Product Manager
    Product Design
    +2 more
  • Walmart Labs logoAsked at Walmart Labs 

    "SQL databases are relational, NoSQL databases are non-relational. SQL databases use structured query language and have a predefined schema. NoSQL databases have dynamic schemas for unstructured data. SQL databases are vertically scalable, while NoSQL databases are horizontally scalable."

    Ali H. - "SQL databases are relational, NoSQL databases are non-relational. SQL databases use structured query language and have a predefined schema. NoSQL databases have dynamic schemas for unstructured data. SQL databases are vertically scalable, while NoSQL databases are horizontally scalable."See full answer

    Software Engineer
    Technical
    +4 more
  • "clarifying questions: Particular location? Small town? Big town? Self- checkout vs. associate checkout? Weekly operating hours? Super-center vs small format? Competitive landscape? Store sales? Are we talking division 1 or adding health and wellness? Does the store have a vision center? Hair… nails … bank etc. Let’s say we agree that this is a super center in a suburb that wants to focus on converting to full self checkout. I’d have to look further into exact times with my data science team t"

    Michael P. - "clarifying questions: Particular location? Small town? Big town? Self- checkout vs. associate checkout? Weekly operating hours? Super-center vs small format? Competitive landscape? Store sales? Are we talking division 1 or adding health and wellness? Does the store have a vision center? Hair… nails … bank etc. Let’s say we agree that this is a super center in a suburb that wants to focus on converting to full self checkout. I’d have to look further into exact times with my data science team t"See full answer

    Estimation
    Product Design
  • Walmart Labs logoAsked at Walmart Labs 
    +2

    "This could be done using two-pointer approach assuming array is sorted: left and right pointers. We need track two sums (left and right) as we move pointers. For moving pointers we will move left to right by 1 (increment) when right sum is greater. We will move right pointer to left by 1 (decrement) when left sum is greater. at some point we will either get the sum same and that's when we exit from the loop. 0-left will be one array and right-(n-1) will be another array. We are not going to mo"

    Bhaskar B. - "This could be done using two-pointer approach assuming array is sorted: left and right pointers. We need track two sums (left and right) as we move pointers. For moving pointers we will move left to right by 1 (increment) when right sum is greater. We will move right pointer to left by 1 (decrement) when left sum is greater. at some point we will either get the sum same and that's when we exit from the loop. 0-left will be one array and right-(n-1) will be another array. We are not going to mo"See full answer

    Software Engineer
    Data Structures & Algorithms
    +2 more
  • Walmart Labs logoAsked at Walmart Labs 

    "I prefer to build a team of complementary skills than being skewed on one aspect. And generally avoid an all rockstar team. Technically, this means we will have atleast one rockstar for one skill and it is acceptable if that rockstar is just an avg performer on other skills Which person gets indexed more on which skill is a time to time exercise depending on needs of the org, product charter and career aspirations of the person."

    RestlessMonk - "I prefer to build a team of complementary skills than being skewed on one aspect. And generally avoid an all rockstar team. Technically, this means we will have atleast one rockstar for one skill and it is acceptable if that rockstar is just an avg performer on other skills Which person gets indexed more on which skill is a time to time exercise depending on needs of the org, product charter and career aspirations of the person."See full answer

    Product Manager
    Behavioral
  • "Below data was given in a an excel. Data of 6 weeks, at a weekly level of COVID samples collected and tested Age Group, Population size, # tested, # positive, gender My approach: Tried to understand the trend of positivity rate of each group across weeks and cumulative level There is no variation across weeks, and each cohort exhibited similar pattern in all the weeks. So looked at cumulative data of 6 weeks. No clear goal/objective set by the interviewer for vaccine distributio"

    RestlessMonk - "Below data was given in a an excel. Data of 6 weeks, at a weekly level of COVID samples collected and tested Age Group, Population size, # tested, # positive, gender My approach: Tried to understand the trend of positivity rate of each group across weeks and cumulative level There is no variation across weeks, and each cohort exhibited similar pattern in all the weeks. So looked at cumulative data of 6 weeks. No clear goal/objective set by the interviewer for vaccine distributio"See full answer

    Product Manager
    Analytical
  • Product Design
  • "The primary goal of the adtech platform is to precisely target your audience online, that can reap great rewards for your marketing and revenue objectives. For that we have to define Program Success Metrics. Here are six key metrics for technology companies used by leading advertising providers such as Facebook and Google use: Impressions: How many unique and total viewership of the ad Exposure: the average number of times an ad is served per person. Engagement Rate: how many click t"

    Pradeep kumar S. - "The primary goal of the adtech platform is to precisely target your audience online, that can reap great rewards for your marketing and revenue objectives. For that we have to define Program Success Metrics. Here are six key metrics for technology companies used by leading advertising providers such as Facebook and Google use: Impressions: How many unique and total viewership of the ad Exposure: the average number of times an ad is served per person. Engagement Rate: how many click t"See full answer

    Analytical
  • Walmart Labs logoAsked at Walmart Labs 
    +16

    " O(n) time, O(1) space from typing import List def maxsubarraysum(nums: List[int]) -> int: if len(nums) == 0: return 0 maxsum = currsum = nums[0] for i in range(1, len(nums)): currsum = max(currsum + nums[i], nums[i]) maxsum = max(currsum, max_sum) return max_sum debug your code below print(maxsubarraysum([-1, 2, -3, 4])) `"

    Rick E. - " O(n) time, O(1) space from typing import List def maxsubarraysum(nums: List[int]) -> int: if len(nums) == 0: return 0 maxsum = currsum = nums[0] for i in range(1, len(nums)): currsum = max(currsum + nums[i], nums[i]) maxsum = max(currsum, max_sum) return max_sum debug your code below print(maxsubarraysum([-1, 2, -3, 4])) `"See full answer

    Software Engineer
    Data Structures & Algorithms
    +4 more
Showing 21-40 of 51