All company sheets
Walmart Global Tech DSA interview questions
52 problems to practise before your Walmart Global Tech online test or coding round. Most widely asked first.
52
Questions
15
Easy
33
Medium
4
Hard
Commonly reported. Problems candidates often report from this company’s coding rounds. These are Astra’s own tags, not an official question list.
52 questions
- 1
Calculate the N-th Fibonacci Number
EasyRecursionTagged at 7 companies - 2
Check if an Array Contains Any Duplicate Values
EasyArrayTagged at 7 companies - 3
Increment a Large Integer Represented as an Array
EasyArrayTagged at 7 companies - 4
High-Frequency Trading Bot Limit Orders
EasyArrayTagged at 7 companies - 5
Data Retention Policy Enforcement
EasyTwo PointersTagged at 7 companies - 6
Assign Cookies
EasyTwo PointersTagged at 7 companies - 7
Product of Array Except Self
MediumArrayTagged at 7 companies - 8
Search a 2D Matrix
MediumArrayTagged at 7 companies - 9
Find Longest Increasing Subsequence (O(n log n) Solution)
MediumBinary SearchTagged at 7 companies - 10
Find All Duplicates in an Array (O(1) Space)
MediumArrayTagged at 7 companies - 11
Determine if You Can Jump to the End of an Array
MediumArrayTagged at 7 companies - 12
Generate All Subsets (The Power Set)
MediumArrayTagged at 7 companies - 13
IoT Sensor Anomaly Detection
MediumSliding WindowTagged at 7 companies - 14
Log File Error Burst Detection
MediumSliding WindowTagged at 7 companies - 15
Complex Financial Transaction Reconciliation
MediumTwo PointersTagged at 7 companies - 16
Grumpy Bookstore Owner
MediumSliding WindowTagged at 7 companies - 17
Invert Binary Tree
EasyTreeTagged at 6 companies - 18
Symmetric Tree
EasyTreeTagged at 6 companies - 19
Merge Two Binary Trees
EasyTreeTagged at 6 companies - 20
Implement a Stack Data Structure Using a Single Queue
EasyStack and QueueTagged at 6 companies - 21
Remove Duplicates from a Sorted Linked List
EasyLinkedListTagged at 6 companies - 22
Find the Intersection of Two Linked Lists
EasyLinkedListTagged at 6 companies - 23
Determine if a String Has Valid Parentheses
EasyStringTagged at 6 companies - 24
Minimum ASCII Delete Sum for Two Strings
MediumDPTagged at 6 companies - 25
Max Sum of Two Non-Overlapping Subarrays
MediumDPTagged at 6 companies - 26
Find Wait Days for Warmer Daily Temperatures
MediumStack and QueueTagged at 6 companies - 27
Find First Non-Repeating Character in a Stream
MediumStack and QueueTagged at 6 companies - 28
Minimum Add to Make Parentheses Valid
MediumStack and QueueTagged at 6 companies - 29
Reorder a Singly Linked List In-Place
MediumLinkedListTagged at 6 companies - 30
Add Two Numbers II (Digits in Forward Order)
MediumLinkedListTagged at 6 companies - 31
Sort a Linked List Using Merge Sort
MediumLinkedListTagged at 6 companies - 32
Merge Sort for a Doubly Linked List
MediumLinkedListTagged at 6 companies - 33
Delete the Middle Node of a Linked List
MediumLinkedListTagged at 6 companies - 34
Implement N-ary Tree Level Order Traversal
MediumTreeTagged at 6 companies - 35
Find the Root of an N-ary Tree (Given All Nodes)
MediumTreeTagged at 6 companies - 36
Find the Lowest Common Ancestor (LCA) of an N-ary Tree
MediumTreeTagged at 6 companies - 37
Find the Kth Largest Element in an Array (Heap)
MediumTreeTagged at 6 companies - 38
Convert a Binary Search Tree to a Greater Sum Tree
MediumTreeTagged at 6 companies - 39
Check if a Tree is a Valid Binary Search Tree (Amazon/MS)
MediumTreeTagged at 6 companies - 40
Find All Nodes at Distance K from a Target Node
MediumTreeTagged at 6 companies - 41
Populate Next Right Pointers in Each Node II (Any Tree)
MediumTreeTagged at 6 companies - 42
Find All Repeated DNA Sequences in a String
MediumStringTagged at 6 companies - 43
Determine if Two Strings are 'Close' Strings
MediumStringTagged at 6 companies - 44
Detecting Edge and Vertex Count
EasyGraphTagged at 5 companies - 45
Convert Edge List to Adjacency List
EasyGraphTagged at 5 companies - 46
Clone Graph
MediumGraphTagged at 5 companies - 47
Dijkstra’s Algorithm (Using Min Heap)
MediumGraphTagged at 5 companies - 48
Skyscanner Flight Aggregator
MediumGraphTagged at 5 companies - 49
Implement the Knuth-Morris-Pratt (KMP) Prefix Function (LPS)
HardStringTagged at 5 companies - 50
Find the Number of Distinct Subsequences (DP)
HardStringTagged at 5 companies - 51
Dungeon Game
HardDPTagged at 4 companies - 52
Read N Characters Given Read4 II - Call Multiple Times
HardDesignTagged at 3 companies