# Find the Largest Number in a Rotated List - Amazon Top Interview Questions

### Problem Statement :

You are given a list of unique integers nums that is sorted in ascending order and is rotated at some pivot point. Find the maximum number in the rotated list.

Can you solve it in \mathcal{O}(\log{}n)O(logn)?

Constraints

n ≤ 100,000 where n is the length of nums.

Example 1

Input

arr = [6, 7, 8, 1, 4]

Output

8

Explanation

The original sorted array of [1, 4, 6, 7, 8] was rotated at index 2 and results in the input array [6, 7, 8, 1, 4,]. And the largest number is 8.

Example 2

Input

arr = [1, 2, 3]

Output

3

Example 3

Input

arr = [1]

Output

1

Example 4

Input

arr = [10, 1, 2, 3, 4, 7]

Output

10

### Solution :

                        Solution in C++ :

int solve(vector<int>& a) {
int low = 0;
int high = a.size() - 1;
int maxi = -1000;
while (high >= low) {
int mid = (low + high) / 2;
if (a[mid] < a[0]) {
high = mid - 1;
}

else if (a[mid] >= a[0]) {
maxi = max(maxi, a[mid]);
low = mid + 1;
}
}

return maxi;
}


                        Solution in Java :

import java.util.*;

class Solution {
public int solve(int[] arr) {
int n = arr.length;
int low = 0;
int high = arr.length - 1;

while (low < high) {
int mid = (low + high) / 2;

if (arr[mid] > arr[high]) {
low = mid + 1;
} else
high = mid;
}
if (low == 0)
return arr[n - 1];
return arr[low - 1];
}
}


                        Solution in Python :

class Solution:
def solve(self, arr):
lo, hi = 0, len(arr)
left, right = arr[0], arr[-1]

while lo < hi:
mid = (lo + hi) // 2
if left > arr[mid]:
hi = mid
else:
lo = mid + 1

return arr[lo - 1]


## Truck Tour

Suppose there is a circle. There are N petrol pumps on that circle. Petrol pumps are numbered 0 to (N-1) (both inclusive). You have two pieces of information corresponding to each of the petrol pump: (1) the amount of petrol that particular petrol pump will give, and (2) the distance from that petrol pump to the next petrol pump. Initially, you have a tank of infinite capacity carrying no petr

## Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

## QHEAP1

This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element