Implement Priority Queue with in-place

Last updated: January 9, 2026

Quick Overview

Implement a Hash Map that supports get and put in O(log n) time.

Walmart
Coding & Algorithms
Software Engineer
Walmart
January 9, 2026
Software Engineer
Phone Screen
Coding & Algorithms
Medium

151

7

2,232 solved

Implement a Hash Map that supports get and put in O(log n) time.

How to Approach This
  1. Clarify input constraints and edge cases before writing code.
  2. Walk through your approach verbally and confirm with the interviewer before coding.
  3. Start with a brute force solution, then optimize. Mention time and space complexity.
  4. Test your solution with examples, including edge cases like empty input or duplicates.
  5. Consider common patterns: sliding window, two pointers, hash map, BFS/DFS, dynamic programming.
Sharpen Your Skills on Codemia

Practice similar problems with our interactive workspace, get AI feedback, and track your progress.

Practice DSA Problems
Submit Your Answer
Markdown supported
Walmart Software Engineer Interview Guide

Interview process, tips, and preparation timeline

Related Questions
See all Coding & Algorithms questions