I'm personally not very big a fan of such puzzle questions, I prefer actual programming exercises in interviews.
That said, first it would depend on if I can tell if they are broken or not from the floor I am dropping them at. I will presume I can.
I would go up to the second floor, drop the first marble. If it broke I would try the first floor. If that broke I would know it was no floor.
If the first didn't break, I would go to the 4th floor and drop from there. If that broke, I would go back down and get the other marble, then drop at the 3rd floor, breaking or not I would know which is the limit.
If neither broke, I would go get both, and do the same process, this time starting at the 6th floor.
This way, I can skip every other floor until I get a marble that breaks.
This would be optimized for if the marble breaks early... I suppose there is probably an optimal amount of floors I could skip to get the most for each skip... but then if one breaks, I would have to check each floor individually from the first floor above the last known floor... which of course would be a pain if I skipped too many floors (sorry, not going to figure out the optimal solution right now).
Ideally, I would want a whole bag of marbles, then I could use a binary search algorithm and divide the number of floors in half with each drop... but then, that wasn't the question, was it?