Walmart Software Engineer III Interview Questions, Process, and Tips

Q1. Given a tree and a node, print all ancestors of Node
Ans. 
Given a tree and a node, print all ancestors of Node
• Start from the given node and traverse up the tree

• While traversing, keep track of the parent nodes

• Print the parent nodes as you traverse up until reaching the root
Answered by AI
View 1 more answer
Q2. What would be the ideal data structure to represent people and friend relations in facebook
Ans. 
Graph
• Use a graph data structure to represent people as nodes and friend relations as edges

• Each person can be represented as a node with their unique identifier

• Friend relations can be represented as directed edges between nodes

• This allows for efficient traversal and retrieval of friend connections
Answered by AI
View 2 more answers
Q3. Reverse a linked list
Ans. 
Reverse a linked list
• Iterate through the linked list and change the direction of the pointers

• Use three pointers to keep track of the previous, current, and next nodes

• Recursively reverse the linked list
Answered by AI
Add your answer

Q1. Code to determine the median of datapoints present in two sorted arrays. Most efficient algo
Ans. 
Code to find median of datapoints in two sorted arrays
• Use binary search to find the median index

• Divide the arrays into two halves based on the median index

• Compare the middle elements of the two halves to determine the median
Answered by AI
Add your answer

Q1. Discussion about projects, and previous experience
Add your answer
Q2. Custom implementation of stack where there are two additional methods that return the min and max of the elements in the stack
Ans. 
Custom stack with methods to return min and max elements
• Implement a stack using an array or linked list

• Track the minimum and maximum elements using additional variables

• Update the minimum and maximum variables during push and pop operations

• Implement methods to return the minimum and maximum elements
Answered by AI
Add your answer

Q1. There are 3 technical rounds
Add your answer

Q1. Coding problems, Spring, DSA
Add your answer

Data structures and algorithms, leetcode medium level.

Java with data structures and algorithms round

Q1. Basic hr questions
Add your answer