Walmart interview experience Real time questions & tips from candidates to crack your interview

SDE - 2

Walmart
upvote
share-icon
2 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Journey
The personal journey from starting to getting placed in a product company can be an exciting and challenging process. Here is a general overview of the steps involved in this journey: 1. Self-Assessment and Goal Setting: The first step is to assess your skills, interests, and goals. Determine what kind of product company you aspire to work for and what roles or positions align with your strengths and ambitions. This self-reflection will help you chart a clear path towards your desired destination. 2. Acquiring Relevant Skills and Knowledge: Once you have identified the skills required for your target role, you need to acquire them. This may involve pursuing formal education, enrolling in relevant courses or training programs, or gaining practical experience through internships or personal projects. Continuously learning and developing your skills will increase your chances of getting noticed by product companies. 3. Building a Professional Network: Networking plays a crucial role in finding job opportunities. Attend industry events, join online communities, participate in forums or social media groups related to product management, and connect with professionals working in your desired field. Building meaningful relationships and leveraging your network can lead to valuable referrals and insider information about job openings. 4. Tailoring Your Resume and Cover Letter: Craft a targeted resume and cover letter that highlight your relevant skills, experiences, and achievements. Tailor each application to the specific company and position you are applying for, showcasing how your skills align with their requirements. Make sure to emphasize any relevant projects or internships you have completed, demonstrating your ability to contribute to a product-focused environment. 5. Job Search and Application: Begin your job search by exploring various resources, such as online job boards, company websites, professional networking platforms, and recruitment agencies. Regularly check for job openings, submit applications, and follow up if necessary. Stay persistent and proactive throughout the process, as finding the right opportunity may take time and effort. 6. Preparing for Interviews: If your application stands out, you may be invited for an interview. Prepare for these interviews by researching the company, its products, and its industry. Practice common interview questions and think of specific examples from your experiences that demonstrate your skills and problem-solving abilities. Showcase your passion for product development and ability to contribute to the company's goals. 7. Interviewing and Evaluation: During the interview process, you may go through multiple rounds, including phone screens, technical assessments, and in-person or virtual interviews. Be confident, and articulate, and demonstrate your knowledge and skills effectively. It's also essential to evaluate whether the company and its culture align with your values and career aspirations. 8. Negotiating and Accepting an Offer: If you successfully navigate the interview process and receive an offer, take the time to evaluate it carefully. Consider salary, benefits, company culture, growth opportunities, and work-life balance. If necessary, negotiate the terms of the offer to ensure they align with your expectations and goals. 9. Onboarding and Integration: Once you accept an offer, prepare for your new role by familiarizing yourself with the company's products, processes, and methodologies. Be open to learning from your colleagues and take the initiative to understand the company's vision and objectives. Adapt quickly to the new environment and build relationships with your teammates, as effective teamwork is often crucial in a product company. Remember, this journey is unique for each individual, and the timeline and specific steps may vary. Persistence, continuous learning, and adaptability are key attributes that can greatly contribute to your success in obtaining a position in a product company.
Application story
They came for on-campus hire, and people who met the eligibility criteria were given a chance to attend their online rounds.
Why selected/rejected for the role?
Since I had a data science profile, and they were looking for software roles, the expectations did align.
Preparation
Duration: 2 months
Topics: DSA, OOPS, System Design, Machine Learning, Basic Aptitude, Dynamic Programming
Tip
Tip

Tip 1: Be extremely thorough with your resume 
Tip 2: Consistency is key, Practice at least 5 questions daily in programming
Tip 3: Before the interview, know about the company and try to include your knowledge about the company in your discussion with the panel

Application process
Where: Campus
Eligibility: 7.5 CGPA
Resume Tip
Resume tip

Tip 1: Be thorough with DP, because most DP questions are asked 
Tip 2: Be strong in OOPS and real-life examples of it

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 mins
Interview date30 Jun 2022
Coding problem3

It happend in the morning from 10:30-12:00, it was conducted in hackerrank platform.

1. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
IBMVisaOYO

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Problem approach

1. Create an array `dp` of the same length as the input array, initialized with 1s.
2. Iterate over the input array from left to right, considering each element `nums[i]`.
3. For each element `nums[i]`, iterate over all the previous elements `nums[j]` (where `j` ranges from 0 to `i-1`).
4. If `nums[j]` is smaller than `nums[i]`, update `dp[i]` as the maximum value between `dp[i]` and `dp[j] + 1`. This means that if we can extend the LIS ending at `nums[j]` with `nums[i]`, we can form a longer LIS ending at `nums[i]`.
5. Finally, the maximum value in the `dp` array is the length of the longest increasing subsequence.

Try solving now

2. House Robber

Moderate
26m average time
0/80
Asked in companies
PayPalExpedia GroupGoldman Sachs

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

Problem approach

Create a DP vector of size n+1 and value -1 and variables pick and not pick. 
Create a recursive function 
If n < 0 possible stolen value is 0.
If n = 0 possible stolen value is hval[0].
If DP[n] != -1 possible stolen value is DP[n].
Set pick as pick = hval[n] + maxLoot(hval, n-2, DP) 
Set not pick as notPick = maxLoot(hval, n-1, DP).
Set Dp[n] = max(pick, notPick) and return DP[n].

Try solving now

3. Kth Smallest Element

Moderate
0/80
Asked in companies
Wells FargoFacebookWalmart

You are given a square matrix ‘NxN’ rows and columns. The matrix is sorted, meaning all rows and columns of the matrix are sorted in ascending order. You are also given an integer ‘K’, and your task is to find the ‘K’th smallest element in the sorted order.

For example:
You are given ‘mat’ = [[1, 2, 2,], [3, 3, 4], [5, 6 ,7]]] and ‘K’ = 5, the elements of the matrix are [1, 2, 2, 3, 3, 4, 5, 6, 7], the 5th smallest element in the matrix is 3. Hence the answer is 3.
Problem approach

Follow the given steps to solve the problem:

Sort the input array in the increasing order
Return the element at the K-1 index (0 – Based indexing) in the sorted array

Try solving now
02
Round
Medium
Video Call
Duration60 mins
Interview date9 Jul 2022
Coding problem4

The round lasted for up to 1 hour duration.

1. DBMS Questions

Explain Joins

Difference between primary key and secondary key

2. Find The Repeating And Missing Number

Easy
10m average time
90% success
0/40
Asked in companies
AmazonSamsungPhonePe

You are given an array 'nums' consisting of first N positive integers. But from the N integers, one of the integers occurs twice in the array, and one of the integers is missing. You need to determine the repeating and the missing integer.

Example:
Let the array be [1, 2, 3, 4, 4, 5]. In the given array ‘4’ occurs twice and the number ‘6’ is missing.
Problem approach

Traverse all elements and put them in a hash table. Element is used as the key and the count of occurrences is used as the value in the hash table. 
Traverse the array again and print the element with count 1 in the hash table.

Try solving now

3. System Design question

Build a movie booking ticketing system

4. OOPs Question

what are OOPS concepts? explain 4 pillars of oops

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 2
3 rounds | 6 problems
Interviewed by Walmart
3112 views
1 comments
0 upvotes
company logo
SDE - 2
4 rounds | 4 problems
Interviewed by Walmart
2002 views
1 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Walmart
2810 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 13 problems
Interviewed by Walmart
2127 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
6766 views
1 comments
0 upvotes
company logo
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
5281 views
0 comments
0 upvotes
company logo
SDE - 2
4 rounds | 7 problems
Interviewed by Dunzo
3164 views
0 comments
0 upvotes