• 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 an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

August 12, 2014 by Dhaval Dave

Given an array of n distinct integers sorted in ascending order, write a function that returns a Fixed Point in the array such that Arr[i] = i .
If there is any Fixed Point present in array, else returns -1.
Note that integers in array can be negative.

Example :

  Input: arr[] = {-2, -1, 1, 3, 5}
Output: 3 // arr[3] == 3

Input: arr[] = {-4, -1, 1, 2, 5, 8}
Output: -1 // No Fixed Point

First Simple Method : Linear Search
for(i = 0; i < n; i++){
        if(arr[i] == i) return i;
}
Complexity O(n)

Method 2 : Divide and Conquer (As numbers is sorted we can use it as binary search)

Thanks to Dhaval for suggesting this Code.

int indexSearch(int arr[], int low, int high)
{
    if(high >= low)
    {
        int mid = (low + high)/2;
        if(mid == arr[mid])
            return mid;
        if(mid > arr[mid])
            return indexSearch(arr, (mid + 1), high);
        else
            return indexSearch(arr, low, (mid -1));
    }

    /* Return -1 if there is no Fixed Point */
    return -1;
}
int main()
{
    int arr[] = {-2, -1, 1, 3, 5};
    int n = sizeof(arr)/sizeof(arr[0]);
    printf(“Fixed Point is %d”, indexSearch(arr, 0, n-1));
    getchar();
    return 0;
}

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, problem Tagged With: Array

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

Find the kth number with prime factors 3, 5 and 7

Find Percentage of Words matching in Two Strings

Print all nodes that are at distance k from a leaf node

Count number of ways to reach a given score in a game

Reversal of LinkedList

Check if an array has duplicate numbers in O(n) time and O(1) space

Maximum path sum between two leaves

Find next greater number with same set of digits

Urban Ladder Written Test.

Leetcode: Edit Distance

Number of Islands BFS/DFS

Python String and numbers

The Magic HackerEarth Nirvana solutions Hiring Challenge

Hackerearth : Counting Subarrays

Find min element in Sorted Rotated Array (With Duplicates)

Flipkart Set 1 On Campus with Answers

Trie Dictionary

Find shortest distances between every pair of vertices ( Dynamic Programming Floyd Warshall Algorithm)

Find min element in Sorted Rotated Array (Without Duplicates)

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

BFS (Breath First Search)

Find loop in Singly linked list

Knight Tour Problem (Graph – Breadth First Search)

Rectangular chocolate bar Create at least one piece which consists of exactly nTiles tiles

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

Introduction To Number Theory ( Part 1 )

Add Sub Multiply very large number stored as string

BlueStone E-commerce Interview Experience

Minimum insertions to form a palindrome

Templates in C++

Copyright © 2025 · Genesis Framework · WordPress · Log in