100 Doors question. Problem: 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?

How can you detect anagrams

Write a function to traverse a Binary Tree Then write it without recursion.