# Walmart Lab Interview Experience | Set 11 (On-Campus)

500 students were selected for online test and cgpa criteria was 7.0 cgpa. Online Test The online test was conducted on HackerEarth. Three questions were asked and we were given 90 minutes to solve three questions. 1. game of stones. Alice and bob are playing a game. N stones are placed and a person can pick less than or equal to m stones at a time. First turn is of Alice and both play optimally. Ex n= 6 stones and m is 4 Alice will pick 1 stone in start and Otherwise bob wins. Range of n â€“ 10^9 Solve it in O (1) complexity. We have to tell who will win the game. 2. There is a number system consisting of numbers from 0 to 9 and alphabets A-Z and a-z such that 0 < 1 < 2 < 3. . .. 9 < A <B < C < D â€¦. <Z and a=A, b=B â€¦â€¦ z=Z. You are given an array of strings and you have to find the sum of the strings in the array.
```Ex â€“ 01Z + 123 = 142.
abC + 001 = abd.```
Output string should contain only numbers and lowercase alphabets. 3. we are given an array of n integers and we are given a number k and we have to break array into k possible subsets and we have to find the maximum sum of these subsets. Then from the possible maximum values print the minimum of all the maximum values obtained.
```Ex; - n=3, k=2
Arr = {1,2,3}```