#Arrays

Given an array, find the optimal solution for a brute force O(n²) approach. Can you optimize it to O(n)?

Complete three coding problems within 90 minutes. The topics include arrays, hashmaps, and string manipulation. Two problems are of medium difficulty, and one is hard.

Describe the steps to replace a specific portion of an array with a new value. What approaches would you use to ensure efficiency?

Describe the Dutch National Flag problem and outline the algorithm to sort an array with three distinct values in a single pass.

Explain the concept of finding a peak element in an array, where an element is considered a peak if it is greater than or equal to its neighbors. Describe an efficient algorithm using binary search to achieve this.