Ho presentato la mia candidatura tramite un'agenzia di reclutamento personale. La procedura ha richiesto più di una settimana. Ho sostenuto un colloquio presso Walmart Global Tech (Bengaluru) nel mese di apr 2021
Colloquio
I interviewed for FullStack dev. The hiring process was really fast and smooth. 4 rounds. Took about 10-15 days in total.
First Round: (Javascript & DS)
Basics and deep dive in Javascript.
Open ended problem in which I could use any data structure and implement the whole solution with the data structure too.
Second Round (Nodejs, System Dessign & Design patterns)
Similar approach as first round, deep dive into Node.js and event loop.
A lot of questions on best practices & API design
Design pattern questions.
Security attacks and prevention techniques.
All types of strategies of session management.
Gateway & Loadbalancer questions in detail
Dependency injection in detail.
Third Round (Managerial round)
This was an open discussion. Evaluation of soft skills and technical skills in the higher level.
Forth Round (HR discussion)
All the interviewers were really humble and great people. I loved interacting with them.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Walmart Global Tech nel mese di mar 2025
Colloquio
Recruiter had approached me for a hiring drive. had 3 rounds -
1. DSA (Leetcode medium)
2. Java/LLD (java concepts)
3. Hiring Manager.
Each round was an elimination round. Interview happened virtually.
Domande di colloquio [2]
Domanda 1
Round 1.
Tweaked version of this - https://www.geeksforgeeks.org/problems/bottom-view-of-binary-tree/1
Given a tree, find bottom view -
1
/ \
3 2
/ \ / \
4 5 6 7
Expected output - 4 3 5 6 2 7 (Not 4 3 6 2 7)
Round 2 -
Core Java theory questions -
1. how to make a class immutable? What is the use case?
2. What is the difference between deep copy and shallow copy.
3. how do you declare a singleton class? Write code.
4. Consider below statements -
String s1 = "abc"
String s2 = new String("abc")
String s3 = “abc”
what is output of
s1==s2
s1==s3
5. set s;
s.put(new Student("a", 1))
s.put(new Student("b", 2))
s.put(new Student("a", 1))
what is the size of s
6. how are collisions handled in hashmap?
7. worst case time complexity of inserting element to hashmap
8. using multithreading write program to print output numbers from 1 to 100 even numbers should execute by 1 thread and odd by others.
order of numbers 1 - 100 should be maintained
Ho presentato la mia candidatura online. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Walmart Global Tech (San Jose, CA) nel mese di set 2021
Colloquio
Typical phone screen. Scheduler informed me about an hour long initial phone screen.
Interview was stated to have an introduction and a simple hackerrank exercise to evaluate thought process and make further decisions.
Domande di colloquio [2]
Domanda 1
Asked popular Leetcode question based on cache (not LRU).
