Filter interviews by
HashMap is implemented using an array of linked lists to store key-value pairs.
HashMap consists of an array of buckets, each containing a linked list of key-value pairs.
Hashing function is used to determine the index of the bucket where a key-value pair will be stored.
Collision resolution techniques like chaining or open addressing are used to handle collisions.
HashMap allows null keys and values, but only one null key
A date picker in JavaScript allows users to select a date from a calendar interface.
Use HTML input element with type 'date' for modern browsers
For older browsers, use a JavaScript library like jQuery UI Datepicker
Implement validation to ensure selected date is within acceptable range
Implement a stack using a queue data structure.
Use two queues to simulate a stack.
Push operation: Enqueue the element to queue 1.
Pop operation: Dequeue all elements from queue 1 to queue 2, dequeue the last element from queue 2.
Top operation: Return the front element of queue 1.
Empty operation: Check if both queues are empty.
Use two threads to print numbers 1 to 10, with Thread A printing odd numbers and Thread B printing even numbers.
Create two threads, one for odd numbers and one for even numbers
Use a shared variable to keep track of the current number being printed
Use synchronization mechanisms like mutex or semaphore to ensure proper sequencing of numbers
I applied via Referral and was interviewed before Dec 2023. There were 5 interview rounds.
JavaScript is a popular programming language used for web development. ES6 modules are a way to organize and reuse code in JavaScript.
JavaScript is a high-level, interpreted programming language commonly used for client-side web development.
ES6 modules allow developers to split their code into separate files and import/export functions, variables, and classes between them.
ES6 introduced 'import' and 'export' keywords f...
Provide additional information regarding CSS, HTML coding, and the coding scenario in React.
Key components of frontend system design include user interface, data management, state management, and performance optimization.
User Interface: Designing the layout, navigation, and visual elements of the frontend.
Data Management: Handling data fetching, storage, and manipulation within the frontend.
State Management: Managing the state of the application to ensure data consistency and reactivity.
Performance Optimizati...
I have worked on various projects including a mobile app for tracking fitness goals and a web application for managing inventory.
Developed a mobile app using React Native to track fitness goals and provide workout plans.
Contributed to a web application built with Angular for managing inventory and tracking sales.
Implemented RESTful APIs for communication between front-end and back-end systems.
Collaborated with cross-fu...
I applied via Recruitment Consulltant and was interviewed before Oct 2022. There were 3 interview rounds.
Sort an array of 0s, 1s, and 2s and find the left view of a binary tree.
To sort the array of 0s, 1s, and 2s, you can use the Dutch National Flag algorithm which sorts the array in a single pass.
To find the left view of a binary tree, perform a level order traversal and keep track of the first node at each level.
Walmart Labs interview questions for designations
I applied via Instahyre and was interviewed before Jun 2023. There was 1 interview round.
Given an array containing only numbers 0,1,2, arrange all 0s,1s and 2s together without using sorting technique.
It can be solved using flag problem
Get interview-ready with Top Walmart Labs Interview Questions
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I appeared for an interview before Jun 2016.
I am a passionate software developer with 5 years of experience in web development and a strong background in computer science.
5 years of experience in web development
Strong background in computer science
Passionate about software development
To separate personal and professional calls, and to ensure availability and accessibility.
Separate personal and professional calls
Ensure availability and accessibility
Maintain work-life balance
Avoid mixing personal and work-related contacts
based on 5 interviews
1 Interview rounds
based on 7 reviews
Rating in categories
Senior Software Engineer
33
salaries
| ₹15 L/yr - ₹58 L/yr |
Software Engineer III
13
salaries
| ₹15.7 L/yr - ₹36 L/yr |
Software Engineer
12
salaries
| ₹19.3 L/yr - ₹64.1 L/yr |
Software Developer
8
salaries
| ₹13.7 L/yr - ₹27 L/yr |
Data Scientist
6
salaries
| ₹24 L/yr - ₹58 L/yr |
TCS
Accenture
Wipro
Cognizant