Fiz uma entrevista na empresa Walmart Global Tech.
Entrevista
Interview started with recruiter phone screening followed by 5 rounds of interviews. Interviewers were knowledgeable and professional.
Touched in depth concepts, Questions were require indepth understanding of Javascript concepts and algorithm based problems
Perguntas de entrevista [1]
Pergunta 1
Protypical inhertence and closures and problems had on these concepts
Fiz uma entrevista na empresa Walmart Global Tech.
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Fiz uma entrevista na empresa Walmart Global Tech.
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
