• 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

Subset Sum Problem Dynamic programming

Introduction To Number Theory ( Part 1 )

Generic Object Oriented Stack with Template

Fibonacci Hashing & Fastest Hashtable

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Possible sizes of bus to carry n groups of friends

Implement a generic binary search algorithm for Integer Double String etc

Adobe Interview Questions 8 month Exp

Apriori algorithm C Code Data Mining

Sort Stack in place

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

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

Coin Collection Dynamic Programming

Best Java Book | Top Java Programming Book for Beginners

Difference between a LinkedList and a Binary Search Tree BST

Check Binary Tree is Binary Search Tree or not

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

Circular Linked List

Common Ancestor in a Binary Tree or Binary Search Tree

Word Break Problem

Print Power Set of a Set

Search element in a matrix with all rows and columns in sorted order

Naurki.com Security Breach

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

simple sql injection

Sort an array according to the order defined by another array

Printing Longest Common Subsequence

N teams are participating. each team plays twice with all other teams. Some of them will go to the semi final. Find Minimum and Maximum number of matches that a team has to win to qualify for finals ?

Urban Ladder Written Test.

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

Copyright © 2025 · Genesis Framework · WordPress · Log in