• 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

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

November 14, 2014 by Dhaval Dave

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1
Example : 00001111
Output : 4Method 1 : in O(n) we can do it . with sequential search.

Method 2 : Binary search.

Yes binary search is useful, as data is sorted.
Just we need to change its conditions for 0 and 1.
lets have a look at Function firstOccurance.

firstOccurrance(int[] sortedBins) {
    int lower = 0;
    int upper = sortedBins.length - 1;
    while (lower <= upper) {
        int middle = 1 + (upper - lower) / 2;
        if (sortedBins[middle] == 0) {
            lower = middle + 1;
        } else {
            upper = middle - 1;
        } 
        if (sortedBins[lower] == 1) {
            return lower;
        }
    }
    return -1;
}

Similar Articles

Filed Under: Adobe Interview Questions, Amazon Interview Question, 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

Find Percentage of Words matching in Two Strings

Python List

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

Circular Linked List

Edit Distance ( Dynamic Programming )

Introduction To Number Theory ( Part 1 )

Test Cases for Round Function

Coin Collection Dynamic Programming

Memory Efficient LinkedList

Adobe Interview Questions 8 month Exp

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

ADOBE Aptitude C Language Test

Apriori algorithm C Code Data Mining

Sequence Finder Dynamic Programming

Flipkart SDET Interview Experience

Find two non repeating elements in an array of repeating elements

Trie Dictionary

Word Break Problem

Cisco Hiring Event 21st – 22nd Feb 2015

robot standing at first cell of an M*N matrix. It can move only in two directions, right and down. In how many ways, it can reach to the last cell i.e. (M, N) Code it

Practo Hiring Experience

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 ?

Find the element that appears once others appears thrice

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

Amazon Interview Experience – SDE Chennai

Doubly linked list

Stickler thief

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

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

Hackerearth : Counting Subarrays

Copyright © 2025 · Genesis Framework · WordPress · Log in