Open In App

Walmart Labs Interview Experience | July 2019

Improve
Improve
Like Article
Like
Save
Share
Report

Walmart Labs Interview Questions July 2019

There were 1 coding round and 4 F2F interviews. This was for Software Developer Position at the Bangalore Office. Each round was an elimination round.

Coding Round :

We were presented with a set of 5 DS/Algo questions and were asked to implement 3 questions from them. We were expected to write the Full Function Code with test cases.

Question 1 https://www.codechef.com/problems/ONEKING

Question 2 https://www.geeksforgeeks.org/problems/maximum-tip-calculator/0

Question 3 https://www.geeksforgeeks.org/connect-nodes-at-same-level-with-o1-extra-space/

Question 4 https://www.geeksforgeeks.org/recursively-remove-adjacent-duplicates-given-string/

Question 5 https://www.geeksforgeeks.org/print-all-pairs-with-given-sum/

Problem Solving Round 1 :

I was asked about the projects I had been involved in and the technologies I have worked with. The interviewer went onto explain his projects and the team he works in.

I was asked 2 DS/Algo questions in this round was told to write the full function code for both of them. Make sure you prepare Time and Space Complexity properly.

Question 1 https://www.geeksforgeeks.org/shortest-distance-two-cells-matrix-grid/

Question 2 https://www.geeksforgeeks.org/next-higher-number-using-atmost-one-swap-operation/

I was able to solve and code both of them. Tip: – Don’t rush into solutions. Take your time to think about all the edge cases and then proceed with your solution.

Problem Solving Round 2:

I was asked 2 DS/Algo questions in this round. I was asked to write full code for the 1st question and pseudo code for the 2nd.

Question 1 https://www.geeksforgeeks.org/word-ladder-length-of-shortest-chain-to-reach-a-target-word/

Question 2 https://www.geeksforgeeks.org/find-the-ordering-of-tasks-from-given-dependencies/

I was able to solve the 1st question completely and explained my approach for the 2nd one. Due to time constraints, I wasn’t able to write the code, but the Interviewer was very impressed with the way I approached it. Tip: – Even if you are not able to code, make sure you try and explain your approach.

Design Round

I was asked to Design a Logging System

We have a Java Application that is continuously running and generating logs of different severity? ?Info, Warning, Debug, etc.

Level 1- Information Logs

Level 2 – Warning (Will Contain both Warning and Info Logs)

Level 3 – Debug (Will Contain Debug Logs in addition to Level 2 )

We have a configuration file that has some rules for the actions to be taken depending on the type of Log we encounter.

Info Logs –  Print on Console.

Debug Logs – Write to a File.

I was first asked a High-Level Design of the entire system. An abstract view of the entire system. Various components and how they interact with each other.

Since Debug Logs contains Info Logs, How do we make sure we don’t maintain duplicate entries while dealing with all the logs.? Since we need to write the Debug Logs to a file, how can we efficiently manage the File Write operations? Which data structure would best be suited for this? , etc.

https://docs.oracle.com/cd/E23095_01/Platform.93/ATGProgGuide/html/s1002designingloggingsystems01.html

Tip – Make sure you try and clarify all the doubts upfront and understand the question clearly before you proceed with your design. Remember there is no right or wrong answer to a Design Question. It’s either good design or a bad design. Make sure you don’t keep quiet, try and keep discussing your approach with the interviewer.

I wasn’t able to qualify for the next round. !!


Advice:
Prepare all the data structures well. Dynamic Programming seems to be one of their favorite topics. Try reading about how systems are designed. Clear your concepts on Java, Class Design, LLD. The interviewer will help by giving hints whenever u will be stuck at any problem, so do not hesitate to ask your doubts.

Be patient !! It’s going to be a long day of brain-storming. All the best. !!


Last Updated : 22 Jul, 2019
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads