Verizon Interview Questions

• Coding Round Questions
• Technical Interview Questions
  • Data Structures and Algorithm
  • Miscellaneous
• References

---

Coding round questions

• You have been given an integer n, you have to find all the prime numbers between 1 and n(both included).

  Sample: Input: n=12 Output: 5 Solution: 2, 3, 5, 7, 11

• You have to implement a stack with following operations
  1. Push
  2. Pop
  3. Getting the topmost element
  4. Checking whether the stack is empty or not
  5. Extracting the minimum element from stack in O(1) time.

____ Technical Interview Questions
Data Structures and Algorithm

- You have been given a range of numbers from 1 to n with some numbers missing from it. You have to find which numbers are missing.

Sample:
    Input:
	1 2 4 6 7 8 12 13 14 16
    Output:
	3 5 9 10 11 15

Miscellaneous

- What is polymorphism.
- What is the difference between compile time and run time polymorphism.
- what are dangling pointers.
- What is the concept of memory leak.
- Difference between C++ and Java.
- Can a constructor be virtual.
- How does partition function of quick sort works.
- Difference betweena a process and a thread.