# 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]


## Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

## Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .