Walmart Global Tech India SDE2(Fresher) Oncampus Interview Questions
Summary
I underwent an on-campus interview process for an SDE2 (Fresher) role at Walmart Global Tech India, which comprised three distinct rounds: a technical skills assessment, a data structures and algorithms challenge, and a final HR discussion.
Full Experience
My interview process for the SDE2 (Fresher) role at Walmart Global Tech India was an on-campus hiring event for the 2023 batch, consisting of three rounds conducted over Zoom.
The first round was a technical assessment, lasting 45-50 minutes. It began with a self-introduction, followed by a brief discussion about one of my internship projects, a React application focused on frontend development. The interviewer delved deeper into my work, asking counter-questions about my process. Following this, I was given a coding question to validate a list of IPv4 addresses, returning a boolean array. I explained my logic, coded it, and then addressed potential error handling and input validations. The round concluded with basic Computer Networks questions, like 'what happens when you search google.com on your web browser,' and discussions on the differences and use cases of ArrayList vs. LinkedList, BST vs. LinkedList, and abstract classes vs. interfaces.
The second round, lasting another 45-50 minutes, focused on Data Structures and Algorithms. I mentioned Trees as my most comfortable data structure. The interviewer then presented a variation of the LeetCode problem 'Two Sum IV - Input is a BST', asking me to find the count of pairs with a given sum k. I initially proposed an O(N) time and O(N) space solution using inorder traversal. Upon being prompted for a space optimization, I offered an O(Nh) time and O(h) space complexity solution, which satisfied the interviewer, and I coded both. Subsequently, I tackled the 'Gas Station' problem from LeetCode, explaining my O(n) time and O(1) space approach and coding it out.
The third and final round was an HR discussion, approximately 40 minutes long. After a brief chat about my day and another self-introduction, we extensively discussed my internship projects, including challenges I faced and how I overcame them. The interviewer then explored my strengths and weaknesses. A particularly memorable part was when she asked about something I wasn't happy about and how my life would be if I had what I expected. I shared my journey from getting ECE due to JEE Mains scores to how it fueled my passion for the CS domain, which she received very positively.
Interview Questions (7)
Given a list of IPv4 addresses, check if each one is valid. Return a boolean array where array[i] is true if the i-th IPv4 address is correct, false otherwise. The solution should also handle possible errors and input validations.
Explain what happens when you search google.com on your web browser.
Discuss the differences between ArrayList and LinkedList, and provide use cases for each.
Discuss the differences between BST (Binary Search Tree) and LinkedList, and provide use cases for each.
Discuss the differences between abstract classes and interfaces, and provide use cases for each.
There are n gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to its next station (i + 1) % n. You begin the journey with an empty tank at one of the gas stations. Return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1. If there exists a solution, it is guaranteed to be unique.
Preparation Tips
Based on my experience, I'd suggest the following for aspiring candidates:
- Be confident and clear when explaining your approaches, ensuring no hesitation in your speech.
- For HR questions, be genuine and authentic, as interviewers can discern dishonesty.
- LeetCode is highly effective for DSA preparation.
- Thoroughly review Computer Science fundamentals, including Computer Networks, Database Management Systems, Operating Systems, and Object-Oriented Programming.