J'ai postulé en ligne. J'ai passé un entretien chez Walmart Global Tech (Heredia) en mai 2026
Entretien
The process included several stages. The first interview was a 30-minute conversation with recruiting. The second interview was a one-hour technical interview focused mainly on technical questions related to the role. The final technical interview lasted around one hour and included several participants. During that session, I completed a small live coding exercise in C# focused on problem-solving and logic, followed by a system design exercise where I had to propose the architecture for a system. After that, they asked additional technical questions. The last stage was an in-person behavioral interview focused mainly on communication, experience, and culture fit.
Questions d'entretien [5]
Question 1
Explain what Dependency Injection is in .NET and why it is useful.
The interview process was smooth and well organized. It started with an initial recruiter screening, followed by a technical assessment focused on coding, problem-solving, Java backend concepts, data structures, and system design basics. The interviewer was professional, explained the expectations clearly, and gave time to discuss my approach before coding.
Questions d'entretien [1]
Question 1
I explained my experience building Java and Spring Boot microservices, developing REST APIs, working with databases, writing unit and integration tests, and supporting production backend systems. I also discussed how I used caching, query optimization, and CI/CD pipelines to improve performance and reliability.
3 rounds 1st round was technical assessment using hacker rank. 2 different questions one for mySQL and one using Python. 2nd round is System Design and 3rd round is a behavioral interview with manager.
Questions d'entretien [1]
Question 1
1. (MySQL) You are given a table, BST, containing two columns: N and P, where N represents the value of a node in Binary Tree, and P is the parent of N. Write a query to find the node type of Binary Tree ordered by the value of the node. Output one of the following for each node:
Root: If node is root node.
Leaf: If node is leaf node.
Inner: If node is neither root nor leaf node.
2. (Python)The Missing Number problem requires finding the only number missing from an array nums containing ( n ) distinct numbers in the range ([0, n]). The problem has an efficient solution with ( O(n) ) runtime and ( O(1) ) extra space.
