Walmart Labs Interview Questions — 100 DSA Problems

95 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Walmart Labs LeetCode questions for software engineering interviews.

• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Valid Parentheses (EASY) — String, Stack
• Max Stack (HARD) — Linked List, Stack, Design, Doubly-Linked List, Ordered Set
• Merge Intervals (MEDIUM) — Array, Sorting
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Two Sum (EASY) — Array, Hash Table
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Divide Intervals Into Minimum Number of Groups (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Minimum Number of Operations to Make Arrays Similar (HARD) — Array, Greedy, Sorting
• Count Good Triplets in an Array (HARD) — Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
• Minimum Operations to Make Array Equal II (MEDIUM) — Array, Math, Greedy
• Maximum Number of Tasks You Can Assign (HARD) — Array, Two Pointers, Binary Search, Greedy, Queue, Sorting, Monotonic Queue
• Middle of the Linked List (EASY) — Linked List, Two Pointers
• Number of Ways to Separate Numbers (HARD) — String, Dynamic Programming, Suffix Array
• The Winner University (EASY) — Database
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Kth Largest Element in an Array (MEDIUM) — Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Longest Consecutive Sequence (MEDIUM) — Array, Hash Table, Union Find
• Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
• Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
• Move Zeroes (EASY) — Array, Two Pointers
• Combination Sum (MEDIUM) — Array, Backtracking
• Rotate Array (MEDIUM) — Array, Math, Two Pointers
• Degree of an Array (EASY) — Array, Hash Table
• All Nodes Distance K in Binary Tree (MEDIUM) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree
• 3Sum (MEDIUM) — Array, Two Pointers, Sorting
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Pow(x, n) (MEDIUM) — Math, Recursion
• Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
• House Robber (MEDIUM) — Array, Dynamic Programming
• LFU Cache (HARD) — Hash Table, Linked List, Design, Doubly-Linked List
• Flatten Nested List Iterator (MEDIUM) — Stack, Tree, Depth-First Search, Design, Queue, Iterator
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Longest Common Prefix (EASY) — String, Trie
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• First Missing Positive (HARD) — Array, Hash Table
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Add Binary (EASY) — Math, String, Bit Manipulation, Simulation
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix