Medium Data Structure Problems Questions

Practice medium difficulty algorithmic problems that combine multiple data structures such as arrays, strings, hash maps, stacks, queues, linked lists, and simple trees. Focus on techniques like two pointers, sliding window, prefix sums, frequency counting, and composing several structures in a single solution. Be prepared to explain time and space complexity, correctness, and trade offs between alternative approaches.