• 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

Implement LRU Cache

SAP Off Campus Hiring_ March 2015 Analytical Aptitude

Find Pythagorean Triplets in an array in O(N)

CodeChef’ RRCOPY

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

Singly linked list

Common Ancestor in a Binary Tree or Binary Search Tree

Find Nearest Minimum number in left side in O(n)

Reliance Jio Software Developer Interview Experience

Skiing on Mountains Matrix

Regular Expression Matching

Microsoft BING Interview Experience

BFS (Breath First Search)

Generic Object Oriented Stack with Template

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

BlueStone E-commerce Interview Experience

Maximum of all subarrays of size k

ADOBE Aptitude C Language Test

The Magic HackerEarth Nirvana solutions Hiring Challenge

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Sort an array according to the order defined by another array

Generate largest number arranging a no. of given non negative integer numbers

Find min element in Sorted Rotated Array (With Duplicates)

Print Power Set of a Set

Given Set of words or A String find whether chain is possible from these words or not

Leetcode: Edit Distance

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

TicTacToe Game As Asked in Flipkart

Print vertical sum of all the axis in the given binary tree

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Copyright © 2025 · Genesis Framework · WordPress · Log in