• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Find min element in Sorted Rotated Array (Without Duplicates)

August 4, 2014 by Dhaval Dave

Problem: Find the minimum element in a sorted and rotated array if duplicates not allowed:
Example: {3, 4, 5, 6, 7, 1, 2} output: 1

Algorithm:
This problem can be easily solved in O(n) time complexity buy traversing the
whole array and check for minimum element.
Here we are using a different solution which takes O(Log n)
Let us look at this approach, we are using a modified version of Binary Search Tree algorithm.

Thanks Dheeraj for  sharing Question and Code  for this .

Code:

#include<iostream> 
 using namespace std;

int BST(int A[],int low,int high){
  int mid=low+(high-low)/2;
  if ( mid == high ) return A[mid];  //if size of sub array is 1
  if(mid < high && mid > low && A[mid] < A[mid + 1] && A[mid -1] > A[mid] ) 
  return A[mid];  
//compare value of mid + 1,mid, mid-1 if they exist 

 if(A[mid] > A[high]) {
 if(A[mid + 1] < A[mid]) return A[mid + 1];
 else return BST(A, mid + 1, high); //check in right sub array
 }
 else
 {
 if(A[mid] < A[mid – 1]) return A[mid];
 else return BST(A , low , mid – 1); //check in left sub array
 } 
}

int main()
{
 int A[]={3,4,5,6,7,1,2};
 int n= sizeof(A)/sizeof(A[0]);
 cout<<BST(A,0,n-1)<<endl;
}

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Array, Binary Search

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

C++ OOPs Part1

Maximum occurred Smallest integer in n ranges

Given a float number convert it into the string WITHOUT using any inbuilt Function

Diagonal Traversal of Binary Tree

Wrong Directions given find minimum moves so that he can reach to the destination

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Given a sorted array and a number x, find the pair in array whose sum is closest to x

N Petrol bunks or City arranged in circle. You have Fuel and distance between petrol bunks. Is it possible to find starting point so that we can travel all Petrol Bunks

Maximum difference between two elements s.t larger element appears after the smaller number

Memory Efficient LinkedList

Implement a generic binary search algorithm for Integer Double String etc

SAP Off Campus Hiring_ March 2015 Computer Skills

The greedy coins game Dynamic Programming

Amazon Interview Experience – SDE Chennai

Common Ancestor in a Binary Tree or Binary Search Tree

Linked List V/S Binary Search Tree

In Given LinkedList Divide LL in N Sub parts and delete first K nodes of each part

Maximum sum contiguous subarray of an Array

Singly linked list

Find and print longest consecutive number sequence in a given sequence in O(n)

LeetCode: Binary Tree Maximum Path Sum

Code Chef PRGIFT Solution

flattens 2 D linked list to a single sorted link list

Printing each word reverse in string

Minimum insertions to form a palindrome

Skiing on Mountains Matrix

Max Sum in circularly situated Values

Reliance Jio Software Developer Interview Experience

Find next greater number with same set of digits

Mirror of Tree

Copyright © 2025 · Genesis Framework · WordPress · Log in