Detailed insights from real candidates who interviewed at top tech companies
First round was two DP problems. The first problem was similar to Combination Sum, but with unique elements instead of duplicates. The second problem was Target Sum.Second round focused on LLD and HLD, where I was asked to design BookmyShow and draw entities and relationships. I cleared this round.T...
I interviewed for a Software Staff Engineer position at Walmart in Bangalore and received an offer, which I ultimately declined. The interview process spanned multiple rounds, including Data Structure...
My interview journey at Walmart started with an in-person DSA round, which was part of a hiring drive. I was presented with two problems. The first was Copy List with Random Pointer. I initially implemented the hashmap-based approach, but the interviewer challenged me to find an O(1) space complexit...
I interviewed for a Software Engineer III role at Walmart Global Tech in India. I was rejected after the first round, which consisted of two LeetCode-style coding questions: Find the Celebrity and Med...
Role: Software Engineer IIILocation : IndiaStatus: ❌ Rejected after Round 1Mode: Online Technical Interview🔹 Round 1: DSA + Problem-SolvingTwo LeetCode-style coding questions:1️⃣ Find the Celebrityhttps://leetcode.com/problems/find-the-celebrity/2️⃣ Median from Data Streamhttps://leetcode.com/probl...
I share my learning journey and solutions for LeetCode 480: Sliding Window Median, first using a brute-force approach and then optimizing it with the SortedList data structure. I note that this exact ...
🚀 LeetCode 480: Sliding Window Median – My Learning Journey & a Game-Changing Data Structure Today I solved https://leetcode.com/problems/sliding-window-median/ and learned something super useful that I wanted to share with the community — especially if you're preparing for interviews or optimizing...
I interviewed for a Staff Android Design Engineer role at Walmart, undergoing two rounds of interviews focusing on past experiences, Android internals, and future tech views, ultimately resulting in a...
Appeared for a Staff Android Design EngineerRound 1: Hiring Manager Round- Questions on Previous experiences..- Deep dive into current work- View on GenAi, future of mobile- Reason looking out for ChangeRound 2: Android QuestionsThis had a mix of question on basics of Android and some snippets were ...
I recently interviewed at Walmart for a Software Engineer III (Java Backend Developer) role. I successfully cleared the DSA round and performed well in the Java and Low-Level Design round, and I am cu...
Round 1: DSAInterviewer: Senior Software Engineer @ WalmartQuick intro, then directly moved to problem solving.Questions:Coin Change (Dynamic Programming)Course Schedule (Graph / Topological Sort)✅ Solved both within time. Verdict: Cleared.Round 2: Java + LLDInterviewer: Staff Software Engineer @ Wa...
I interviewed for a Software Engineer III role at Walmart Global Tech in Bangalore, which involved three in-person rounds focusing on DSA, Low-Level/System Design, and Hiring Manager discussions. I su...
🚀 Walmart Global Tech – Software Engineer III Interview Experience (Bangalore) Process: Referral My Experience: 3 years as SDE-II Total Rounds: 3 (all in-person on-site, wrapped up in a single day) 📌 Round 1 – DSA Coding Round Problem Statement: The round focused on medium to medium-hard level DS...
💡 Tips for Preparation DSA: Focus on trees, graphs, sliding window, two pointers, and binary search. Practice from LeetCode (Medium/Hard) and be comfortable explaining brute force → optimized approach. System Design (LLD + HLD): Pick common design problems like cache, notification system, book...
🛒 walmart_move_zeros_max_subarray Move Zeros – https://leetcode.com/problems/move-zeroes/ Maximum Subarray – https://leetcode.com/problems/maximum-subarray/ 🛒 walmart_sde3_urvashi_dec2024 House Robber II – https://leetcode.com/problems/house-robber-ii/ Subarray Sum Equals K – https://leetcode.com...
No Online assessment. Round 1 (DSA round) : 2 Leetcode medium questions. graph DFS binary search (min of max). Round 2 (Java/LLD) : LLD (Database) of ticket booking app. Some questions on Collections library, Spring boot and Java basic questions Round 3 (HLD) : system desin for E-comme...
Despite a challenging interview process with Walmart, the candidate was rejected. The interview included a DSA round with two problems and an LLD + HLD round with a Jukebox problem, but the second rou...
Round 1: DSA (60 mins)They schedule this round but nobody joined I kept waiting for an hour. Reached out to recruiter via mail and phone, they didn't respond. But after half an hour she called and apologized and rescheduled it for next day.1. Binary tree problem where two players are playing one sta...
3K+ Downloads
One of its unique features is an automated coding contest reminder, which sets alarms for upcoming coding contests on popular platforms like CodeChef, CodeForces, and LeetCode, without the need for user input. This feature ensures that users never miss a coding contest and can stay updated with the latest coding challenges.
