• 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

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

December 23, 2014 by Dhaval Dave

you have 100 doors in a row that are all initially closed. you make 100 passes by the doors starting with the first door every time. the first time through you visit every door and toggle the door (if the door is closed, you open it, if its open, you close it). the second time you only visit every 2nd door (door #2, #4, #6). the third time, every 3rd door (door #3, #6, #9), etc, until you only visit the 100th door.question: what state are the doors in after the last pass? which are open which are closed?

Solution

For example,
After the first pass every door is open.
Second pass you only visit the even doors (2,4,6,8…) so now the even doors are closed and the odd ones are opened.
Third time through you will close door 3 (opened from the first pass), open door 6 (closed from the second pass), etc..
Hint : Door 12 will be visited in 1, 2, 3, 4, 6 & 12 pass (divisors..)

You can figure out that for any given door,
Say door #42, you will visit it for every divisor it has.
42 has 1 & 42, 2 & 21, 3 & 14, 6 & 7. 

Pass 1 open the door,
Pass 2 close it.
Pass 3 open,
Pass 6 close.
Pass 7 open ….  pass 14 close, pass 21 open, pass 42 close. for every pair of divisors the door will just end up back in its initial state. 

So you might think that every door will end up closed?
Well what about door #9. 9 has the divisors 1 & 9, 3 & 3. but 3 is repeated because 9 is a perfect square, so you will only visit door #9, on pass 1, 3, and 9… leaving it open at the end.

Only perfect square doors will be open at the end.

This Puzzle was asked in Housing.co.in

Similar Articles

Filed Under: Adobe Interview Questions, Flipkart Interview Questions, Interview Questions, Microsoft Interview Questions Tagged With: Mathematical, Puzzle

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

Fibonacci Hashing & Fastest Hashtable

SAP Off Campus Hiring_ March 2015 Computer Skills

Client Server C program

Circular Linked List

Coin Collection Dynamic Programming

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

Code Chef PRGIFT Solution

Find position of the only set bit

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

Length of the longest substring without repeating characters

Knight Tour Problem (Graph – Breadth First Search)

LeetCode : Word Search

Find min element in Sorted Rotated Array (With Duplicates)

Add Sub Multiply very large number stored as string

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

Regular Expression Matching

25 horses 5 tracks Find 3 fastest puzzle

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

Binary Tree in Java

Find the number ABCD such that when multipled by 4 gives DCBA.

HackeEarth Flipkart’s Drone

‘N’ Story Building, with 1,2,3 steps how many ways can a person reach top of building.

Word Break Problem

Binary Tree in Java

Number of Islands BFS/DFS

Find min element in Sorted Rotated Array (Without Duplicates)

Leetcode: Merge Intervals

Printing Longest Common Subsequence

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

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

Copyright © 2025 · Genesis Framework · WordPress · Log in