Walmart Labs Interview Questions

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

Komal S. - "a. Sort the array elements. b. take two pointers at index 0 and index Len-1; c. if the sum at the two pointers is target; break and return the pair d. if the sum is smaller, then move left pointer by 1 e. else move right pointer by 1; run the logic till the target is met or right pointer crosses the left pointer."See full answer

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

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

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

Vishnu G. - "This is a classic strategic dilemma, but the answer for Walmart, given its core business model and strengths, is quite clear: Invest in boosting dish soap production. Here's why: Proven Success: Dish soap is Walmart's top product with strong, established sales. Scaling leverages existing, efficient supply chains and customer demand. Core Competency: Walmart excels at high-volume, low-margin household goods. This aligns perfectly with their business model and customer base. **L"See full answer

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

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

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

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

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

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

Yash G. - " import java.util.*; enum RideType { SHARED, PRIVATE, EXECUTIVE } enum VehicleType { SEDAN, SUV, HATCHBACK, LUXURY, VAN, ELECTRIC, AUTO_RICKSHAW, BIKE_TAXI } final class Location { private final double logitude; private final double latitude; private final String location; public Location(double logitude, double latitude, String location){ this.logitude = logitude; this.latitude = latitude; this.l"See full answer

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

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

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