Quiz: Python Interview Programs

5 questionsNo time limitPass: 60%+10 XP on first pass

The programs asked again and again in campus interviews — prime, Fibonacci, palindrome, Armstrong, factorial, anagram, frequency, second largest, binary search and FizzBuzz — with clean solutions.

Free account · see your score, answers and explanations, earn XP

Question 1
What does reverse_number(1200) (from this lesson) return?
00212121001200
Question 2
Why does the prime check loop only while i * i <= n?
To avoid negative numbersBecause any factor pair has one factor at most √nBecause primes are less than √nIt is just a style choice
Question 3
What does this print?
```
print(sum(int(d) ** 3 for d in "153"))
```
915327135
Question 4
What is the time complexity of binary search?
O(n)O(log n)O(n log n)O(1)
Question 5
In FizzBuzz, what goes wrong if you check i % 3 == 0 before i % 15 == 0?
Nothing15, 30, 45… print "Fizz" instead of "FizzBuzz"The program crashesMultiples of 5 are skipped