#Arrays

Solve the circular tour problem where you need to determine if a tour can be completed within given petrol and distance constraints. Provide your algorithm and reasoning.

How do you find a missing number in an array given overflow constraints? Discuss your approach.

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?