#Data Structures

Implement a Least Recently Used (LRU) Cache. Consider the appropriate data structures for implementation. You will also need to provide a verbal explanation of your approach and write pseudocode before converting the pseudocode into working code and executing it.

Answer a set of 25 multiple choice questions covering topics such as C, Data Structures, Algorithms, Machine Learning, Java, DBMS, Object-Oriented Programming, and core Computer Science fundamentals.

Merge two sorted arrays into a single sorted array.

Given an array of integers sorted in non-decreasing order, find the starting and ending position of a target value. If the target is not found, return [-1, -1].

Implement functions to handle lock and unlock operations on an M-ary tree, ensuring proper hierarchy control as part of the Tree of Space problem, under the guidance of a mentor.